Performance characteristics of gang scheduling in multiprogrammed environments
Conference
·
OSTI ID:611755
Gang scheduling provides both space-slicing and time-slicing of computer resources for parallel programs. Each thread of execution from a parallel job is concurrently scheduled on an independent processor in order to achieve an optimal level of program performance. Time-slicing of parallel jobs provides for better overall system responsiveness and utilization than otherwise possible. Lawrence Livermore National Laboratory has deployed three generations of its gang scheduler on a variety of computing platforms. Results indicate the potential benefits of this technology to parallel processing are no less significant than time-sharing was in the 1960`s.
- 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:
- 611755
- Report Number(s):
- UCRL-JC--127313; CONF-971138--; ON: DE98051347
- Country of Publication:
- United States
- Language:
- English
Similar Records
Gang scheduling a parallel machine
Gang scheduling a parallel machine
Gang scheduling a parallel machine. Revision 1
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
Gang scheduling a parallel machine. Revision 1
Conference
·
Sat Nov 30 23:00:00 EST 1991
·
OSTI ID:10122302