Low-latency Atomic Broadcast in the Presence of Contention

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

• Piotr Zieliński, Cavendish Laboratory, University of Cambridge
• Tuesday 17 October 2006, 14:30-15:30
• Room FW11, Computer Laboratory, William Gates Building.

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.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Cambridge talks
• Computer Laboratory Opera Group Seminars
• Department of Computer Science and Technology talks and seminars
• Interested Talks
• Room FW11, Computer Laboratory, William Gates Building
• School of Technology
• Trust & Technology Initiative - interesting events
• bld31

Note that ex-directory lists are not shown.