Resource co-allocation using advance reservations with flexible time-windows
ACM SIGMETRICS Performance Evaluation Review
SLA-Based Advance Reservations with Flexible and Adaptive Time QoS Parameters
ICSOC '07 Proceedings of the 5th international conference on Service-Oriented Computing
Rescheduling co-allocation requests based on flexible advance reservations and processor remapping
GRID '08 Proceedings of the 2008 9th IEEE/ACM International Conference on Grid Computing
Optimum allocation of distributed service workflows with probabilistic real-time guarantees
Service Oriented Computing and Applications
An economic agent maximizing cloud provider revenues under a pay-as-you-book pricing model
GECON'12 Proceedings of the 9th international conference on Economics of Grids, Clouds, Systems, and Services
Improving user QoS by relaxing resource reservation policy in high-performance grid environments
International Journal of Grid and Utility Computing
| Hi-index | 0.00 |
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.