DocumentCode
2228676
Title
Impact of laxity on scheduling with advance reservations in grids
Author
Farooq, Umar ; Majumdar, Shikharesh ; Parsons, Eric W.
Author_Institution
Dept. of Syst. & Comput. Eng., Carleton Univ., Ottawa, Ont., Canada
fYear
2005
fDate
27-29 Sept. 2005
Firstpage
319
Lastpage
322
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.
Keywords
computational complexity; dynamic scheduling; grid computing; resource allocation; NP-hard problem; advance resource reservation; dynamic AR scheduling; grid infrastructure; scalable algorithm; Application software; Costs; Dynamic scheduling; Grid computing; NP-hard problem; Processor scheduling; Scheduling algorithm; System performance; Systems engineering and theory; Upper bound;
fLanguage
English
Publisher
ieee
Conference_Titel
Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 2005. 13th IEEE International Symposium on
ISSN
1526-7539
Print_ISBN
0-7695-2458-3
Type
conf
DOI
10.1109/MASCOTS.2005.33
Filename
1521148
Link To Document