On task assignment problems in a heterogeneous computing environment

Author

Sen, Arunabha ; Sengupta, Abhijit

Author_Institution

Dept. of Comput. Sci. & Eng., Arizona State Univ., Tempe, AZ, USA

fYear

1996

fDate

3-6 Nov. 1996

Firstpage

1373

Abstract

We consider two task assignment problems. In one case the problem is to distribute the tasks to the heterogeneous processors in such a way that the completion time of all the tasks is minimized. In the second problem the objective is to distribute tasks to the processors in such a way that the total computation time is minimized. Both the problems are known to be NP-complete. We present an approximation algorithm for the first problem with a performance bound. For the second problem we present a simulated annealing algorithm and present our experimental results.

Keywords

approximation theory; computational complexity; integer programming; linear programming; parallel algorithms; simulated annealing; NP-complete problem; approximation algorithm; experimental results; heterogeneous computing environment; heterogeneous processors; integer linear program; parallel processors; performance bound; simulated annealing algorithm; task assignment problems; total computation time; Computational modeling; Computer networks; Computer science; Concurrent computing; Distributed computing; Distributed processing; Ear; Graphics; Simulated annealing;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1996. Conference Record of the Thirtieth Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-8186-7646-9

Type

conf

DOI

10.1109/ACSSC.1996.599174

Filename

599174