Skip to Main content Skip to Navigation

Allocating Series of Workflows on Computing Grids

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 metadata

Cited literature [34 references]  Display  Hide  Download
Contributor : Loris Marchal Connect in order to contact the contributor
Submitted on : Thursday, July 31, 2008 - 2:26:55 PM
Last modification on : Saturday, September 11, 2021 - 3:16:51 AM
Long-term archiving on: : Friday, October 5, 2012 - 11:36:23 AM


Files produced by the author(s)


  • HAL Id : inria-00308639, version 1



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⟩



Record views


Files downloads