SEIKEI University Repository >
01:紀要(Bulletin) >
11:理工学研究報告 >
第49巻第1号 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10928/179
|
タイトル: | タスクスケジューリングにおける過剰な通信遅延の排除と通信可能域の走査に関する経験則の導入 |
その他のタイトル: | Applying heuristics using scanning of communication term and elimination of ineffective commu-nication overhead to Task Scheduling |
著者: | 宇都宮, 雅彦 甲斐, 宗徳 Utsunomiya, Masahiko KAI, Munenori |
キーワード: | Task scheduling Combinatorial optimization problem Strongly NP hard Communication overhead |
発行日: | 2012年6月1日 |
出版者: | 成蹊大学理工学部 |
抄録: | Task scheduling is one of core technologies to improve the efficiency of parallel processing. A schedule is a solution of task scheduling problem, and make to cooperate the performance of parallel machines. The shorter length of schedule (makespan) is reduced, the more efficient parallel machines run. But, task scheduling problem is combinatorial optimization problem that has strongly NP hard computational complexity. Accordingly, it is necessary that to design algorithm taking account of more unforeseeable disposition in order to reduce makespan. Concerning to solve the problem, the disposition is considered with communication overhead between machines. In this paper, the authors propose new heuristic algorithms to optimize communication overhead. These are applied the focus to critical path of dependences and earliest allocation pattern of communications. The authors describe characteristics and processes of these algorithms, and our experiments show the effectiveness of them |
URI: | http://hdl.handle.net/10928/179 |
出現コレクション: | 第49巻第1号
|
このリポジトリに保管されているアイテムは、他に指定されている場合を除き、著作権により保護されています。
|