Skip to Main content Skip to Navigation

Scheduling Tasks Sharing Files from Distributed Repositories (revised version)

Arnaud Giersch 1 Yves Robert 1 Frédéric Vivien 1
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 a large distributed heterogeneous platform, which is composed of a set of servers. Each server is a processor cluster equipped with a file repository. The tasks to be scheduled depend upon (input) files which initially reside on the server repositories. A given file may well be shared by several tasks. For each task, the problem is to decide which server will execute it, and to transfer the required files (those which the task depends upon) to that server repository. The objective is to find a task allocation, and to schedule the induced communications, 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, including an extension of the heuristic to the decentralized framework, and several lower cost heuristics, which we compare through extensive simulations. This report is a revised version of the LIP research report no. 2003-49 / INRIA research report no. 4976, which it replaces.
Document type :
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 5:36:41 PM
Last modification on : Monday, November 16, 2020 - 9:56:02 AM


  • HAL Id : inria-00071459, version 1



Arnaud Giersch, Yves Robert, Frédéric Vivien. Scheduling Tasks Sharing Files from Distributed Repositories (revised version). [Research Report] RR-5124, LIP RR-2004-04, INRIA, LIP. 2004. ⟨inria-00071459⟩



Record views


Files downloads