Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks

Abstract : In this paper, we consider the problem of scheduling independent parallel tasks in parallel systems with identical processors. The problem is NP-hard, since it includes the bin packing problem as a special case when all tasks have unit execution time. We propose and analyze a simple approximation algorithm called H_m, where m is a positive integer. Algorithm H_m has a moderate asymptotic worst-case performance ratio in the range [4/3 ... 31/18] for all m≥ 6; but the algorithm has a small asymptotic worst-case performance ratio in the range [1+1/(r+1)..1+1/r], when task sizes do not exceed 1/r of the total available processors, where r>1 is an integer. Furthermore, we show that if the task sizes are independent, identically distributed (i.i.d.) uniform random variables, and task execution times are i.i.d. random variables with finite mean and variance, then the average-case performance ratio of algorithm H_m is no larger than 1.2898680..., and for an exponential distribution of task sizes, it does not exceed 1.2898305.... As demonstrated by our analytical as well as numerical results, the average-case performance ratio improves significantly when tasks request for smaller numbers of processors.
Type de document :
Article dans une revue
Discrete Mathematics and Theoretical Computer Science, DMTCS, 1999, 3 (4), pp.155-166
Liste complète des métadonnées

Littérature citée [8 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00958934
Contributeur : Service Ist Inria Sophia Antipolis-Méditerranée / I3s <>
Soumis le : jeudi 13 mars 2014 - 16:47:58
Dernière modification le : mercredi 29 novembre 2017 - 10:26:19
Document(s) archivé(s) le : vendredi 13 juin 2014 - 12:01:07

Fichier

dm030403.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : hal-00958934, version 1

Collections

Citation

Keqin Li. Analysis of an Approximation Algorithm for Scheduling Independent Parallel Tasks. Discrete Mathematics and Theoretical Computer Science, DMTCS, 1999, 3 (4), pp.155-166. 〈hal-00958934〉

Partager

Métriques

Consultations de la notice

91

Téléchargements de fichiers

181