An Advance Reservation-Based Co-allocation Algorithm for Distributed Computers and Network Bandwidth on QoS-Guaranteed Grids

Abstract

Abstract. Co-allocation of performance-guaranteed computing and network resources provided by several administrative domains is one of the key issues for constructing a QoS-guaranteed Grid. We propose an advance reservation-based co-allocation algorithm for both computing and network resources on a QoSguaranteed Grid, modeled as an integer programming (IP) problem. The goal of our algorithm is to create reservation plans satisfying user resource requirements as an on-line service. Also the algorithm takes co-allocation options for user and resource administrator issues into consideration. We evaluate the proposed algorithm with extensive simulation, in terms of both functionality and practicality. The results show: The algorithm enables efficient co-allocation of both computing and network resources provided by multiple domains, and can reflect reservation options for resource administrators issues as a first step. The calculation times needed for selecting resources using an IP solver are acceptable for an on-line service.

Advance reservation, co-allocation and pricing of network and computational resources in grids

“…Note that the width of the first minimal cut in the list is 3. The extended minimal cut between the two minimal cuts of the list is {[(1, 4)], [(2, 5), (5,8)], [(3, 6)]}. As can be seen, [(2, 5), (5,8)] is an extended link and the second link has been marked with an open diamond.…”

“…Takefuse et al propose an advance reservation-based coallocation algorithm for distributed computational resources and network bandwidth [8]. Their online approach incorporates both co-allocation and advance reservation, but does not integrate economic principles.…”

“…We can also check that when we remove any link in EMCL from the network, its capacity will decrease. The non-limiting links from set {(4, 8), (11,12), (14,16), (14,17), (16,18), (17,18)} are not included in the extended minimal cut list.…”

“…Extended links are not marked but visible by the fact that the links in an extended link are horizontally separated by commas, for example (2,5), (5,8).…”

“…For computational resources, we assume that all compute resources are equal when normalized to a reference CPU. We use the step function given in (8) to pre-price all the compute resources in the system.…”