DocumentCode
2244751
Title
Gang scheduling for highly efficient, distributed multiprocessor systems
Author
Franke, Hubertus ; Pattnaik, Pratap ; Rudolph, Larry
Author_Institution
IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA
fYear
1996
fDate
27-31 Oct. 1996
Firstpage
4
Lastpage
12
Abstract
We have implemented a job scheduling system for workstation clusters and massively parallel systems with highly efficient message passing interconnects that supports space and time sharing through multiuser gang scheduling of parallel jobs. The system is available on the IBM-SP-2 cluster. It is highly modular, scalable and can easily be adapted to a variety of other MPP systems. The system supports various scheduling policies. We architect the system so that the time-sharing of processors avoids any significant serialization and extra resource consumption, but preserves the reliability and the efficiency of the high performance communication subsystem that characterizes a dedicated non time shared systems.
Keywords
processor scheduling; IBM-SP-2 cluster; high performance communication subsystem; job scheduling; massively parallel systems; message passing interconnects; multiuser gang scheduling; time-sharing; workstation clusters; Communication switching; Concurrent computing; Context; High performance computing; Message passing; Multiprocessing systems; Processor scheduling; Termination of employment; Time sharing computer systems; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Frontiers of Massively Parallel Computing, 1996. Proceedings Frontiers '96., Sixth Symposium on the
Conference_Location
Annapolis, MA, USA
ISSN
1088-4955
Print_ISBN
0-8186-7551-9
Type
conf
DOI
10.1109/FMPC.1996.558056
Filename
558056
Link To Document