Concurrent Programming: Algorithms, Principles, and Foundations

Raynal, Michel

doi:10.1007/978-3-642-32027-9

Cited by 138 publications

(128 citation statements)

References 0 publications

Supporting

Mentioning

128

Contrasting

Order By: Relevance

“…Since its introduction, the renaming problem has been extensively studied (see for example [5,10,19]). It was initially introduced as a non-adaptive problem in which processes just need to pick distinct output names in the space [1, .…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

Asynchronous Coordination Under Preferences and Constraints

Castañeda¹,

Fraigniaud

Gafni³

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Section: Related Workmentioning

confidence: 99%

“…. , p k [5,19]. Processes are asynchronous, communicate by writing and reading from a reliable shared memory, and any set of processes may crash.…”

Section: Computational Modelmentioning

confidence: 99%

Asynchronous Coordination Under Preferences and Constraints

Castañeda¹,

Fraigniaud

Gafni³

et al. 2016

Lecture Notes in Computer Science

View full text Add to dashboard Cite

“…The first (which is given the name alpha in [13,22]) has been proposed by Lamport in [17] in the context of message-passing systems and adapted to the read/write shared memory model by Lamport & Gafni [10]. An alpha object is a round-based abstraction 1 which is implemented with an array of n shared single-writer/multi-reader registers where n is the total number of processes.…”

Section: On the Implementation Of Consensus Objectsmentioning

confidence: 99%

“…Wait-free implementations of store-collect objects Such implementations are described in several papers (see Chapter 7 of [22] for a survey). The implementations described in [1,2] are based on atomic read/write registers.…”

Section: Cooperation Modelmentioning

confidence: 99%

From a Store-Collect Object and Ω to Efficient Asynchronous Consensus

Raynal

Stainer

2012

Euro-Par 2012 Parallel Processing

Self Cite

View full text Add to dashboard Cite

This paper presents an efficient algorithm that builds a consensus object. This algorithm is based on an Ω failure detector (to obtain consensus liveness) and a store-collect object (to maintain its safety). A store-collect object provides the processes with two operations, a store operation which allows the invoking process to deposit a new value while discarding the previous value it has deposited and a collect operation that returns to the invoking process a set of pairs (i, val) where val is the last value deposited by the process p i . A store-collect object has no sequential specification.While store-collect objects have been used as base objects to design wait-free constructions of more sophisticated objects (such as snapshot or renaming objects), as far as we know, they have not been explicitly used to built consensus objects. The proposed storecollect-based algorithm, which is round-based, has several noteworthy features. First it uses a single store-collect object (and not an object per round). Second, during a round, a process invokes at most once the store operation and the value val it deposits is a simple pair r, v where r is a round number and v a proposed value. Third, a process is directed to skip rounds according to its view of the current global state (thereby saving useless computation rounds). Finally, the algorithm benefits from the adaptive wait-free implementations that have been proposed for store-collect objects, namely, the number of shared memory accesses involved in a collect operation is O(k) where k is the number of processes that have invoked the store operation. This makes the proposed algorithm particularly efficient and interesting for multiprocess programs made up of asynchronous crash-prone processes that run on top of multicore architectures. Key-words:asynchronous shared memory system, building block, concurrent object, consensus, distributed algorithm, eventual leader, failure detector, fault-tolerance, modularity, multicore system, process crash, store-collect object Consensus asynchrone efficace à partir des objets distribués Ω et Store-collect Résumé : Cet article présente un algorithme efficace qui implémente un objet consensus sans attente (wait-free). Cet algorithme s'appuie sur un détecteur de fautes Ω pour garantir la vivacité du consensus et sur un objet store-collect qui en assure la sûreté. Cette approche permet de bénéficier des implémentations adaptatives existantes de l'objet store-collect, ce qui fait de l'algorithme proposé une alternative intéressante pour résoudre le problème du consensus dans les systèmes asynchrones sujets aux défaillances construits sur des architectures multiprocesseur.

show abstract

“…[7,20,26,28]). This comes from the fact that a snapshot object allows processes to define and use consistent global states of a read/write-based com-putation: each process deposits the relevant part of its local state in the snapshot object, and can then obtain consistent global states by invoking the operation snapshot().…”

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

Self Cite

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

Concurrent Programming: Algorithms, Principles, and Foundations

Cited by 138 publications

References 0 publications

Asynchronous Coordination Under Preferences and Constraints

Asynchronous Coordination Under Preferences and Constraints

From a Store-Collect Object and Ω to Efficient Asynchronous Consensus

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

Contact Info

Product

Resources

About