ACM Home Page
Please provide us with feedback. Feedback
Performance characteristics of gang scheduling in multiprogrammed environments
Full text PdfPdf (81 KB)
Source Conference on High Performance Networking and Computing archive
Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM) table of contents
San Jose, CA
Pages: 1 - 12  
Year of Publication: 1997
ISBN:0-89791-985-8
Author
Morris A. Jette  Lawrence Livermore National Laboratory, Livermore, CA
Sponsors
IEEE-CS\DATC : IEEE Computer Society
SIGARCH: ACM Special Interest Group on Computer Architecture
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 9,   Downloads (12 Months): 37,   Citation Count: 8
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/509593.509647
What is a DOI?

ABSTRACT

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.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
Cray Research Inc. Cray T3D System Architecture Overview. Order number HR-04033, Sept 1993.
 
2
B. C. Curtis and B. E. Kelly, Dedicated Computing on a YMP/C916. Cray User Group, Sep 95.
3
 
4
D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. IBM Research Report RC19790(87657), Feb 1995.
 
5
 
6
B. Gorda and R. Wolski, Timesharing massively parallel machines. International Conference on Parallel Processing, volume II, Aug 1995, pp. 214-217.
 
7
B. C. Gorda and E. D. Brooks III, Gang Scheduling a Parallel Machine. Technical Report UCRL-JC-107020, Lawrence Livermore National Laboratory, Dec 1991.
 
8
M. Jette and J. Reynolds, Centralized User Banking and User Administration on UNICOS. Cray User Group, Mar 1994.
 
9
M. Jette, D. Storch and E. Yim, Gang Scheduler - Timesharing the Cray T3D". Cray User Group, Mar 1996, pp. 247-252.
 
10
11
 
12
 
13
 
14
P. G. Sobalvarro, S. Pakin, W. E. Weihl, and A. A. Chien, Dynamic Coscheduling on Workstation Clusters. Symposium on Operating Systems Design and Implementation, Oct 1996.
 
15
16
 
17
R. Wood, Distributed Production Control System. Technical Report UCRL-TB-122372, Lawrence Livermore National Laboratory, Nov 1995.
 
18

CITED BY  8