タスクグラフの階層的マクロタスク化とそのタスクスケジューリング手法の提案

DOI IR Web Site

Bibliographic Information

Other Title
  • タスクグラフ ノ カイソウテキ マクロタスクカ ト ソノ タスクスケジューリング シュホウ ノ テイアン
  • Detecting Hierarchically Structured Macro-tasks within a Task Graph and Its Task Scheduling Method

Search this article

Description

type:Article

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.

identifier:http://repository.seikei.ac.jp/dspace/handle/10928/1133

Journal

Keywords

Details 詳細情報について

Report a problem

Back to top