Mapping and Scheduling of Parallel Tasks for ... - ComplexHPC.org

More documents

Recommendations

Info

The Mixed Parallel Task (M-Task) Programming ModelProgramming Support M-Task ProgrammingMapping on Multicore PlatformsSummaryThe M-Task Programming ModelThe Programming ModelSchedulingTask GraphM-Task application is represented by adirected acyclic graph (M-Task dag)G = (V , E).Nodes v ∈ V correspond to the executionof an M-task (either basic or complex).Edges e ∈ E symbolize precedenceconstraints.(Homogeneous) Target platforms with Pprocessors are considered.M-Tasks v ∈ V can be executed on anynonempty processor group of a targetplatform with P processors.Gudula RüngerMapping and Scheduling of Parallel Tasks for Multicore Systems6
The Mixed Parallel Task (M-Task) Programming ModelProgramming Support M-Task ProgrammingMapping on Multicore PlatformsSummaryThe Programming ModelSchedulingThe Multiprocessor-Task(M-Task) Programming ModelCost ModelNodes v ∈ V are assigned a computation cost T v : [1, . . . , P] → R + .Representation by measured runtimes or by symbolic runtime formulas inclosed form.Derivation by:runtime prediction techniques, orfitting measured runtimes (simulation) to a function prototype.Edges e = (v 1 , v 2 ) ∈ E have a communication cost arising from possiblere-distribution operations.Communication costs given as formula dependend on:transferred data size between nodes v 1 and v2, andmachine dependend parameters startup time and byte transfer time.Gudula RüngerMapping and Scheduling of Parallel Tasks for Multicore Systems7
Page 1 and 2: The Mixed Parallel Task (M-Task) Pr
Page 3 and 4: OutlineThe Mixed Parallel Task (M-T
Page 5: The Mixed Parallel Task (M-Task) Pr

Mapping and Scheduling of Parallel Tasks for ... - ComplexHPC.org

Create successful ePaper yourself

Delete template?

Save as template?