Upper and Lower Bounds for Deterministic Approximate Objects

Danny Hendler, Adnane Khattabi, Alessia Milani, Corentin Travers

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-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 languageEnglish
Title of host publicationProceedings - 2021 IEEE 41st International Conference on Distributed Computing Systems, ICDCS 2021
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages438-448
Number of pages11
ISBN (Electronic)9781665445139
DOIs
StatePublished - 2021
Event41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021 - Virtual, Washington, United States
Duration: 7 Jul 202110 Jul 2021

Conference

Conference41st IEEE International Conference on Distributed Computing Systems, ICDCS 2021
Country/TerritoryUnited States
CityVirtual, Washington
Period7/07/2110/07/21

Keywords

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

Fingerprint

Dive into the research topics of 'Upper and Lower Bounds for Deterministic Approximate Objects'. Together they form a unique fingerprint.

Cite this