Upper and Lower Bounds for Deterministic Approximate Objects

Danny Hendler; Adnane Khattabi; Alessia Milani; Corentin Travers

doi:10.1109/ICDCS51616.2021.00049

Upper and Lower Bounds for Deterministic Approximate Objects

Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

1 Scopus citations

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.

Original language	English
Title of host publication	Proceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	438-448
Number of pages	11
ISBN (Electronic)	9781665445139
DOIs	https://doi.org/10.1109/ICDCS51616.2021.00049
State	Published - 2021
Event	41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021 - Virtual, Washington, United States Duration: 7 Jul 2021 → 10 Jul 2021

Conference

Conference	41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021
Country/Territory	United States
City	Virtual, Washington
Period	7/07/21 → 10/07/21

Keywords

Concurrent data structures
Distributed algorithms
Distributed computing
Fault tolerance
Relaxed specifications
Shared memory

Access to Document

10.1109/ICDCS51616.2021.00049

https://arxiv.org/abs/2104.09902

Cite this

@inproceedings{9b691bb490ab4ae0a3d5b6867984fa74,

title = "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.",

keywords = "Concurrent data structures, Distributed algorithms, Distributed computing, Fault tolerance, Relaxed specifications, Shared memory",

author = "Danny Hendler and Adnane Khattabi and Alessia Milani and Corentin Travers",

note = "Funding Information: Alessia Milani and Corentin Travers are supported by ANR projects Descartes and FREDDA. Adnane Khattabi is supported by UMI Relax. Danny Hendler is supported in part by ISF grant 380/18. Publisher Copyright: {\textcopyright} 2021 IEEE.; 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021 ; Conference date: 07-07-2021 Through 10-07-2021",

year = "2021",

doi = "10.1109/ICDCS51616.2021.00049",

language = "English",

pages = "438--448",

booktitle = "Proceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

address = "United States",

}

Hendler, D, Khattabi, A, Milani, A & Travers, C 2021, Upper and Lower Bounds for Deterministic Approximate Objects. in Proceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021. Institute of Electrical and Electronics Engineers Inc., pp. 438-448, 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021, Virtual, Washington, United States, 7/07/21. https://doi.org/10.1109/ICDCS51616.2021.00049

Upper and Lower Bounds for Deterministic Approximate Objects. / Hendler, Danny; Khattabi, Adnane; Milani, Alessia; Travers, Corentin.

Proceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021. Institute of Electrical and Electronics Engineers Inc., 2021. p. 438-448.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Upper and Lower Bounds for Deterministic Approximate Objects

AU - Hendler, Danny

AU - Khattabi, Adnane

AU - Milani, Alessia

AU - Travers, Corentin

N1 - Funding Information: Alessia Milani and Corentin Travers are supported by ANR projects Descartes and FREDDA. Adnane Khattabi is supported by UMI Relax. Danny Hendler is supported in part by ISF grant 380/18. Publisher Copyright: © 2021 IEEE.

PY - 2021

Y1 - 2021

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∈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.

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∈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.

KW - Concurrent data structures

KW - Distributed algorithms

KW - Distributed computing

KW - Fault tolerance

KW - Relaxed specifications

KW - Shared memory

UR - http://www.scopus.com/inward/record.url?scp=85117105116&partnerID=8YFLogxK

U2 - 10.1109/ICDCS51616.2021.00049

DO - 10.1109/ICDCS51616.2021.00049

M3 - Conference contribution

SP - 438

EP - 448

BT - Proceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021

Y2 - 7 July 2021 through 10 July 2021

ER -

Upper and Lower Bounds for Deterministic Approximate Objects

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this