Skip to main content
SpringerLink
Log in

Low complexity network synchronization

  • Conference paper
  • First Online:
Distributed Algorithms (WDAG 1994)

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

Included in the following conference series:

Abstract

Synchronizer γ is the best synchronizer known that works with any type of synchronous model and any network topology. This paper presents three new synchronizers: η 1, η2 and θ. These synchronizers use sparse covers in order to operate and have the following advantages over synchronizer γ: (1) they are conceptually simpler, as only one convergecast and one broadcast processes are performed along each cluster spanning-tree between each two consecutive pulses, and no preferred links are needed for inter-cluster communication. (2) synchronizer η 2 uses half the communication complexity of synchronizer γ, while retaining the time complexity. (3) synchronizer θ uses half the time complexity of synchronizer γ, while retaining the communication complexity. (4) since there is no need to elect preferred links between neighboring clusters, the initialization process of these synchronizers is more efficient: it requires only O(¦V¦log ¦V} + ¦E¦) messages.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. Awerbuch, Complexity of Network Synchronization, Journal of the Association for Computing Machinery, Vol. 32, No. 4, October 1985, pp. 804–823.

    MathSciNet  Google Scholar 

  2. B. Awerbuch, Optimal Distributed Algorithms of Minimum Weight Spanning Tree, Counting, Leader Election and Related Problems, STOC 1987, pp. 230–240.

    Google Scholar 

  3. B. Awerbuch, B. Berger, L. Cowen and D. Peleg, Fast Network Decomposition, PODC 1992.

    Google Scholar 

  4. I. Althofer, G. Das, D. Dobkin and D. Joseph, Generating sparse spanners for weighted graphs, 2nd Scandinavian Workshop on Algorithm Theory 1990, 26–37.

    Google Scholar 

  5. B. Awerbuch and D. Peleg, Network Synchronization with Polylogarithmic Overhead, 31st Symposium on Foundations of Computer Science 1990, pp. 514–522.

    Google Scholar 

  6. B. Awerbuch and D. Peleg, Sparse Partitions, 31st FOCS, 1990.

    Google Scholar 

  7. B. Awerbuch and D. Peleg, Efficient Distributed Construction of Sparse Covers, CS90-17, The Weizmann Institute, July 1990.

    Google Scholar 

  8. B. Awerbuch, B. Patt-Shamir, D. Peleg and M. Saks, Adapting to Asynchronous Dynamic Networks, Proc. 24th ACM STOC, 1992, pages 557–570.

    Google Scholar 

  9. D. Peleg and A. Schaffer, Graph Spanners, J. of Graph Theory 13, 1989, 99–116.

    Google Scholar 

  10. 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, 144–147.

    Article  Google Scholar 

  11. R. G. Gallager, P. A. Humblet and P. M. Spira, A Distributed Algorithm for Minimum-Weight Spanning Trees, ACM Transactions on Programming Languages and Systems 5, 1983, 66–77.

    Article  Google Scholar 

  12. N. Linial and M. Saks, Decomposing Graphs into Regions of Small Diameter, ACM/SIAM symp. on Discrete Algorithms, 1991 pages 320–330.

    Google Scholar 

  13. K.B. Lakshmanan and K. Thulasiraman, On The Use Of Synchronizers For Asynchronous Communication Networks, 2nd WDAG, Amsterdam, July 1987.

    Google Scholar 

  14. D. Peleg, Sparse Graph Partitions, CS89-01, The Weizmann Institute, Feb. 1989.

    Google Scholar 

  15. D. Peleg and J.D. Ullman, An Optimal Synchronizer for the Hypercube, SIAM Journal on computing, Vol 18, No. 4, pp. 740–747, August 1989.

    Article  Google Scholar 

  16. L. Shabtay and A. Segall, Active and Passive Synchronizers, TR-706, December 1991, Computer Science Department, Technion IIT, submitted to NETWORKS.

    Google Scholar 

  17. L. Shabtay and A. Segall, Message Delaying Synchronizers, 5th WDAG, Delphi, October 1991.

    Google Scholar 

  18. L. Shabtay and A. Segall, A Synchronizer with Low Memory Overhead, 14th International Conference on Distributed Computing Systems, Poznan pp. 250–257.

    Google Scholar 

  19. L. Shabtay and A. Segall, On the Memory Overhead of Synchronizers, LPCR Report #9313, May 1993, Computer Science Department, Technion IIT.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science, Technion, Israel Institute of Technology, 32000, Haifa, Israel

    Lior Shabtay & Adrian Segall

Authors
  1. Lior Shabtay
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Adrian Segall
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Gerard Tel Paul Vitányi

Rights and permissions

Reprints and permissions

Copyright information

© 1994 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shabtay, L., Segall, A. (1994). Low complexity network synchronization. In: Tel, G., Vitányi, P. (eds) Distributed Algorithms. WDAG 1994. Lecture Notes in Computer Science, vol 857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020436

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-58449-0

  • Online ISBN: 978-3-540-48799-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation