https://scholars.lib.ntu.edu.tw/handle/123456789/309236
標題: | Scheduling parallel tasks on hypercubes | 作者: | Lin, J.-F. SAO-JIE CHEN |
關鍵字: | Computer architecture; Parallel architectures; Scheduling | 公開日期: | 1994 | 卷: | 30 | 期: | 11 | 起(迄)頁: | 841-842 | 來源出版物: | Electronics Letters | 摘要: | The authors consider the problem of non-pre-emptively scheduling independent parallel tasks with communication overhead on a d–dimensional hypercube system. To find a schedule such that the schedule length is minimised is NP-hard. Therefore, a simple heuristic algorithm is investigated and its performance bound is derived as (2 + In m - 1/m), where m = 2d. © 1994, IEE. All rights reserved. |
URI: | http://www.scopus.com/inward/record.url?eid=2-s2.0-0028430172&partnerID=MN8TOARS http://scholars.lib.ntu.edu.tw/handle/123456789/309236 |
ISSN: | 00135194 | DOI: | 10.1049/el:19940591 | SDG/關鍵字: | Algorithms; Computational complexity; Computer architecture; Decision theory; Heuristic programming; Parallel processing systems; Program processors; Scheduling; Set theory; Conventional scheduling problem; D dimensional hypercube system; Earliest completion time algorithm; Heuristic algorithm; Parallel architecture; Parallel task scheduling problem; Scheduling parallel task; Computer operating procedures |
顯示於: | 電機工程學系 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。