Fast randomized consensus using shared memory
From MaRDI portal
Publication:3485848
Recommendations
- Fast and simple distributed consensus
- Communication-efficient randomized consensus
- Space-efficient asynchronous consensus without shared memory initialization
- Fast deterministic consensus in a noisy environment
- Faster randomized consensus with an oblivious adversary
- Faster randomized consensus with an oblivious adversary
- Randomized protocols for asynchronous consensus
Cited in
(51)- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- \(L^\ast\)-based learning of Markov decision processes (extended version)
- A complexity-based classification for multiprocessor synchronization
- Minimal counterexamples for linear-time probabilistic verification
- Fast deterministic consensus in a noisy environment
- Verification of the randomized consensus algorithm of Aspnes and Herlihy: a case study
- The complexity of synchronizing Markov decision processes
- Anonymous obstruction-free \((n,k)\)-set agreement with \(n-k+1\) atomic read/write registers
- Fast deterministic consensus in a noisy environment
- Randomized consensus in expected \(O(n \log n)\) individual work
- Optimal schedulers vs optimal bases: an approach for efficient exact solving of Markov decision processes
- On atomic registers and randomized consensus in m\&m systems
- Approximate shared-memory counting despite a strong adversary
- Atomic snapshots using lattice agreement
- The strong at-most-once problem
- Scenario-based verification of uncertain MDPs
- Efficient execution of nondeterministic parallel programs on asynchronous systems
- Farkas certificates and minimal witnesses for probabilistic reachability constraints
- On the importance of having an identity or, is consensus really universal?
- Coupling and self-stabilization
- An inductive technique for parameterised model checking of degenerative distributed randomised protocols
- scientific article; zbMATH DE number 2081023 (Why is no real title available?)
- Task-structured probabilistic I/O automata
- Sequential convex programming for the efficient verification of parametric MDPs
- Deniable Functional Encryption
- Compositional probabilistic verification through multi-objective model checking
- On the use of MTBDDs for performability analysis and verification of stochastic systems.
- Naming symmetric processes using shared variables
- A partial equivalence between shared-memory and message-passing in an asynchronous fail-stop distributed environment
- Randomized consensus in expected \(O(n ^{2})\) total work using single-writer registers
- A modular approach to shared-memory consensus, with applications to the probabilistic-write model
- A tight space bound for consensus
- Randomized consensus with regular registers
- The space complexity of unbounded timestamps
- Communication-efficient randomized consensus
- Does a Program Yield the Right Distribution?
- Faster randomized consensus with an oblivious adversary
- Randomized registers and iterative algorithms
- Long-lived counters with polylogarithmic amortized step complexity
- Error bounds for stochastic shortest path problems
- Space-efficient asynchronous consensus without shared memory initialization
- The correctness proof of Ben-Or's randomized consensus algorithm
- Randomized two-process wait-free test-and-set
- Deciding probabilistic bisimilarity distance one for probabilistic automata
- Parameter-Independent Strategies for pMDPs via POMDPs
- Combining shared-coin algorithms
- Randomized protocols for asynchronous consensus
- Faster randomized consensus with an oblivious adversary
- The epigenetic consensus problem
- Efficient low-contention asynchronous consensus with the value-oblivious adversary scheduler
- Probabilistic black-box reachability checking (extended version)
This page was built for publication: Fast randomized consensus using shared memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3485848)
