SEIKEI University Repository >
01:紀要(Bulletin) >
11:理工学研究報告 >
第53巻第1号 >
このアイテムの引用には次の識別子を使用してください:
http://hdl.handle.net/10928/813
|
タイトル: | 通信遅延を考慮したタスクスケジューリング問題の並列解法 : サブタスクグラフ最適スケジューリングによる探索効率の改善 |
その他のタイトル: | Development of Parallelized Solver for Task Scheduling Problems with Communication Delays : Improvements of Search Effectiveness using Optimal Scheduling of Sub-task-graphs |
著者: | 澁谷, 知則 甲斐, 宗徳 SHIBUYA, Tomonori KAI, Munenoti |
キーワード: | Task scheduling Branch and Bound Method Parallel Search |
発行日: | 2016年6月1日 |
出版者: | 成蹊大学理工学部 |
抄録: | In order to implement high performance parallel processing, task scheduling is a very important key technology. However, task scheduling problems belong to very difficult optimizing problem and are not be able to solve in practical time. So, it is required to detect sub task graphs, which can be partially optimized independently, as soon as possible. Each sub task graph can be recognized as a macro task, therefore, total number of tasks will be reduced, and this results in reducing the time to solve scheduling problems. In this paper, we propose a new sub task graph detection mechanism which can find more sub task graphs. We show that some scheduling problems, which were impossible to solve by the conventional methods, can be solved. |
URI: | http://hdl.handle.net/10928/813 |
出現コレクション: | 第53巻第1号
|
このリポジトリに保管されているアイテムは、他に指定されている場合を除き、著作権により保護されています。
|