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.
Unable to display preview. Download preview PDF.
- 2.Liu, L. S., Ho, C. W. and Sheu, J. P. On the parallelism of nested for-loops using index shift method. Proc. Internat. Conf. on Parallel Processing (Aug. 1990) II-119–II-123.Google Scholar
- 3.Okuda, K., Cycle shrinking by dependence reduction. Technical Report, Universidade de São Paulo, 1995.Google Scholar
- 7.Shang, W., O'Keefe, M. T. and Fortes, J. A. B. Generalized cycle shrinking. Parallel Algorithms and VLSI Architecture II. P. Quinten and Y. Robert (editors) North Holland, 1991.Google Scholar