Approximation algorithms for scheduling with a limited number of communications - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Parallel Computing Année : 2000

Approximation algorithms for scheduling with a limited number of communications

Résumé

We consider the case of a UET tree and an unlimited number of processors. We give a 2-approximation algorithm for minimizing the total number of communications, when there are no communication delays. This algorithm allows us to design a 6-approximation algorithm for the makespan minimization problem when there are unit length communication delays and the processors are interconnected by a single bus. Finally, we compare our 6-approximation algorithm with other algorithms by simulations. We show that its mean performance is regular (around 1.25) and we explain, for certain cases, the performance of these algorithms by considering some parameters of the problem.
Fichier principal
Vignette du fichier
ParaComp-2000.pdf (551.72 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00363041 , version 1 (20-10-2015)

Identifiants

Citer

Chams Lahlou. Approximation algorithms for scheduling with a limited number of communications. Parallel Computing, 2000, 26 (9), pp.1129-1162. ⟨10.1016/S0167-8191(00)00032-6⟩. ⟨hal-00363041⟩
113 Consultations
78 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More