Abstract
Delaying messages is one of the techniques that can be employed in order to create correct asynchronous protocols using the synchronizer mechanism. In this paper, we show that message delaying cannot be implemented with certain synchronizers and that the synchronizers must be altered before message delaying can be applied. We present three different techniques that solve the problem and work for most synchronizers.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Awerbuch, Complexity Of Network Synchronization, Journal of the Association for Computing Machinery, Vol. 32, No. 4, October 1985, pp. 804–823.
B. Awerbuch, Reducing Complexities of the Distributed Max-Flow and Breadth-First-Search Algorithms by Means of Network Synchronization, NETWORKS, Vol. 15 (1985) 425–437.
A. Fekete, N. Lynch and L. Shrira, A Modular Proof of Correctness for a Network Synchronizer, 2nd International Workshop on DISTRIBUTED ALGORITHMS, Amsterdam, July 1987.
K.B. Lakshmanan and K. Thulasiraman, On The Use Of Synchronizers For Asynchronous Communication Networks, 2nd International Workshop on DISTRIBUTED ALGORITHMS, Amsterdam, July 1987.
D. Peleg and J.D. Ullman, An Optimal Synchronizer for the Hypercube, SIAM Journal of COMPUT. Vol 18, No. 4, pp. 740–747, August 1989.
C.T. Chou, I. Cidon, I.S. Gopal and S. Zaks, Synchronizing Asynchronous Bounded Delay Networks, IEEE Transactions on communications, Vol. 38, No. 2, February 1990, Pages 144–147.
B. Awerbuch and D. Peleg, Network Synchronization with Polilogarithmic Overhead, Technical Report CS90-19, August 1990, The Weizmann Institute of Science, Department of Applied Mathematics and Computer Science, Israel.
S. Even and S. Rajsbaum, Lack of Global Clock Does Not Slow Down the Computation in Distributed Networks, Technical Report, October 1988, Computer Science Department, Technion — Israel Institute of Technology.
B. Awerbuch and M. Sisper, Dynamic Networks are as fast as Static Networks, Proc. 29-th IEEE symp. on Foundations of Computer Science 1988, pages 206–220.
K.B. Lakshmanan and K. Thulasiraman and M.A. Comeau, An Efficient Distributed Protocol for Finding Sortest Paths in Networks with Negative Weights, IEEE Transactions on Software Engineering, Vol. 15, No. 5, MAY 1989.
B. Schieber and S. Moran, Slowing Sequential Algorithms for Obtaining fast Distributed and Parallel Algorithm: Maximum Matchings, Proc. 5-th ACM Symp. on Pronciples of Distributed Computing, pages 282–292, ACM August 1986.
A. Segall, Distributed Network Protocols, IEEE Transactions on Information Theory, vol. IT-29, no. 1, January 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1992 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Shabtay, L., Segall, A. (1992). Message delaying synchronizers. In: Toueg, S., Spirakis, P.G., Kirousis, L. (eds) Distributed Algorithms. WDAG 1991. Lecture Notes in Computer Science, vol 579. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0022456
Download citation
DOI: https://doi.org/10.1007/BFb0022456
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-55236-9
Online ISBN: 978-3-540-46789-2
eBook Packages: Springer Book Archive