Skip to main content

Parallel Programming

  • Conference paper
GI — 8. Jahrestagung

Part of the book series: Informatik-Fachberichte ((INFORMATIK,volume 16))

  • 74 Accesses

Abstract

A survey is given of various important concepts and notations that are under development in order to deal reliably with concurrently executing programs. The bounded buffer problem is used throughout.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  • Brinch Hansen, P. Structured multiprogramming. CACM 15 (July 1972), 574–578.

    Google Scholar 

  • Brinch Hansen, P. Operating Systems Principles. Prentice Hall, 1973.

    Google Scholar 

  • Brinch Hansen, P. The programming language Concurrent Pascal. IEE Trans. Software Eng. 1 (June 1975), 199–207.

    Google Scholar 

  • Dijkstra, E.W. Hierarchical ordering of sequential processes. Acta Informatica 1 (1971), 115–138.

    Article  MathSciNet  Google Scholar 

  • Dijkstra, E.W. A Discipline of Programming. Prentice Hall, 1976.

    MATH  Google Scholar 

  • Hoare, C.A.R. Towards a theory of parallel programming. In Operating Systems Techniques, Hoare (ed.), Academic Press, 1972. 61–71.

    Google Scholar 

  • Hoare, C.A.R. Monitors: an operating system structuring concept. CACM 17 (October 1974), 549–557.

    MATH  Google Scholar 

  • Hoare, C.A.R. Communicating sequential processes. Submitted to CACM

    Google Scholar 

  • Owicki, S. and D. Gries. Verifying properties of parallel programs: an axiomatic approach. CACM 19 (May 1976), 279–285.

    MathSciNet  MATH  Google Scholar 

  • Owicki, S. and D. Gries. An axiomatic proof technique for parallel programs. Acta Informatica 6 (1976), 319–340.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1978 Springer-Verlag Berlin · Heidelberg

About this paper

Cite this paper

Gries, D. (1978). Parallel Programming. In: Schindler, S., Giloi, W.K. (eds) GI — 8. Jahrestagung. Informatik-Fachberichte, vol 16. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-67091-6_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-67091-6_11

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-09038-0

  • Online ISBN: 978-3-642-67091-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics