Linear-time snapshot using multi-writer multi-reader registers

Inoue, Michiko; Chen, Wei

doi:10.1007/bfb0020429

Cited by 48 publications

(47 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Hence, they are called SWMR snapshot objects. Snapshot objects were the underlying atomic registers are MWMR (Multi-Writer/Multi-Reader) have also been studied (e.g., [5,15,16]). …”

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

“…Hence, they are called SWMR snapshot objects. Snapshot objects were the underlying atomic registers are MWMR (Multi-Writer/Multi-Reader) have also been studied (e.g., [5,15,16]). …”

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

show abstract

“…The cost of each snapshot operation is O(log 3 n) atomic register steps with high probability, where n is the number of processes, even against an adaptive adversary. This is an exponential improvement on the linear cost of the previous best known unrestricted snapshot construction [7,8] and on the linear lower bound for deterministic constructions [9], and does not require limiting the number of updates as in previous sublinear constructions [4]. One of the main ingredients in the construction is a novel randomized helping technique that allows out-of-date processes to obtain up-to-date information without running into covering lower bounds.…”

Section: Introductionmentioning

confidence: 99%

“…The first known wait-free implementations of snapshot from atomic registers [1,2,6] required Θ(n 2 ) steps to carry out a snapshot with n processes; subsequent work [7,8] reduced this cost to O(n), which was shown to be optimal in the worst case for non-blocking deterministic algorithms by Jayanti et al [9].…”

Section: Introductionmentioning

confidence: 99%

Atomic Snapshots in O(log3 n) Steps Using Randomized Helping

Aspnes

Censor-Hillel

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract.A randomized construction of unbounded snapshots objects from atomic registers is given. The cost of each snapshot operation is O(log 3 n) atomic register steps with high probability, where n is the number of processes, even against an adaptive adversary. This is an exponential improvement on the linear cost of the previous best known unrestricted snapshot construction [7,8] and on the linear lower bound for deterministic constructions [9], and does not require limiting the number of updates as in previous sublinear constructions [4]. One of the main ingredients in the construction is a novel randomized helping technique that allows out-of-date processes to obtain up-to-date information without running into covering lower bounds.

show abstract

“…So, the base read/write registers on which its implementation relies are multi-writer/multi-reader atomic registers. Wait-free algorithms implementing multiwriter snapshot objects made up of m base components are described in [3,15,16]. The algorithm described in [15] has a linear cost O(n).…”

Section: Introductionmentioning

confidence: 99%

“…Wait-free algorithms implementing multiwriter snapshot objects made up of m base components are described in [3,15,16]. The algorithm described in [15] has a linear cost O(n). A short survey of algorithms that implement single-writer and multi-writer snapshot objects is presented in [8].…”

Section: Introductionmentioning

confidence: 99%

A Simple Snapshot Algorithm for Multicore Systems

Imbs

Raynal

2011

2011 5th Latin-American Symposium on Dependable Computing

View full text Add to dashboard Cite

An atomic snapshot object is an object that can be concurrently accessed by n asynchronous processes prone to crash. It is made of m components (base atomic registers) and is defined by two operations: an update operation that allows a process to atomically assign a new value to a component and a snapshot operation that atomically reads and returns the values of all the components. To cope with the net effect of concurrency, asynchrony and failures, the algorithm implementing the update operation has to help concurrent snapshot operations in order they can always terminate. This paper presents a new and particularly simple construction of a snapshot object. This construction relies on a new principle, that we call "write first, help later" strategy. This strategy directs an update operation first to write its value and only then computes an helping snapshot value that can be used by a snapshot operation in order to terminate. Interestingly, not only the algorithms implementing the snapshot and update operations are simple and have easy proofs, but they are also efficient in terms of the number of accesses to the underlying atomic registers shared by the processes. An operation costs O(m) in the best case and O(n × m) in the worst case.Key-words: Asynchronous shared memory system, Atomicity, Atomic snapshot, Concurrency, Linearizability, Atomic registers, Process crash, Read/Write atomic register, Wait-freedom. Un algorithme de snapshot simple pour les systèmes multi-coeursRésumé : Ce rapport présente un algorithme de snapshot simple. Contrairement aux algorithmes proposés précédemment, il utilise le principe suivant: pour effectuer une miseà jour d'unélément du snapshot, les processusécrivent d'abord en mémoire partagée la valeur qu'ils veulent affecterà cetélément puis ils calculent une valeur d'aide.

show abstract

Linear-time snapshot using multi-writer multi-reader registers

Cited by 48 publications

References 11 publications

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

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

Atomic Snapshots in O(log3 n) Steps Using Randomized Helping

A Simple Snapshot Algorithm for Multicore Systems

Contact Info

Product

Resources

About