Abstract
We present a simple and efficient synchronizer for ABD networks, asynchronous networks with bounded delay message delivery. The algorithms improve on an earlier algorithm [Ch87]. Using a mathematical model for this type of synchronizer we achieve optimality results for ABD synchronizers.
This work was partially carried out when the second author visited the Technion in December, 1987.
The work of the this author is supported by the Foundation for Computer Science (SION) of the Netherlands Organization for Scientific Research (NWO).
Preview
Unable to display preview. Download preview PDF.
9 References
Awerbuch, B., Complexity of Network Synchronization, Journal of the ACM 32 (1985) 804–823.
Chou, C.-T., I. Cidon, I.S. Gopal, S. Zaks, Synchronizing Asynchronous Bounded Delay Networks, in: J. van Leeuwen (ed.), Proceedings 2nd International Workshop on Distributed Algorithms, Lecture Notes in Computer Science 312, Springer Verlag, 1988.
Korach, E., G. Tel, S. Zaks, Optimal Synchronization of ABD Networks, Techn. Rep. RUU-CS-88-23, Dept. of Computer Science, University of Utrecht, Utrecht, 1988.
Lundelius, J., N. Lynch, An Upper and Lower Bound for Clock Synchronization, Information and Control 62 (1984) 190–204.
Lakshmanan, K.b., K. Thulasiraman, On the Use of Synchronizers for Asynchronous Communication Networks, in: J. van Leeuwen (ed.), Proceedings 2nd International Workshop on Distributed Algorithms, Lecture Notes in Computer Science 312, Springer Verlag, 1988.
Vitanyi, P.M.B., Time-Driven Algorithms for Distributed Control, Tech. Rep. CS-R8510, OWI, Amsterdam, The Netherlands, 1985.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Korach, E., Tel, G., Zaks, S. (1988). Optimal synchronization of ABD networks. In: Vogt, F.H. (eds) CONCURRENCY 88. CONCURRENCY 1988. Lecture Notes in Computer Science, vol 335. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-50403-6_50
Download citation
DOI: https://doi.org/10.1007/3-540-50403-6_50
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50403-0
Online ISBN: 978-3-540-45999-6
eBook Packages: Springer Book Archive