Loop Parallelization in the Polytope Model

@inproceedings{Lengauer1993LoopPI,
  title={Loop Parallelization in the Polytope Model},
  author={C. Lengauer},
  booktitle={CONCUR},
  year={1993}
}
  • C. Lengauer
  • Published in CONCUR 1993
  • Computer Science
  • During the course of the last decade, a mathematical model for the parallelization of FOR-loops has become increasingly popular. In this model, a (perfect) nest of r FOR-loops is represented by a convex polytope in ℤr. The boundaries of each loop specify the extent of the polytope in a distinct dimension. Various ways of slicing and segmenting the polytope yield a multitude of guaranteed correct mappings of the loops' operations in space-time. These transformations have a very intuitive… CONTINUE READING
    The Static Parallelization of Loops and Recursions
    • 5
    Projecting Periodic Polyhedra for Loop Nest Analysis
    • 9
    Code generation in the polytope model
    • 69
    • PDF
    Code Generation in the Polytope Model with Non-linear Parameters
    • Bachelorarbeit Autor, Philipp Claÿen, M. Griebl
    • 2007
    • 1
    • PDF

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 74 REFERENCES
    Scanning polyhedra with DO loops
    • 376
    • PDF
    Automatic generation of systolic programs from nested loops
    • 27
    A Loop Transformation Theory and an Algorithm to Maximize Parallelism
    • 751
    A Systolizing Compilation Scheme for Nested Loops with Linear Bounds
    • 2
    • PDF
    The ALPHA language and its use for the design of systolic arrays
    • 117
    Calculus of space-optimal mappings of systolic algorithms on processor arrays
    • 25
    Automatic synthesis of systolic arrays from uniform recurrent equations
    • 175