The DOI matches its OpenAlex record; 17 of the 17 references it cites were found in a registry or an index.
Practical lock-freedom
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Communicating Sequential Processes
Hoare, T. (1985) · Cited by 9,016
Impossibility of distributed consensus with one faulty process
Fischer, M. J., Lynch, N. A., & Paterson, M. S. (1985) · Journal of the ACM · doi:10.1145/3149.214121 · Cited by 4,579
Linearizability: a correctness condition for concurrent objects
Herlihy, M. P., & Wing, J. M. (1990) · ACM Transactions on Programming Languages and Systems · doi:10.1145/78969.78972 · Cited by 3,176
How to Make a Multiprocessor Computer That Correctly Executes Multiprocess Programs
Lamport (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675439 · Cited by 2,519
Transactional memory: architectural support for lock-free data structures
Herlihy, M., & Moss, J. E. B. (1993) · Proceedings of the 20th annual international symposium on Computer architecture - ISCA '93 · doi:10.1145/165123.165164 · Cited by 2,141
On optimistic methods for concurrency control
Kung, H. T., & Robinson, J. T. (1981) · ACM Transactions on Database Systems · doi:10.1145/319566.319567 · Cited by 1,439
Communicating Sequential Processes
Hoare, C. A. R. (1978) · Springer eBooks · doi:10.1007/978-1-4757-3472-0_16 · Cited by 1,426
Shavit, N., & Touitou, D. (1995) · doi:10.1145/224964.224987 · Cited by 1,197
Skip lists: a probabilistic alternative to balanced trees
Pugh, W. (1990) · Communications of the ACM · doi:10.1145/78973.78977 · Cited by 1,165
Software transactional memory for dynamic-sized data structures
Herlihy, M. P., Luchangco, V., Moir, M., & Scherer, W. N. (2003) · doi:10.1145/872035.872048 · Cited by 984
Language support for lightweight transactions
Harris, T., & Fraser, K. A. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641654 · Cited by 630
Self-citationScheduler activations: effective kernel support for the user-level management of parallelism
Anderson, T. E., Bershad, B. N., Lazowska, E. D., & Levy, H. M. (1992) · ACM Transactions on Computer Systems · doi:10.1145/146941.146944 · Cited by 431
The Sparc Architecture Manual/Version 9
Weaver, D. L., & Gremond, T. (1994) · Cited by 324
Process structuring, synchronization, and recovery using atomic actions
Lomet, D. B. (1977) · ACM SIGOPS Operating Systems Review · doi:10.1145/390018.808319 · Cited by 173
Apologizing versus asking permission: optimistic concurrency control for abstract data types
Herlihy, M. P. (1990) · ACM Transactions on Database Systems · doi:10.1145/77643.77647 · Cited by 134
Concurrent Search and Insertion in AVL Trees
Ellis, E. (1980) · IEEE Transactions on Computers · doi:10.1109/tc.1980.1675680 · Cited by 93
Cited by
Parallel Programmability and the Chapel Language
Chamberlain, B. L., Callahan, D., & Zima, H. P. (2007) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342007078442 · Cited by 879
Cache craftiness for fast multicore key-value storage
Mao, Y., Kohler, E., & Morris, R. T. (2012) · Proceedings of the 7th ACM european conference on Computer Systems · doi:10.1145/2168836.2168855 · Cited by 467
Kuper, L., Turon, A., Krishnaswami, N. R., & Newton, R. R. (2014) · Proceedings of the 41st ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages · doi:10.1145/2535838.2535842 · Cited by 46
Metadata
- Authors
- Fraser, K. A.
- Venue
- OpenGrey (Institut de l'Information Scientifique et Technique)
- Publisher
- Institut de l'Information Scientifique et Technique
- Published
- 2021-04-12
- OpenAlex
- W2187800381
- Cited by
- 458
- References
- 17
- Type
- dissertation
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.