Skip to main content

Parallele Prozesse (Task)

  • Chapter
Programmieren mit Ada
  • 39 Accesses

Zusammenfassung

Die Theorie der parallelen Prozesse, die miteinander kooperieren und konkurrieren, indem sie Signale (Semaphore) austauschen, wurde 1968 von Dijkstra begründet. Aus der Systemprogrammierung stammen Bezeichnungen wie TASK, ENTRY, CALL, PRIORITY und time-sharing.

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

Access this chapter

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

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1992 Friedr. Vieweg & Sohn Verlagsgesellschaft mbH, Braunschweig/Wiesbaden

About this chapter

Cite this chapter

Feldmann, H. (1992). Parallele Prozesse (Task). In: Programmieren mit Ada. Vieweg+Teubner Verlag. https://doi.org/10.1007/978-3-322-87793-2_11

Download citation

  • DOI: https://doi.org/10.1007/978-3-322-87793-2_11

  • Publisher Name: Vieweg+Teubner Verlag

  • Print ISBN: 978-3-528-05205-8

  • Online ISBN: 978-3-322-87793-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics