On the user-scheduler dialogue: Studies of user-provided runtime estimates and utility functions

International Journal of High Performance Computing Applications

Volumn 20, Issue 4, 2006, Pages 495-506

  Lee, Cynthia Bailey ^a   Snavely, Allan ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

Runtime estimates; Scheduling; Utility functions

Indexed keywords

APPROXIMATION THEORY; PROGRAM PROCESSORS; SCHEDULING;

HIGH-PERFORMANCE COMPUTING; RUNTIME ESTIMATES; UTILITY FUNCTIONS;

OPERATIONS RESEARCH;

EID: 33750200641     PISSN: 10943420     EISSN: 17412846     Source Type: Journal    
DOI: 10.1177/1094342006068414     Document Type: Conference Paper

References (21)

1. Buehler, R. 2003. Planning, personality, and prediction: The role of future focus in optimistic time predictions. Orgaizational Behavior & Human Decision Processes, 92 (1-2).
2. Chiang, S.-H., Arpaci-Dusseau, A., and Vernon, M. K. 2002. The impact of more accurate requested runtimes on prduction job scheduling performance. Proceedings of the 4th Workshop on Workload Characterization, D. G. Fetelson, L. Rudolph, U. Schwiegelshohn, editors, July.
3. Chun, B. N. 2001. Market-based Cluster Resource Managment. Ph.D. thesis. University of California, Berkeley. November.
4. Chun, B. N. and Culler, D. E. 2002. User-centric performance analysis of market-based cluster batch schedulers. 2nd IEEE International Symposium on Cluster Computing and the Grid, May.
5. Cirne, W. and Berman, F. 2001. A comprehensive model of the supercomputer workload. Proceedings of IEEE 4th Annual Workshop on Job Scheduling Strategies for Paralel Processing. Cambridge, MA.
6. Feitelson, D. G., Rudolph, L., Schwiegelsohn, U., Sevcik, K. C., and Wong, P. 1997. Theory and practice in parallel job scheduling. Proceedings of the 3rd Workshop on Job Scheduling Strategies for Parallel Processing, D. G. Fetelson and L. Rudolph, editors. April.
7. Franaszek, P. A. and Nelson, R. D. 1995. Properties of delay-cost scheduling in time-sharing systems. Journal of Research and Development 39 (3).
8. Irwin, D. E., Grit, L. E., and Chase, J. S. 2004. Balancing Risk and Reward in a Market-Based Task Service. 13th IEEE International Symposium on High Performance Distriuted Computing, June.
9. Jones, J. P. and Nitzberg, B. 1999. Scheduling for parallel supercomputing: A historical perspective of achievable utilization. Proceedings of the 5th Workshop on Job Scheuling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph, editors, April.
10. Kruger, J. and Dunning, D. 1999. Unskilled and unaware of it: How difficulties in recognizing one's own incompetence lead to inflated self-assessments. Journal of Personality & Social Psychology 77 (6).
11. Lawson, B. G. and Smirni, E. 2002. Multiple-queue backfilling scheduling with priorities and reservations for parallel systems. Proceedings of 8th Workshop on Job Scheduling Strategies for Parallel Processing, D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, editors. July.
12. Lee, C., Snavely, A., Leary, R. H., Carrington, L., Casanova, H., Bohn, R., Carson, R., Hardy J., and Schwartzman, Y. 2004. Towards high-order performance objectives for HPC system scheduling. San Diego Supercomputer Center Tecnical Report, March 9.
13. Lovallo, D. and Kahneman, D. 2003. Delusions of Success. Harvard Business Review 81 (7).
14. Messina, P. C. 1993. The concurrent supercomputing consotium: Year 1. Parallel & Distributed Technology 1 (1).
15. Mu'alem, A. W. and Feitelson, D. G. 2001. Utilization, predicability, workloads, and user runtime estimates in scheduing the IBM SP2 with backfilling. IEEE Transactions on Parallel & Distributed Systems 12 (6).
16. Perkovic, D. and Keleher, P. 2000. Randomization, speculation, and adaptation in batch schedulers. Proceedings of Supecomputing 2000, November.
17. Snavely, A., Carrington, L., Wolter, N., Labarta, J., Badia, R., and Purkayastha, A. 2002. A framework for performance modeling and prediction. Proceedings of the 2002 ACM/ IEEE Conference on Supercomputing, November.
18. Srinivasan, S., Kettimuthu, R., Subramani, V., and Sadayappan, P. 2002. Characterization of backfilling strategies for parallel job scheduling. Proceedings of 2002 International Workshops on Parallel Processing, August.
19. Stoica, I., Abdel-Wahab, H., and Pothen, A. 1995. A microecnomic scheduler for parallel computers. IPPS'95 Worshop: Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph, editors, April.
20. Ward, W. A. Jr., Mahood, C. L., and West, J. E. 2002. Scheduing jobs on parallel systems using a relaxed backfill straegy. Proceedings of the 8th Workshop on Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph, editors, July.
21. Zotkin, D. and Keleher, P. 1999. Sloppiness as a virtue: Jolength estimation and performance in backfilling scheulers. 8th IEEE International Symposium on High Peformance Distributed Computing, Redondo Beach, CA, August.