Processor saving scheduling policies for multiprocessor systems
- 1 January 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. 47 (2) , 178-189
- https://doi.org/10.1109/12.663764
Abstract
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.Keywords
This publication has 21 references indexed in Scilit:
- Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policiesPublished by Association for Computing Machinery (ACM) ,1994
- Robust partitioning policies of multiprocessor systemsPerformance Evaluation, 1994
- Application scheduling and processor allocation in multiprogrammed parallel processing systemsPerformance Evaluation, 1994
- Processor scheduling on multiprogrammed, distributed memory parallel computersACM SIGMETRICS Performance Evaluation Review, 1993
- Performance analysis of job scheduling policies in parallel supercomputing environmentsPublished by Association for Computing Machinery (ACM) ,1993
- Processor scheduling in shared memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1990
- Process control and scheduling issues for multiprogrammed shared-memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1989
- Characterizations of parallelism in applications and their use in schedulingPublished by Association for Computing Machinery (ACM) ,1989
- Dynamic partitioning of multiprocessor systemsInternational Journal of Parallel Programming, 1989
- Speedup versus efficiency in parallel systemsIEEE Transactions on Computers, 1989