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>msSummarySubsystems <strong>of</strong> STK<strong>Scheduling</strong> ToolkitThe Two-Level ModelExtended ModelComm<strong>and</strong> line benchmark utilityApplication <strong>of</strong> a single scheduling algorithm to a large set <strong>of</strong> (generated)problems.Interpretation <strong>of</strong> the results by an external tool, e.g. Matlab.Example – average runtime <strong>of</strong> algorithm TwoL-Level:generated problems with 50 to 1.000 M-<strong>Tasks</strong> (step width 50), <strong>and</strong>target machines with 16 to 256 processors (step width 16).100 different graphs were considered <strong>for</strong> each problem size leading to a total<strong>of</strong> 32.000 computed schedules.Runtime <strong>of</strong> the TwoL−Level Scheduler1.5Average Runtime (sec)10.50250200150100500# <strong>of</strong> ProcessorsGudula Rünger01000800600400200# <strong>of</strong> Nodes<strong>Mapping</strong> <strong>and</strong> <strong>Scheduling</strong> <strong>of</strong> <strong>Parallel</strong> <strong>Tasks</strong> <strong>for</strong> Multicore Systems15
Change language