Download presentation

Presentation is loading. Please wait.

Published byBrock Mowdy Modified over 3 years ago

2
Using the Iteration Space Visualizer in Loop Parallelization Yijun YU http://winpar.elis.rug.ac.be/ppt/isv

3
Overview ISV – A 3D Iteration Space Visualizer : view the dependence in the iteration space iteration -- one instance of the loop body space – the grid of all index values Detect the parallelism Estimate the speedup Derive a loop transformation Find Statement-level parallelism Future development

4
1. Dependence DO I = 1,3 A(I) = A(I-1) ENDDO DOALL I = 1,3 A(I) = A(I-1) ENDDO A(2) = A(1) A(1) = A(0) A(3) = A(2) 123 113 013 011 0 0 0 0 program A(1) = A(0) A(2) = A(1) A(3) = A(2) execution trace 123 023 003 000 0 0 0 0 shared memory

5
1.1 Example1 ISV directive visualize

6
1.2 Visualize the Dependence A dependence is visualized in an iteration space dependence graph iteration Node Iteration Flow dependence Edge Dependence order between nodes Color Dependence type: FLOW: Write Read ANTI: Read Write OUTPUT: Write Write

7
1.3 Parallelism? Stepwise view sequential execution No parallelism found However, many programs have parallelism…

8
2. Potential Parallelism Time(sequential) = number of iterations Dataflow: iterations are executed as soon as its data are ready Time(dataflow) = number of iterations on the longest critical path The potential parallelism is denoted by speedup = Time(sequential)/Time(dataflow)

9
2.1 Example 2

10
Diophantine Equations + Loop bounds (polytope) = Iteration Space Dependencies

11
2.2 Irregular dependence Dependences have non-uniform distance Parallelism Analysis: 200 iterations over 15 data flow steps Speedup:13.3 Problem: How to exploit it?

12
3. Visualize parallelism Find answers to these questions What is the dependence pattern? Is there a parallel loop? (How to find?) What is the maximal parallelism? (How to exploit it?) Is the load of parallel tasks balanced?

13
3.1 Example 3

14
3.2 3D Space

15
3.3 Loop parallelizable? The I, J, K loops are in the 3D space: 32 iterations Simulate sequential execution Which loop can be parallel?

16
Interactively try the parallelization Interactively check a parallel loop I 3.4 Loop parallelization The blinking dependence edges prevent the parallelization of the given loop I.

17
Let ISV find the correct parallelization Automatically check the parallel loop Simulate parallel execution 3.5 Parallel execution It takes 16 time steps

18
Sequential execution takes 32 time steps Simulate data flow execution 3.6 Dataflow execution Dataflow execution only takes 4 times steps Potential speedup=8.

19
Dataflow speedup = 8 Iterating through partitions: the connected components 3.7 Graph partitioning All the partitions are load balanced

20
4. Loop Transformation Real parallelism Potential parallelism Transformation

21
4.1 Example 4

22
4.2 The iteration space Sequentially 25 iterations

23
4.3 Loop Parallelizable? check loop I check loop J

24
Totally 9 steps Potential speedup: 25/9=2.78 Wave front effect: all iterations on the same wave are on the same line 4.4 Dataflow execution

25
4.5 Zoom-in on the I-space

26
4.6 Speedup vs program size Zoom-in previews parallelism in part of a loop without modifying the program Executing the programs of different size n estimates a speedup of n 2 /(2n-1)

27
4.7 How to obtain the potential parallelism Here we already have these metrics: Sequential time steps = N 2 Dataflow time step = 2N-1 potential speedup = N 2 /(2N-1) Transformation. How to obtain the potential speedup of a loop?

28
4.8 Unimodular transformation (UT) A unimodular matrix is a square integer matrix that has unit determinant. It is the result of identity matrix by three kinds of basic transformations: reversal, interchange, and skewing The new loop execution order is determined by the transformed index. The iteration space remains unit step size Find a suitable UT reorders the iterations such that the new loop nest has a parallel loop Unimodular matrix New loop index Old loop index reversal interchange skewing

29
4.9 Hyperplane transformation Interactively define a hyper-plane Observe the plane iteration matches the dataflow simulation plane = dataflow The plane iteration Based on the plane, ISV calculates a unimodular transformation

30
The transformed iteration space and the generated loop 4.10 The derived UT

31
4.11 Verify the UT ISV checks if the transformation is valid Observe that the parallel loop execution in the transformed loop matches the plane execution parallel = plane

32
5. Statement-level parallelism Unimodular transformations work at iteration level The statement dependence within the loop body is hidden in the iteration space graph How to exploit parallelism at statement level? Statement to iteration

33
5.1 Example 5 SSV: statement space visualization

34
5.2 Iteration-level parallelism The iteration space is 2D. There are N 2 =16 iterations The dataflow execution has 2N-1=7 time steps. The potential speedup is: 16/7 = 2.29

35
5.3 Parallelism in statements The (statement) iteration space is 3D There are 2N 2 =32 statements The dataflow execution still has 2N-1=7 time steps. The potential speedup is: 32/7 = 4.58

36
5.4 Comparison Here: doubles the potential speedup at iteration level

37
5.5 Define the partition planes partitions hyper-planes

38
What is validity? Show the execution order on top of the dependence arrows. (for 1 plane or all together, depending on the density of the slide)

39
5.6 Invalid UT The invalid unimodular transformation derived from hyper-plane is refused by ISV Alternatively, ISV calculates the unimodular transformation based on the dependence distance vectors available in the dependence graph

40
6. Pseudo distance method The pseudo distance method: Extract base vectors from the dependent iterations Examine if the base vectors generates all the distances Calculate the unimodular transformation based on the base vectors The base vectors The unimodular matrix

41
Another way to find parallelism automatically The iteration space is a grid, non-uniform dependencies are members of a uniform dependence grid, with unknown base-vectors. Finding these base vectors allows us to extend existing parallelization to the non-uniform case.

42
6.1 Dependence distance (1,0,-1) (0,1,1)

43
6.2 The Transformation The transforming matrix discovered by pseudo distance method 1 10 -1 01 1 00 The distance vectors are transformed (1,0,-1) (0,1,0) (0,1,1) (0,0,1) The dependent iterations have the same first index, implies the outermost loop is parallel.

44
6.3 Compare the UT matrices The transforming matrix discovered by pseudo distance method 1 10 -1 01 1 00 An invalid transforming matrix discovered by the hyper-plane method 1 00 -1 10 1 01 The same first column means the transformed outermost loops have the same index.

45
6.4 The transformed space The outermost loop is parallel There are 8 parallel tasks The load of tasks is not balanced The longest task takes 7 time steps

46
7. Non-perfectly nested loop What is it? The unimodular transformations only work for perfectly nested loops For non-perfectly nested loop, the iteration space is constructed with extended indices N fold non-perfectly nested loop to a N+1 fold perfectly nested loop

47
7.1 Perfectly nested Loop? Non-perfectly nested loop: DO I1 = 1,3 A(I1) = A(I1-1) DO I2 = 1,4 B(I1,I2) = B(I1-1,I2)+B(I1,I2-1) ENDDO Perfectly nested loop: DO I1 = 1,3 DO I2 = 1,5 DO I3 = 0,1 IF (I2.EQ.1.AND.I3.EQ.0) A(I1) = A(I1-1) ELSE IF(I3.EQ.1) B(I1-1,I2)=B(I1-2,I2)+B(I1-1,I2-1) ENDDO

48
7.2 Exploit parallelism with UT

49
8. Applications ProgramsCatagoryDepthFormPatternTransformation Example 1 Tutorial 1PerfectUniformN/A Example 2 Tutorial 2PerfectNon-uniformN/A Example 3 Tutorial 3PerfectUniformWavefront UT Example 4 Tutorial 2PerfectUniformWavefront UT Example 5 Tutorial 2+1PerfectUniform Stmt Partitioning UT Example 6 Tutorial 2+1 Non- perfect UniformWavefront UT Matrix multiplication Algorithm 3PerfectUniformParallelization Gauss-Jordan Algorithm 3PerfectNon-UniformParallelization FFT Algorithm 3PerfectNon-UniformParallelization Cholesky Benchmark4 Non- perfect Non-UniformPartitioning UT TOMCATV Benchmark3 Non- perfect UniformParallelization Flow3D CFD App.3PerfectUniformWavefront UT

50
9. Future considerations Weighted dependence graph More semantics on data locality: data space graph, data communication graph data reuse iteration space graph, More loop transformation: Affine (statement) iteration space mappings Automatic statement distribution Integration with Omega library

Similar presentations

OK

Optimizing Compilers for Modern Architectures Coarse-Grain Parallelism Chapter 6 of Allen and Kennedy.

Optimizing Compilers for Modern Architectures Coarse-Grain Parallelism Chapter 6 of Allen and Kennedy.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To ensure the functioning of the site, we use **cookies**. We share information about your activities on the site with our partners and Google partners: social networks and companies engaged in advertising and web analytics. For more information, see the Privacy Policy and Google Privacy & Terms.
Your consent to our cookies if you continue to use this website.

Ads by Google

Ppt on money and credit download Ppt on asymptotic notation of algorithms in c Ppt on switching networking Ppt on self awareness games Ppt on ministry of corporate affairs ontario Ppt on solar energy Ppt on ganga river system Ppt on statistics and probability formulas Download ppt on women empowerment Download ppt on autonomous car