Abstract
In this paper, we prove that the data-driven parallelization technique, which compiles sequential programs into parallel programs for distributed memory parallel computers, is correct. We dėfine a model based on labeled transition systems, and we prove, in spite of nondeterminism due to communications asynchronism, the confluence of all the possible behaviours of parallel programs obtained from the compilation rules.
We also show that this model is powerful enough to prove the correctness of various optimizations of the basic compilation mechanism.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Françoise André, Jean-Louis Pazat, and Henry Thomas. Pandore: a system to manage data distribution. In ACM International Conference on Supercomputing, June 11–15 1990.
K.R. Apt and E.-R. Olderog. Verification of Sequential and Concurrent Programs. Springer-Verlag, 1991.
A. Arnold. Transition systems and concurrent processes. Mathematical Problems in Computation Theory, Banach Center Publications, 21, 1988.
Cyrille Bareau, Benoît Cailland, Claude Jard, and René Thoraval. Correctness of Automated Distribution of Sequential Programs. Technical Report 665, Institut de Recherche en Informatique et Systèmes Aléatoires, June 1992.
Luc Bougé. On the semantics of languages for massively parallel Simd architectures. Research report 91-14, LIP/ENS Lyon, April 1991.
David Callahan and Ken Kennedy. Compiling programs for distributed-memory multiprocessors. The Journal of Supercomputing, (2):151–169, 1988.
ISO 9074. Estelle: a Formal Description Technique based on an Extented State Transition Model. ISO TC97/SC21/WG6.1, 1989.
C Jard and J.-M. Jézéquel. ECHIDNA, an Estelle-compiler to prototype protocols on distributed computers. Concurrency Practice and Experience, 4(5):377–397, August 1992.
Robert M. Keller. A fundamental theorem of asynchronous parallel computation. In T. Y. Feng, editor, Parallel Processing, pages 102–112, Springer Verlag, 1975. Lecture Notes in Computer Science 24.
R. Milner. Communication and Concurrency. Prentice Hall, 1989.
H. R. Nielson and F. Nielson. Semantics with Applications: a Formal Introduction. Wiley, 1992.
Edwin M. Paalvast, Henk J. Sips, and A. J. van Gemund. Automatic parallel program generation and optimization from data decompositions. In International Conference on Parallel Processing, August 1991.
P. Weis, M.V. Aponte, A. Laville, M. Mauny, and A. Suárez. The CAML reference manual. Rapport Technique 121, 1NRIA, septembre 1990.
Hans P. Zima, Heinz-J. Bast, and Michael Gerndt. Superb: a tool for semi-automatic mimd/simd parallelization. Parallel Computing, (6):1–18, 1988.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bareau, C., Caillaud, B., Jard, C., Thoraval, R. (1993). Correctness of automated distribution of sequential programs. In: Bode, A., Reeve, M., Wolf, G. (eds) PARLE '93 Parallel Architectures and Languages Europe. PARLE 1993. Lecture Notes in Computer Science, vol 694. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-56891-3_41
Download citation
DOI: https://doi.org/10.1007/3-540-56891-3_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56891-9
Online ISBN: 978-3-540-47779-2
eBook Packages: Springer Book Archive