Task assignment in distributed computing systems
作者:
CHIUN-CHIEH HSU,
SHENG-DE WANG,
TE-SON KUO,
期刊:
International Journal of Systems Science
(Taylor Available online 1990)
卷期:
Volume 21,
issue 12
页码: 2425-2440
ISSN:0020-7721
年代: 1990
DOI:10.1080/00207729008910562
出版商: Taylor & Francis Group
数据来源: Taylor
摘要:
The problem is addressed of assigning a task with a precedence constraint to a distributed computing system. Task turnaround time with regard to communication overhead and idle time is adopted to measure the performance of task assignment. The assignment of the module is determined as is the sequence of message transmission to balance the processor load and reduce communication overhead. The search for the optimal task assignment with a precedence constraint is known to be NP-complete (Garey et al. 1979) in the strong sense. A heuristic algorithm with polynomial time complexity is then proposed in order to solve the task-assignment problem effectively. Experimental results show that the proposed approach produces a near-optimal or even optimal task assignment.
点击下载:
PDF (293KB)
返 回