DSpace About DSpace Software

SEIKEI University Repository >
01:紀要(Bulletin) >
11:理工学研究報告 >
第55巻第2号 >

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

Title: タスクグラフの階層的マクロタスク化とそのタスクスケジューリング手法の提案
Other Titles: Detecting Hierarchically Structured Macro-tasks within a Task Graph and Its Task Scheduling Method
Authors: 長谷川, 幹
甲斐, 宗徳
KAI, Munenori
Keywords: Task scheduling
Combinatorial optimization problems
High performance search method
Issue Date: 1-Dec-2018
Publisher: 成蹊大学理工学部
Abstract: One of the key methods for the optimized parallel processing of any program is task scheduling. This intends to minimize the execution time of the entire program by determining an optimal schedule for allocating all tasks, which are processing units comprising the program, onto available processor elements into pieces. Due to complexity of calculation and being a large-scale problem, the optimization problem is extremely challenging to solve with the current algorithms in a practical amount of time. Authors have studied the method of partially optimizing task graph as a technique of task scheduling for large-scale problems. This paper reports on scheduling method that supports hierarchical macro for task groups.
URI: http://hdl.handle.net/10928/1133
Appears in Collections:第55巻第2号

Files in This Item:

File Description SizeFormat
rikougaku-55-2_7-13.pdf1.26 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