Skip to main content

Statement-sets

Parallelism enabled by independence

  • Conference paper
  • First Online:

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

Abstract

The possibility to specify a collection of statements (without any preferred execution order) is clamed to be important for the programming of parallel computers.

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. Chapmann, et al., VIENNA FORTRAN Compilation System Version 1.0 User's Guide, Technical Raport, Institut for Software Technology and Parallel Systems, Univ. of Vienna, (Jan. 1993).

    Google Scholar 

  2. High Performance Fortran Forum, High Performance Fortran Language Specification, Version 1.0, Scientific Programmingf, 2(1 & 2 1993).

    Google Scholar 

  3. W. F. Tichy and C. G. Herter, Modula-2*: An Extension of Modula-2 for Highly Parallel, Portable Programs, Technical Report 4/90, Department of Computer Science, University of Karlsruhe, (Jan. 1990).

    Google Scholar 

  4. J.-P. Banâtre, D. Le Métayer. Programming by Multiset Transformation, Commununication of the ACM 36 (1993) 1, pp. 98–111.

    Google Scholar 

  5. P. Naur, Revised Report on the Algorithmic Language ALGOL 60, Commununication of the ACM 6 (1963) 1.

    Google Scholar 

  6. N. Wirth, The Programming Language Oberon, Department Informatik, ETH Zurich, Report 111 (Sep. 1989), pp. 11–28.

    Google Scholar 

  7. C. Temperton, Self-Sorting In-Place Fast Fourier Transformations, SIAM J. Sci. Stat. Comput. 12 (1991) 7, pp. 808–823.

    Google Scholar 

  8. C.A.R. Hoare, Quicksort, Computer Journal 5 (1962) 1, pp. 10–15.

    Article  Google Scholar 

  9. J. Templ, SPARC-Oberon User's Guide and Implementation, Department Informatik, ETH Zurich, Report 133 (June 1990).

    Google Scholar 

  10. SPARC International, Inc. The SPAR Architecture Manual, Version 8, Prentice Hall, Englewood Cliffs, 1992.

    Google Scholar 

  11. Strachey, C. An impossible program, Computer Journal 7, (1965) 4, p. 313.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

László Böszörményi

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Knudsen, S.E. (1996). Statement-sets. In: Böszörményi, L. (eds) Parallel Computation. ACPC 1996. Lecture Notes in Computer Science, vol 1127. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61695-0_14

Download citation

  • DOI: https://doi.org/10.1007/3-540-61695-0_14

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-61695-5

  • Online ISBN: 978-3-540-70645-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics