Minimizing Inter-Iteration Dependencies in Multi-Dimensional Loops

Let Let us now review some of the previous research done Since compiler spend most of the time in executing loop nests because of the dependences, minimizing dependences across loops is vital for compiler optimization. This paper explores two methods, sums of data dependencies and dominant data dependencies for eliminating dependencies in multi-dimensional loops. The first method eliminates dependences by combining other dependencies and method two eliminates dependences by making use of the distance of the dependence. To conclude we provide an algorithm for minimizing the number of dependences in multi-dimensional loops. Index Terms: multi-dimensional dependencies, loop carried dependences.