Allocating Series of Workflows on Computing Grids

Matthieu Gallet 1, 2 Loris Marchal 1, 2 Frédéric Vivien 1, 2, 3
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
3 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In this report, we focus on scheduling jobs on computing Grids. In our model, a Grid job is made of a large collection of input data sets, which must all be processed by the same task graph or workflow, thus resulting in a series of workflow problem. We are looking for an efficient solution with regard to throughput and latency, while avoiding solutions requiring complex control. We thus only consider single-allocation strategies. We present an algorithm based on mixed linear programming to find an optimal allocation, and this for different routing policies depending on how much latitude we have on communications. Then, using simulations, we compare our allocations to reference heuristics. Our results show that our algorithm almost always finds an allocation with good throughput and low latency, and that it outperforms the reference heuristics, especially under communication-intensive scenarios.
Complete list of metadatas

Cited literature [34 references]  Display  Hide  Download

https://hal.inria.fr/inria-00308639
Contributor : Loris Marchal <>
Submitted on : Thursday, July 31, 2008 - 2:26:55 PM
Last modification on : Tuesday, December 11, 2018 - 10:58:05 AM
Long-term archiving on : Friday, October 5, 2012 - 11:36:23 AM

File

RR-6603.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00308639, version 1

Collections

Citation

Matthieu Gallet, Loris Marchal, Frédéric Vivien. Allocating Series of Workflows on Computing Grids. [Research Report] RR-6603, INRIA. 2008, pp.31. ⟨inria-00308639⟩

Share

Metrics

Record views

294

Files downloads

271