BEGIN:VCALENDAR
VERSION:2.0
PRODID:-//wp-events-plugin.com//7.2.3.1//EN
BEGIN:VEVENT
UID:701@lincs.fr
DTSTART;TZID=Europe/Paris:20220406T110000
DTEND;TZID=Europe/Paris:20220406T120000
DTSTAMP:20220422T130258Z
URL:https://www.lincs.fr/events/the-weakest-failure-detector-abstraction/
SUMMARY:The Weakest Failure Detector Abstraction
DESCRIPTION:Many important distributed computing problems cannot be solved
 in purely asynchronous fault-prone systems. These impossibilities can be
 circumvented with failure detectors\, distributed oracles that provide
 computing units with hints about failures. The weakest failure detector for
 a given problem defines necessary and sufficient assumptions about failures
 that enable the problem's solutions. In this meeting\, we are going to
 discuss how to determine two important weakest failure detectors: (1)
 Omega\, the leader election failure detector for solving consensus and (2)
 Sigma\, the quorum failure detector for implementing read-write
 storage.\n\nLiterature:\n[1] Tushar Deepak Chandra\, Sam Toueg: Unreliable
 Failure Detectors for Reliable Distributed Systems. J. ACM 43(2): 225-267
 (1996).\n[2] Tushar Deepak Chandra\, Vassos Hadzilacos\, Sam Toueg: The
 Weakest Failure Detector for Solving Consensus. J. ACM 43(4): 685-722
 (1996).\n[3] Carole Delporte-Gallet\, Hugues Fauconnier\, Rachid Guerraoui:
 Tight failure detection bounds on atomic object implementations. J. ACM
 57(4): 22:1-22:32 (2010).
CATEGORIES:Network Theory,Working Group,Youtube
LOCATION:Paris-Rennes Room (EIT Digital)\, 23 avenue d'Italie\, 75013
 Paris\, France
X-APPLE-STRUCTURED-LOCATION;VALUE=URI;X-ADDRESS=23 avenue d'Italie\, 75013
 Paris\, France;X-APPLE-RADIUS=100;X-TITLE=Paris-Rennes Room (EIT
 Digital):geo:0,0
END:VEVENT
BEGIN:VTIMEZONE
TZID:Europe/Paris
X-LIC-LOCATION:Europe/Paris
BEGIN:DAYLIGHT
DTSTART:20220327T030000
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
END:DAYLIGHT
END:VTIMEZONE
END:VCALENDAR