![[Search]](/static/images/search.gif){kind=small}
![[A-Z Index]](/static/images/az.gif){kind=small}
![[Contact]](/static/images/contact.gif){kind=small}
![[University of Cambridge]](/static/images/identifier2.gif){kind=small}
![[Talks.cam]](/static/images/talkslogosmall.gif)
Piotr Zieliński, Cavendish Laboratory, University of Cambridge
Tuesday 17 October 2006, 14:30-15:30
Low-latency Atomic Broadcast in the Presence of Contention
- 👤 Speaker: Piotr Zieliński, Cavendish Laboratory, University of Cambridge
- 📅 Date & Time: Tuesday 17 October 2006, 14:30 - 15:30
- 📍 Venue: Room FW11, Computer Laboratory, William Gates Building
Questions? Contact
Minor Gordon
Abstract
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.
Series This talk is part of the Computer Laboratory Opera Group Seminars series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- 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
- yk449
Note: Ex-directory lists are not shown.