Chapter

Advances in Databases and Information Systems

Volume 6909 of the series Lecture Notes in Computer Science pp 185-199

Resource Scheduling Methods for Query Optimization in Data Grid Systems

  • Igor EpimakhovAffiliated withLancaster UniversityInstitut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University
  • , Abdelkader HameurlainAffiliated withLancaster UniversityInstitut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University
  • , Tharam DillonAffiliated withCarnegie Mellon UniversityDEBII Institute, Curtin University
  • , Franck MorvanAffiliated withLancaster UniversityInstitut de Recherche en Informatique de Toulouse IRIT, Paul Sabatier University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

Resource allocation (RA) is one of the most important stages of distributed query processing in Data Grid systems. Recently, a number of papers that propose different methods for RA were published. To deal with specific characteristics of the data grid systems, such as dynamicity, heterogeneity and large-scale, many studies extend classic methods from distributed and parallel databases domains. Others invite fundamentally different methods based on incentives for autonomous nodes. The present study provides a brief description, qualitative comparison and performance evaluation of the most interesting approaches (extended classic and incentive-based) for RA. Both approaches are promising and appropriate for successful data grid systems.

Keywords

Data grid systems resource allocation distributed query processing and optimization incentive-based scheduling extended classic scheduling