Skip to main content

PEI: a single unifying model to design parallel programs

  • Paper Sessions
  • Conference paper
  • First Online:
  • 693 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 694))

Abstract

A lot of programming models have been proposed to deal with parallelism in order to express program transformations and refinements. This justifies to introduce an unifying theory to abstract different concepts. The aim of this paper is to introduce such a theory. This theory includes the definitions of problems, programs and transformation rules. It is founded on the simple mathematical concepts of multiset and of an equivalence between their representations as data fields. Program transformations are founded on this equivalence and defined from a refinement relation. Due to the unifying aspect of this theory, solutions that can be reached by these transformations are relevant to various synchronous or asynchronous computing models.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Chen, Y. Choo, and J. Li. Parallel Functional Languages and Compilers. Frontier Series. ACM Press, 1991. chapter 7.

    Google Scholar 

  2. K.M. Chandy and J. Misra. Parallel Program Design: A foundation. Addison Wesley, 1988.

    Google Scholar 

  3. P. Clauss, C. Mongenet, and G.-R. Perrin. Synthesis of size-optimal toroidal arrays for the algebraic path problem: A new contribution. Parallel Computing, 18:185–194, 1992.

    Article  Google Scholar 

  4. C. Creveuil. Techniques d'analyse et de mise en oeuvre des programmes Gamma. PhD thesis, Université de Rennes 1, Décembre 1991.

    Google Scholar 

  5. INRIA Sophia-Antipolis, Valbonne. Centaur 1.1, 1991.

    Google Scholar 

  6. R.M. Karp, R.E. Miller, and S. Winograd. The organization of computations for uniform recurrence equations. Journal of ACM, 14(3):563–590, Juillet 1967.

    Google Scholar 

  7. C. Mauras. Alpha; un langage équationnel pour la conception et la programmation d'architectures parallèles synchrones. PhD thesis, Université de Rennes 1, Décembre 1989.

    Google Scholar 

  8. J. Misra. Equational reasoning about nondeterministic processes. Formal Aspects of Computing, 2:167–195, 1990.

    Article  Google Scholar 

  9. C. Morgan. Programming from specifications. C.A.R. Hoare. Prentice Hall Ed., Endlewood Cliffs, N.J., 1990.

    Google Scholar 

  10. P. Quinton. The mapping of linear recurrence equations on regular arrays. Journal of VLSI Signal Processing, 1, 1989.

    Google Scholar 

  11. E. Violard. Une théorie unificatrice pour la construction de programmes parallèles par des techniques de transformations. PhD thesis, Université de Franche-Comté, Octobre 1992.

    Google Scholar 

  12. E. Violard and G.-R. Perrin. Pei: a language and its refinement calculus for parallel programming. Parallel Computing, 18:1167–1184, 1992.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Arndt Bode Mike Reeve Gottfried Wolf

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Violard, E., Perrin, G.R. (1993). PEI: a single unifying model to design parallel 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_40

Download citation

  • DOI: https://doi.org/10.1007/3-540-56891-3_40

  • 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

Publish with us

Policies and ethics