HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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

Remi Bertin 1, 2 Arnaud Legrand 2 Corinne Touati 2
2 MESCAL - Middleware efficiently scalable
Inria Grenoble - Rhône-Alpes, LIG - Laboratoire d'Informatique de Grenoble
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.
Complete list of metadata

Contributor : Arnaud Legrand Connect in order to contact the contributor
Submitted on : Monday, February 18, 2013 - 11:51:28 AM
Last modification on : Friday, January 21, 2022 - 3:23:42 AM

Links full text




Remi Bertin, Arnaud Legrand, Corinne Touati. Toward a Fully Decentralized Algorithm for Multiple Bag-of-tasks Application Scheduling on Grids. IEEE/ACM International Conference on Grid Computing (Grid), 2008, Tsukuba, Japan, ⟨10.1109/GRID.2008.4662790⟩. ⟨hal-00789438⟩



Record views