Gang scheduling for highly efficient, distributed multiprocessor systems
- 24 December 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
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. Author(s) Franke, H. IBM Thomas J. Watson Res. Center, Yorktown Heights, NY, USA Pattnaik, P. ; Rudolph, L.Keywords
This publication has 8 references indexed in Scilit:
- MPI programming environment for IBM SP1/SP2Published by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- An analysis of gang scheduling for multiprogrammed parallel computing environmentsPublished by Association for Computing Machinery (ACM) ,1996
- SP2 system architectureIBM Systems Journal, 1995
- The SP2 High-Performance SwitchIBM Systems Journal, 1995
- Gang scheduling performance benefits for fine-grain synchronizationJournal of Parallel and Distributed Computing, 1992
- Network Time Protocol (Version 3) Specification, Implementation and AnalysisPublished by RFC Editor ,1992
- Process control and scheduling issues for multiprogrammed shared-memory multiprocessorsPublished by Association for Computing Machinery (ACM) ,1989
- Performance prediction and calibration for a class of multiprocessorsIEEE Transactions on Computers, 1988