Abstract
This article deals with automatic parallelization of static control programs. The removal of memory related dependences is usually realized by translating the original program into a single assignment form. This total data expansion has a very high memory cost. We present a technique of partial data expansion for global memory architectures which leaves untouched the performances of the parallelization process.
Chapter PDF
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D. E. Maydan, S. P. Amarasinghe, and M. S. Lam. Array data-flow analysis and its use in array privatization. In Principles of Programming Languages, 1993.
P.Y Calland, A. Darte, Y. Robert, F. Vivien. On the removal of anti and output dependences. Technical report RR96-04, laboratoire LIP-école normale supérieure de Lyon-Feb 1996.
E. De Greef, F. Catthoor and H. De Man. Reducing storage size for static control programs mapped to parallel architectures.-presented at Dagstuhl Seminar on Loop Parallelization, April 1996.
P. Feautrier:.Dataflow Analysis of Array and Scalar References. Int. J. of Parallel Programming, 20(1):23–53, February 1991.
P. Feautrier. Some efficient solutions to the affine scheduling problem part If multidimensional time. Int J. of Parallel Programming, 21(6):389–420, December 92.
V. Lefebvre and P. Feautrier. Storage Management in Parallel Programs. In Proc. of the Fith Euromicro Workshop on Parallel and Distributed Processing Conf, Pages 181–188. London. Jan 1997.
P. Tu and D. Padua. Array privatization for shared and distributed memory machines. In Proc. Third Workshop on Languages and Compilers for Distributed Memory Machines, Boulder, Colorado 1992.
S. Rajopadhye and D. Wilde. Memory Reuse Analysis in the Polyhedral Model. In Bougé, Fraignaud, Mignotte and Robert, editors, Euro-Par'96 Parallel Processing, Vol I, pages 389-397. Springer-Verlag, LNCS 1123, Aug 1996.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1997 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lefebvre, V., Feautrier, P. (1997). Optimizing storage size for static control programs in automatic parallelizers. 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/BFb0002757
Download citation
DOI: https://doi.org/10.1007/BFb0002757
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