Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks

Marwane Bouznif 1 Rodolphe Giroudeau 2, *
* Auteur correspondant
1 G-SCOP_OC - OC
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
2 MAORE - Méthodes Algorithmes pour l'Ordonnancement et les Réseaux
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : We investigate complexity and approximation results on a processor networks where the communication delay depends on the distance between the processors performing tasks. We then prove that there is no heuristic with a performance guarantee smaller than 4/3 for makespan minimization for precedence graph on a large class of processor networks like hypercube, grid, torus, and so forth,with a fixed diameter δ ∈ . We extend complexity results when the precedence graph is a bipartite graph. We also design an efficient polynomial-time O δ2 -approximation algorithm for the makespan minimization on processor networks with diameter δ.
Type de document :
Article dans une revue
Advances in Operations Research, Hindawi Publishing Corporation, 2011, pp.20. 〈10.1155/2011/476939〉
Liste complète des métadonnées

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00605652
Contributeur : Rodolphe Giroudeau <>
Soumis le : dimanche 3 juillet 2011 - 16:40:47
Dernière modification le : jeudi 24 mai 2018 - 15:59:22

Lien texte intégral

Identifiants

Citation

Marwane Bouznif, Rodolphe Giroudeau. Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks. Advances in Operations Research, Hindawi Publishing Corporation, 2011, pp.20. 〈10.1155/2011/476939〉. 〈lirmm-00605652〉

Partager

Métriques

Consultations de la notice

157