Skip to main content

Parallel programming

  • Chapter
  • 47 Accesses

Abstract

Thus far we have always (implicitly) assumed that the statements of a statement sequence execute one after the other. Programs consisting of such statement sequences are termed sequential. However, in practice some problems are difficult or impossible to solve with a sequential program. Here we can resort to parallel programming, which is actually the more general view: sequential programs can be viewed a special (although very important) case of parallel programs.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.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

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Böszörményi, L., Weich, C. (1996). Parallel programming. In: Programming in Modula-3. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-60940-4_16

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-60940-4_16

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-64614-0

  • Online ISBN: 978-3-642-60940-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics