Job scheduling in the presence of multiple resource requirements

ACM/IEEE SC 1999 Conference, SC 1999

Volumn , Issue , 1999, Pages 47-

  Leinberger, William ^a   Karypis, George ^a   Kumar, Vipin ^a  

^a UNIVERSITY OF MINNESOTA   (United States)

Author keywords

High performance computing; Multiple resource constraints; Parallel job scheduling

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; PARALLEL PROCESSING SYSTEMS; PROGRAM PROCESSORS; SCHEDULING; SCHEDULING ALGORITHMS;

FIRST COME FIRST SERVED; HARDWARE AND SOFTWARE; HIGH PERFORMANCE COMPUTING; MASSIVELY PARALLEL PROCESSING SYSTEMS; MULTIPLE RESOURCE CONSTRAINT; PARALLEL JOB SCHEDULING; RESOURCE REQUIREMENTS; RESOURCE SCHEDULING ALGORITHMS;

JOB SHOP SCHEDULING;

EID: 84994508155     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SC.1999.10067     Document Type: Conference Paper

References (18)

1. Jr. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation algorithms for bin-packing - an updated survey. In G. Ausiello, M. Lucertini, and P. Serafini, editors, Algorithm Design for Computer System Design, pages 49-99. Springer-Verlag, New York, 1984.
2. D.G. Feitelson. Packing schemes for gang scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS '96 Workshop: Job Scheduling Strategies for Parallel Processing, volume 1162, pages 65-88. Springer-Verlag, New York, 1996. Lect. Notes in Computer Science.
3. D.G. Feitelson and L. Rudolph. Parallel job scheduling: Issues and approaches. In D.G. Feitelson and L. Rudolph, editors, IPPS '95 Workshop: Job Scheduling Strategies for Parallel Processing, volume 949, pages 1-18. Springer-Verlag, New York, 1995. Lect. Notes in Computer Science.
4. D.G. Feitelson and A.M. Weil. Utilization and predictability in scheduling the ibm sp2 with backfilling. In Proceedings of the IPPS/SPDP 1998, pages 542-546. IEEE Computer Society, 1998.
5. M. R. Garey and R. L. Graham. Bounds for multiprocessor scheduling with resource constraints. SIAM Journal of Computing, 4(2):187-201, June 1975.
6. S. Hotovy. Workload evolution on the cornell theory center ibm sp2. In D.G. Feitelson and L. Rudolph, editors, IPPS '96 Workshop: Job Scheduling Strategies for Parallel Processing, volume 1162, pages 27-40. Springer-Verlag, New York, 1996. Lect. Notes in Computer Science.
7. G. Karypis and V. Kumar. Multi-constraint graph partitioning. In Supercomputing '98, November 1998.
8. W. Leinberger, G. Karypis, and V. Kumar. Multicapacity bin packing algorithms with applications to job scheduling under multiple constraints. In International Conferfence on Parallel Processing, 1999.
9. D. Lifka. The anl/ibm sp scheduling system. Technical report, Mathematics and Computer Science Division, Argonne National Laboratory, Argonne, IL, 1995.
10. R. K. Mansharamani and M. K. Vernon. Comparison of processor allocation policies for parallel systems. Technical report, Computer Sciences Department, University of Wisconsin, December 1993.
11. R.K. Mansharamani and M.K. Vernon. Properties of the eqs parallel processor allocation policy. Technical Report 1192, Computer Science Department, University of Wisconsin-Madison, November 1993.
12. K. Maruyama, S. K. Chang, and D. T. Tang. A general packing algorithm for multidimensional resource requirements. International Journal of Computer and Information Sciences, 6(2):131-149, May 1976.
13. C. McCann and J. Zahorjan. Scheduling memory constrained jobs on distributed memory computers. In Proceedings of the 1995 ACM SIGMETRICS Joint International Conference on Measurement and Modelling of Computer Systems, pages 208-219, 1996.
14. W. Nitzberg, K.Windisch, V. Lo, R. More, and D. Feitelson. A comparison of workload traces from two production parallel machines. In The 6th Symposium on the Frontiers of Massively Parallel Computing, pages 319-326, October 1998.
15. E. W. Parsons and K. C. Sevcik. Coordinated allocation of memory and processors in multiprocessors. Technical report, Computer Systems Research Institute, University of Toronto, October 1995.
16. E.W. Parsons and K. C. Sevcik. Implementing multiprocessor scheduling disciplines. Technical Report 356, Computer Systems Research Institute, University of Toronto, Canada, 1998.
17. J. Skovira, W. Chan, H. Zhou, and D.Lifka. The easy-loadleveler api project. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162, pages 41-47. Springer-Verlag, New York, 1996. Lect. Notes in Computer Science.
18. D. Talby and D. G. Feitelson. Supporting priorities and improving utilization of the ibm sp2 scheduler using slack-based backfilling. Technical report, Institute of Computer Science, The Hebrew University of Jerusalem, 1999.