Abstract
One of the best known techniques to compile sequential programs for multiprocessors is to detect the so called reduction operations. An example of such an operation is the sum of vector elements which can be evaluated under a pyramidal scheme using the associativity property of addition. A method to detect such operations in a PASCAL or FORTRAN-like programming language is presented. This detection and the corresponding modifications to the source programs are considered as non-standard denotational interpretations of the abstract syntax tree of the object programs. A by-product of this paper is to show how a denotational specification of a nontrivial application can directly lead to a running prototype, using here the ML programming language as an “executable specification language”.
Chapter PDF
Similar content being viewed by others
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
Abelson and Sussman, Structure and Interpretation of Computer Programs, MIT Press (1985).
J. R. Allen, K. Kennedy, C. Porterfield, and J. Warren, “Conversion of Control Dependence to Data Dependence,” POPL83, ACM (1983).
A. J. Bernstein, “Analysis of Programs for Parallel Processing,” IEEE Trans. on Elec. Comp. 15, pp.757–763 (October 1966).
G. Cousineau, “The ML Handbook,” (draft INRIA) (Mai 1985).
P. Cousot, Methodes Iteratives de Construction de Points Fixes d'Operateurs Monotones sur un Treillis, Analyse Semantique des Programmes, U.S.M.G, Grenoble (1978).
R. B. Dannenberg and G. W. Ernst, “Formal Program Verification Using Symbolic Execution,” IEEE Trans.on Soft.Eng. 8 (Janvier 1982).
V. Donzeau-Gouge, “Utilisation de la semantique denotationelle pour l'etude d'interpretations non-standard,” Rapport de Recherche 273, INRIA (Janvier 1978).
M. J. C. Gordon, The Denotational Description of Programming Languages, Springer-Verlag (1979).
M. J. C. Gordon and R. Milner, Edinburgh LCF, Springer-Verlag (1979).
Hillis, The Connection Machine, MIT Press (1985).
P. Jouvelot, Evaluation semantique des Conditions de Bernstein, MASI (Mars 1985).
P. Jouvelot, ML: Un Langage de Maquettage ?, AFCET (Octobre 1985).
D. J. Kuck and D. A. Padua, High-Speed Multiprocessors and their Compilers, IEEE (1979).
K. McIsaac, “Pattern Matching Algebraic Identities,” SIGSAM Bull. 19 (Mai 1985).
F. Nielson, “Program Transformations in a Denotational Setting,” TOPLAS, ACM (Juillet 1985).
J. E. Stoy, Denotational Semantics: The Scott-Strachey Approach to Programming Language Theory, MIT Press (1977).
N. Suzuki and D. Jefferson, Verification Decidability of Presburger Array Programs, 1977.
R. D. Tennent, “The Denotational Semantics of Programming Languages,” CACM 19 (Aout 1976).
J. D. Ullman, Computational Aspects of VLSI, Computer Science Press (1984).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jouvelot, P. (1986). Parallelization by semantic detection of reductions. In: Robinet, B., Wilhelm, R. (eds) ESOP 86. ESOP 1986. Lecture Notes in Computer Science, vol 213. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16442-1_17
Download citation
DOI: https://doi.org/10.1007/3-540-16442-1_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16442-5
Online ISBN: 978-3-540-39782-3
eBook Packages: Springer Book Archive