Performance characteristics of gang scheduling in multiprogrammed environments

Proceedings of the International Conference on Supercomputing

Volumn , Issue , 1997, Pages

  Jette, Morris A ^a  

^a LAWRENCE LIVERMORE NATIONAL LABORATORY   (United States)

Author keywords

Gang scheduling; Multiprogramming; Parallel system; Scheduling; Space slicing; Time slicing

Indexed keywords

MULTIPROGRAMMING; PARALLEL ARCHITECTURES; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS;

GANG SCHEDULING; LAWRENCE LIVERMORE NATIONAL LABORATORIES; PARALLEL PROCESSING; PARALLEL SYSTEM; PERFORMANCE CHARACTERISTICS; PROGRAM PERFORMANCE; SPACE-SLICING; TIME-SLICING;

SCHEDULING;

EID: 84900345016     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/509593.509647     Document Type: Conference Paper

References (18)

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. A. C. Dusseau, R. H. Arpaci and D. E. Culler, Effective Distributed Scheduling of Parallel Workloads. ACM SIGMETRICS '96 Conference on the Measurement and Modeling of Computer Systems, 1996.
4. D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. IBM Research Report RC19790 (87657), Feb 1995.
5. D. G. Feitelson and M. A. Jette, Improved Utilization and Responsiveness with Gang Scheduling. IPPS '97 Workshop on Job Scheduling Strategies for Parallel Processing, Apr 1997.
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. K. Li and K-H Cheng, A two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system. Journal of Parallel and Distributed Computers 12(1), May 1991.
11. C. McCann, R. Vaswani, and J. Zahorjan, A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors. ACM Transactions on Computer Systems 11(2), May 1993.
12. E. Rosti, E. Smirni, G. Serazzi and L. W. Dowdy, Analysis of non-work-conserving processor partitioning policies. Job Scheduling Strategies for Parallel Processing, 1995.
13. P. G. Sobalvarro and W. E. Weihl, Demand-based Coscheduling of Parallel Jobs on MultiprogrammedMultiprocessors. IPPS '95 Parallel Job Scheduling Workshop, Apr 1995.
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. C. Severance and R. Enbody, Comparing Gang Scheduling with Dynamic Space Sharing on Symmetric Multiprocessors Using Automatic Self-Allocating Threads (ASAT), IPPS, Apr 1997.
16. A. Tucker and A. Gupta, Process control and scheduling issues for multiprogrammed shared-memory multiprocessors. 12th Symposium on Operating Systems Principles, Dec 1989.
17. R. Wood, Distributed Production Control System. Technical Report UCRL-TB-122372, Lawrence Livermore National Laboratory, Nov 1995.
18. Q. Yang and H. Wang, A new graph approach to minimizing processor fragmentation in hypercube multiprocessors. IEEE Transactions on Parallel and Distributed Systems 4(10), Oct 1993.