DBScholar

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
967
Venue
PODS
Year
1992
Pagerank
5.093636e-05
Overall Rank
13,080 | 10.26%
DOI
10.1145/137097.137873

Incoming Non-self Citations Over Time

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

Authors

BibTeX Citation

@inproceedings{turek_pods92,
        address = {New York, NY, USA},
        series = {{PODS} '92},
        title = {{Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking}},
        url = {https://dl.acm.org/doi/10.1145/137097.137873},
        doi = {10.1145/137097.137873},
        booktitle = {Proceedings of the {ACM} {SIGMOD} Symposium on {Principles} of {Database} {Systems}},
        publisher = {Association for Computing Machinery},
        author = {Turek, John and Shasha, Dennis and Prakash, Sundeep},
        year = {1992}
}

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,663 Performance of B-Tree Concurrency Control Algorithms 1991 SIGMOD 0.00010073735
5,530 A Framework for the Performance Analysis of Concurrent B-tree Algorithms 1990 PODS 6.1856695e-05
Previous Page 1 / 1 Next

Semantically Similar Papers