VARQ: Virtual advance reservations for queues

Proceedings of the 17th International Symposium on High Performance Distributed Computing 2008, HPDC'08

Volumn , Issue , 2008, Pages 75-86

  Nurmi, Daniel ^a   Wolski, Rich ^a   Brevik, John ^b  

^a University of California   (United States)

^b CALIFORNIA STATE UNIVERSITY   (United States)

Author keywords

Advance reservation; Batch queue; Super computing

Indexed keywords

DIE CASTING; HIGH PERFORMANCE LIQUID CHROMATOGRAPHY; POPULATION STATISTICS; PROBABILITY; STATISTICAL METHODS; TELECOMMUNICATION NETWORKS;

ADVANCE RESERVATION; ADVANCE RESERVATIONS; BATCH QUEUE; BEST EFFORTS; EMPIRICAL EVALUATIONS; HIGH-PERFORMANCE COMPUTING; HPC SYSTEMS; JOB SCHEDULING; MACHINE UTILIZATIONS; MULTIPROCESSOR MACHINES; OPERATING SYSTEMS; PROBABILISTIC APPROACHES; PROCESSOR RESOURCES; RESOURCE DEMANDS; RESOURCE UTILIZATIONS; SUPER-COMPUTING; TURN-AROUND;

SCHEDULING;

EID: 57349151478     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1383422.1383433     Document Type: Conference Paper

References (28)

1. F, Berman, G. Fox, and T. Hey. Grid Computing: Making the Global, Infrastructure, a Reality. Wiley and Sons, 2003.
2. J. Brevik, D. Nurmi, and R. Wolski. Predicting bounds on queuing delay for batch-scheduled parallel machines. In Proceedings of PPoPP 2006. March 2006.
3. A. Bucur and D. Epema. The performance of processor co-allocation in multicluster systems. In 3rd IEEE/ACM Int'l Symp. on Cluster Computing and the GRID (CCGrid2003.
4. S. Clearwater and S. Kleban, Heavy-tailed distributions in supercomputer jobs. Technical Report SAND2002-2378C, Sandia National Labs, 2002.
5. C. Czajkowski, I. Foster, N. Karonis, C. Kesselman, S. Martin, W. Smith, and S. Tuecke. A resource management architecture for metacomputing systems. In International Parallel Processing Symp. Workshop on Job Scheduling Strategies for Parallel Processing, 1998.
6. A. Downey. Predicting queue times on space-sharing parallel computers. In Proceedings of the 11th International Parallel Processing Symposium, April 1997.
7. A. Downey. Using queue time predictions for processor allocation. In Proceedings of the 3rd Workshop on Job Scheduling Strategies for Parallel Processing, April 1997.
8. C. Ernemann, V. Hamscher, U. Schwiegelshohn, R,. Yahyapour, and A. Streit. On advantages of grid computing for parallel job scheduling. In 2nd IEEE/ACM International Symposium on Cluster Computing and, the Grid. 2002, pages 39-47.
9. C. Ernemann, V. Hamscher, and R. Yahyapour. Economic scheduling in grid computing, 2002.
10. D. G. Feitelson. A survey of scheduling in multiprogrammed parallel systems.
11. D. G. Feitelson, L. Rudolph, and U. Schwiegelshohn. Parallel job scheduling - a status report, 2004.
12. I. Foster and C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann Publishers, Inc., 1998.
13. J. Gehring and T. Preiss. Scheduling a metacomputer with uncooperative sub-schedulers. In Proc. JSSPP, pages 179.
14. M. Harchol-Balter. The effect of heavy-tailed job size distributions on computer system design. In Proceedings of ASA-IMS Conference on Applications of Heavy Tailed Distributions in Economics. Engineering and Statistics, June 1999.
15. F. Heine, M. Hovestadt, O. Kao, and A. Streit. On the impact of reservations from the grid on planning-based resource management. In International Workshop on Grid Computing Security and Resource Management (GSRM 2005) at ICCS 2005. Atlanta, USA, Springer. LNCS 3516, pages 155-162.
16. D. Jackson, Q. Snell, and M. Clement. Core algorithms of the maui scheduler. In 7th Workshop on Job Scheduling Strategies for Parallel Processing, 2001.
17. D. Lifka. The ANL/IBM SP scheduling system, volume 949. Springer-Verlag, 1995.
18. Maui scheduler home page -http://www.clusterresources.com/products/maui/ .
19. 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. Parallel and Distributed, Syst. 12(6), Jun 2001, pages 529-54 3.
20. C. Ng, P. Buonadonna, B. N. Chun, A. C. Snoeren, , and A. Vahdat. Addressing strategic behavior in a deployed microeconomic resource allocator. In In Proceedings of the. 3rd Workshop on Economics of Peer-to-Peer Systems, 2005.
21. D. Nurmi, J. Brevik, and R. Wolski. Qbets: Queue bounds estimation from time series. In Proceedings of Job Scheduling Strategies for Parallel Processing (JSSPP), June 2007.
22. The qbets web page - http://nws.cs.ucsb.edu/batchq.
23. J. Shneidman, C. Ng, D. C. Parkes, A. AuYoung, A. C. Snoeren, and A. Vahdat. Why markets could (but don't currently) solve resource allocation problems in systems. In Proceedings of the 10th USENIX Workshop on Hot Topics in Operating Systems, 2005.
24. L. Smarr and C. E. Catlett. Metacomputing, 1992.
25. W. Smith, I. Foster, and V. Taylor. Scheduling with advanced reservations. In Parallel and Distributed Processing Symposium (IPDPS 2000), pages 127-132.
26. W. Smith, V. E. Taylor, and I. T. Foster. Using run-time predictions to estimate queue wait times and improve scheduler performance. In IPPS/SPDP '99/JSSPP '99: Proceedings of the Job Scheduling Strategies for Parallel Processing, pages 202-219, London, UK, 1999. Springer-Verlag.
27. Q. Snell, M. Clement, D. Jackson, and C. Gregory. The performance impact of advance reservation meta-scheduling. In 6th Workshop on Job Scheduling Strategies for Parallel Processing, pages 137-153, 2000.
28. The teragrid user portal - http://portal.teragrid.org.