Effective selection of partition sizes for moldable scheduling of parallel jobs

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

Volumn 2552, Issue , 2002, Pages 174-183

  Srinivasan, Srividya ^a   Subramani, Vijay ^a   Kettimuthu, Rajkumar ^a   Holenarsipur, Praveen ^a   Sadayappan, P ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

CURRENT PRACTICES; JOB SCHEDULING; PARALLEL JOB SCHEDULING; PARALLEL JOBS; PROCESSOR PARTITIONS; SCHEDULING MODELS; SCHEDULING STRATEGIES;

PARALLEL PROCESSING SYSTEMS;

EID: 34248186212     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36265-7_17     Document Type: Conference Paper

References (22)

1. S. V. Anastasiadis and K. C. Sevcik. Parallel Application Scheduling on Networks of Workstations. Journal of Parallel and Distributed Computing, 43(2):109-124, 1997. 174
2. O. Arndt, B. Freisleben, T. Kielmann, and F. Thilo. A Comparative Study of Online Scheduling Algorithms for Networks of Workstations. Cluster Computing, 3(2):95-112, 2000. 174
3. S. H. Chiang, R. K. Mansharamani, and M. K. Vernon. Use of Application Characteristics and Limited Preemption for Run-to-Completion Parallel Processor Scheduling Policies. In SIGMETRICS, pages 33-44, 1994. 174
4. S. H. Chiang and M. K. Vernon. Production Job Scheduling for Parallel Shared Memory Systems. In Proceedings of the International Parallel and Distributed Processing Symp, 2001. 174
5. W. Cirne. Using Moldability to Improve the Performance of Supercomputer Jobs. Ph.D. Thesis. Computer Science and Engineering, University of California San Diego, 2001. 174, 176
6. W. Cirne. When the Herd is Smart: The Emergent Behavior of SA. In IEEE Trans. Par. Distr. Systems, 2002. 174, 176
7. W. Cirne and F. Berman. Adaptive Selection of Partition Size for Supercomputer Requests. In Workshop on Job Scheduling Strategies for Parallel Processing, pages 187-208, 2000. 174, 176
8. A. B. Downey. A Model For Speedup of Parallel Programs. Technical Report CSD-97-933. University of California at Berkeley, 1997. 176
9. D. G. Feitelson. Logs of real parallel workloads from production systems. http://www.cs.huji.ac.il/labs/parallel/workload/logs.html. 175, 176
10. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong. Theory and Practice in Parallel Job Scheduling. In Workshop on Job Scheduling Strategies for Parallel Processing, pages 1-34. 174, 176
11. D. Jackson, Q. Snell, and M. J. Clement. Core Algorithms of the Maui Scheduler. In Wkshp. on Job Sched. Strategies for Parallel Processing, pages 87-102, 2001. 175
12. P. J. Keleher, D. Zotkin, and D. Perkovic. Attacking the Bottlenecks of Backfilling Schedulers. Cluster Computing, 3(4):245-254, 2000. 174
13. D. Lifka. The ANL/IBM SP Scheduling System. In Workshop on Job Scheduling Strategies for Parallel Processing, pages 295-303, 1995. 175
14. A. W. Mu’alem and D. G. Feitelson. Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. In IEEE Trans. Par. Distr. Systems, volume 12, pages 529-543, 2001. 174, 175
15. E. Rosti, E. Smirni, L. W. Dowdy, G. Serazzi, and B. M. Carlson. Robust Partitioning Policies of Multiprocessor Systems. Performance Evaluation, 19(2-3):141-165, 1994. 174
16. S. Setia and S. Tripathi. A Comparative Analysis of Static Processor Partitioning Policies for Parallel Computers. In Proc. of the Intl. Wkshp. on Modeling and Simulation of Computer and Telecomm. Syst. (MASCOTS), pages 283-286, 1993. 174
17. K. C. Sevcik. Application Scheduling and Processor Allocation in Multiprogrammed Parallel Processing Systems. Performance Evaluation, 19(2-3):107-140, 1994. 174
18. J. Skovira, W. Chan, H. Zhou, and D. Lifka. The EASY - LoadLeveler API Project. In Wkshp. on Job Sched. Strategies for Parallel Processing, pages 41-47, 1996. 175
19. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Characterization of Backfilling Strategies for Parallel Job Scheduling. In Proceedings of the ICPP2002 Workshops, pages 514-519, 2002. 180
20. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Selective Reservation Strategies for Backfill Job Scheduling. In Proceedings of the 8th Workshop on Job Scheduling Strategies for Parallel Processing, 2002. 180
21. A. Streit. On Job Scheduling for HPC-Clusters and the dynP Scheduler. In Proc. Intl. Conf. High Perf. Comp., pages 58-67, 2001. 174
22. D. Talby and D. Feitelson. Supporting Priorities and Improving Utilization of the IBM SP Scheduler Using Slack-Based Backfilling. In Proceedings of the 13th International Parallel Processing Symposium, 1999. 175