PSO-based resource scheduling algorithm for parallel query processing on grids

Arturo Pérez-Cebreros, Gilberto Martinez-Luna, Nareli Cruz-Cortés

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The accelerated development in Grid computing has positioned it as promising next generation computing platforms. Grid computing contains resource management, task scheduling, security problems, information management and so on. In the context of database query processing, existing parallelisation techniques can not operate well in Grid environments, because the way they select machines and allocate queries. This is due to the geographic distribution of resources that are owned by different organizations. The resource owners have different usage or access policies, cost models, varying loads and availability. It is a big challenge for efficient scheduling algorithm design and implementation. In this paper, a heuristic approach based on particle swarm optimization algorithm is adopted to solving parallel query scheduling problem in grid environment.

Original languageEnglish
Title of host publicationICEIS 2009 - 11th International Conference on Enterprise Information Systems, Proceedings
PublisherINSTICC Press
Pages131-137
Number of pages7
ISBN (Print)9789898111845
DOIs
StatePublished - 2009
EventICEIS 2009 - 11th International Conference on Enterprise Information Systems - Milan, Italy
Duration: 6 May 200910 May 2009

Publication series

NameICEIS 2009 - 11th International Conference on Enterprise Information Systems, Proceedings
VolumeDISI

Conference

ConferenceICEIS 2009 - 11th International Conference on Enterprise Information Systems
Country/TerritoryItaly
CityMilan
Period6/05/0910/05/09

Keywords

  • Database
  • Genetic algorithms
  • Grid
  • Particle swarm optimization
  • Query scheduler

Fingerprint

Dive into the research topics of 'PSO-based resource scheduling algorithm for parallel query processing on grids'. Together they form a unique fingerprint.

Cite this