Abstract
An important part of a parallelizing compiler is the restructuring phase, which extracts parallelism from a sequential program. We consider an important restructuring transformation, called cycle shrinking [1], which partitions the iteration space of a loop so that the iterations within each partition can be executed in parallel. We propose a new cycle shrinking transformation, called extended cycle shrinking, which is an improvement over the existing methods. We present the conditions under which our method can be applied, and give an algorithm which performs this transformation. Further, we present results to show that our method always leads to a minimal number of partitions, whereas the earlier methods do not. Thus our algorithms is, in this sense, optimal.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
C.D.Polychronopoulos, ”Compiler Optimizations for Enhancing Parallelism and Their Impact on Architecture Design”, IEEE Transaction on Computers, Vol 37, No. 8, August 1988.
J.R.Allen and K.Kennedy, ”Automatic Translation of FORTRAN Programs to Vector Form”, ACM Trans. Programming Lang. Syst., Vol 9, October 1987.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Biswas, S., Sanyal, A., Tewari, L.M. (1991). Extended cycle shrinking: A restructuring method for parallel compilation. In: Dehne, F., Fiala, F., Koczkodaj, W.W. (eds) Advances in Computing and Information — ICCI '91. ICCI 1991. Lecture Notes in Computer Science, vol 497. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54029-6_195
Download citation
DOI: https://doi.org/10.1007/3-540-54029-6_195
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54029-8
Online ISBN: 978-3-540-47359-6
eBook Packages: Springer Book Archive