Abstract
This paper presents an environment for automatic parallelization. From systems of recurrence equations, our tool aims at vizualizing the problem, analyzing the dependences and computing efficient parallel solutions. Its use and capabilities are illustrated with the example of the Cholesky factorization.
The work presented in this paper describes a first version of OPERA. Our goal is to extend this tool in order to propose a more general environment for parallel architecture synthesis. It should deal with SARE or equivalent nested DO-loops programs with single-assignment statements and automatically produce various optimal solutions.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Ph. Clauss and C. Mongenet. Synthesis aspects in the design of efficient processor arrays from affine recurrence equations. Journal of Symbolic Computation, 15:547–569, 1993.
Ph. Clauss, C. Mongenet, and G.R. Perrin. Calculus of space-optimal mappings of systolic algorithms on processor arrays. In IEEE International Conference on Application-Specific Array Processors, ASAP'90, pages 4–18, 1990.
H.T. Kung and C.E Leiserson. Systolic arrays for vlsi. In Sparse matrix proceedings, pages 245–282. SIAM, 1978.
H. Le Verge, Ch. Mauras, and P. Quinton. The alpha language and its use for the design of systolic arrays. Journal of VLSI and signal processing, 3:173–182, 1991.
D.I. Moldovan. On the design of algorithms for vlsi systolic arrays. Proceedings of the IEEE, 71(1):113–120, 1983.
C. Mongenet, Ph. Clauss, and G.R. Perrin. Geometrical tools to map systems of affine recurrence equations on regular arrays. Acta Informatica, 31:137–160, 1994.
C. Mongenet and G.R. Perrin. Synthesis of systolic arrays for inductive problems. In Conference on Parallel Architectures and Languages Europe, PARLE'87, pages 260–277. Springer Verlag, 1987. LNCS 259.
P. Quinton. Automatic synthesis of systolic arrays from uniform recurrence equations. In IEEE 11th Int. Symp. on Computer Architectur, pages 208–214, 1984.
D. Wilde. A library for doing polyhedral operations. Technical Report Internal Publication 785, IRISA, Rennes, France, Dec 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loechner, V., Mongenet, C. (1995). A toolbox for affine recurrence equations parallelization. In: Hertzberger, B., Serazzi, G. (eds) High-Performance Computing and Networking. HPCN-Europe 1995. Lecture Notes in Computer Science, vol 919. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0046638
Download citation
DOI: https://doi.org/10.1007/BFb0046638
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59393-5
Online ISBN: 978-3-540-49242-9
eBook Packages: Springer Book Archive