Unleashing and speeding up readers in atomic object implementations

Chryssis Georgiou, Theophanis Hadjistasi, Nicolas Nicolaou, Alexander Allister Schwarzmann

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Providing efficient emulations of atomic read/write objects in asynchronous, crash-prone, message-passing systems is an important problem in distributed computing. Communication latency is a factor that typically dominates the performance of message-passing systems, consequently the efficiency of algorithms implementing atomic objects is measured in terms of the number of communication exchanges involved in each read and write operation. The seminal result of Attiya, Bar-Noy, and Dolev established that two pairs of communication exchanges, or equivalently two round-trip communications, are sufficient. Subsequent research examined the possibility of implementations that involve less than four exchanges. The work of Dutta et al. showed that for single-writer/multiple-reader (SWMR) settings two exchanges are sufficient, provided that the number of readers is severely constrained with respect to the number of object replicas in the system and the number of replica failures, and also showed that no two-exchange implementations of multiple-writer/multiple-reader (MWMR) objects are possible. Later research focused on providing implementations that remove the constraint on the number of readers, while having read and write operations that use variable number of communication exchanges, specifically two, three, or four exchanges. This work presents two advances in the state-of-the-art in this area. Specifically, for SWMR and MWMR systems algorithms are given in which read operations take two or three exchanges. This improves on prior works where read operations took either (a) three exchanges, or (b) two or four exchanges. The number of readers in the new algorithms is unconstrained, and write operations take the same number of exchanges as in prior work (two for SWMR and four for MWMR settings). The correctness of algorithms is rigorously argued. The paper presents an empirical study using the NS3 simulator that compares the performance of relevant algorithms, demonstrates the practicality of the new algorithms, and identifies settings in which their performance is clearly superior.

Original languageEnglish (US)
Title of host publicationNetworked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers
EditorsAndreas Podelski, François Taïani
PublisherSpringer Verlag
Pages175-190
Number of pages16
ISBN (Print)9783030055288
DOIs
StatePublished - Jan 1 2019
Externally publishedYes
Event6th International Conference on Networked Systems, NETYS 2018 - Essaouira, Morocco
Duration: May 9 2018May 11 2018

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11028 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other6th International Conference on Networked Systems, NETYS 2018
CountryMorocco
CityEssaouira
Period5/9/185/11/18

Fingerprint

Communication
Message passing
Message Passing
Replica
Distributed computer systems
Object
Computer systems
Simulators
Sufficient
Emulation
Crash
Distributed Computing
Empirical Study
Latency
Correctness
Simulator
Demonstrate

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Georgiou, C., Hadjistasi, T., Nicolaou, N., & Schwarzmann, A. A. (2019). Unleashing and speeding up readers in atomic object implementations. In A. Podelski, & F. Taïani (Eds.), Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers (pp. 175-190). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11028 LNCS). Springer Verlag. https://doi.org/10.1007/978-3-030-05529-5_12

Unleashing and speeding up readers in atomic object implementations. / Georgiou, Chryssis; Hadjistasi, Theophanis; Nicolaou, Nicolas; Schwarzmann, Alexander Allister.

Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. ed. / Andreas Podelski; François Taïani. Springer Verlag, 2019. p. 175-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 11028 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Georgiou, C, Hadjistasi, T, Nicolaou, N & Schwarzmann, AA 2019, Unleashing and speeding up readers in atomic object implementations. in A Podelski & F Taïani (eds), Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 11028 LNCS, Springer Verlag, pp. 175-190, 6th International Conference on Networked Systems, NETYS 2018, Essaouira, Morocco, 5/9/18. https://doi.org/10.1007/978-3-030-05529-5_12
Georgiou C, Hadjistasi T, Nicolaou N, Schwarzmann AA. Unleashing and speeding up readers in atomic object implementations. In Podelski A, Taïani F, editors, Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. Springer Verlag. 2019. p. 175-190. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/978-3-030-05529-5_12
Georgiou, Chryssis ; Hadjistasi, Theophanis ; Nicolaou, Nicolas ; Schwarzmann, Alexander Allister. / Unleashing and speeding up readers in atomic object implementations. Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers. editor / Andreas Podelski ; François Taïani. Springer Verlag, 2019. pp. 175-190 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{45b8f9b6da1c4d8593c19f555cf85d55,
title = "Unleashing and speeding up readers in atomic object implementations",
abstract = "Providing efficient emulations of atomic read/write objects in asynchronous, crash-prone, message-passing systems is an important problem in distributed computing. Communication latency is a factor that typically dominates the performance of message-passing systems, consequently the efficiency of algorithms implementing atomic objects is measured in terms of the number of communication exchanges involved in each read and write operation. The seminal result of Attiya, Bar-Noy, and Dolev established that two pairs of communication exchanges, or equivalently two round-trip communications, are sufficient. Subsequent research examined the possibility of implementations that involve less than four exchanges. The work of Dutta et al. showed that for single-writer/multiple-reader (SWMR) settings two exchanges are sufficient, provided that the number of readers is severely constrained with respect to the number of object replicas in the system and the number of replica failures, and also showed that no two-exchange implementations of multiple-writer/multiple-reader (MWMR) objects are possible. Later research focused on providing implementations that remove the constraint on the number of readers, while having read and write operations that use variable number of communication exchanges, specifically two, three, or four exchanges. This work presents two advances in the state-of-the-art in this area. Specifically, for SWMR and MWMR systems algorithms are given in which read operations take two or three exchanges. This improves on prior works where read operations took either (a) three exchanges, or (b) two or four exchanges. The number of readers in the new algorithms is unconstrained, and write operations take the same number of exchanges as in prior work (two for SWMR and four for MWMR settings). The correctness of algorithms is rigorously argued. The paper presents an empirical study using the NS3 simulator that compares the performance of relevant algorithms, demonstrates the practicality of the new algorithms, and identifies settings in which their performance is clearly superior.",
author = "Chryssis Georgiou and Theophanis Hadjistasi and Nicolas Nicolaou and Schwarzmann, {Alexander Allister}",
year = "2019",
month = "1",
day = "1",
doi = "10.1007/978-3-030-05529-5_12",
language = "English (US)",
isbn = "9783030055288",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "175--190",
editor = "Andreas Podelski and Fran{\cc}ois Ta{\"i}ani",
booktitle = "Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers",

}

TY - GEN

T1 - Unleashing and speeding up readers in atomic object implementations

AU - Georgiou, Chryssis

AU - Hadjistasi, Theophanis

AU - Nicolaou, Nicolas

AU - Schwarzmann, Alexander Allister

PY - 2019/1/1

Y1 - 2019/1/1

N2 - Providing efficient emulations of atomic read/write objects in asynchronous, crash-prone, message-passing systems is an important problem in distributed computing. Communication latency is a factor that typically dominates the performance of message-passing systems, consequently the efficiency of algorithms implementing atomic objects is measured in terms of the number of communication exchanges involved in each read and write operation. The seminal result of Attiya, Bar-Noy, and Dolev established that two pairs of communication exchanges, or equivalently two round-trip communications, are sufficient. Subsequent research examined the possibility of implementations that involve less than four exchanges. The work of Dutta et al. showed that for single-writer/multiple-reader (SWMR) settings two exchanges are sufficient, provided that the number of readers is severely constrained with respect to the number of object replicas in the system and the number of replica failures, and also showed that no two-exchange implementations of multiple-writer/multiple-reader (MWMR) objects are possible. Later research focused on providing implementations that remove the constraint on the number of readers, while having read and write operations that use variable number of communication exchanges, specifically two, three, or four exchanges. This work presents two advances in the state-of-the-art in this area. Specifically, for SWMR and MWMR systems algorithms are given in which read operations take two or three exchanges. This improves on prior works where read operations took either (a) three exchanges, or (b) two or four exchanges. The number of readers in the new algorithms is unconstrained, and write operations take the same number of exchanges as in prior work (two for SWMR and four for MWMR settings). The correctness of algorithms is rigorously argued. The paper presents an empirical study using the NS3 simulator that compares the performance of relevant algorithms, demonstrates the practicality of the new algorithms, and identifies settings in which their performance is clearly superior.

AB - Providing efficient emulations of atomic read/write objects in asynchronous, crash-prone, message-passing systems is an important problem in distributed computing. Communication latency is a factor that typically dominates the performance of message-passing systems, consequently the efficiency of algorithms implementing atomic objects is measured in terms of the number of communication exchanges involved in each read and write operation. The seminal result of Attiya, Bar-Noy, and Dolev established that two pairs of communication exchanges, or equivalently two round-trip communications, are sufficient. Subsequent research examined the possibility of implementations that involve less than four exchanges. The work of Dutta et al. showed that for single-writer/multiple-reader (SWMR) settings two exchanges are sufficient, provided that the number of readers is severely constrained with respect to the number of object replicas in the system and the number of replica failures, and also showed that no two-exchange implementations of multiple-writer/multiple-reader (MWMR) objects are possible. Later research focused on providing implementations that remove the constraint on the number of readers, while having read and write operations that use variable number of communication exchanges, specifically two, three, or four exchanges. This work presents two advances in the state-of-the-art in this area. Specifically, for SWMR and MWMR systems algorithms are given in which read operations take two or three exchanges. This improves on prior works where read operations took either (a) three exchanges, or (b) two or four exchanges. The number of readers in the new algorithms is unconstrained, and write operations take the same number of exchanges as in prior work (two for SWMR and four for MWMR settings). The correctness of algorithms is rigorously argued. The paper presents an empirical study using the NS3 simulator that compares the performance of relevant algorithms, demonstrates the practicality of the new algorithms, and identifies settings in which their performance is clearly superior.

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

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

U2 - 10.1007/978-3-030-05529-5_12

DO - 10.1007/978-3-030-05529-5_12

M3 - Conference contribution

SN - 9783030055288

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 175

EP - 190

BT - Networked Systems - 6th International Conference, NETYS 2018, Revised Selected Papers

A2 - Podelski, Andreas

A2 - Taïani, François

PB - Springer Verlag

ER -