Resource Scheduling Methods for Query Optimization in Data Grid Systems

  • Igor Epimakhov
  • Abdelkader Hameurlain
  • Tharam Dillon
  • Franck Morvan
Conference paper

DOI: 10.1007/978-3-642-23737-9_14

Volume 6909 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Epimakhov I., Hameurlain A., Dillon T., Morvan F. (2011) Resource Scheduling Methods for Query Optimization in Data Grid Systems. In: Eder J., Bielikova M., Tjoa A.M. (eds) Advances in Databases and Information Systems. ADBIS 2011. Lecture Notes in Computer Science, vol 6909. Springer, Berlin, Heidelberg

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 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Igor Epimakhov
    • 1
  • Abdelkader Hameurlain
    • 1
  • Tharam Dillon
    • 2
  • Franck Morvan
    • 1
  1. 1.Institut de Recherche en Informatique de Toulouse IRITPaul Sabatier UniversityToulouseFrance
  2. 2.DEBII InstituteCurtin UniversityPerthAustralia