Distributed Liberal Phase Synchronization

  • W. H. J. Feijen
  • A. J. M. van Gasteren
Part of the Monographs in Computer Science book series (MCS)

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).

Keywords

Phase Synchronization Previous Chapter Black Node Program Text Deadlock State 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media New York 1999

Authors and Affiliations

  • W. H. J. Feijen
    • 1
  • A. J. M. van Gasteren
    • 1
  1. 1.Department of Computing ScienceEindhoven University of TechnologyEindhovenThe Netherlands

Personalised recommendations