Impact of Laxity on Scheduling with Advance Reservations in Grids

Authors:
Umar Farooq;Shikharesh Majumdar;Eric W. Parsons
Affiliations:
Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada;Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada;Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
Venue:
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
Year:
2005

Citing 0
Cited 5

Grid resource brokering algorithms enabling advance reservations and resource selection based on performance predictions

Future Generation Computer Systems
Scheduling mixed-parallel applications with advance reservations

HPDC '08 Proceedings of the 17th international symposium on High performance distributed computing
VRM: a failure-aware Grid resource management system

International Journal of High Performance Computing and Networking
Scheduling mixed-parallel applications with advance reservations

Cluster Computing
Optimum allocation of distributed service workflows with probabilistic real-time guarantees

Service Oriented Computing and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

Advance reservations (ARs) were introduced for application level dynamic scheduling of resources in a Grid infrastructure. Previous research shows that ARs can meet their objectives but at a significant performance cost. We argue that laxity in the reservation window of an AR can help improve the performance of AR scheduling. Scheduling ARs with laxities is an NP-Hard problem and in this paper we briefly discuss our scalable algorithm for AR scheduling. Based on simulation, the paper investigates in detail the effect laxity on the system performance.