Optimization of Layer-based Scheduling Algorithms for Mixed Parallel Applications with Precedence Constraints Using Move-blocks

Kunis, Raphael; Rünger, Gudula

doi:10.1109/pdp.2009.12

Cited by 2 publications

(1 citation statement)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The algorithm Move-blocks does not move single nodes but universal blocks. A special case of universal block is the simple block that was considered in [21]. In a simple block, the processor group of each node is identical to the processor group of the simple block.…”

mentioning

confidence: 99%

Optimizing layer‐based scheduling algorithms for parallel tasks with dependencies

Kunis

Rünger

2010

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYProgramming with parallel tasks leads to task graphs with dependencies representing a parallel program. Scheduling algorithms are employed to find an efficient execution order of the parallel tasks. A large variety of scheduling algorithms exist, including layer-based scheduling algorithms for homogeneous target platforms that build consecutive layers of independent parallel tasks and schedule each layer separately. Although these scheduling algorithms provide good results in terms of scheduling algorithm runtime and schedule execution time, the resulting schedules leave room for optimization. This article proposes an optimization for arbitrary layer-based scheduling algorithms, which is called Move-blocks algorithm. Given a layer-based schedule of the parallel tasks, this algorithm moves blocks of parallel tasks into preceding layers in order to reduce the overall execution time of a task-based application. Suitable blocks of parallel tasks are identified by the algorithm Find-blocks, which is employed together with the Move-blocks algorithm. The algorithm Move-blocks is applied to four well-known scheduling algorithms. A detailed evaluation for a wide range of test cases is given.

show abstract

mentioning

confidence: 99%