| 大会名称 |
| 2016年 総合大会 |
| 大会コ－ド |
| 2016G |
| 開催年 |
|
2016
|
| 発行日 |
|
2016/3/1
|
| セッション番号 |
|
A-10
|
| セッション名 |
|
システム数理と応用
|
| 講演日 |
|
2016/3/16
|
| 講演場所(会議室等) |
|
総合学習プラザ 2F 第13講義室
|
| 講演番号 |
|
A-10-16
|
| タイトル |
|
rERA: An Optimization Algorithm of Task Dependency Graph for Scheduling
|
| 著者名 |
|
◎Zhuo Cheng, Yasuo Tan, Yuto Lim,
|
| キーワード |
|
task dependency, optimization algorithm, scheduling
|
| 抄録 |
|
In multi-task systems, different tasks work together to achieve desired functions. To guarantee correctness, the tasks are required to be completed in specific orders. To characterize such orders, task dependency graph is an expressive form. Scheduling algorithms need to traverse the task dependency graphs to make sure the execution sequences of tasks are consistent with the orders. Therefore, the complexity of the graphs can obviously affect the efficiency of the scheduling algorithms. In this paper, we propose an algorithm to remove the redundant edges of the task dependency graphs. By this way, the efficiency of scheduling algorithms can be improved.
|
| 本文pdf |
|
PDF download
|
