We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
EXACT ALGORITHMS FOR A TASK ASSIGNMENT PROBLEM.
- Authors
KAYA, KAMER; UÇAR, BORA
- Abstract
We consider the following task assignment problem. Communicating tasks are to be assigned to heterogeneous processors interconnected with a heterogeneous network. The objective is to minimize the total sum of the execution and communication costs. The problem is NP-hard. We present an exact algorithm based on the well-known A* search. We report simulation results over a wide range of parameters where the largest solved instance contains about three hundred tasks to be assigned to eight processors.
- Subjects
GRAPHIC methods; ALGORITHMS; PARALLEL processing; ELECTRONIC data processing; SUPERCOMPUTERS
- Publication
Parallel Processing Letters, 2009, Vol 19, Issue 3, p451
- ISSN
0129-6264
- Publication type
Article
- DOI
10.1142/S012962640900033X