Search-based job scheduling for parallel computer workloads

Proceedings - IEEE International Conference on Cluster Computing, ICCC

Volumn , Issue , 2005, Pages

  Vasupongayya, Sangsuree ^a   Chiang, Su Hui ^a   Massey, Bart ^a  

^a PORTLAND STATE UNIVERSITY   (United States)

Author keywords

Backfill; Discrepancy based search; Parallel job scheduling

Indexed keywords

BACKFILL; BACKFILL POLICIES; BALANCE PERFORMANCE; CLUSTER COMPUTING; COMPLETE SEARCH; DISCREPANCY-BASED SEARCH; INTERNATIONAL CONFERENCES; JOB SCHEDULING; JOB SCHEDULING POLICIES; LINUX CLUSTERING; LOWER BOUNDS; PARALLEL COMPUTER SYSTEMS; PARALLEL COMPUTERS; PARALLEL JOB SCHEDULING; PERFORMANCE EVALUATION; PERFORMANCE GOALS; SCHEDULING POLICIES;

AD HOC NETWORKS; COMPUTER SYSTEMS; CONTROL THEORY; HIERARCHICAL SYSTEMS; LEARNING ALGORITHMS; PARALLEL ALGORITHMS; SCHEDULING;

CHLORINE COMPOUNDS;

EID: 50149096924     PISSN: 15525244     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CLUSTR.2005.347037     Document Type: Conference Paper

References (18)

1. S.-H. Chiang, A. Dusseau-Arpaci, and M. K. Vernon. The impact of more accurate requested runtimes on production job scheduling performance. In Proc. 8th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP), Edinburgh, Scotland, July 2002. Springer Verlag. LNCS. 2537.
2. S.-H. Chiang and C. Fu. Re-evaluating reservation policies for backfill scheduling on parallel systems. In Proc. 16th IASTED Int'l Conf. on Parallel and Distributed Computing and Systems (PDCS), Cambridge, MA., November 2004.
3. S.-H. Chiang and C. Fu. Benefit of limited time-sharing in the presence of very large parallel jobs. In Proc. 19th IEEE Int'l Parallel & Distributed Processing Symposium (IPDPS), Denver, April 2005.
4. S.-H. Chiang and M. K. Vernon. Production job scheduling for parallel shared memory systems. In Proc. 15th IEEE IPDPS, San Francisco, April 2001.
5. J. M. Crawford. Solving satisfiability problems using a combination of systematic and local search. In 2nd DIMACS Challenge: Cliques, Coloring, and Satisfiability, Rutgers Univ., NJ., 1993.
6. J. M. Crawford. An approach to resource constrained project scheduling. In Proc. 1996 Artificial Intelligence and Manufacturing Research Planning Workshop, 1996.
7. W. D. Harvey and M. L. Ginsberg. Limited discrepancy search. In Proc. 14th Int'l Joint Conf. on Artificial Intelligence, Montreal, Canada, August 1995.
8. R. E. Korf. Improved limited discrepancy search. In Proc. 13th National Conf. on Artificial Intelligence (AAAI-96), pages 209-215, Portland, OR., August 1996.
9. MOAB, http://www.supercluster.org/moab.
10. A. W. Mu'alem and D. G. Feitelson. Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling, IEEE Trans. Parallel and Distributed Syst., 12(6):529-543, June 2001.
11. PBS Scheduler. http://www.nas.nasa.gov/Software/PBS/.
12. Platform LSF. http://www.platform.com/products/LSFfamily/.
13. E. Shmueli and D. G. Feitelson. Backfilling with lookahead to optimize the performance of parallel job scheduling. In Proc. 9th Workshop on JSSPP, Seattle, June 2003. Springer Verlag. LNCS. 2862.
14. S. Srinivasan, R. Kettimuthu, V. Subramani, and P. Sadayappan. Selective reservation strategies for backfill job scheduling. In Proc. 8th Workshop on JSSPP, Edinburgh, Scotland, July 2002. Springer Verlag, LNCS. 2537.
15. D. Talby and D. G. Feitelson. Supporting priorities and improving utilization of the IBM SP2 scheduler using slack-based backfilling. In Proc. 13th Int'l. Parallel Processing Symp., pages 513-517, San Juan, April 1999.
16. D. Talby and D. G. Feitelson. Improving and stabilizing parallel computer performance using adaptive backfilling. In Proc. 19th IEEE IPDPS, Denver, April 2005.
17. T. Walsh. Depth-bounded discrepancy search. In Proc. 15th Int'l Joint Conf. on A.I., Nagoya, Japan, 1997.
18. W. A. Ward, Jr. Carrie L. Mahood, and J. E. West. Scheduling jobs on parallel systems using a relaxed backfill strategy. In Proc. 8th Workshop on JSSPP, Edinburgh, Scotland, July 2002. Springer Verlag, Lect. Notes Comput. Sci. Vol. 2537.