Mapping Tightly-Coupled Applications on Volatile Resources - Archive ouverte HAL Access content directly
Reports Year :

Mapping Tightly-Coupled Applications on Volatile Resources

(1) , (2, 3) , (2, 3) , (2, 3)


Platforms that comprise volatile processors, such as desktop grids, have been traditionally used for executing independent-task applications. In this work we study the scheduling of tightly-coupled iterative master-worker applications onto volatile processors. The main challenge is that workers must be simultaneously available for the application to make progress. We consider two additional complications: one should take into account that workers can become temporarily reclaimed and, for data-intensive applications, one should account for the limited bandwidth between the master and the workers. In this context, our first contribution is a theoretical study of the scheduling problem in its off-line version, i.e., when processor availability is known in advance. Even in this case the problem is NP-hard. Our second contribution is an analytical approximation of the expectation of the time needed by a set of workers to complete a set of tasks and of the probability of success of this computation. This approximation relies on a Markovian assumption for the temporal availability of processors. Our third contribution is a set of heuristics, some of which use the above approximation to favor reliable processors in a sensible manner. We evaluate these heuristics in simulation. We identify some heuristics that significantly outperform their competitors and derive heuristic design guidelines.
Fichier principal
Vignette du fichier
RR.pdf (185.7 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

ensl-00697621 , version 1 (15-05-2012)


  • HAL Id : ensl-00697621 , version 1


Henri Casanova, Fanny Dufossé, Yves Robert, Frédéric Vivien. Mapping Tightly-Coupled Applications on Volatile Resources. 2012. ⟨ensl-00697621⟩
242 View
205 Download


Gmail Facebook Twitter LinkedIn More