Predicting Bounds on Queuing Delay in Space-shared Computing Environments
- 1 October 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
Most space-sharing resources presently operated by high performance computing centers employ some sort of batch queueing system to manage resource allocation to multiple users. In this work, we explore a new method for providing end-users with predictions of the bounds on queuing delay individual jobs will experience when waiting to be scheduled to a machine partition. We evaluate this method using scheduler logs that cover a 10 year period from 10 large HPC systems. Our results show that it is possible to predict delay bounds with specified confidence levels for jobs in different queues, and for jobs requesting different ranges of processor countsKeywords
This publication has 7 references indexed in Scilit:
- Grid ComputingPublished by Wiley ,2003
- Parallel Job Scheduling under Dynamic WorkloadsPublished by Springer Nature ,2003
- Predicting queue times on space-sharing parallel computersPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler PerformancePublished by Springer Nature ,1999
- Dynamic vs. static quantum-based parallel processor allocationPublished by Springer Nature ,1996
- Toward convergence in job schedulers for parallel supercomputersPublished by Springer Nature ,1996
- Parallel job scheduling: Issues and approachesPublished by Springer Nature ,1995