Applying scheduling and tuning to on-line parallel tomography
Proceedings of the 2001 ACM/IEEE conference on Supercomputing
Predicting Queue Times on Space-Sharing Parallel Computers
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Using Run-Time Predictions to Estimate Queue Wait Times and Improve Scheduler Performance
IPPS/SPDP '99/JSSPP '99 Proceedings of the Job Scheduling Strategies for Parallel Processing
A computational economy for grid computing and its implementation in the Nimrod-G resource broker
Future Generation Computer Systems - Grid computing: Towards a new computing infrastructure
Adaptive Computing on the Grid Using AppLeS
IEEE Transactions on Parallel and Distributed Systems
The workload on parallel supercomputers: modeling the characteristics of rigid jobs
Journal of Parallel and Distributed Computing
Dynamic Scheduling of Parallel Jobs with QoS Demands in Multiclusters and Grids
GRID '04 Proceedings of the 5th IEEE/ACM International Workshop on Grid Computing
The impact of predictive inaccuracies on execution scheduling
Performance Evaluation - Performance modelling and evaluation of high-performance parallel and distributed systems
Cross-Platform Performance Prediction of Parallel Applications Using Partial Execution
SC '05 Proceedings of the 2005 ACM/IEEE conference on Supercomputing
Performance prediction and its use in parallel and distributed computing systems
Future Generation Computer Systems - Systems performance analysis and evaluation
Backfilling with lookahead to optimize the packing of parallel jobs
Journal of Parallel and Distributed Computing
Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment
Journal of Parallel and Distributed Computing
Backfilling Using System-Generated Predictions Rather than User Runtime Estimates
IEEE Transactions on Parallel and Distributed Systems
On the User-Scheduler Dialogue: Studies of User-Provided Runtime Estimates and Utility Functions
International Journal of High Performance Computing Applications
The performance of bags-of-tasks in large-scale distributed systems
HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
Performance modeling of parallel applications for grid scheduling
Journal of Parallel and Distributed Computing
Centralized versus Distributed Schedulers for Bag-of-Tasks Applications
IEEE Transactions on Parallel and Distributed Systems
Trace-based evaluation of job runtime and queue wait time predictions in grids
Proceedings of the 18th ACM international symposium on High performance distributed computing
IPDPS '09 Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing
QBETS: queue bounds estimation from time series
JSSPP'07 Proceedings of the 13th international conference on Job scheduling strategies for parallel processing
Maximizing revenue in Grid markets using an economically enhanced resource manager
Concurrency and Computation: Practice & Experience - Economic Models and Algorithms for Grid Systems
Performance analysis of job dissemination techniques in Grid systems
Concurrency and Computation: Practice & Experience
Are user runtime estimates inherently inaccurate?
JSSPP'04 Proceedings of the 10th international conference on Job Scheduling Strategies for Parallel Processing
Energy efficiency management in computational grids through energy-aware scheduling
Proceedings of the 28th Annual ACM Symposium on Applied Computing
Hi-index | 0.00 |
Metaschedulers can distribute parts of a Bag-of-Tasks (BoT) application among various resource providers in order to speed up its execution. The expected completion time of the user application is then calculated based on the run-time estimates of all applications running and waiting for resources. However, because of inaccurate run time estimates, initial schedules are not those that provide users with the earliest completion time. These estimates increase the time distance between the first and last tasks of a BoT application, which increases average user response time, especially in multi-provider environments. This paper proposes a coordinated rescheduling algorithm to handle inaccurate run-time estimates when executing BoT applications in multi-provider environments. The coordinated rescheduling defines which tasks can have start time updated based on the expected completion time of the entire BoT application. We have also evaluated the impact of system-generated run-time estimates to schedule BoT applications on multiple providers. We performed experiments using simulations and a real distributed platform, Grid'5000. From our experiments, we obtained reductions of up to 5 and 10% for response time and slowdown metrics, respectively, by using coordinated rescheduling over a traditional rescheduling solution. Moreover, coordinated rescheduling requires little modification of existing scheduling systems. System-generated predictions, on the other hand, are more complex to be deployed and may not reduce response times as much as coordinated rescheduling. Copyright © 2011 John Wiley & Sons, Ltd.