Advertisement

Extended cycle shrinking: A restructuring method for parallel compilation

  • S. Biswas
  • A. Sanyal
  • L. M. Tewari
Parallel Processing And Systems
Part of the Lecture Notes in Computer Science book series (LNCS, volume 497)

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.

Unable to display preview. Download preview PDF.

References

  1. [1]
    C.D.Polychronopoulos, ”Compiler Optimizations for Enhancing Parallelism and Their Impact on Architecture Design”, IEEE Transaction on Computers, Vol 37, No. 8, August 1988.Google Scholar
  2. [2]
    J.R.Allen and K.Kennedy, ”Automatic Translation of FORTRAN Programs to Vector Form”, ACM Trans. Programming Lang. Syst., Vol 9, October 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • S. Biswas
    • 1
  • A. Sanyal
    • 1
  • L. M. Tewari
    • 1
  1. 1.Department of Computer Science and EngineeringIndian Institute of TechnologyBombayIndia

Personalised recommendations