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 language | English (US) |
|---|---|
| Title of host publication | Conference Record of the Asilomar Conference on Signals, Systems and Computers |
| Publisher | IEEE |
| Pages | 1373-1377 |
| Number of pages | 5 |
| Volume | 2 |
| State | Published - 1997 |
| Event | Proceedings of the 1996 30th Asilomar Conference on Signals, Systems & Computers. Part 2 (of 2) - Pacific Grove, CA, USA Duration: Nov 3 1996 → Nov 6 1996 |
Other
| Other | Proceedings of the 1996 30th Asilomar Conference on Signals, Systems & Computers. Part 2 (of 2) |
|---|---|
| City | Pacific Grove, CA, USA |
| Period | 11/3/96 → 11/6/96 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Signal Processing
- Electrical and Electronic Engineering
Cite this
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 proceeding › Conference contribution
}
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 -