Message delaying synchronizers

  • Lior Shabtay
  • Adrian Segall
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 579)


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.


Original Protocol Neighboring Cluster Network Synchronization Safe Message Message Delay 
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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [Awer 1]
    B. Awerbuch, Complexity Of Network Synchronization, Journal of the Association for Computing Machinery, Vol. 32, No. 4, October 1985, pp. 804–823.Google Scholar
  2. [Awer 2]
    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.Google Scholar
  3. [FLS 1]
    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.Google Scholar
  4. [LT 1]
    K.B. Lakshmanan and K. Thulasiraman, On The Use Of Synchronizers For Asynchronous Communication Networks, 2nd International Workshop on DISTRIBUTED ALGORITHMS, Amsterdam, July 1987.Google Scholar
  5. [PU 1]
    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.Google Scholar
  6. [CCGZ 1]
    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.Google Scholar
  7. [AP 1]
    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.Google Scholar
  8. [ER 1]
    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.Google Scholar
  9. [AS 1]
    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.Google Scholar
  10. [LTC 1]
    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.Google Scholar
  11. [SM 1]
    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.Google Scholar
  12. [Seg 1]
    A. Segall, Distributed Network Protocols, IEEE Transactions on Information Theory, vol. IT-29, no. 1, January 1983.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Lior Shabtay
    • 1
  • Adrian Segall
    • 1
  1. 1.Dept. of Computer ScienceTechnion, Israel Institute of TechnologyHaifaIsrael

Personalised recommendations