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žené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 677; s. 41 - 55
Hlavný autor:	Taubenfeld, Gadi
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 16.05.2017
Predmet:	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 prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!