Abstract
This paper deals with communication optimization which is a crucial issue in automatic parallelization. From a system of parameterized affine recurrence equations, we propose a heuristic which determines an efficient space-time transformation. It reduces first the distant communications and then the local communications.
Chapter PDF
Keywords
References
Clauss, Ph., Loechner, V.: Parametric Analysis of Polyhedral Iteration Spaces. ASAP'96, Chicago, Illinois, August 1996.
Dion, M., Robert, Y.: Mapping affine loop nests: New results. HPCN'95, Milan, LNCS 919, 184–189, 1995.
Darte, A., Robert, Y.: A graph-theoretic approach to the alignment problem. Parallel Processing Letters. 4(3), 1994.
Feautrier, P.: Towards automatic distribution. Parallel Processing Letters. 4(3): 233–244, 1994.
Lengauer, Ch.: Loop parallelization in the polytope model. CONCUR'93, LNCS 715, 398–416, 1993.
Loechner, V., Wilde, D. K.: Parameterized polyhedra and. their vertices. Research Report ICPS 96-09. http://icps.u-strasbg.fr/pub-96/
Mongenet, C.: Mappings for communication minimization using distribution and alignment. PACT'95, Limassol, Cyprus, ACM Press, 185–193, 1995.
Mongenet, C.: Affine dependence classification for communications minimization. Research Report ICPS 96-08. http://icps.u-strasbg fr/pub-96/
Mongenet, C., Clauss, Ph., Perrin, G. R.: A geometrical coding to compile affine recurrence equations on regular arrays. IPPS'91, Anaheim, California, 1991.
Quinton, P., Van Dongen, V.: The Mapping of Linean Recurrence Equations on Regular Arrays. Journal of VLSI Signal Processing, 1:95–113, 1989.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Loechner, V., Mongenet, C. (1997). Solutions to the communication minimization problem for affine recurrence equations. In: Lengauer, C., Griebl, M., Gorlatch, S. (eds) Euro-Par'97 Parallel Processing. Euro-Par 1997. Lecture Notes in Computer Science, vol 1300. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0002752
Download citation
DOI: https://doi.org/10.1007/BFb0002752
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-63440-9
Online ISBN: 978-3-540-69549-3
eBook Packages: Springer Book Archive