Intermediate value linearizability: a quantitative correctness criterion

DOI10.1145/3584699MaRDI QIDQ7032170zbMATH OpenFDO

Authors Arik Rinberg, Idit Keidar

Publication date 5 February 2025

Published in Journal of the ACM (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/3584699

zbMATH Keywords

concurrencyconcurrent objectslinearizability

Mathematics Subject Classification ID

Data structures (68P05) Computational aspects of data analysis and big data (68T09) Distributed algorithms (68W15)

Cites work

• A comparative study of parallel and sequential priority queue algorithms
• Algorithms for distributed functional monitoring
• An improved data stream summary: the count-min sketch and its applications
• Approximate counting: a detailed analysis
• Counting large numbers of events in small registers
• Database Theory - ICDT 2005
• Design and implementation of an efficient priority queue
• Linearizable implementations do not suffice for randomized distributed computation
• Mergeable summaries
• On interprocess communication. II: Algorithms
• Probabilistic counting algorithms for data base applications
• Quantitative relaxation of concurrent data structures
• Strongly Linearizable Implementations of Snapshots and Other Types
• Synopses for massive data: samples, histograms, wavelets, sketches
• The complexity of updating multi-writer snapshot objects
• The time complexity of updating snapshot memories
• Unifying Concurrent Objects and Distributed Tasks

This page was built for publication: Intermediate value linearizability: a quantitative correctness criterion

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7032170)