DSpace About DSpace Software

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

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

Title: タスクスケジューリングにおける過剰な通信遅延の排除と通信可能域の走査に関する経験則の導入
Other Titles: Applying heuristics using scanning of communication term and elimination of ineffective commu-nication overhead to Task Scheduling
Authors: 宇都宮, 雅彦
甲斐, 宗徳
Utsunomiya, Masahiko
KAI, Munenori
Keywords: Task scheduling
Combinatorial optimization problem
Strongly NP hard
Communication overhead
Issue Date: 1-Jun-2012
Publisher: 成蹊大学理工学部
Abstract: 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
Appears in Collections:第49巻第1号

Files in This Item:

File Description SizeFormat
rikougaku-49-1_1-11.pdf2.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