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

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 g...

Full description

Saved in:
Bibliographic Details
Published in:Advances in Operations Research Vol. 2011; no. 2011; pp. 201 - 220
Main Authors: Bouznif, M., Giroudeau, R.
Format: Journal Article
Language:English
Published: Cairo, Egypt Hindawi Limiteds 01.01.2011
Hindawi Puplishing Corporation
Hindawi Publishing Corporation
Subjects:
Computer Science
Operations Research
ISSN:1687-9147, 1687-9155
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 δ.Erratum to “Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks”dx.doi.org/10.1155/2012/543215
ISSN:1687-9147
1687-9155
DOI:10.1155/2011/476939