JAIST Repository >
School of Information Science >
Conference Papers >
Conference Papers >

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

Title: rERA: An optimization algorithm of task dependency graph for scheduling
Authors: Cheng, Zhuo
Tan, Yasuo
Lim, Yuto
Keywords: Task Dependency
Scheduling Algorithm
Issue Date: 2016-03-01
Publisher: The Institute of Electronics, Information and Communication Engineers (IEICE)
Magazine name: 電子情報通信学会基礎・境界ソサイエティ/NOLTAソサイエティ大会講演論文集
Volume: 2016年_基礎・境界
Number: A-10-16
Start page: 171
End page: 171
Abstract: In this paper, based on the analysis of task dependency, we propose an algorithm to remove the redundantedges of the task dependency graphs. The effectivenessof the algorithm is illustrated through a simpleexample. By this way, the complexity of the taskdependency graph is reduced, which can improve theefficiency of scheduling algorithms.
URI: http://hdl.handle.net/10119/14090
Material Type: publisher
Appears in Collections:b11-1. 会議発表論文・発表資料 (Conference Papers)

Files in This Item:

File Description SizeFormat
22878.pdf539KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology