Skip to Main content Skip to Navigation
Journal articles

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

Marwane Bouznif 1 Rodolphe Giroudeau 2, *
* Corresponding author
1 G-SCOP_OC - Optimisation Combinatoire
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 δ.
Document type :
Journal articles
Complete list of metadata

https://hal-lirmm.ccsd.cnrs.fr/lirmm-00605652
Contributor : Rodolphe Giroudeau <>
Submitted on : Tuesday, May 25, 2021 - 10:47:27 AM
Last modification on : Wednesday, September 22, 2021 - 3:04:47 AM
Long-term archiving on: : Thursday, August 26, 2021 - 6:36:25 PM

File

476939.pdf
Publisher files allowed on an open archive

Licence


Distributed under a Creative Commons Attribution 4.0 International License

Identifiers

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, 2011, pp.#476939. ⟨10.1155/2011/476939⟩. ⟨lirmm-00605652⟩

Share

Metrics

Record views

486

Files downloads

46