Paper Info
Title
Flexible Time-Windows for Advance Reservation Scheduling
Abstract
Advance-reservation is an essential feature of any system in which resources may need to be co-allocated at predetermined times. In this paper, we discuss unconstrained advance reservations, which use flexible time-windows to lower blocking probability and, consequently, increase resource utilization. We claim and show using simulations that the minimum window size, which theoretically brings the blocking probability to zero, in a first-come-first-served advance reservation model without time-slots, equals the waiting time in a queue-based on-demand model. We also show, with simulations, the effect of the window size on the blocking probability and on the resource utilization, for an advance reservation model with time-slots, for different types of arrival and service times. We then compare the blocking probabilities obtained by on-demand reservations, advance reservations, and unconstrained advance reservations with flexibility.
Year
DOI
Venue
2006
10.1109/MASCOTS.2006.25
MASCOTS
Keywords
Field
DocType
queue-based on-demand model,advance reservation scheduling,first-come-first-served advance reservation model,advance reservation model,unconstrained advance reservation,resource utilization,increase resource utilization,flexible time-windows,advance reservation,window size,on-demand reservation,minimum window size,operating systems,resource management,protocols,bandwidth,mathematics,workstations,grid computing
Reservation,Resource management,Grid computing,Scheduling (computing),Computer science,Queue,Workstation,Computer network,Real-time computing,Bandwidth (signal processing),Processor scheduling,Distributed computing
Conference
ISBN
Citations 
PageRank 
0-7695-2573-3
15
0.96
References 
Authors
6
3
Name
Order
Citations
PageRank
Neena R. Kaushik1181.70
Silvia M. Figueira232075.28
Stephen A. Chiappari3203.50