Fast Access to Distributed Atomic Memory

Dutta, Partha; Guerraoui, Rachid; Levy, Ronnie; Vukolić, Marko

doi:10.1137/090757010

Cited by 25 publications

(52 citation statements)

References 18 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, the reader in [9] needs to write (i.e., modify the objects' state) as dictated by the lower bound of [12] which showed that every atomic read must write into at least t objects. [10] extends the result of [9] to the Byzantine failure model assuming authenticated (i.e., digitally signed) data and established the impossibility of fast crash-tolerant multiwriter multi-reader (MWMR) atomic register implementations. This result is in line with classical MWMR implementations such as [22] that have read/write latency of at least 2 rounds.…”

Section: Related Workmentioning

confidence: 72%

The complexity of robust atomic storage

Dobre¹,

Guerraoui

Majuntke³

et al. 2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

We study the time-complexity of robust atomic read/write storage from fault-prone storage components in asynchronous message-passing systems. Robustness here means waitfree tolerating the largest possible number t of Byzantine storage component failures (optimal resilience) without relying on data authentication. We show that no single-writer multiple-reader (SWMR) robust atomic storage implementation exists if (a) read operations complete in less than four communication round-trips (rounds), and (b) the timecomplexity of write operations is constant. More precisely, we present two lower bounds. The first is a read lower bound stating that three rounds of communication are necessary to read from a SWMR robust atomic storage. The second is a write lower bound, showing that Ω(log(t)) write rounds are necessary to read in three rounds from such a storage. Applied to known results, our lower bounds close a fundamental gap: we show that time-optimal robust atomic storage can be obtained using well-known transformations from regular to atomic storage and existing time-optimal regular storage implementations.

show abstract

Section: Related Workmentioning

confidence: 72%

The complexity of robust atomic storage

Dobre¹,

Guerraoui

Majuntke³

et al. 2011

Proceedings of the 30th Annual ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…. , reg(m) be the arrays received at the previous line; (11) for Algorithm implementing the operation snapshot(): client side As previously, this algorithm is decomposed in two parts. The part described at lines 7-13 is executed by the invoking process p i (client), while lines 16-17 are executed by all processes (in their server role).…”

Section: Local Variables Initializationmentioning

confidence: 99%

“…Many constructions of atomic read/write registers on top of message-passing systems have been proposed (e.g., [3,7,11,20,22,23,24,25] to cite a few). They differ in the type and the number of failures they tolerate, the number of messages they need to implement a read or a write operation, the size of control information carried by these implementation messages, and the time complexity of each operation [27].…”

Section: Introductionmentioning

confidence: 99%

Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems

Delporte-Gallet

Fauconnier

Rajsbaum³

et al. 2016

Algorithms and Architectures for Parallel Processing

View full text Add to dashboard Cite

Distributed snapshots, as introduced by Chandy and Lamport in the context of asynchronous failure-free message-passing distributed systems, are consistent global states in which the observed distributed application might have passed through. It appears that two such distributed snapshots cannot necessarily be compared (in the sense of determining which one of them is the "first"). Differently, snapshots introduced in asynchronous crash-prone read/write distributed systems are totally ordered, which greatly simplify their use by upper layer applications.In order to benefit from shared memory snapshot objects, it is possible to simulate a read/write shared memory on top of an asynchronous crash-prone message-passing system, and build then snapshot objects on top of it. This algorithm stacking is costly in both time and messages. To circumvent this drawback, this paper presents algorithms building snapshot objects directly on top of asynchronous crash-prone message-passing system. "Directly" means here "without building an intermediate layer such as a read/write shared memory". To the authors knowledge, the proposed algorithms are the first providing such constructions. Interestingly enough, these algorithms are efficient and relatively simple.

show abstract

“…. Proof: G v must collect a quorum of proposals for a sequence seq to generate it (lines [12][13][14]. Each server i ∈ v makes a single initial proposal (line 1) and updates it only by processing proposals from other server of v (lines 8 and 10).…”

Section: Lemma 1 (Weak Accuracy) Consider the View Generatorsmentioning

confidence: 99%

Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage

Alchieri

Bessani

Greve

et al. 2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Quorum systems are useful tools for implementing consistent and available storage in the presence of failures. These systems usually comprise a static set of servers that provide a fault-tolerant read/write register accessed by a set of clients. We consider a dynamic variant of these systems and propose FREESTORE, a set of fault-tolerant protocols that emulates a register in dynamic asynchronous systems in which processes are able to join/leave the servers set during the execution. These protocols use a new abstraction called view generators, that captures the agreement requirements of reconfiguration and can be implemented in different system models with different properties. Particularly interesting, we present a reconfiguration protocol that is modular, efficient, consensus-free and loosely coupled with read/write protocols, improving the overall system performance.

show abstract

Fast Access to Distributed Atomic Memory

Cited by 25 publications

References 18 publications

The complexity of robust atomic storage

The complexity of robust atomic storage

Implementing Snapshot Objects on Top of Crash-Prone Asynchronous Message-Passing Systems

Brief Announcement: Decoupled and Consensus-Free Reconfiguration for Fault-Tolerant Storage

Contact Info

Product

Resources

About