Abstract
There is a rather wide-spread belief that the design of distributed algorithms requires methods that are quite different from those used for the design of shared-variable algorithms. This is an unfortunate misunderstanding. In previous chapters we already showed the development of a number of small distributed algorithms, and in this chapter we will try to dispel the misunderstanding more rigorously by presenting the design of a non-trivial, fully distributed algorithm for phase synchronization (an algorithm which most likely is beyond what can operationally be conceived and comprehended).
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). Distributed Liberal Phase Synchronization. In: On a Method of Multiprogramming. Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3126-2_27
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3126-2_27
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