Skip to Main content Skip to Navigation
Conference papers

Upper and Lower Bounds for Deterministic Approximate Objects

Abstract : Relaxing the sequential specification of shared objects has been proposed as a promising approach to obtain implementations with better complexity. In this paper, we study the step complexity of relaxed variants of two common shared objects: max registers and counters. In particular, we consider the k-multiplicative-accurate max register and the k-multiplicative-accurate counter, where read operations are allowed to err by a multiplicative factor of k (for some k ∈ N). More accurately, reads are allowed to return an approximate value x of the maximum value v previously written to the max register, or of the number v of increments previously applied to the counter, respectively, such that v/k ≤ x ≤ v • k. We provide upper and lower bounds on the complexity of implementing these objects in a wait-free manner in the shared memory model.
Document type :
Conference papers
Complete list of metadata
Contributor : Adnane Khattabi <>
Submitted on : Wednesday, April 28, 2021 - 3:51:43 PM
Last modification on : Friday, April 30, 2021 - 3:22:17 AM


Files produced by the author(s)


  • HAL Id : hal-03202712, version 2



Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers. Upper and Lower Bounds for Deterministic Approximate Objects. 41st IEEE International Conference on Distributed Computing Systems (ICDCS21), Jul 2021, Washington (virtual), United States. ⟨hal-03202712v2⟩



Record views


Files downloads