On task assignment problems in a heterogeneous computing environment

Arunabha Sen, Abhijit Sengupta

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

1 Citation (Scopus)

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

Fingerprint

Approximation algorithms
Simulated annealing

ASJC Scopus subject areas

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

Cite this

Sen, A., & Sengupta, A. (1997). On task assignment problems in a heterogeneous computing environment. In Conference Record of the Asilomar Conference on Signals, Systems and Computers (Vol. 2, pp. 1373-1377). IEEE.

On task assignment problems in a heterogeneous computing environment. / Sen, Arunabha; Sengupta, Abhijit.

Conference Record of the Asilomar Conference on Signals, Systems and Computers. Vol. 2 IEEE, 1997. p. 1373-1377.

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

Sen, A & Sengupta, A 1997, On task assignment problems in a heterogeneous computing environment. in Conference Record of the Asilomar Conference on Signals, Systems and Computers. vol. 2, IEEE, pp. 1373-1377, Proceedings of the 1996 30th Asilomar Conference on Signals, Systems & Computers. Part 2 (of 2), Pacific Grove, CA, USA, 11/3/96.
Sen A, Sengupta A. On task assignment problems in a heterogeneous computing environment. In Conference Record of the Asilomar Conference on Signals, Systems and Computers. Vol. 2. IEEE. 1997. p. 1373-1377
Sen, Arunabha ; Sengupta, Abhijit. / On task assignment problems in a heterogeneous computing environment. Conference Record of the Asilomar Conference on Signals, Systems and Computers. Vol. 2 IEEE, 1997. pp. 1373-1377
@inproceedings{dd43a793156d48edbdc0e72f1bae3b9e,
title = "On task assignment problems in a heterogeneous computing environment",
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.",
author = "Arunabha Sen and Abhijit Sengupta",
year = "1997",
language = "English (US)",
volume = "2",
pages = "1373--1377",
booktitle = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
publisher = "IEEE",

}

TY - GEN

T1 - On task assignment problems in a heterogeneous computing environment

AU - Sen, Arunabha

AU - Sengupta, Abhijit

PY - 1997

Y1 - 1997

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

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

UR - http://www.scopus.com/inward/record.url?scp=0030717864&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0030717864&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0030717864

VL - 2

SP - 1373

EP - 1377

BT - Conference Record of the Asilomar Conference on Signals, Systems and Computers

PB - IEEE

ER -