“Exploiting Tuple Spaces to Provide Fault-Tolerant Scheduling on Computational Grids”
From Navigators
(Difference between revisions)
(NavsPubsFull5.xml import (201201141459, full reimport with new ids for legacy pubs avoiding collisions)) |
|||
Line 1: | Line 1: | ||
{{Publication | {{Publication | ||
- | |title= | + | |type=inproceedings |
- | + | |title=Exploiting Tuple Spaces to Provide Fault-Tolerant Scheduling on Computational Grids | |
- | + | |author=Fabio Favarim, Joni Fraga, Lau Cheuk Lung, Miguel Correia, João Santos | |
- | + | |month=may | |
- | + | |year=2007 | |
- | + | |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. | |
- | + | |booktitle=In Proceedings of the 10th IEEE International Symposium on Object and component-oriented Real-time distributed Computing (ISORC). May 2007. | |
- | |author= | + | |url=http://www.navigators.di.fc.ul.pt/archive/favarim-ExploitingTupleSpace.pdf |
- | + | ||
- | | | + | |
- | + | ||
- | | | + | |
- | + | ||
- | | | + | |
- | + | ||
- | |booktitle= | + | |
- | + | ||
- | | | + | |
- | + | ||
- | + | ||
- | + | ||
- | + | ||
- | + | ||
}} | }} |
Latest revision as of 18:18, 14 January 2013
Fabio Favarim, Joni Fraga, Lau Cheuk Lung, Miguel Correia, João Santos
in In Proceedings of the 10th IEEE International Symposium on Object and component-oriented Real-time distributed Computing (ISORC). May 2007., May 2007.
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.
Download paper
Download Exploiting Tuple Spaces to Provide Fault-Tolerant Scheduling on Computational Grids
Export citation
Project(s):
Missing ResearchLine