New techniques for Cycle Shrinking
Several loop transformations techniques have been designed to extract parallelism from nested loop structures. We first review two important approaches, known as Generalized Cycle Shrinking presented by Shang, O'Keefe and Fortes and the Index Shift Method introduced by Liu, Ho and Sheu. The main result of the paper is a new methodology that permits to combine cycle shrinking techniques with the index shift method. We present a new optimization method that produces the best scheduling vector, and we show that we can outperform previous results by an arbitrary speedup factor.
Unable to display preview. Download preview PDF.
- A. Darte and Y. Robert, Scheduling uniform loop nests, Technical Report LIP-IMAG 92-10, Ecole Normale Supérieure de Lyon, February 1992.Google Scholar
- C.E. Leiserson and J.B. Saxe, “Optimizing synchronous systems”, Journal of VLSI Computer Systems, Vol. 1, April, 1983, pp. 41–67.Google Scholar
- L.S. Liu, C.W. Ho, and J.P. Sheu, “On the parallelism of nested for-loops using index shift method”, Proceedings of International Conference on Parallel Processing, August 1990, pp. 11-119–11-123.Google Scholar
- C.D. Polychronopoulos, Parallel Programming and Compilers, Kluwer Academic Publishers, Boston, 1988.Google Scholar
- Y. Robert and S.W. Song, Revisiting cycle shrinking, Technical Report LIP-IMAG 91–31, Ecole Normale Supérieure de Lyon, September 1991.Google Scholar
- W. Shang and J.A.B. Fortes, “Time optimal linear schedules for algorithms with uniform dependences”, Proceedings of International Conference on Systolic Arrays, May 1988, pp. 393–402.Google Scholar
- W. Shang, M.T. O'Keefe, J.A.B. Fortes, “On loop transformations for generalized cycle shrinking”, Proceedings of International Conference on Parallel Processing, August 1991, pp. II-132–II-141.Google Scholar
- M. Wolfe, Optimizing Supercompilers for Supercomputers, MIT Press, Cambridge MA, 1989.Google Scholar