DSpace About DSpace Software
個性を持った自立的な人間の創造
    
日本語
 

SEIKEI University Repository >
01:紀要(Bulletin) >
09:理工学研究報告 >
第53巻第1号 >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10928/813

Title: 通信遅延を考慮したタスクスケジューリング問題の並列解法 : サブタスクグラフ最適スケジューリングによる探索効率の改善
Other Titles: Development of Parallelized Solver for Task Scheduling Problems with Communication Delays : Improvements of Search Effectiveness using Optimal Scheduling of Sub-task-graphs
Authors: 澁谷, 知則
甲斐, 宗徳
SHIBUYA, Tomonori
KAI, Munenoti
Keywords: Task scheduling
Branch and Bound Method
Parallel Search
Issue Date: 1-Jun-2016
Publisher: 成蹊大学理工学部
Abstract: 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
Appears in Collections:第53巻第1号

Files in This Item:

File Description SizeFormat
rikougaku-53-1_9-15.pdf1.12 MBAdobe PDFView/Open

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.

 

Valid XHTML 1.0! DSpace Software Copyright © 2002-2010  Duraspace - Feedback