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...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 677; pp. 41 - 55
Main Author:	Taubenfeld, Gadi
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 16.05.2017
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!