Implementing three exchange read operations for distributed atomic storage

Chryssis Georgiou, Theophanis Hadjistasi, Nicolas Nicolaou, Alexander A. Schwarzmann

Research output: Contribution to journalArticlepeer-review

Abstract

Communication latency typically dominates the performance of message-passing systems, and consequently defines the efficiency of operations of algorithms implementing atomic read/write objects in asynchronous, crash-prone, message-passing systems. Here latency is measured in terms of the number of communication exchanges (or simply exchanges) involved in each operation. We present four algorithms, two for the single-writer/multiple-reader (SWMR) and two for the multi-writer/multiple-reader (MWMR) settings, that allow reads to take two or three exchanges, advancing the state-of-the-art in this area. Writes take the same number of exchanges as in prior works (i.e., two for SWMR and four for MWMR settings). In contrast with existing efficient implementations, ours come with no constraints on reader participation in both settings, and on the number of writers in the MWMR setting. Correctness of algorithms is rigorously argued. We conclude with an empirical study demonstrating the practicality of the algorithms, and identifying settings in which their read performance, is clearly superior compared to relevant algorithms.

Original languageEnglish (US)
Pages (from-to)97-113
Number of pages17
JournalJournal of Parallel and Distributed Computing
Volume163
DOIs
StatePublished - May 2022

Keywords

  • Atomicity
  • Fault-tolerance
  • Read/write objects
  • Shared memory

ASJC Scopus subject areas

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Implementing three exchange read operations for distributed atomic storage'. Together they form a unique fingerprint.

Cite this