Abstract-This paper presents a compile-time scheduling heuristic called dynamic level scheduling, which accounts for interprocessor communication overhead when mapping precedence-constrained, communicating tasks onto heterogeneous processor architectures with limited or possibly irregular interconnection structures. This technique uses dynamicallychanging priorities to match tasks with processors at each step, and schedules over both spatial and temporal dimensions to eliminate shared resource contention. This method is fast, flexible, widely targetable, and displays promising performance.
Sih et al REF propose a compile-time scheduling heuristic called dynamic-level scheduling which accounts for interprocessor communication overhead.
A compile-time scheduling heuristic for interconnection-constrained heterogeneous processor architectures
IEEE Trans. Parallel Distrib. Syst.
IEEE Trans. Parallel Distrib. Syst.
Computer Science