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 |
ASJC Scopus subject areas
- Hardware and Architecture
- Signal Processing
- Electrical and Electronic Engineering