Database Paper Browser

Back to papers

Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking

Summary: Instruction-by-instruction transformation that converts most lock-based, deadlock-free concurrent data-structure algorithms into nonblocking equivalents while preserving semantics. Constant per-operation overhead and no loss of concurrency in failure-free runs, avoiding wholesale rewrites. (summarized by gpt-5-mini on Feb 09 2026)

Paper ID
968
Venue
PODS
Year
1992
Pagerank
4.1945683e-05
Overall Rank
12,886 | 10.36%
DOI
-

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 2 of 2 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
1,573 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00011295081
5,239 A Framework for the Performance Analysis of Concurrent B-tree Algorithms 1990 PODS 5.6106291e-05
Previous Page 1 / 1 Next

Semantically Similar Papers