On the performance of distributed lock-based synchronization

Yuval Lubowich, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


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.

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 12th International Conference, ICDCN 2011, Proceedings
Number of pages12
StatePublished - 2011
Externally publishedYes
Event12th International Conference on Distributed Computing and Networking, ICDCN 2011 - Bangalore, India
Duration: 2 Jan 20115 Jan 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6522 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference12th International Conference on Distributed Computing and Networking, ICDCN 2011


  • Locking
  • distributed data structures
  • distributed mutual exclusion
  • message passing
  • performance analysis
  • synchronization


Dive into the research topics of 'On the performance of distributed lock-based synchronization'. Together they form a unique fingerprint.

Cite this