Abstract
Synchronous distributed algorithms are easier to design and analyze than their asynchronous counterparts. Unfortunately, they do not work when executed in an asynchronous system. Hence, the idea to simulate synchronous systems on top of an asynchronous one. Such a simulation algorithm is called a synchronizer. First, this chapter presents several synchronizers in the context of fully asynchronous systems. It is important to notice that, as the underlying system is asynchronous, the synchronous algorithms simulated on top of it cannot consider physical time as a programming object they could use (e.g., to measure physical duration). The only notion of time they can manipulate is a logical time associated with the concept of a round. Then, the chapter presents synchronizers suited to partially synchronous systems. Partial synchrony means here that message delays are bounded but the clocks of the processes (processors) are not synchronized (some private local area networks have such characteristics).
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
References
B. Awerbuch, Reducing complexities of the distributed max-flow and breadth-first algorithms by means of network synchronization. Networks 15, 425–437 (1985)
B. Awerbuch, Complexity of network synchronization. J. ACM 4, 804–823 (1985)
Ch. Boulinier, F. Petit, V. Villain, Synchronous vs asynchronous unison. Algorithmica 51(1), 61–80 (2008)
C.T. Chou, I. Cidon, I. Gopal, S. Zaks, Synchronizing asynchronous bounded delays networks, in Proc. 2nd Int’l Workshop on Distributed Algorithms (WDAG’87). LNCS, vol. 312 (Springer, Berlin, 1987), pp. 212–218
J.-M. Couvreur, N. Francez, M. Gouda, Asynchronous unison, in Proc. 12th IEEE Int’l Conference on Distributed Computing Systems (ICDCS’92) (IEEE Press, New York, 1992), pp. 486–493
F. Cristian, Probabilistic clock synchronization. Distrib. Comput. 3(3), 146–158 (1989)
E.W. Dijkstra, Self stabilizing systems in spite of distributed control. Commun. ACM 17, 643–644 (1974)
E.W.D. Dijkstra, C.S. Scholten, Termination detection for diffusing computations. Inf. Process. Lett. 11(1), 1–4 (1980)
D. Dolev, J.Y. Halpern, H.R. Strong, On the possibility and impossibility of achieving clock synchronization. J. Comput. Syst. Sci. 33(2), 230–250 (1986)
S. Dolev, Self-Stabilization (The MIT Press, Cambridge, 2000), 197 pages
A. Fekete, N.A. Lynch, L. Shrira, A modular proof of correctness for a network synchronizer, in Proc. 2nd Int’l Workshop on Distributed Algorithms (WDAG’87). LNCS, vol. 312 (Springer, Berlin, 1987), pp. 219–256
R.G. Gallager, Distributed minimum hop algorithms. Tech Report LIDS 1175, MIT, 1982
M. Gouda, T. Herman, Stabilizing unison. Inf. Process. Lett. 35(4), 171–175 (1990)
E. Korach, G. Tel, S. Zaks, Optimal synchronization of ABD networks, in Proc. Int’l Conference on Concurrency. LNCS, vol. 335 (Springer, Berlin, 1988), pp. 353–367
K.B. Lakshmanan, K. Thulisaraman, On the use of synchronizers for asynchronous communication networks, in Proc. 2nd Int’l Workshop on Distributed Algorithms (WDAG’87). LNCS, vol. 312 (Springer, Berlin, 1987), pp. 257–267
L. Lamport, P.M. Melliar-Smith, Synchronizing clocks in the presence of faults. J. ACM 32(1), 52–78 (1985)
B. Patt-Shamir, S. Rajsbaum, A theory of clock synchronization, in Proc. 26th Annual ACM Symposium on Theory of Computing (STOC’94) (ACM Press, New York, 1994), pp. 810–819
D. Peleg, Distributed Computing: A Locally-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications (2000), 343 pages
D. Peleg, J.D. Ullman, An optimal synchronizer for the hypercube. SIAM J. Comput. 18, 740–747 (1989)
M. Raynal, J.-M. Hélary, Synchronization and Control of Distributed Systems and Programs. Wiley Series in Parallel Computing (1991), 126 pages. ISBN 0-471-92453-9
A. Segall, Distributed network protocols. IEEE Trans. Inf. Theory 29(1), 23–35 (1983)
T.K. Srikanth, S. Toueg, Optimal clock synchronization. J. ACM 34(3), 626–645 (1987)
J.L. Welch, Simulating synchronous processors. Inf. Comput. 74, 159–171 (1987)
J.L. Welch, N.A. Lynch, A new fault-tolerance algorithm for clock synchronization. Inf. Comput. 77(1), 1–36 (1988)
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2013 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Raynal, M. (2013). Simulating Synchrony on Top of Asynchronous Systems. In: Distributed Algorithms for Message-Passing Systems. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38123-2_9
Download citation
DOI: https://doi.org/10.1007/978-3-642-38123-2_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-38122-5
Online ISBN: 978-3-642-38123-2
eBook Packages: Computer ScienceComputer Science (R0)