Scheduling with Storage Constraints

Abstract : We are interested in this paper to study scheduling problems in systems where many users compete to perform their respective jobs on shared parallel resources. Each user has specific needs or wishes for computing his/her jobs expressed as a function to optimize (among maximum completion time, sum of completion times and sum of weighted completion times). Such problems have been mainly studied through Game Theory. In this work, we focus on solving the problem by optimizing simultaneously each user's objective function independently using classical combinatorial optimization techniques. Some results have already been proposed for two users on a single computing resource. However, no generic combinatorial method is known for many objectives. The analysis proposed in this paper concerns an arbitrarily fixed number of users and is not restricted to a single resource. We first derive inapproximability bounds; then we analyze several greedy heuristics whose approximation ratios are close to these bounds. However, they remain high since they are linear in the number of users. We provide a deeper analysis which shows that a slightly modified version of the algorithm is a constant approximation of a Pareto-optimal solution.
Liste complète des métadonnées

Cited literature [12 references]  Display  Hide  Download
Contributor : Grégory Mounié <>
Submitted on : Friday, June 19, 2009 - 9:24:51 AM
Last modification on : Thursday, October 11, 2018 - 8:48:03 AM
Document(s) archivé(s) le : Monday, October 15, 2012 - 12:31:44 PM


Files produced by the author(s)


  • HAL Id : hal-00396303, version 1



Erik Saule, Pierre-Francois Dutot, Grégory Mounié. Scheduling with Storage Constraints. IPDPS'08, Apr 2008, Miami, United States. pp.1-8. ⟨hal-00396303⟩



Record views


Files downloads