Download presentation

Presentation is loading. Please wait.

Published byJett Melbourne Modified over 3 years ago

1
Generalized Index-Set Splitting Christopher Barton Arie Tal Bob Blainey Jose Nelson Amaral

2
Generalized Index-Set Splitting ● Overview ● Compile-time unknown split points ● Loops with multiple split points ● Removing “dead” inductive-branches ● Nested inductive branches ● Controlling Code Growth ● Results ● Conclusions

3
Index-Set Splitting ● Divide the index-set (range) of a loop into sub-ranges ● Each sub-range represents a separate loop for (i=0; i < 100; i++) { if (i < 5) a[i] = 2 * a[i]; else a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } for (i=0; i < 5; i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; } for (i=5; i < 100; i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; }

4
Compile-time Unknown Split Points ● When the lower-bound, upper-bound or split- point are unknown at compile time: for (i=0; i < 100; i++) { if (i < m) a[i] = 2 * a[i]; else a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } for (i=0; i < m; i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; } for (i=m; i < 100; i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } Problem: m may be smaller than 0 or greater than 100!

5
Compile-time Unknown Split Points ● To overcome this problem, we will use the following sub-ranges: – First loop: 0 – min(m, 100) – Second loop: max(m,0) - 100 for (i=0; i < min(m,100); i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; } for (i=max(m,0); i < 100; i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; }

6
for (i=max(m,0); i < 100; i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } Compile-time Unknown Split Points m ≤ 0: 0 < m < 100 100 ≤ m: for (i=0; i < min(m,100); i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; } second loop iterates from 0 to 100 for (i=max(m,0); i < 100; i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } first loop iterates from 0 to m second loop iterates from m to 100 for (i=max(m,0); i < 100; i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } for (i=0; i < min(m,100); i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; } first loop iterates from 0 to 100 for (i=0; i < min(m,100); i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; }

7
Compile-time Unknown Split Points ● In general: – Given a range with lower bound lb, upper bound ub, and split-point sp, we define two sub-ranges: ● lb to min(sp, ub) ● max(sp,lb) to ub for (i=lb; i < min(sp,ub); i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; } for (i=max(sp,lb); i < ub; i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } No other conditions are needed in addition to the loop structure

8
Loops With Multiple Split Points ● Multiple split points can be handled iteratively ● Instead, we build a sub-range tree: for (i=0; i < 100; i++) { if (i < m) a[i] = 2 * a[i]; if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 0,min(m,n,100) max(0,n),min(m,100) max(m,0),min(n,100) max(m,n,0),100 if (i < m) if (i < n)

9
Loops with multiple split points ● The first level in the sub-range tree corresponds to the original loop range for (i=0; i < 100; i++) { if (i < m) a[i] = 2 * a[i]; if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 0,min(m,n,100) max(0,n),min(m,100) max(m,0),min(n,100) max(m,n,0),100

10
Loops with multiple split points ● The second level of the tree corresponds to the two loops created to remove the (i < m) inductive branch for (i=0; i < min(m,100); i++) { a[i] = 2 * a[i]; if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } for (i=max(m,0); i < 100; i++) { if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 0,min(m,n,100) max(0,n),min(m,100) max(m,0),min(n,100) max(m,n,0),100

11
Removing Dead Inductive- Branches ● To easily remove dead inductive-branches, we mark the edges in the Then/Else to correspond with the condition for (i=max(0,n); i<min(m,100); i++) { if (i < m) a[i] = 2 * a[i]; if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 0,min(m,n,100) max(0,n),min(m,100) max(m,0),min(n,100) max(m,n,0),100

12
Removing Dead Inductive- Branches ● We examine the path that leads from the root of the sub-range tree to the desired sub- range node for (i=max(0,n); i<min(m,100); i++) { if (i < m) a[i] = 2 * a[i]; if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 0,min(m,n,100) max(0,n),min(m,100) max(m,0),min(n,100) max(m,n,0),100

13
Nested Inductive-branches ● Nested branches only split the nodes of the ranges to which they apply for (i=0; i < 100; i++) { if (i < m) a[i] = 2 * a[i]; else if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 max(m,0),min(n,100) max(m,n,0),100

14
Nested Inductive-branches ● Nested branches only split the nodes of the ranges to which they apply ● The result will be three loops: for (i=max(m,n,0); i < 100; i++) { b[i] = a[i] * a[i]; } 0,100 0,min(m,100) max(m,0), 100 max(m,0),min(n,100) max(m,n,0),100 for (i=0; i < min(m,100; i++) { a[i] = 2 * a[i]; b[i] = a[i] * a[i]; } for (i=max(m,0); i < min(n,100); i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; }

15
Controlling Code Growth ● We descend down the sub-range tree using a greedy breadth-first approach for (i=0; i < 100; i++) { if (i < m) a[i] = 2 * a[i]; if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 0,min(m,n,100) max(0,n),min(m,100) max(m,0),min(n,100) max(m,n,0),100

16
Controlling Code Growth ● We stop when we reach all the leaf nodes, or the code growth limit ● The selected nodes designate the loops that will be generated for (i=0; i<min(m,100); i++) { a[i] = 2 * a[i]; if (i < n) a[i] = 5 * a[i]; b[i] = a[i] * a[i]; } 0,100 0,min(m,100)max(m,0), 100 0,min(m,n,100) max(0,n),min(m,100) max(m,0),min(n,100) max(m,n,0),100 for (i=max(m,n,0); i<100; i++) { b[i] = a[i] * a[i]; } for (i=max(m,0); i<min(n,100); i++) { a[i] = 5 * a[i]; b[i] = a[i] * a[i]; }

17
ISS Opportunities in SPEC2000

18
Compilation Times for SPEC2000

19
Runtimes for SPEC2000

20
Conclusions ● Presented a technique to remove loop-variant branches from loops by splitting the original loop into several loops with varying ranges ● Implemented in IBM’s XL Compiler suite and showed ISS opportunities in benchmark suites ● Exploring ways ISS can be used to improve effectiveness of other optimizations

Similar presentations

OK

Global optimization. Data flow analysis To generate better code, need to examine definitions and uses of variables beyond basic blocks. With use- definition.

Global optimization. Data flow analysis To generate better code, need to examine definitions and uses of variables beyond basic blocks. With use- definition.

© 2018 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google

Educational backgrounds for ppt on social media Ppt on principles of peace building Download ppt on harmonics in power system Ppt on file system in unix everything is a file Ppt on panel discussion definition Ppt on first conditional game Flat panel display ppt online Elements of one act play ppt on website Ppt on road signs in india Ppt on online shopping cart project in php