Communications of the ACM
The grid: blueprint for a new computing infrastructure
The grid: blueprint for a new computing infrastructure
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Predicting Queue Times on Space-Sharing Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
The ANL/IBM SP Scheduling System
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Job Characteristics of a Production Parallel Scientivic Workload on the NASA Ames iPSC/860
IPPS '95 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
A Historical Application Profiler for Use by Parallel Schedulers
IPPS '97 Proceedings of the Job Scheduling Strategies for Parallel Processing
Predicting Application Run Times Using Historical Information
IPPS/SPDP '98 Proceedings of the Workshop on Job Scheduling Strategies for Parallel Processing
Techniques for Estimating the Computation and Communication Costs of Distributed Data Mining
ICCS '02 Proceedings of the International Conference on Computational Science-Part I
Benchmarks and Standards for the Evaluation of Parallel Job Schedulers
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Backfilling, and Migration
JSSPP '01 Revised Papers from the 7th International Workshop on Job Scheduling Strategies for Parallel Processing
The Impact of More Accurate Requested Runtimes on Production Job Scheduling Performance
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
Job Scheduling for the BlueGene/L System
JSSPP '02 Revised Papers from the 8th International Workshop on Job Scheduling Strategies for Parallel Processing
The Impact of Migration on Parallel Job Scheduling for Distributed Systems
Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
Reliable Multi-robot Coordination Using Minimal Communication and Neural Prediction
Revised Papers from the International Seminar on Advances in Plan-Based Control of Robotic Agents,
An Economy-based Accounting Infrastructure for the DataGrid
GRID '03 Proceedings of the 4th International Workshop on Grid Computing
Predicting application run times with historical information
Journal of Parallel and Distributed Computing
Enhancing Prediction on Non-dedicated Clusters
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
Predicting Grid Performance Based on Novel Reduct Algorithm
KES '08 Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II
TeraGrid resource selection tools: a road test
Proceedings of the 2010 TeraGrid Conference
Discovering Piecewise Linear Models of Grid Workload
CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Task profiling model for load profile prediction
Future Generation Computer Systems
Multiplexing low and high QoS workloads in virtual environments
JSSPP'10 Proceedings of the 15th international conference on Job scheduling strategies for parallel processing
Service control with the preemptive parallel job scheduler Scojo-PECT
Cluster Computing
Modeling and experimental validation of the data handover API
GPC'11 Proceedings of the 6th international conference on Advances in grid and pervasive computing
Backfilling with guarantees granted upon job submission
Euro-Par'11 Proceedings of the 17th international conference on Parallel processing - Volume Part I
Modeling and synthesizing task placement constraints in Google compute clusters
Proceedings of the 2nd ACM Symposium on Cloud Computing
Towards Non-Stationary Grid Models
Journal of Grid Computing
Adaptive Executions of Multi-Physics Coupled Applications on Batch Grids
Journal of Grid Computing
Using on-the-fly simulation for estimating the turnaround time on non-dedicated clusters
Euro-Par'06 Proceedings of the 12th international conference on Parallel Processing
A grid resource broker supporting advance reservations and benchmark-based resource selection
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
Rough set based data mining tasks scheduling on knowledge grid
AWIC'05 Proceedings of the Third international conference on Advances in Web Intelligence
ScoPred–scalable user-directed performance prediction using complexity modeling and historical data
JSSPP'05 Proceedings of the 11th international conference on Job Scheduling Strategies for Parallel Processing
Rough set based computation times estimation on knowledge grid
EGC'05 Proceedings of the 2005 European conference on Advances in Grid Computing
Coordinated rescheduling of Bag-of-Tasks for executions on multiple resource providers
Concurrency and Computation: Practice & Experience
State-based predictions with self-correction on Enterprise Desktop Grid environments
Journal of Parallel and Distributed Computing
List-based Data Structures for Efficient Management of Advance Reservations
International Journal of Parallel Programming
| Hi-index | 0.00 |
On many computers, a request to run a job is not serviced immediately but instead is placed in a queue and serviced only when resources are released by preceding jobs. In this paper, we build on run-time prediction techniques that we developed in previous research to explore two problems. The first problem is to predict how long applications will wait in a queue until they receive resources. We develop run-time estimates that result in more accurate wait-time predictions than other run-time prediction techniques. The second problem we investigate is improving scheduling performance. We use run-time predictions to improve the performance of the least-work-first and backfill scheduling algorithms. We find that using our run-time predictor results in lower mean wait times for the workloads with higher offered loads and for the backfill scheduling algorithm.