Gang scheduling a parallel machine
Conference
·
OSTI ID:5369935
Program development on parallel machines can be a nightmare of scheduling headaches. We have developed a portable time sharing mechanism to handle the problem of scheduling gangs of processors. User program and their gangs of processors are put to sleep and awakened by the gang scheduler to provide a time sharing environment. Time quantums are adjusted according to priority queues and a system of fair share accounting. The initial platform for this software is the 128 processor BBN TC2000 in use in the Massively Parallel Computing Initiative at the Lawrence Livermore National Laboratory. 2 refs., 1 fig.
- Research Organization:
- Lawrence Livermore National Lab., CA (United States)
- Sponsoring Organization:
- DOE; USDOE, Washington, DC (United States)
- DOE Contract Number:
- W-7405-ENG-48
- OSTI ID:
- 5369935
- Report Number(s):
- UCRL-JC-107020; CONF-911103--4; ON: DE91011539
- Country of Publication:
- United States
- Language:
- English
Similar Records
Gang scheduling a parallel machine
Gang scheduling a parallel machine. Revision 1
Performance characteristics of gang scheduling in multiprogrammed environments
Conference
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:5856904
Gang scheduling a parallel machine. Revision 1
Conference
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:10122302
Performance characteristics of gang scheduling in multiprogrammed environments
Conference
·
Fri Oct 31 23:00:00 EST 1997
·
OSTI ID:611755