Abstract
We consider a multiprogram with a positive and finite number of components. Component i has a private boolean variable y.i and it does just one thing, namely it performs one as yet unknown assignment to this variable. The problem is to synchronize the components in such a way that they all terminate and leave the system in a final state satisfyingâ€
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). A Simple Election Algorithm. In: On a Method of Multiprogramming. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3126-2_24
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3126-2_24
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