Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids - Archive ouverte HAL Access content directly
Reports (Research Report) Year : 2008

Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids

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

Abstract

In this paper, we present a fully decentralized algorithm for fair resource sharing between multiple bag-of-tasks applications in a grid environment. This algorithm is inspired from related work on multi-path routing in communication network. An interesting feature of this algorithm is that it allows the choice of wide variety of fairness criteria and achieves both optimal path selection and flow control. In addition, this algorithm only requires local information at each slave computing tasks and at each buffer of the network links while minimal computation is done by the schedulers. A naive adaptation is unstable and inefficient though. Fortunately, a simple and effective scaling mechanism is sufficient to circumvent this issue. This scaling mechanism is motivated by a careful study of the subtle differences with the classical multi-path routing problem. We prove its efficiency through a detailed analysis of a simple simulation.
Fichier principal
Vignette du fichier
RR-6537.pdf (408.51 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00279993 , version 1 (16-05-2008)
inria-00279993 , version 2 (19-05-2008)

Identifiers

  • HAL Id : inria-00279993 , version 2

Cite

Rémi Bertin, Arnaud Legrand, Corinne Touati. Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids. [Research Report] INRIA. 2008, pp.27. ⟨inria-00279993v2⟩
166 View
222 Download

Share

Gmail Facebook Twitter LinkedIn More