Reliable communication in the presence of failures
ACM Transactions on Computer Systems (TOCS)
Early-delivery atomic broadcast
PODC '90 Proceedings of the ninth annual ACM symposium on Principles of distributed computing
The Totem single-ring ordering and membership protocol
ACM Transactions on Computer Systems (TOCS)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
Time, clocks, and the ordering of events in a distributed system
Communications of the ACM
On the Quality of Service of Failure Detectors
DSN '00 Proceedings of the 2000 International Conference on Dependable Systems and Networks (formerly FTCS-30 and DCCA-8)
Proceedings of the 13th International Symposium on Distributed Computing
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A Modular Approach to Fault-Tolerant Broadcasts and Related Problems
A gossip-style failure detection service
Middleware '98 Proceedings of the IFIP International Conference on Distributed Systems Platforms and Open Distributed Processing
Solving Agreement Problems with Weak Ordering Oracles
EDCC-4 Proceedings of the 4th European Dependable Computing Conference on Dependable Computing
Failure Detection Lower Bounds on Registers and Consensus
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Brief announcement: on the inherent cost of generic broadcast
Proceedings of the twenty-third annual ACM symposium on Principles of distributed computing
Handling message semantics with Generic Broadcast protocols
Distributed Computing
Total order broadcast and multicast algorithms: Taxonomy and survey
ACM Computing Surveys (CSUR)
Journal of Parallel and Distributed Computing
Deterministic Models of Communication Faults
MFCS '08 Proceedings of the 33rd international symposium on Mathematical Foundations of Computer Science
Solving Atomic Multicast When Groups Crash
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
A step towards a new generation of group communication systems
Proceedings of the ACM/IFIP/USENIX 2003 International Conference on Middleware
Tight failure detection bounds on atomic object implementations
Journal of the ACM (JACM)
Semi-passive replication and Lazy Consensus
Journal of Parallel and Distributed Computing
The failure detector abstraction
ACM Computing Surveys (CSUR)
Group communication: from practice to theory
SOFSEM'06 Proceedings of the 32nd conference on Current Trends in Theory and Practice of Computer Science
Low-latency atomic broadcast in the presence of contention
DISC'06 Proceedings of the 20th international conference on Distributed Computing
DISC'05 Proceedings of the 19th international conference on Distributed Computing
Dependable Systems
Modular approach to replication for availability
Replication
Byzantine fault-tolerance with commutative commands
OPODIS'11 Proceedings of the 15th international conference on Principles of Distributed Systems
Surviving congestion in geo-distributed storage systems
USENIX ATC'12 Proceedings of the 2012 USENIX conference on Annual Technical Conference
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
ACM SIGOPS 24th Symposium on Operating Systems Principles
There is more consensus in Egalitarian parliaments
Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles
Scalable service-oriented replication with flexible consistency guarantee in the cloud
Information Sciences: an International Journal
| Hi-index | 0.00 |
We consider the problem of generic broadcast in asynchronous systems with crashes, a problem that was first studied in [12]. Roughly speaking, given a "conflict" relation on the set of messages, generic broadcast ensures that any two messages that conflict are delivered in the same order; messages that do not conflict may be delivered in different order. In this paper, we define what it means for an implementation generic broadcast to be "thrifty", and give corresponding implementations that are optimal in terms of resiliency. We also give an interesting application of our results regarding the implementation of atomic broadcast.