Abstract
Loop transformations for parallelization are linear, invertible mappings from an iteration space to spacc-time; a further restriction on the mapping, unimodularity, simplifies code generation. In most previous work, non-unimodular transformations require a potentially large amount of overhead. We sketch a method for producing efficient code for non-unimodular loop transformations.
This article was processed using the LaTEX macro package with LLNCS style
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
C. Ancourt and F. Irigoin. Scanning polyhedra with DO loops. In Proc. Third ACM SIGPLAN Symp. on Principles & Practice of Parallel Programming (PPoPP), pages 39–50. ACM Press, Apr. 1991.
M. Barnett. A Systolizing Compiler. PhD thesis, Department of Computer Sciences, The University of Texas at Austin, May 1992. Technical Report TR-92-13.
R. T. Boute. The Euclidean definition of the functions div and mod. ACM Trans. on Programming Languages and Systems, 14(2): 127–144, Apr. 1992.
P. Feautrier. Semantical analysis and mathematical programming. In M. Cosnard, Y. Robert, P. Quinton, and M. Raynal, editors, Parallel & Distributed Algorithms, pages 309–320. North-Holland, 1989
L.-C. Lu and M. Chen. New loop transformation techniques for massive parallelism. Technical Report YALEU/DCS/TR-833, Department of Computer Science, Yale University, Oct. 1990.
H. B. Ribas. Automatic Generation of Systolic Programs from Nested Loops. PhD thesis, Department of Computer Science, Carnegie-Mellon University, June 1990. Technical Report CMU-CS-90-143.
M. Wolf and M. Lam. A loop transformation theory and an algorithm to maximize parallelism. IEEE Trans. on Parallel and Distributed Systems, 2(4):452–471, Oct. 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Barnett, M., Lengauer, C. (1992). Unimodularity considered non-essential (extended abstract). In: Bougé, L., Cosnard, M., Robert, Y., Trystram, D. (eds) Parallel Processing: CONPAR 92—VAPP V. VAPP CONPAR 1992 1992. Lecture Notes in Computer Science, vol 634. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-55895-0_467
Download citation
DOI: https://doi.org/10.1007/3-540-55895-0_467
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55895-8
Online ISBN: 978-3-540-47306-0
eBook Packages: Springer Book Archive