Slotwise - Sparse scheduling[Dhamdhere, Rosen, Zadeck, PLDI’92]

Each slot in a data flow problem is analyzed - bit vector (separable)

• reduce number of quantities modeled simultaneously

Only compute where value might be different from default

• reduce number of points

Slotwise: time O(pN),

p is size of program visited

Worst case - O(N2)

...

Previous slide

Next slide

Back to first slide

View graphic version