Published Articles >> Table of Contents >> Abstract

10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07)   pp. 403-411
Exploiting Tuple Spaces to Provide Fault-Tolerant Scheduling on Computational Grids
Fabio Favarim, Universidade Federal de Santa Catarina, Brazil
Joni da Silva Fraga, Universidade Federal de Santa Catarina, Brazil
Lau Cheuk Lung, Pontificia Universidade Catolica do Parana, Brazil
Miguel Correia, Universidade de Lisboa, Portugal
Joao Felipe Santos, Universidade Federal de Santa Catarina, Brazil

Full Article Text:

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/ISORC.2007.37
Send link to a friend

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.
Back to Top Additional Information
Citation:  Fabio Favarim, Joni da Silva Fraga, Lau Cheuk Lung, Miguel Correia, Joao Felipe Santos, "Exploiting Tuple Spaces to Provide Fault-Tolerant Scheduling on Computational Grids," isorc, pp. 403-411,  10th IEEE International Symposium on Object and Component-Oriented Real-Time Distributed Computing (ISORC'07),  2007