Randomization, speculation, and adaptation in batch schedulers

Proceedings of the International Conference on Supercomputing

Volumn 2000-November, Issue , 2000, Pages

  Perkoviü, Dejan ^a   Keleher, Peter J ^a  

^a University of Maryland ^*  (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BATCH SCHEDULERS; BOUNDED SLOWDOWNS; JOB SCHEDULING ALGORITHMS; PERFORMANCE; PRIORITY-BASED; RANDOMISATION; SIMPLE MODELING; TEST RUNS;

SCHEDULING ALGORITHMS;

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

References (11)

1. K. Aida, H. Kasahara, and S. Narita, “Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs,” in Job Scheduling Strategies for Parallel Processing, vol. 1291, Lecture Notes in Computer Science, D. G. Feitelson and L. Rudolph, Eds.: Springer-Verlag, 1998.
2. th International Parallel Processing Symposium, 1998.
3. D. Lifka, “ANL/IBM SP scheduling system,” in Job Scheduling for Parallel Processin, vol. 949, Lecture Notes in Computer Science, D. G. F. a. L. Rudolph, Ed.: Springer-Verlag, 1995, pp. 295-303.
4. C. McCann and J. Zahorjan, “Processor Allocation Policies for Message-Passing Parallel Computers,” in Proceedings of the 1994 ACM SIGMETRICS Conference, February 1994, pp. 19-32.
5. J. Padhye and L. Dowdy, “Dynamic Adaptive Processor Allocation Policies for Message Passing Parallel Computers: An Empirical Comparison,” in Job Scheduling Strategies for Parallel Processing, vol. 1162, Lecture Notes in Computer Science, D. G. Feitelson and L. Rudolph, Eds.: Springer-Verlag, 1996, pp. 224-243.
6. J. D. Padhye and L. W. Dowdy, “Dynamic versus Adaptive Processor Allocation Policies for Message Passing Parallel Computers: An Empirical Comparison,” Lecture Notes in Computer Science, vol. 1162, 1996.
7. E. Rosti, E. Smirni, L. W. Dowdy, G. Serazzi, and B. M. Carlson, “Robust partitioning policies for multiprocessor systems,” Performance Evaluation, vol. 19(2-3), pp. 141-165, March 1994.
8. th International Conference on Parallel Processing. Oconomowoc, WI, August 1995, pp. III:203-210.
9. W. Smith, V. Taylor, and I. Foster, “Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance,” in IPPS/SPDP '99 Workshop on Job Scheduling Strategies for Parallel Processing, 1999.
10. J. Subhlock, T. Gross, and T. Suzuoka, “Impact of Job Mix on Optimizations for Space Sharing Scheduler,” in Supercomputing '96, 1996.
11. th High Performance Distributed Computing Conference, August 1999.