Skip to Main content Skip to Navigation

Scheduling tasks sharing fileson heterogeneous clusters

Arnaud Giersch 1 yves Robert Frédéric Vivien 
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper is devoted to scheduling a large collection of independent tasks onto heterogeneous clusters. The tasks depend upon (input) files which initially reside on a master processor. A given file may well be shared by several tasks. The role of the master is to distribute the files to the processors, so that they can execute the tasks. The objective for the master is to select which file to send to which slave, and in which order, so as to minimize the total execution time. The contribution of this paper is twofold. On the theoretical side, we establish complexity results that assess the difficulty of the problem. On the practical side, we design several new heuristics, which are shown to perform as efficiently as the best heuristics designed by Casanova et al., although their cost is an order of magnitude lower.
Document type :
Complete list of metadata
Contributor : Rapport De Recherche Inria Connect in order to contact the contributor
Submitted on : Tuesday, May 23, 2006 - 6:43:11 PM
Last modification on : Wednesday, March 2, 2022 - 1:28:05 PM


  • HAL Id : inria-00071767, version 1



Arnaud Giersch, yves Robert, Frédéric Vivien. Scheduling tasks sharing fileson heterogeneous clusters. [Research Report] RR-4819, LIP RR-2003-28, INRIA, LIP. 2003. ⟨inria-00071767⟩



Record views


Files downloads