BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:America/Denver
X-LIC-LOCATION:America/Denver
BEGIN:DAYLIGHT
TZOFFSETFROM:-0700
TZOFFSETTO:-0600
TZNAME:MDT
DTSTART:19700308T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=2SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:-0600
TZOFFSETTO:-0700
TZNAME:MST
DTSTART:19701101T020000
RRULE:FREQ=YEARLY;BYMONTH=11;BYDAY=1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20200129T163556Z
LOCATION:301-302-303
DTSTART;TZID=America/Denver:20191122T103000
DTEND;TZID=America/Denver:20191122T105500
UID:submissions.supercomputing.org_SC19_sess131_ws_ftxs104@linklings.com
SUMMARY:Self-Stabilizing Connected Components
DESCRIPTION:Workshop\n\nSelf-Stabilizing Connected Components\n\nSao, Enge
 lmann, Eswar, Green, Vuduc\n\nFor the problem of computing the connected c
 omponents of a graph, this paper considers the design of algorithms that a
 re resilient to transient hardware faults, like bit flips.  More specifica
 lly, it applies the technique of self-stabilization.  A system is self-sta
 bilizing if, when starting from a valid or invalid state, it is guaranteed
  to reach a valid state after a finite number of steps.  Therefore on a ma
 chine subject to a transient fault, a self-stabilizing algorithm could rec
 over if that fault caused the system to enter an invalid state.\n\nWe give
  a comprehensive analysis of the valid and invalid states during label pro
 pagation and derive algorithms to verify and correct the invalid state.  T
 he self-stabilizing label-propagation algorithm performs O(V log V) additi
 onal computation and requires O(V) additional storage over its conventiona
 l counterpart (and, as such, does not increase asymptotic complexity over 
 conventional labelprop).\n\nWhen run against a battery of simulated fault 
 injection tests, the self-stabilizing label propagation algorithm exhibits
  more resilient behavior than a triple modular redundancy (TMR) based faul
 t-tolerant algorithm in 80% of cases.  From a performance perspective, it 
 also outperforms TMR as it requires fewer iterations in total.  Beyond the
  fault-tolerance properties of self-stabilizing label-propagation, we beli
 eve, they are useful from the theoretical perspective; and may have other 
 use-cases.\n\nTag: Workshop Reg Pass, Extreme Scale Computing, Fault Toler
 ance, Reliability, Resiliency\n\nRegistration Category: Workshop Reg Pass,
  Extreme Scale Computing, Fault Tolerance, Reliability, Resiliency
URL:https://sc19.supercomputing.org/presentation/?id=ws_ftxs104&sess=sess1
 31
END:VEVENT
END:VCALENDAR