Space-efficient asynchronous consensus without shared memory initialization
From MaRDI portal
Recommendations
- Fast randomized consensus using shared memory
- Space-Optimal, Wait-Free Real-Time Synchronization
- Using asynchrony and zero degradation to speed up indulgent consensus protocols
- An asynchronous protocol for release consistent distributed shared memory systems
- A tight space bound for consensus
- A tight space bound for consensus
Cites work
- scientific article; zbMATH DE number 3819094 (Why is no real title available?)
- Easy impossibility proofs for distributed consensus problems
- Impossibility of distributed consensus with one faulty process
- On the minimal synchronism needed for distributed consensus
- Self-stabilizing systems in spite of distributed control
Cited in
(11)- On the power of shared object types to implement one-resilient consensus
- A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
- Brief announcement: Computing in the presence of weak crash failures
- The synchronization power of atomic bitwise operations
- Fast randomized consensus using shared memory
- scientific article; zbMATH DE number 1305392 (Why is no real title available?)
- A tight space bound for consensus
- At-Most-Once Semantics in Asynchronous Shared Memory
- Brief announcement: Reaching approximate consensus when everyone may crash
- The epigenetic consensus problem
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
This page was built for publication: Space-efficient asynchronous consensus without shared memory initialization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1209330)
