DMCA
Exploiting tuple spaces to provide fault-tolerant scheduling on computational grids (2007)
| Venue: | In 10th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing |
| Citations: | 7 - 3 self |
BibTeX
@INPROCEEDINGS{Favarim07exploitingtuple,
author = {Fábio Favarim and Joni Silva and Fraga Lau and Cheuk Lung and Miguel Correia and João Felipe Santos},
title = {Exploiting tuple spaces to provide fault-tolerant scheduling on computational grids},
booktitle = {In 10th IEEE International Symposium on Object/component/service-oriented Real-time distributed Computing},
year = {2007},
pages = {403--411}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Scheduling tasks on large-scale computational grids is difficult due to the heterogeneous computational capabilities of the resources, node unavailability and unreliable network connectivity. This work proposes GRIDTS, a grid infrastructure in which the resources select the tasks they execute, instead of a scheduler finding resources for the tasks. This solution allows scheduling decisions to be made with up-to-date information about the resources. Moreover, GRIDTS provides fault-tolerant scheduling by combining a set of fault tolerance techniques to tolerate crash faults in components of the system. The core of the solution is a tuple space, which supports the communication, but also provides support for the fault tolerance mechanisms. 1.
Keyphrases
tuple space fault-tolerant scheduling computational grid scheduler finding resource heterogeneous computational capability fault tolerance technique large-scale computational grid node unavailability crash fault grid infrastructure up-to-date information fault tolerance mechanism unreliable network connectivity
