Effect of job size characteristics on job scheduling performance

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1911, Issue , 2000, Pages 1-17

  Aida, Kento ^a  

^a TOKYO INSTITUTE OF TECHNOLOGY   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

PARALLEL PROCESSING SYSTEMS;

ADMINISTRATION POLICY; JOB SCHEDULING ALGORITHMS; PARALLEL COMPUTER; PARALLEL COMPUTER SYSTEMS; PRIORITY SCHEDULING; USER COMMUNITIES; WORK-LOAD MODELS; WORKLOAD CHARACTERISTICS;

SCHEDULING;

EID: 84947213753     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-39997-6_1     Document Type: Conference Paper

References (15)

1. K. Li and K. Cheng. Job Scheduling in a Partitionable Mesh Using a Two- Dimensional Buddy System Partitioning Scheme. IEEE Trans. on Parallel and Distributed Systems, 2(4):413–422, 1991.
2. D. A. Lifka. The ANL/IBM SP Scheduling System. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 949, pages 295–303. Springer-Verlag, 1995.
3. J. S. Skovira, W. Chan, and H. Zhou. The EASY -LoadLev eler API Project. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162, pages 41–47. Springer-Verlag, 1996.
4. P. Krueger, T. Lai, and V. A. Dixit-Radiya. Job Scheduling Is More Important than Processor Allocation for Hypercube Computers. IEEE Trans. on Parallel and Distributed Systems, 5(5):488–497, 1994.
5. D. G. Feitelson. Packing Scheme for Gang Scheduling. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162, pages 89–110. Springer-Verlag, 1996.
6. J. Subhlok, T. Gross, and T Suzuoka. Impact of Job Mix on Optimizations for Space Sharing Scheduler. In Proc. of Supercomputing’96, 1996.
7. A. B. Downey. A parallel workload model and its implications for processor allocation. In Proc. the 6th International Symposium of High Performance Distributed Computing, pages 112–123, 1997.
8. Parallel Workloads Archive. http://www.cs.huji.ac.il/labs/parallel/workload/.
9. V. Lo, J. Mache, and K. Windisch. A Comparative Study of Real Workload Traces and Synthetic Workload. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1459, pages 25–46. Springer-Verlag, 1998.
10. D. G. Feitelson and L. Rudolph. Toward Convergence in Job Schedulers for Parallel Supercomputers. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162, pages 1–26. Springer-Verlag, 1996.
11. R. Gibbons. A Historical Application Profiler for Use by Parallel Schedulers. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291, pages 58–77. Springer-Verlag, 1997.
12. K. Aida, H. Kasahara, and S. Narita. Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1459, pages 98–121, 1998.
13. H. Franke, J. Jann, J. E. Moreira, P. Pattnaik, and M. A. Jette. An Evaluation of Parallel Job Scheduling for ASCI Blue-Pacific. In Proc. SC99, 1999.
14. E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin-packing - An Updated Survey. In Algorithm Design for Computer System Design, pages 49–106. Springer-Verlag, 1984.
15. E. G. Coffman, M. R. Garey, and D. S. Johnson. Bin Packing with Divisible Item Sizes. Journal of Complexity, 3:406–428, 1987.