Contention-sensitive data structures and algorithms

A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in 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-s...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Theoretical computer science Ročník 677; s. 41 - 55
Hlavní autor: Taubenfeld, Gadi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier B.V 16.05.2017
Témata:
Contention-sensitive
Disable-free
Interference
k-obstruction-free
Livelock
Locks
Prevention-free
Shortcut code
Starvation
Synchronization
Wait-free
Shortcut code
Disable-free
Livelock
Starvation
Interference
k-obstruction-free
Locks
Wait-free
Prevention-free
Synchronization
Contention-sensitive
ISSN:0304-3975, 1879-2294
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:A contention-sensitive data structure is a concurrent data structure in which the overhead introduced by locking is eliminated in 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.
ISSN:0304-3975
1879-2294
DOI:10.1016/j.tcs.2017.03.017