Skip to main content
Springer Nature Link
Log in

Improving dynamic token-based distributed synchronization performance via optimistic broadcasting

  • Conference paper
  • First Online:
Network-Based Parallel Computing Communication, Architecture, and Applications (CANPC 1998)

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

  • 95 Accesses

Abstract

In this paper we propose a new dynamic token-based distributed synchronization algorithm that utilizes a new technique called optimistic broadcasting (optcasting) to improve efficiency. Briefly, an optcast message is a reliable unicast one that can also be heard by nodes other than its designated destination. Our algorithm manages pending token requesters by a distributed queue, and optcasts a direction towards the current queue end to help new requesters finding the queue end more quickly. Simulated experimental results indicate that our optcast algorithm outperforms the already fast Chang-Singhal-Liu (CSL) algorithm by up to 40%, especially for large systems of many processor nodes and under high synchronization loads. In addition, optcasting is highly robust and resistant to message loss, retaining at least 63% (86% if optcasting is also incorporated into acknowledgment messages) coverage even when the message loss rate approaches 100%.

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. Y.I. Chang et al., An Improved O(log(n)) Mutual Exclusion Algorithm for Distributed Systems, Proceedings of 1990 ICPP, pp. III295–302.

    Google Scholar 

  2. C. Fidge, Logical Time in Distributed Computing Systems, Computer, Vol.24 No.8, August 1991, pp. 28–33.

    Article  Google Scholar 

  3. Sally Floyd et al., A Reliable Multicast Framework for Light-weight Sessions and Application Level Framing, ACM SIGCOMM 1995, pp. 342–356.

    Google Scholar 

  4. J. Fowler et al., Causal Distributed Breakpoints, Proc. Of 1990 ICDCS, 1990, pp. 134–141.

    Google Scholar 

  5. C. Jard et al., Dependency Tracking and Filtering in Distributed Computation, Tech. Report No. 851, IRISA, Beaulieu, France.

    Google Scholar 

  6. Theodore Johnson, A Performance Comparison of Fast Distributed Synchronization Algorithms, Tech. Report TR94-032, Dept. of CIS, Univ. of Florida, 1994.

    Google Scholar 

  7. Theodore Johnson et al., A Comparison of Fast and Low Overhead Distributed Priority Locks, Journal of Parallel and Distributed Computing, Vol. 32 No. 1, January 1996, pp. 74–89.

    Article  Google Scholar 

  8. Vinay Kumar, Mbone: Interactive Multimedia on the Internet, Macmillan Publishing, Nov. 1995, ISBN 1-56205-397-3.

    Google Scholar 

  9. L. Lamport, Time, Clocks, and the Ordering of Events in a Distributed System, CACM, Vol. 21 No. 7, 1978, pp. 558–564.

    MATH  Google Scholar 

  10. G. Le Lann, Distributed Systems-Towards a Formal Approach, Proc. IFIP Congress, Toronto, North-Holland Publishing, pp. 155–160.

    Google Scholar 

  11. M.R, Macedonia et al., MBone Provides Audio and Video Across the Internet, Computer, Vol. 27 No. 4, April 1994, pp. 30–36.

    Article  Google Scholar 

  12. M. Maekawa, A Sqrt(n) Algorithm for Mutual Exclusion in Decentralized Systems, ACM Transactions on Computer Systems, Vol. 3, No. 2, pp. 145–159, May 1985

    Article  Google Scholar 

  13. M.L Neilsen et al., A DAG-Based Algorithm for Distributed Mutual Exclusion, Proc. of 1991 ICDCS, pp. 354–360.

    Google Scholar 

  14. M. Ramachandran, M. Singhal: On the Synchronization Mechanisms in Distributed Shared Memory Systems, Technical Report OSU-CISRC-10/94-TR54, 1994.

    Google Scholar 

  15. K. Raymond, A Tree-Based Algorithm for Distributed Mutual Exclusion, ACM Trans, on Computer Systems, Vol. 7 No. 1, 2989, pp. 61–77.

    Article  MathSciNet  Google Scholar 

  16. Michel Raynel et al., Logical Time: Capturing Causality in Distributed Systems, Computer, Feb. 1996, pp. 49–56.

    Article  Google Scholar 

  17. G. Ricart et al., An Optimal Algorithm For Mutual Exclusion in Computer Networks, CACM, 24(1), pp. 9–17, Jan. 1981

    MathSciNet  Google Scholar 

  18. I. Suzuki et al., A Distributed Mutual Exclusion Algorithm, ACM Transaction on Computer Systems, Vol. 3, No. 4, pp. 344–349, 1985

    Article  Google Scholar 

  19. M. Singhal et al., An Efficient Implementation of Vector Clocks, Information Processing Letters, Vol. 43, August, 1992, pp. 47–52.

    Article  MATH  Google Scholar 

  20. M. Singhal: A Taxonomy of Distributed Mutual Exclusion, Journal of Parallel and Distributed Computing, Vol. 18, 1993, pp. 94–101.

    Article  MATH  Google Scholar 

  21. Andrew S. Tananbaum et al., Parallel Programming Using Shared Objects and Broadcasting, Computer, August 1992, pp. 10–20.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Electrical Engineering, National Taiwan University, Taipei, Taiwan, R. O. C.

    Alexander I-Chi Lai & Chin-Laung Lei

Authors
  1. Alexander I-Chi Lai
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chin-Laung Lei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Dhabaleswar K. Panda Craig B. Stunkel

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lai, A.IC., Lei, CL. (1998). Improving dynamic token-based distributed synchronization performance via optimistic broadcasting. In: Panda, D.K., Stunkel, C.B. (eds) Network-Based Parallel Computing Communication, Architecture, and Applications. CANPC 1998. Lecture Notes in Computer Science, vol 1362. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0052212

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64140-7

  • Online ISBN: 978-3-540-69693-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation