Skip to main content
SpringerLink
Log in

On the Performance of Distributed Lock-Based Synchronization

  • Conference paper
Distributed Computing and Networking (ICDCN 2011)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6522))

Included in the following conference series:

  • 758 Accesses

Abstract

We study the relation between two classical types of distributed locking mechanisms, called token-based locking and permission-based locking, and several distributed data structures which use locking for synchronization. We have proposed, implemented and tested several lock-based distributed data structures, namely, two different types of counters called find&increment and increment&publish, a queue, a stack and a linked list. For each one of them we have determined what is the preferred type of lock to be used as the underling locking mechanism. Furthermore, we have determined which one of the two proposed counters is better to be used either as a stand-alone data structure or when used as a building block for implementing other high level data structures.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Agrawal, D., El-Abbadi, A.: An efficient and fault-tolerant solution for distributed mutual exclusion. ACM Transactions on Computer Systems 9(1), 1–20 (1991)

    Article  Google Scholar 

  2. Bayer, R., Schkolnick, M.: Concurrency operations on B-trees. Acta Informatica 1(1), 1–21 (1977)

    MathSciNet  MATH  Google Scholar 

  3. Carvalho, O.S.F., Roucairol, G.: On mutual exclusion in computer networks. Communications of the ACM 26(2), 146–147 (1983)

    Article  Google Scholar 

  4. Dijkstra, E.W.: Solution of a problem in concurrent programming control. Communications of the ACM 8(9), 569 (1965)

    Article  Google Scholar 

  5. Ellis, C.S.: Distributed data structures: A case study. IEEE Transactions on Computers c-34(12), 1178–1185 (1985)

    Article  Google Scholar 

  6. Herlihy, M.P., Wing, J.M.: Linearizability: a correctness condition for concurrent objects. ACM Trans. on Programming Languages and Systems 12(3), 463–492 (1990)

    Article  Google Scholar 

  7. Ibaraki, T., Kameda, T.: A theory of coteries: Mutual exclusion in distributed systems. IEEE Transactions on Parallel and Distributed Systems 4(7), 779–794 (1993)

    Article  Google Scholar 

  8. Lamport, L.: Time, clocks, and the order of events in a distributed system. Communications of the ACM 21(7), 558–565 (1978)

    Article  MATH  Google Scholar 

  9. Lehman, P.L., Yao, S.B.: Efficient locking for concurrent operations on B-trees. ACM Transactions on Database Systems 6(4), 650–670 (1981)

    Article  MATH  Google Scholar 

  10. Maekawa, M.: A \(\sqrt{N}\) algorithm for mutual exclusion in decentralized systems. ACM Transactions on Computer Systems 3(2), 145–159 (1985)

    Article  Google Scholar 

  11. Mishra, S., Srimani, P.K.: Fault-tolerant mutual exclusion algorithms. Journal of Systems and Software 11(2), 111–129 (1990)

    Article  Google Scholar 

  12. Mizuno, M., Mesterenko, M., Kakugawa, H.: Lock-based self-stabilizing distributed mutual exclusion algorithm. In: Proc. 17th Inter. Conf. on Dist. Comp. Systems, pp. 708–716 (1996)

    Google Scholar 

  13. Naimi, M., Trehel, M.: An improvement of the logn distributed algorithm for mutual exclusion. In: Proc. 17th Inter. Conf. on Dist. Comp. Systems, pp. 371–375 (1987)

    Google Scholar 

  14. Neilsen, M.L., Mizuno, M.: A DAG-based algorithm for distributed mutual exclusion. In: Proc. 17th Inter. Conf. on Dist. Comp. Systems, pp. 354–360 (1991)

    Google Scholar 

  15. Neilsen, M.L., Mizuno, M.: Coterie join algorithm. IEEE Transactions on Parallel and Distributed Systems 3(5), 582–590 (1992)

    Article  MathSciNet  Google Scholar 

  16. Peleg, D.: Distributed data structures: A complexity-oriented structure. In: van Leeuwen, J., Santoro, N. (eds.) WDAG 1990. LNCS, vol. 486, pp. 71–89. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

  17. Rangarajan, S., Tripathi, S.K.: A robust distributed mutual exclusion algorithm. In: Toueg, S., Kirousis, L.M., Spirakis, P.G. (eds.) WDAG 1991. LNCS, vol. 579, pp. 295–308. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  18. Raymond, K.: A tree-based algorithm for distributed mutual exclusion. ACM Transactions on Computer Systems 7(1), 61–77 (1989)

    Article  Google Scholar 

  19. Raynal, M.: Algorithms for mutual exclusion. The MIT Press, Cambridge (1986); Translation of: Algorithmique du parallélisme (1984)

    Google Scholar 

  20. Raynal, M.: Simple taxonomy for distributed mutual exclusion algorithms. Operating Systems Review (ACM) 25(2), 47–50 (1991)

    Article  Google Scholar 

  21. Reddy, R.L.N., Gupta, B., Srimani, P.K.: New fault-tolerant distributed mutual exclusion algorithm. In: Proc. of the ACM/SIGAPP Symp. on Applied Computing, pp. 831–839 (1992)

    Google Scholar 

  22. Ricart, G., Agrawala, A.K.: An optimal algorithm for mutual exclusion in computer networks. CACM 24(1), 9–17 (1981); Corrigendum in CACM 24(9), 578 (1981)

    Google Scholar 

  23. Shou, D., Wang, S.D.: A new transformation method for nondominated coterie design. Information Sciences 74(3), 223–246 (1993)

    Article  MATH  Google Scholar 

  24. Singhal, M.: A dynamic information-structure mutual exclusion algorithm for distributed systems. IEEE Transactions on Parallel and Distributed Systems 3(1), 121–125 (1992)

    Article  Google Scholar 

  25. Singhal, M.: A taxonomy of distributed mutual exclusion. Journal of Parallel and Distributed Computing 18(1), 94–101 (1993)

    Article  MATH  Google Scholar 

  26. Singhal, M., Shivaratri, N.G.: Advanced concepts in operating systems: distributed, database and multiprocessor operating systems. McGraw-Hill, Inc., New York (1994)

    Google Scholar 

  27. van de Snepscheut, J.L.A.: Fair mutual exclusion on a graph of processes. Distributed Computing 2, 113–115 (1987)

    Article  Google Scholar 

  28. Suzuki, I., Kasami, T.: A distributed mutual exclusion algorithm. ACM Transactions on Computer Systems 3(4), 344–349 (1985)

    Article  Google Scholar 

  29. Taubenfeld, G.: Synchronization Algorithms and Concurrent Programming, 423 pages. Pearson/Prentice-Hall (2006) ISBN 0-131-97259-6

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. The Interdisciplinary Center, P.O. Box 167, Herzliya, 46150, Israel

    Yuval Lubowich & Gadi Taubenfeld

Authors
  1. Yuval Lubowich
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Gadi Taubenfeld
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Microsoft Research Silicon Valley, 1065 La Avenida – bldg. 6, 94043, Mountain View, CA, USA

    Marcos K. Aguilera

  2. School of Computing, National University of Singapore, COM2-04-25, 15 Computing Drive, 117418, Republic of Singapore

    Haifeng Yu

  3. 458 Coordinated Science Laboratory, University of Illinois at Urbana-Champaign, MC-228, 1308 West Main Street, 61801, Urbana, IL, USA

    Nitin H. Vaidya

  4. Alcatel-Lucent Technologies, Manyata Technology Park, Nagawara, 560045, Bangalore, India

    Vikram Srinivasan

  5. ECE Department, Duke University, 130 Hudson Hall, Box 90291, 27708, Durham, NC, USA

    Romit Roy Choudhury

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lubowich, Y., Taubenfeld, G. (2011). On the Performance of Distributed Lock-Based Synchronization. In: Aguilera, M.K., Yu, H., Vaidya, N.H., Srinivasan, V., Choudhury, R.R. (eds) Distributed Computing and Networking. ICDCN 2011. Lecture Notes in Computer Science, vol 6522. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17679-1_12

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-17679-1_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-17678-4

  • Online ISBN: 978-3-642-17679-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation