@inproceedings{4cfbac41315448bf96e936bd87d5b688,
title = "Contention-sensitive data structures and algorithms",
abstract = "A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in the common cases, when there is no contention, or when processes with non-interfering operations access it concurrently. When a process invokes an operation on a contention-sensitive data structure, in the absence of contention or interference, the process must be able to complete its operation in a small number of steps and without using locks. Using locks is permitted only when there is interference. We formally define the notion of contention-sensitive data structures, propose four general transformations that facilitate devising such data structures, and illustrate the benefits of the approach by implementing a contention-sensitive consensus algorithm, a contention-sensitive double-ended queue data structure, and a contention-sensitive election algorithm. Finally, we generalize the result to enable to avoid locking also when contention is low.",
keywords = "Contention-sensitive, Disable-free, K-obstruction-free, Livelock, Locks, Prevention-free, Shortcut code, Starvation, Synchronization, Wait-free",
author = "Gadi Taubenfeld",
year = "2009",
doi = "10.1007/978-3-642-04355-0_17",
language = "אנגלית",
isbn = "3642043542",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "157--171",
booktitle = "Distributed Computing - 23rd International Symposium, DISC 2009, Proceedings",
note = "23rd International Symposium on Distributed Computing, DISC 2009 ; Conference date: 23-09-2009 Through 25-09-2009",
}