Communication patterns and input patterns in distributed computing (invited talk)
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1209147 (Why is no real title available?)
- Algorithmics. The spirit of computing
- Concurrent programming: algorithms, principles, and foundations.
- Conditions on input vectors for consensus solvability in asynchronous distributed systems
- Distributed Algorithms for Message-Passing Systems
- Impossibility of distributed consensus with one faulty process
- Interval consistency of asynchronous distributed computations
- Reaching Agreement in the Presence of Faults
- Rollback-dependency trackability: A minimal characterization and its protocol
- Signature-free asynchronous byzantine consensus with t < n/3 and o(n 2 ) messages
- Synchronous condition-based consensus
- Systolic algorithms as programs
- The Byzantine Generals Problem
- The Combined Power of Conditions and Information on Failures to Solve Asynchronous Set Agreement
- The causal ordering abstraction and a simple way to implement it
- The weakest failure detector for solving consensus
- Time, clocks, and the ordering of events in a distributed system
- Unreliable failure detectors for reliable distributed systems
Cited in
(4)
This page was built for publication: Communication patterns and input patterns in distributed computing (invited talk)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3460703)