The DOI matches its Crossref record; 15 of the 15 references it cites were found in a registry or an index.
Transactional boosting: a methodology for highly-concurrent transactional objects
Abstract
We describe a methodology for transforming a large class of highly-concurrent linearizable objects into highly-concurrent transactional objects. As long as the linearizable implementation satisfies certain regularity properties (informally, that every method has an inverse), we define a simple wrapper for the linearizable implementation that guarantees that concurrent transactions without inherent conflicts can synchronize at the same granularity as the original linearizable implementation.
Overview
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
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
Self-citationTransactional 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
Self-citationShavit, 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
Self-citationTransactional Memory Coherence and Consistency
Hammond, L., Wong, V., Chen, M., Carlstrom, B. D., Davis, J. D., Hertzberg, B., Prabhu, M. K., Wijaya, H., Kozyrakis, C., & Olukotun, K. (2004) · ACM SIGARCH Computer Architecture News · doi:10.1145/1028176.1006711 · Cited by 643
Language support for lightweight transactions
Harris, T., & Fraser, K. A. (2014) · ACM SIGPLAN Notices · doi:10.1145/2641638.2641654 · Cited by 630
Optimistic parallelism requires abstractions
Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., & Chew, L. P. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250759 · Cited by 441
High performance dynamic lock-free hash tables and list-based sets
Michael, M. M. (2002) · Proceedings of the fourteenth annual ACM symposium on Parallel algorithms and architectures · doi:10.1145/564870.564881 · Cited by 413
Cited by
Optimistic parallelism requires abstractions
Kulkarni, M., Pingali, K., Walter, B., Ramanarayanan, G., Bala, K., & Chew, L. P. (2007) · Proceedings of the 28th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1250734.1250759 · Cited by 441
Security, Performance, and Applications of Smart Contracts: A Systematic Survey
Rouhani, S., & Deters, R. (2019) · IEEE Access · doi:10.1109/access.2019.2911031 · Cited by 309
Metadata
- Authors
- Herlihy, M., & Koskinen, E.
- Venue
- Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming
- Publisher
- ACM
- Published
- 2008-02-20
- Pages
- 207-216
- OpenAlex
- W2129458440
- Cited by
- 305
- References
- 15
- FWCI
- 22.16
- Type
- conference paper
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Transactional boosting: a methodology for highly-concurrent transactional objects. https://app.cochat.ai/papers/10.1145/1345206.1345237
- The paper
- Herlihy, M., & Koskinen, E. (2008). Transactional boosting: a methodology for highly-concurrent transactional objects. Proceedings of the 13th ACM SIGPLAN Symposium on Principles and practice of parallel programming. https://doi.org/10.1145/1345206.1345237
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.