Improved utilization and responsiveness with gang scheduling

Dror G. Feitelson, Morris A. Jette

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

149 Scopus citations


Most commercial multicomputers use space-slicing schemes in which each scheduling decision has an unknown impact on the future: should a job be scheduled, risking that it will block other larger jobs later, or should the processors be left idle for now in anticipation of future arrivals? This dilemma is solved by using gang scheduling, because then the impact of each decision is limited to its time slice, and future arrivals can be accommodated in other time slices. This added flexibility is shown to improve overall system utilization and responsiveness. Empirical evidence from using gang scheduling on a Cray T3D installed at Lawrence Livermore National Lab corroborates these results, and shows conclusively that gang scheduling can be very effective with current technology.

Original languageAmerican English
Title of host publicationJob Scheduling Strategies for Parallel Processing - IPPS 1997 Workshop, Proceedings
EditorsDror G. Feitelson, Larry Rudolph
PublisherSpringer Verlag
Number of pages24
ISBN (Print)3540635742, 9783540635741
StatePublished - 1997
Event3rd Workshop on Job Scheduling Strategies for Parallel Processing, IPPS 1997 - Geneva, Switzerland
Duration: 5 Apr 19975 Apr 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference3rd Workshop on Job Scheduling Strategies for Parallel Processing, IPPS 1997

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1997.


Dive into the research topics of 'Improved utilization and responsiveness with gang scheduling'. Together they form a unique fingerprint.

Cite this