Improved approximation algorithms for scheduling parallel jobs on identical clusters

Bougeret, Marin, Dutot, Pierre-Francois, Trystram, Denis, Jansen, Klaus and Robenek, Christina (2015) Improved approximation algorithms for scheduling parallel jobs on identical clusters Theoretical Computer Science, 600 . pp. 70-85.

Full text not available from this repository.

Abstract

The Multiple Cluster Scheduling Problem corresponds to minimizing the maximum completion time (makespan) of a set of n parallel rigid (and non-preemptive) jobs submitted to N identical clusters. It cannot be approximated with a ratio better than 2 (unless P = NP). We present in this paper the methodology that encompasses several existing results [1,2]. We detail first how to apply it for obtaining a 5/2-approximation. Then, we use it to provide a new 7/3-approximation running in O(log(nh(max))N(n log(n))), where h(max) is the processing time of the longest job. Finally, we apply it to a restriction of the problem to jobs of limited size, leading to a 2-approximation which is the best possible ratio since the restriction remains 2-inapproximable. (C) 2015 Elsevier B.V. All rights reserved.

Document Type: Article
Additional Information: Times Cited: 0
Research affiliation: OceanRep > The Future Ocean - Cluster of Excellence
Kiel University
Refereed: Yes
ISSN: 0304-3975
Projects: Future Ocean
Date Deposited: 20 Oct 2016 11:00
Last Modified: 01 Aug 2018 09:03
URI: http://eprints.uni-kiel.de/id/eprint/32422

Actions (login required)

View Item View Item