GarQ: An efficient scheduling data structure for advance reservations of grid resources

  • Authors:
  • Anthony Sulistio;Uros Cibej;Sushil K. Prasad;Rajkumar Buyya

  • Affiliations:
  • GRIDS Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia;Faculty of Computer and Information Science, The University of Ljubljana, Ljubljana, Slovenia;Department of Computer Science, Georgia State University, Atlanta, GA, USA;GRIDS Laboratory, Department of Computer Science and Software Engineering, The University of Melbourne, Australia

  • Venue:
  • International Journal of Parallel, Emergent and Distributed Systems
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In Grids, users may require assurance for completing their jobs on shared resources. Such guarantees can only be provided by reserving resources in advance. However, if many reservation requests arrive at a resource simultaneously, the overhead of providing such service due to adding, deleting and searching, will be significant. An efficient data structure for managing these reservations plays an important role in order to minimise the time required for searching available resources, adding and deleting reservations. In this paper, we present new approaches to advance reservation in order to deal with the limitations of the existing data structures, such as Segment Tree and Calendar Queue in similar problems. We propose a Grid advanced reservation Queue (GarQ), which is a new data structure that improves some weaknesses of the aforementioned data structures. We demonstrate the superiority of the proposed structure by conducting a detailed performance evaluation on real workload traces.