Online algorithms for advance resource reservations

We consider the problem of providing QoS guarantees to Grid users through advance reservation of resources. Advance reservation mechanisms provide the ability to allocate resources to users based on agreed-upon QoS requirements and increase the predictability of a Grid system, yet incorporating such mechanisms into current Grid environments has proven to be a challenging task due to the resulting resource fragmentation. We use concepts from computational geometry to present a framework for tackling the resource fragmentation, and for formulating a suite of scheduling strategies. We also develop efficient implementations of the scheduling algorithms that scale to large Grids. We conduct a comprehensive performance evaluation study using simulation, and we present numerical results to demonstrate that our strategies perform well across several metrics that reflect both user- and system-specific goals. Our main contribution is a timely, practical, and efficient solution to the problem of scheduling resources in emerging on-demand computing environments.

Research highlights
► We have used computational geometry to develop efficient algorithm that support advance reservations for homogeneous environments.
► We have conducted in-depth performance evaluation that demonstrate that the proposed strategies perform well across several user and system performance metrics.
► We concluded that online scheduling algorithms achieve–under most conditions–high utilization, while providing smaller delays and better QoS guarantees without adding much complexity.