Extraction (gkx - kernels, gcx - cubes)

a

b

c

d

e

w

x

y

z

p = ke

v = a’d + bd + c’d + ae’

s = r + b’

t = ka + kb + e

u = q’c + qc’ + qc

q = a + b

r = p + a’

k = c + d

• Finding common sub-expressions and pulling them out into their own node(most important and complex function in multi-level optimization)

Previous slide

Next slide

Back to first slide

View graphic version