Graph transformation for communication minimization using retiming

Nested loops are normally the most time intensive tasks in computer algorithms. These loops often include multiple dependencies between arrays that impose communication constraints when used in multiprocessor systems. These dependencies may be between dependent arrays (loop dependencies), or between independent arrays (data dependencies). In this paper, reducing the communication caused by data and loop dependencies for perfect nested loops is explored. It is shown that for a given partition data dependencies may be treated as a specialized form of loop dependencies. Once this is done, previous results on scalable loop tiling can be used to calculate the final total communication. Next, the effects of changing the partition for both loop and data communication are examined. Using these results, the optimal partition for a number of cases are examined. Results are shown which illustrate the efficiency of the system as well as the savings achieved.