Mapping and Scheduling of Parallel Tasks for ... - ComplexHPC.org
Mapping and Scheduling of Parallel Tasks for ... - ComplexHPC.org
Mapping and Scheduling of Parallel Tasks for ... - ComplexHPC.org
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The Mixed <strong>Parallel</strong> Task (M-Task) Programming ModelProgramming Support M-Task Programming<strong>Mapping</strong> on Multicore Plat<strong>for</strong>msSummaryThe Programming Model<strong>Scheduling</strong><strong>Scheduling</strong> algorithms <strong>for</strong> M-tasks with precedence constraints <strong>and</strong>homogeneous target plat<strong>for</strong>msMany scheduling algorithms already exist <strong>for</strong> the M-task schedulingproblem with <strong>and</strong> without precedence constraints.Some <strong>of</strong> the proposed scheduling algorithms have similarities.→ It is possible to distinguish different classes <strong>of</strong> algorithms depending onthe approach used.Classification <strong>of</strong> <strong>Scheduling</strong> Algorithm <strong>for</strong> task Graphs with parallel <strong>Tasks</strong>:Layer-based scheduling algorithms,Allocation- <strong>and</strong> <strong>Scheduling</strong>-based algorithms (also called 2-stepalgorithms), <strong>and</strong>Configuration-based scheduling algorithms.Gudula Rünger<strong>Mapping</strong> <strong>and</strong> <strong>Scheduling</strong> <strong>of</strong> <strong>Parallel</strong> <strong>Tasks</strong> <strong>for</strong> Multicore Systems9
Change language