https://scholars.lib.ntu.edu.tw/handle/123456789/497301
標題: | Task assignment in distributed computing systems | 作者: | Hsu, C.-C. SHENG-DE WANG Kuo, T.S. |
關鍵字: | Combinatorial optimization; Heuristic algorithms; Optimization; Polynomial approximation; Communication overheads; Distributed computing systems; Message transmissions; Near-optimal; Polynomial time complexity; Precedence constraints; Processor loads; Task assignment; Distributed computer systems | 公開日期: | 1990 | 卷: | 21 | 期: | 12 | 起(迄)頁: | 2425-2440 | 來源出版物: | International Journal of Systems Science | 摘要: | 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. © 1990 Taylor & Francis Group, LLC. |
URI: | https://scholars.lib.ntu.edu.tw/handle/123456789/497301 https://www.scopus.com/inward/record.uri?eid=2-s2.0-84950962014&doi=10.1080%2f00207729008910562&partnerID=40&md5=84a0f4acb7457a8eada2f314f95c034b |
DOI: | 10.1080/00207729008910562 |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。