Abstract
Tasks are entities that may operate in parallel. Parallel tasks may be implemented on multicomputers, multiprocessors, or with interleaved execution on a single processor. Tasks may have entries which may be called by other tasks. Synchronization is achieved by rendezvous between a task issuing an entry call and a task accepting the call. Entries are also the principal means of communication between tasks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1980 United States Government
About this chapter
Cite this chapter
Brauer, W. et al. (1980). Tasks. In: Brauer, W., et al. The Programming Language Ada. Lecture Notes in Computer Science, vol 106. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10693-6_9
Download citation
DOI: https://doi.org/10.1007/3-540-10693-6_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10693-7
Online ISBN: 978-3-540-38620-9
eBook Packages: Springer Book Archive