Parallel job scheduling is beginning to gain recognition as an important topic that is distinct from the scheduling of tasks within a parallel job by the programmer or runtime system. The main issue is how to share the resources of the parallel machine among a number of competing jobs, giving each the required level of service. This level of scheduling is done by the operating system. The four most commonly used or advocated techniques are to use a global queue, use variable partitioning, use dynamic partitioning, and use gang scheduling. These techniques are surveyed, and the benefits and shortcomings of each are identified. Then additional requirements that are not addressed by current systems are outlined, followed by considerations for evaluating various scheduling schemes.
|Original language||American English|
|Title of host publication||Job Scheduling Strategies for Parallel Processing - IPPS 1995 Workshop, Proceedings|
|Editors||Dror G. Feitelson, Larry Rudolph|
|Number of pages||18|
|ISBN (Print)||3540601538, 9783540601531|
|State||Published - 1995|
|Event||Workshop on Job Scheduling Strategies for Parallel Processing held as a prelude to the IPPS 1995 Conference - Santa Barbara, United States|
Duration: 25 Apr 1995 → 25 Apr 1995
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||Workshop on Job Scheduling Strategies for Parallel Processing held as a prelude to the IPPS 1995 Conference|
|Period||25/04/95 → 25/04/95|
Bibliographical notePublisher Copyright:
© 1995, Springer Verlag. All rights reserved.