Contention-sensitive data structures and algorithms

DOI10.1016/j.tcs.2017.03.017zbMath1370.68065OpenAlexW2597711081MaRDI QIDQ526873

Gadi Taubenfeld

Publication date: 15 May 2017

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2017.03.017

zbMATH Keywords

synchronizationinterferencewait-freelocks\(k\)-obstruction-freecontention-sensitivedisable-freelivelockprevention-freeshortcut codestarvation

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Data structures (68P05)

Related Items (1)

The computational structure of progress conditions and shared objects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Concurrency of operations on B-trees
• Possibility and impossibility results in a shared memory environment
• Wait-free algorithms for fast, long-lived renaming
• The weakest failure detectors to boost obstruction-freedom
• Waiting in concurrent algorithms
• Timeliness-based wait-freedom
• Concurrent Programming: Algorithms, Principles, and Foundations
• Efficient Transformations of Obstruction-Free Algorithms into Non-blocking Algorithms
• Contention-Sensitive Data Structures and Algorithms
• Impossibility of distributed consensus with one faulty process
• How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
• Concurrent manipulation of binary search trees
• Efficient locking for concurrent operations on B-trees
• Toward a theory of transactional contention managers
• Software transactional memory
• Distributed Computing
• Distributed Computing
• Principles of Distributed Systems
• Distributed Computing
• Distributed Computing

This page was built for publication: Contention-sensitive data structures and algorithms