BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//Talks.cam//talks.cam.ac.uk//
X-WR-CALNAME:Talks.cam
BEGIN:VEVENT
SUMMARY:Low-latency Atomic Broadcast in the Presence of Contention - Piotr
  Zieliński\, Cavendish Laboratory\, University of Cambridge
DTSTART:20061017T133000Z
DTEND:20061017T143000Z
UID:TALK5381@talks.cam.ac.uk
CONTACT:Minor Gordon
DESCRIPTION:The proposed Atomic Broadcast algorithm can deliver messages i
 n two communication steps\, even if multiple processes broadcast at the sa
 me time. It tags all broadcast messages with the local real time\, and del
 ivers all messages in order of these timestamps. The Ω-elected leader sim
 ulates processes it suspects to have crashed (◇S). For fault-tolerance\,
  it uses a new cheap Generic Broadcast algorithm that requires only a majo
 rity of correct processes (n > 2f) and\, in failure-free runs\, delivers a
 ll non-conflicting messages in two steps. \n\n"Talk slides":http://www.cl.
 cam.ac.uk/~pz215/files/atomic-disc-talk.pdf \n"Paper":http://www.cl.cam.ac
 .uk/TechReports/UCAM-CL-TR-671.html 
LOCATION:Room FW11\, Computer Laboratory\, William Gates Building
END:VEVENT
END:VCALENDAR