On task assignment problems in a heterogeneous computing environment

Arunabha Sen, Abhijit Sengupta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Scopus citations

Abstract

We consider two task assignment problems in this paper. 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.

Original languageEnglish (US)
Title of host publicationConference Record of the Asilomar Conference on Signals, Systems and Computers
PublisherIEEE
Pages1373-1377
Number of pages5
Volume2
StatePublished - 1997
EventProceedings of the 1996 30th Asilomar Conference on Signals, Systems & Computers. Part 2 (of 2) - Pacific Grove, CA, USA
Duration: Nov 3 1996Nov 6 1996

Other

OtherProceedings of the 1996 30th Asilomar Conference on Signals, Systems & Computers. Part 2 (of 2)
CityPacific Grove, CA, USA
Period11/3/9611/6/96

ASJC Scopus subject areas

  • Hardware and Architecture
  • Signal Processing
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On task assignment problems in a heterogeneous computing environment'. Together they form a unique fingerprint.

Cite this