Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Processor saving scheduling policies for multiprocessor systems

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
5 Author(s)
Rosti, E. ; Dipartimento di Sci. dell''Inf., Milan Univ., Italy ; Smirni, E. ; Dowdy, L.W. ; Serazzi, G.
more authors

In this paper, processor scheduling policies that “save” processors are introduced and studied. In a multiprogrammed parallel system, a “processor saving” scheduling policy purposefully keeps some of the available processors idle in the presence of work to be done. The conditions under which processor saving policies can be more effective than their greedy counterparts, i.e., policies that never leave processors idle in the presence of work to be done, are examined. Sensitivity analysis is performed with respect to application speedup, system size, coefficient of variation of the applications' execution time, variability in the arrival process, and multiclass workloads. Analytical, simulation, and experimental results show that processor saving policies outperform their greedy counterparts under a variety of system and workload characteristics

Published in:

Computers, IEEE Transactions on  (Volume:47 ,  Issue: 2 )