Gang scheduling a parallel machine

Conference · Sun Dec 01 04:00:00 EST 1991

OSTI ID:5856904

Gorda, B C; Brooks, III, E D

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 processes. User programs and their gangs of processes are put to sleep and awakened by the gang scheduler to provide a time sharing environment. Time quantum 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.

• 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: 5856904
• Report Number(s): UCRL-JC-107020-Rev.1; CONF-920484--1-Rev.1; ON: DE92007309
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ARRAY PROCESSORS
CONTROL SYSTEMS
DATA PROCESSING
PARALLEL PROCESSING
PROCESSING
PROGRAMMING
TASK SCHEDULING