TY - GEN
T1 - Upper and lower bounds for deterministic approximate objects
AU - Hendler, Danny
AU - Khattabi, Adnane
AU - Milani, Alessia
AU - Travers, Corentin
N1 - Publisher Copyright:
© 2021 IEEE.
PY - 2021/7/1
Y1 - 2021/7/1
N2 - 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\in \mathbb{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\leq x\leq 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.
AB - 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\in \mathbb{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\leq x\leq 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.
KW - Concurrent data structures
KW - Distributed algorithms
KW - Distributed computing
KW - Fault tolerance
KW - Relaxed specifications
KW - Shared memory
UR - https://www.scopus.com/pages/publications/85117105116
U2 - 10.1109/ICDCS51616.2021.00049
DO - 10.1109/ICDCS51616.2021.00049
M3 - Conference contribution
AN - SCOPUS:85117105116
T3 - Proceedings - International Conference on Distributed Computing Systems
SP - 438
EP - 448
BT - Proceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021
PB - Institute of Electrical and Electronics Engineers
T2 - 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021
Y2 - 7 July 2021 through 10 July 2021
ER -