University of Cambridge > > Computer Laboratory Opera Group Seminars > Low-latency Atomic Broadcast in the Presence of Contention

Low-latency Atomic Broadcast in the Presence of Contention

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Minor Gordon.

The proposed Atomic Broadcast algorithm can deliver messages in two communication steps, even if multiple processes broadcast at the same time. It tags all broadcast messages with the local real time, and delivers all messages in order of these timestamps. The Ω-elected leader simulates processes it suspects to have crashed (◇S). For fault-tolerance, it uses a new cheap Generic Broadcast algorithm that requires only a majority of correct processes (n > 2f) and, in failure-free runs, delivers all non-conflicting messages in two steps.

Talk slides Paper

This talk is part of the Computer Laboratory Opera Group Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity