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

Hindawi Publishing Corporation Advances in Operations Research Volume 2011, Article ID 476939, 20 pages doi:10.1155/2011/476939 Research Article Inapproximability and Polynomial-Time Approximation Algorithm for UET Tasks on Structured Processor Networks M. Bouznif1 and R. Giroudeau2 1 Laboratoire G-SCOP, 46 avenue Felix Viallet, 38031 Grenoble Cedex 1, France ´ 2 LIRMM, 161 rue Ada, UMR 5056, 34392 Montpellier Cedex 5, France Correspondence should be addressed to R. Giroudeau, rgirou@lirmm.fr Received 26 October 2010; Revised 22 March 2011; Accepted 4 April 2011 Academic Editor: Ching-Jong Liao Copyright q 2011 M. Bouznif and R. Giroudeau. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. 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 δ. 1. Introduction 1.1. Problem Statement In this paper, we consider the processor network model, which is a generalization of the         in which task allocation on the processors