期刊
PARALLEL PROCESSING LETTERS
卷 19, 期 3, 页码 451-465出版社
WORLD SCIENTIFIC PUBL CO PTE LTD
DOI: 10.1142/S012962640900033X
关键词
task assignment; heterogeneous computing systems; task interaction graph; A* search
资金
- Turkish Scientific and Technological Research Agency (TUBITAK) Ph.D. scholarship
- Agence Nationale de la Recherche, through SOLSTICE [ANR-06-CIS6-010]
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.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据