Improved utilization and responsiveness with gang scheduling
- Lawrence Livermore National Lab., CA (United States)
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. 29 refs., 10 figs., 6 tabs.
- Research Organization:
- Lawrence Livermore National Lab., CA (United States)
- Sponsoring Organization:
- USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 490476
- Report Number(s):
- UCRL-JC--125614; CONF-970477--3; ON: DE97052057
- Country of Publication:
- United States
- Language:
- English
Similar Records
Performance characteristics of gang scheduling in multiprogrammed environments
Gang scheduling a parallel machine
Gang scheduling a parallel machine
Conference
·
Fri Oct 31 23:00:00 EST 1997
·
OSTI ID:611755
Gang scheduling a parallel machine
Conference
·
Thu Feb 28 23:00:00 EST 1991
·
OSTI ID:5369935
Gang scheduling a parallel machine
Conference
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:5856904