Skip to main content
SpringerLink
Log in
Book cover

International Workshop on Distributed Algorithms

WDAG 1987: Distributed Algorithms pp 257–277Cite as

On the use of synchronizers for asynchronous communication networks

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 312))

Abstract

A synchronizer is a mechanism that helps simulate a synchronous communication network on an asynchronous one. In this paper, we draw attention to certain difficulties that one may face in the implementation of a synchronizer mechanism, if the model of computation assumed does not permit delaying the processing of messages once received. To illustrate the issues, we present the design of a simple, time-efficient synchronizer. Using a synchronous breadth-first-search tree protocol, it will be shown that this synchronizer will not work correctly in all cases, because the simulation may not be exact. Similar difficulties arise in the implementation of other synchronizers proposed earlier in the literature, if the messages of the synchronous algorithm do not carry the pulse number. It is easy to suggest remedies for these difficulties which are at variance with the model of computation assumed. But, if we must stay within this model, we show that only the time-inefficient β-synchronizer known earlier can be corrected. We also present simple modifications to ensure this.

This research was supported in part by Concordia University under grant CASA-N67, the Natural Sciences and Engineering Research Council of Canada under grant A9194 and by the FCAR, Quebec under the Actions Spontanées grant 87AS2407.

This is a preview of subscription content, log in via an institution.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H.H. Abu-Amara, “Fault-Tolerant Algorithms for Election in Complete Networks”, Technical Report, Coordinated Science Laboratory, University of Illinois, USA, Feb. 1987.

    Google Scholar 

  2. B. Awerbuch, “Complexity of Network Synchronization”, J. Assoc. Comput. Mach., Vol. 32, No. 4, Oct. 1985, pp. 804–823.

    MathSciNet  Google Scholar 

  3. B. Awerbuch, “Reducing Complexities of the Distributed Max-Flow and Breadth-First-Search Algorithms by Means of Network Synchronization”, Networks, Vol. 15, 1985, pp. 425–437.

    Google Scholar 

  4. B. Awerbuch and R.G. Gallager, “A New Distributed Algorithm to Find Breadth-First-Search Trees”, IEEE Trans. Info. Theory, Vol. IT-33, No. 3, May 1987, pp. 315–322.

    Article  Google Scholar 

  5. K.M. Chandy and J. Misra, “Distributed Computation on Graphs: Shortest Path Algorithms”, Comm. Assoc. Comput. Mach., Vol. 25, No. 11, Nov. 1982, pp. 833–837.

    Google Scholar 

  6. E.J.H. Chang, Decentralized Algorithms in Distributed Systems, Ph.D. Dissertation, (Also Technical Report CSRG-103), University of Toronto, Canada, 1979.

    Google Scholar 

  7. E.J.H. Chang, “Echo Algorithms: Depth Parallel Operations on General Graphs”, IEEE Trans. Software Engg., Vol. SE-8, No. 4, July 1982, pp. 391–401.

    Google Scholar 

  8. G.N. Frederickson, “A Single-Source Shortest Path Algorithm for Planar Distributed Network”, in Proc. STACS 85, Lecture Notes in Computer Science, Vol. 182, Springer-Verlag, Berlin, 1985, pp. 143–150.

    Google Scholar 

  9. E. Gafni, “Perspective on Distributed Network Protocols: A Case for Building Blocks”, in Proc. IEEE Military Communications Conference, Monterey, Oct. 1986.

    Google Scholar 

  10. R.G. Gallager, “Distributed Minimum Hop Protocols”, Technical Report LIDS-P-1175, Massachusetts Institute of Technology, USA, Jan. 1982.

    Google Scholar 

  11. E. Korach, D. Rotem and N. Santoro, “Distributed Algorithms for Finding Centers and Medians in Networks”, ACM Trans. Prog. Lang. Systems, Vol. 6, No. 3, July 1984, pp. 380–401.

    Article  Google Scholar 

  12. K.B. Lakshmanan, N. Meenakshi and K. Thulasiraman, “A Time-Optimal, Message-Efficient Distributed Algorithm for Depth-First-Search”, Info. Proc. Letters, Vol. 25, No. 2, May 1987, pp. 103–109.

    Article  Google Scholar 

  13. A. Segall, “Distributed Network Protocols”, IEEE Trans. Info. Theory, Vol. IT-29, No. 1, Jan. 1983, pp. 23–35.

    Article  Google Scholar 

  14. J.E. Van Leeuwen, N. Santoro, J. Urrutia and S. Zaks, “Guessing Games and Distributed Computations in Synchronous Networks”, Technical Report SCS-TR-96, School of Computer Science, Carleton University, Canada, June 1986.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Concordia University, H3G 1M8, Montreal, Quebec, Canada

    K. B. Lakshmanan

  2. Department of Electrical and Computer Engineering, Concordia University, H3G 1M8, Montreal, Quebec, Canada

    K. Thulasiraman

Authors
  1. K. B. Lakshmanan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. K. Thulasiraman
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

J. van Leeuwen

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lakshmanan, K.B., Thulasiraman, K. (1988). On the use of synchronizers for asynchronous communication networks. In: van Leeuwen, J. (eds) Distributed Algorithms. WDAG 1987. Lecture Notes in Computer Science, vol 312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019808

Download citation

  • DOI: https://doi.org/10.1007/BFb0019808

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-19366-1

  • Online ISBN: 978-3-540-39239-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation