International Journal of Parallel Programming

, Volume 19, Issue 6, pp 477–509 | Cite as

Semantics for data parallel computation

  • Michael D. Rice
Article
  • 20 Downloads

Abstract

The paper describes the semantics of an elementary language for data parallel computation that is based on an abstract parallel machine. The semantics of the language is described in both a mathematical and an operational manner. The mathematical semantics can be used to prove the correctness of algorithms specified in the language. The operational semantics provides a CSP description of an abstract machine that can be used to execute programs written in the language. The latter portion of the paper establishes that the two semantic descriptions are equivalent.

Key Words

Algorithm CSP data parallel semantics SIMD 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    M. D. Rice, S. B. Seidman, and P. Y. Wang, The Specification of Data Parallel Algorithms,J. of Parallel and Distributed Computing 8:191–195 (1990).Google Scholar
  2. 2.
    E. A. Ashcroft and W. Wadge, Rx for Semantics,ACM Trans. on Prog. Lang. and Systems 4(2):283fff-294 (1982).Google Scholar
  3. 3.
    D. Scott and C. Strachey, Toward a Mathematical Semantics for Computer Languages,MRI Symp. Proc., Vol. 21:Proc. of Symp. on Computers and Automaton, Polytechnic Press, Brooklyn Polytechnic Institute, New York, pp. 19–46 (1971).Google Scholar
  4. 4.
    D. A. Schmidt,Denotational Semantics, A Methodology for Language Development, Allyn and Bacon (1986).Google Scholar
  5. 5.
    G. D. Plotkin, A Structured Approach to Operational Semantics, Technical Report DAIMI FN-19, Aarhus University, Computer Science Department, Denmark (1981).Google Scholar
  6. 6.
    C. A. R. Hoare,Communicating Sequential Processes, Prentice-Hall International (1985).Google Scholar
  7. 7.
    G. D. Plotkin, LCF Considered as a Programming Language,Theoretical Computer Science 5(3):223–256 (1977).Google Scholar
  8. 8.
    A. R. Meyer and S. S. Cosmadakis, Semantical Paradigms: Notes for an Invited Lecture,Proc. Third Annual Symp. on Logic in Computer Science, IEEE Computer Society Press, pp. 236–253 (1988).Google Scholar
  9. 9.
    P. Degano, R. De Nicola, and U. Montanari, On the Consistency of Truly Concurrent Operational and Denotational Semantics,Proc. Third Annual Symp. on Logic in Computer Science, IEEE Computer Society Press, pp. 133–141 (1988).Google Scholar
  10. 10.
    S. D. Brookes and A. W. Roscoe An Improved Failures Model for Communicating Processes, Springer-Verlag,Lecture Notes in Computer Science 197:281–305.Google Scholar
  11. 11.
    M. D. Rice, S. B. Seidman, and P. Y. Wang, A Functional Model of SIMD Computation,Proc. of the Second Symp. on Massively Parallel Computation, IEEE Computer Society Press, pp. 601–607 (1989).Google Scholar
  12. 12.
    H. J. Siegel, A Model of SIMD Machines and a Comparison of Various Interconnection Networks,IEEE Transactions on Computers C-28:909–917 (1979).Google Scholar
  13. 13.
    W. Sierpinski,Elementary Theory of Numbers, Mathematical Monographs, 42, Polish Academy of Sciences, Warsaw (1964).Google Scholar
  14. 14.
    C. Wilansky and D. A. Banerjee, A Functional Programming Language Compiler for Massively Parallel Computers, 1990 ACM Conference on Lisp and Functional Programming.Google Scholar
  15. 15.
    H. J. Siegel, Analysis Techniques for SIMD Machine Interconnection Networks and the Effects of Processor Masks,IEEE Transactions on Computers C-26:153–161 (1977).Google Scholar
  16. 16.
    W. D. Hillis and G. L. Steele, Data Parallel Algorithms,Comm. ACM 29(2):1170–1183 (1986).Google Scholar
  17. 17.
    S. D. Brookes, C. A. R. Hoare, and A. W. Roscoe, A Theory of Communicating Sequential Processes,JACM 31(3):560–599 (1984).Google Scholar
  18. 18.
    C. S. Klein, Simulation of a SIMD Computer on a Transputer Network, TR-4-88, Computer Science Department, George Mason University, Fairfax, Virginia (1988).Google Scholar
  19. 19.
    M. D. Rice, S. B. Seidman, and P. Y. Wang, A. High-Level Language for SIMD Computation Part 1,Proceedings CONPAR 1988, Cambridge University Press, pp. 384–391 (1989).Google Scholar
  20. 20.
    Thinking Machines Corporation,*Lisp and C* Reference Manuals (1988)Google Scholar
  21. 21.
    W. D. Hillis,The Connection Machine, MIT Press (1986).Google Scholar
  22. 22.
    P. Y. Wang, S. B. Seidman, M. D. Rice, and T. E. Gerasch, An Object Method Programming Language for Data Parallel Computation,Proc. 22nd Annual Hawaii Int'l. Conf. on System Sciences, IEEE Computer Society Press (II), pp. 745–750 (1989).Google Scholar

Copyright information

© Plenum Publishing Corporation 1990

Authors and Affiliations

  • Michael D. Rice
    • 1
  1. 1.Mathematics DepartmentWesleyan UniversityMiddletown

Personalised recommendations