DSpace About DSpace Software

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

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

Title: Deep Learningを用いた階層的な部分タスクグラフ検出法の構築
Other Titles: Construction of Hierarchical Partial Task Graph Detection Method Using Deep Learning
Authors: 田邑, 大雅
甲斐, 宗徳
KAI, Munenori
Keywords: Task scheduling
Deep Learning
Convolutional Neural Network
Issue Date: 1-Jun-2021
Publisher: 成蹊大学理工学部
Abstract: Since task scheduling problems belong to a class of the strong NP-hard combinatorial optimization problem, the required scheduling time increases exponentially as the number of tasks increases. Therefore, we find some small subtask graphs that can be optimally scheduled in the overall task graph, and solve them individually as a scheduling problem. Then, each subtask graph can be treated as one macro task in the whole task graph. This reduces the apparent number of tasks in the overall task graph, reduces the scale of the task graph, and significantly reduces the search time that depends on the number of tasks. We call this hierarchical scheduling. However, this partial task graph detection has a drawback that it becomes a combinatorial optimization problem by itself. Therefore, in this paper, we construct and evaluate a method for detecting partial task graphs using deep learning.
URI: http://hdl.handle.net/10928/1433
Appears in Collections:第58巻第1号

Files in This Item:

File Description SizeFormat
rikougaku-58-1_5-10.pdf981.68 kBAdobe 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