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

Abstract

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.