loading...
Impact of Laxity on Scheduling with Advance Reservations in Grids
Atlanta, Georgia September 27-September 29
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/MASCOT.2005.3313th IEEE International Symposium on ...
 This Article 
 
PDF
HTML
IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Umar Farooq, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
Shikharesh Majumdar, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada
Eric W. Parsons, Department of Systems and Computer Engineering, Carleton University, Ottawa, Canada

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.

Citation:
Umar Farooq, Shikharesh Majumdar, Eric W. Parsons, "Impact of Laxity on Scheduling with Advance Reservations in Grids," mascots, pp.319-324, 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005
Usage of this product signifies your acceptance of the Terms of Use.