Abstract
Most multiprograms are designed with the aim of having the components cooperate on a common task. The common task may vary from a large-scale computation divided over the various components to an orderly scheduling of the access of components to scarce common resources. Almost all applications will require information exchange — communication — between components, and almost always will the need arise for tuning the relative speeds — i.e. for synchronization — of the components. Indeed, a component that is about to perform an addition, might have to be delayed until the addends have arrived, and a component that is about to need a printer, might have to “wait” if no printer is free.
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
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Feijen, W.H.J., van Gasteren, A.J.M. (1999). Synchronization and Total Deadlock. In: On a Method of Multiprogramming. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3126-2_8
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3126-2_8
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4419-3179-5
Online ISBN: 978-1-4757-3126-2
eBook Packages: Springer Book Archive