Modeling user runtime estimates

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

Volumn 3834 LNCS, Issue , 2006, Pages 1-35

  Tsafrir, Dan ^a   Etsion, Yoav ^a   Feitelson, Dror G ^a  

^a HEBREW UNIVERSITY OF JERUSALEM   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BEHAVIORAL RESEARCH; COMPUTER SIMULATION; PARALLEL PROCESSING SYSTEMS; PROFESSIONAL ASPECTS; SCHEDULING;

PARALLEL MACHINES; SCHEDULERS; WORKLOAD TRACES;

HUMAN COMPUTER INTERACTION;

EID: 33744910071     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (41)

1. S-H. Chiang, A. Arpaci-Dusseau, and M. K. Vernon, "The impact of more accurate requested runtimes on production job scheduling performance". In Job Scheduling Strategies for Parallel Processing, D. G. Peitelson, L. Rudolph, and U. Schwiegelshohn (eds.), pp. 103-127, Springer Verlag, 2002.
2. Lect. Notes Comput. Sci. vol. 2537.
3. S-H. Chiang and M. K. Vernon, "Characteristics of a large shared memory production workload". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 159-187, Springer Verlag, 2001.
4. Lect. Notes Comput. Sci. vol. 2221.
5. W. Cirne arid F. Berman, "A comprehensive model of the supercomputer work-load". In 4th Workshop on Workload Characterization, Dec 2001.
6. W. Cirne and F. Berman, "A model for moldable supercomputer jobs". In 15th Intl. Parallel & Distributed Processing Symp., Apr 2001.
7. M. E. Crovella, "Performance evaluation with heavy tailed distributions". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1-10, Springer Verlag, 2001.
8. Lect. Notes Comput. Sci. vol. 2221.
9. A. B. Downey, "A parallel workload model and its implications for processor allocation". In 6th Intl. Symp. High Performance Distributed Comput., pp. 112-124, Aug 1997.
10. Y. Etsion and D. Tsafrir, A Short Survey of Commercial Cluster Batch Schedulers. Technical Report 2005-13, Hebrew University, May 2005.
11. D. G. Feitelson, "Experimental analysis of the root causes of performance evaluation results: a backfilling case study". IEEE Trans. Parallel & Distributed Syst. 16(2), pp. 175-182, Feb 2005.
12. D. G. Feitelson, "Parallel workloads archive". URL http://www.cs.huji.ac.il/labs/parallel/workload.
13. D. G. Feitelson and M. A. Jette, "Improved utilization and responsiveness with gang scheduling". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 238-261, Springer Verlag, 1997.
14. Lect. Notes Comput. Sci. vol. 1291.
15. D. G. Feitelson and A. Mu'alem Weil, "Utilization and predictability in scheduling the IBM SP2 with backfilling". In 12th Intl. Parallel Processing Symp., pp. 542-546, Apr 1998.
16. D. G. Feitelson and B. Nitzberg, "Job characteristics of a production parallel scientific workload on the NASA Ames iPSC/860". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 337-360, Springer-Verlag, 1995.
17. Lect. Notes Comput. Sci. vol. 949.
18. E. Frachtenberg, D. G. Feitelson, J. Fernandez, and F. Petrini, "Parallel job scheduling under dynamic workloads". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (eds.), pp. 208-227, Springer Verlag, 2003.
19. Lect. Notes Comput. Sci. vol. 2862.
20. R. Gibbons, "A historical application profiler for use by parallel schedulers". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 58-77, Springer Verlag, 1997.
21. Lect. Notes Comput. Sci. vol. 1291.
22. J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riodan, "Modeling of workload in MPPs". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 95-116, Springer Verlag, 1997.
23. Lect. Notes Comput. Sci. vol. 1291.
24. P. J. Keleher, D. Zotkin, and D. Perkovic, "Attacking the bottlenecks of backfilling schedulers". Cluster Comput. 3(4), pp. 255-263, 2000.
25. C. B. Lee, Y. Schwartzman, J. Hardy, and A. Snavely, "Are user runtime estimates inherently inaccurate?". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn (eds.), Springer Verlag, Jun 2004.
26. Lect. Notes Comput. Sci. vol. 3277.
27. H. Li, D. Groep, and J. T. L. Wolters, "Predicting job start times on clusters". In International Symposium on Cluster Computing and the Grid (CCGrid), 2004.
28. D. Lifka, "The ANL/IBM SP scheduling system". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 295-303, Springer-Verlag, 1995.
29. Lect. Notes Comput. Sci. vol. 949.
30. U. Lublin and D. G. Feitelson, "The worMoad on parallel supercomputers: modeling the characteristics of rigid jobs". J. Parallel & Distributed Comput. 63(11), pp. 1105-1122, Nov 2003.
31. 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 & Distributed Syst. 12(6), pp. 529-543, Jun 2001.
32. D. Perkovic and P. J. Keleher, "Randomization, speculation, and adaptation in batch schedulers". In Supercomputing, p. 7, Sep 2000.
33. W. Smith, I. Foster, and V. Taylor, "Predicting application run times using historical information". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 122-142, Springer Verlag, 1998.
34. Lect. Notes Comput. Sci. vol. 1459.
35. D. Talby, User Modeling of Parallel Workloads. PhD thesis, The Hebrew University of Jerusalem, Israel, 200? In preparation.
36. D. Tsafrir, Y. Etsion, and D. G. Feitelson, Backfilling Using Runtime Predictions Rather Than User Estimates. Technical Report 2005-5, Hebrew University, Feb 2005.
37. D. Tsafrir and D. G. Feitelson, Workload Flurries. Technical Report 2003-85, Hebrew University, Nov 2003.
38. Y. Zhang, H. Franke, J. E. Moreira, and A. Sivasubramaniam, "An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration". In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 133-158, Springer Verlag, 2001.
39. Lect. Notes Comput. Sci. vol. 2221.
40. J. Zilber, O. Amit, and D. Talby, "What is worth learning from parallel workloads? A user and session based analysis". In Intl. Conf. Supercomputing, Jun 2005.
41. D. Zotkin and P. J. Keleher, "Job-length estimation and performance in backfilling schedulers". In 8th Intl. Symp. High Performance Distributed Comput., Aug 1999.