Preview
Unable to display preview. Download preview PDF.
References
Allen J.R., Kennedy K. (1984). Automatic Loop Interchange. ACM SIGPLAN'84 Symp. on Compiler Construction., SIGPLAN Notices, 19–6, 233–246.
Banerjee U. et al. (1993). Automatic Program Parallelization. Proc. of the IEEE, 81–2, 211–243.
Clauss P., Mongenet C., Perrin G.R. (1992). Calculus of Space-Optimal Mappings of Systolic Algorithms on Processors Arrays. J. of VLSI Signal Proc, 4, 27–36.
Darte A., Robert Y. (1992). Scheduling Uniform Loop Nests. Research report 92-10, Laboratoire de l'Informatique du Parallelisme, ENS Lyon.
Draft, High Performance Fortran Language Specification. High Performance Fortran Forum, January 1993.
Lamport L. (1974). The parallel execution of DO loops. Com. ACM, 17–2, 83–93.
Moldovan D.I. (1983). On the Design of Algorithms for VLSI Systolic Arrays. Procedings of IEEE, 71–1, 113–120.
Mongenet C. (1985). Une Méthode de Conception d'Algorithmes Systoliques, Résultats Théoriques et réalisation. PhD. Thesis, INPL, Nancy.
Mongenet C. (1993). Data compiling for systems of recurrence equations. Dagsthul Seminar 9325 on Parallelization Techniques for Uniform Algorithms.
Mongenet C., Clauss Ph., Perrin G.R. (1991). Geometrical Coding to Compile Affine Recurrence Equations on Regular Arrays. Int. Parallel Processing Symposium, IEEE, Anaheim, CA, USA.
Quinton P. (1984). Automatic Synthesis of Systolic Arrays from Uniform Recurrence Equations. 11th Int. Symp. on Computer Architecture, Ann Arbor, MI, USA, IEEE Computer Society, 208–214.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Perrin, GR. (1994). Some synthesis aspects for data parallel programming. In: Gentzsch, W., Harms, U. (eds) High-Performance Computing and Networking. HPCN-Europe 1994. Lecture Notes in Computer Science, vol 797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57981-8_162
Download citation
DOI: https://doi.org/10.1007/3-540-57981-8_162
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57981-6
Online ISBN: 978-3-540-48408-0
eBook Packages: Springer Book Archive