Cycle Shrinking by Dependence Reduction

We present a new simple cycle shrinking technique called dependence reduction for regular uniform nest algorithm. It consists of a transformation of the dependence graph to reduce the number of execution steps as well as the communication between processors. We gave simple and sufficient conditions for the dependence reduction method to be better than other methods.