Self-stabilizing Connected Components

Sao, Piyush; Engelmann, Christian; Eswar, Srinivas; Green, Oded; Vuduc, Richard

doi:10.1109/FTXS49593.2019.00011

Title: Self-stabilizing Connected Components

Full Record
Other Related Research

Abstract

For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit Hips. More specifically, it applies the technique of self-stabilization. A system is self-stabilizing 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 machine subject to a transient fault, a self-stabilizing algorithm could recover if that fault caused the system to enter an invalid state. We give a comprehensive analysis of the valid and invalid states during label propagation and derive algorithms to verify and correct the invalid state. The self-stabilizing label-propagation algorithm performs O (V log V) additional computation and requires O (V) additional storage over its conventional counterpart (and, as such, does not increase asymptotic complexity over conventional label propagation). When 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 fault-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,more »« less

Authors:

^[1];

^[1]; Eswar, Srinivas ^[2]; Green, Oded ^[2]; Vuduc, Richard ^[3]

ORNL
Georgia Institute of Technology
Georgia Institute of Technology, Atlanta

Publication Date:: 2019-11-01

Research Org.:: Oak Ridge National Lab. (ORNL), Oak Ridge, TN (United States)

Sponsoring Org.:: USDOE Office of Science (SC), Advanced Scientific Computing Research (ASCR)

OSTI Identifier:: 1649445

DOE Contract Number:: AC05-00OR22725

Resource Type:: Conference

Resource Relation:: Conference: The 9th Workshop on Fault Tolerance for HPC at eXtreme Scale (FTXS) 2019 - Denver, Colorado, United States of America - 11/22/2019 5:00:00 AM-

Country of Publication:: United States

Language:: English

Citation Formats


                    Sao, Piyush, Engelmann, Christian, Eswar, Srinivas, Green, Oded, and Vuduc, Richard. Self-stabilizing Connected Components.  United States: N. p., 2019. 
        Web.  doi:10.1109/FTXS49593.2019.00011.

Copy to clipboard


                    Sao, Piyush, Engelmann, Christian, Eswar, Srinivas, Green, Oded, & Vuduc, Richard. Self-stabilizing Connected Components.  United States.  https://doi.org/10.1109/FTXS49593.2019.00011

Copy to clipboard


                    Sao, Piyush, Engelmann, Christian, Eswar, Srinivas, Green, Oded, and Vuduc, Richard. 2019.  
        "Self-stabilizing Connected Components".  United States.  https://doi.org/10.1109/FTXS49593.2019.00011.  https://www.osti.gov/servlets/purl/1649445.

Copy to clipboard


                    
@article{osti_1649445,

  title        = {Self-stabilizing Connected Components},

  author       = {Sao, Piyush and Engelmann, Christian and Eswar, Srinivas and Green, Oded and Vuduc, Richard},

  abstractNote = {For the problem of computing the connected components of a graph, this paper considers the design of algorithms that are resilient to transient hardware faults, like bit Hips. More specifically, it applies the technique of self-stabilization. A system is self-stabilizing 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 machine subject to a transient fault, a self-stabilizing algorithm could recover if that fault caused the system to enter an invalid state. We give a comprehensive analysis of the valid and invalid states during label propagation and derive algorithms to verify and correct the invalid state. The self-stabilizing label-propagation algorithm performs O (V log V) additional computation and requires O (V) additional storage over its conventional counterpart (and, as such, does not increase asymptotic complexity over conventional label propagation). When 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 fault-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 believe, they are useful from the theoretical perspective; and may have other use-cases.},

  doi          = {10.1109/FTXS49593.2019.00011},

  url          = {https://www.osti.gov/biblio/1649445},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {2019},

  month        = {11}

}

Copy to clipboard

Conference:

View Conference (0.73 MB)

https://doi.org/10.1109/FTXS49593.2019.00011

Other availability

Please see Document Availability for additional information on obtaining the full-text document. Library patrons may search WorldCat to identify libraries that hold this conference proceeding.

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Final report for CCS cross-layer reliability visioning study

Technical Report Quinn, Heather; Dehon, Andre; Carter, Nicj

The geometric rate of improvement of transistor size and integrated circuit performance known as Moore's Law has been an engine of growth for our economy, enabling new products and services, creating new value and wealth, increasing safety, and removing menial tasks from our daily lives. Affordable, highly integrated components have enabled both life-saving technologies and rich entertainment applications. Anti-lock brakes, insulin monitors, and GPS-enabled emergency response systems save lives. Cell phones, internet appliances, virtual worlds, realistic video games, and mp3 players enrich our lives and connect us together. Over the past 40 years of silicon scaling, the increasing capabilities ofmore »« less
https://doi.org/10.2172/1044902

Full Text Available
Resiliency in numerical algorithm design for extreme scale simulations

Journal Article Agullo, Emmanuel; Altenbernd, Mirco; Anzt, Hartwig; ... - International Journal of High Performance Computing Applications

Here this work is based on the seminar titled ‘Resiliency in Numerical Algorithm Design for Extreme Scale Simulations’ held March 1–6, 2020, at Schloss Dagstuhl, that was attended by all the authors. Advanced supercomputing is characterized by very high computation speeds at the cost of involving an enormous amount of resources and costs. A typical large-scale computation running for 48 h on a system consuming 20 MW, as predicted for exascale systems, would consume a million kWh, corresponding to about 100k Euro in energy cost for executing 10²³ floating-point operations. It is clearly unacceptable to lose the whole computation if any ofmore »« less
https://doi.org/10.1177/10943420211055188

Full Text Available
Towards A Theory of Autonomous Reconstitution of Compromised Cyber-Systems

Conference Ramuhalli, Pradeep; Halappanavar, Mahantesh; Coble, Jamie; ...

The ability to maintain mission-critical operations in cyber-systems in the face of disruptions is critical. Faults in cyber systems can come from accidental sources (e.g., natural failure of a component) or deliberate sources (e.g., an intelligent adversary). Natural and intentional manipulation of data, computing, or coordination are the most impactful ways that an attacker can prevent an infrastructure from realizing its mission goals. Under these conditions, the ability to reconstitute critical infrastructure becomes important. Specifically, the question is: Given an intelligent adversary, how can cyber systems respond to keep critical infrastructure operational? In cyber systems, the distributed nature of themore »« less
https://doi.org/10.1109/THS.2013.6699067
Reconfigurable computing in space: from current technology to reconfigurable systems-on-a-chip.

Conference Graham, R; Caffrey, M; Johnson, D; ...

The performance, in-system reprogrammability, flexibility, and reduced costs of SRAM-based FPGAs make them very interesting for high-speed, on-orbit data processing, but, because the current generation of radiation-tolerant SRAM-based FPGAs are derived directly from COTS versions of the chips, several issues must be dealt with for space, including SEU sensitivities, power consumption, thermal problems, and support logic. This paper will discuss Los Alamos National Laboratory's approach to using the Xilinx XQVR1000 FPGAs for on-orbit processing in the Cibola Flight Experiment (CFE) as well as the possibilities and challenges of using newer, system-on-a-reprogrammable-chip FPGAs, such as Virtex I1 Pro, in space-based reconfigurablemore »« less
Full Text Available
Protection and Restoration Solutions to Reliable and Resilient Integration of Grid-connected PV Installations and Distributed Energy Resources: Design, Testbed, Proof of Work and Impact Studies (Final Report)

Technical Report Jiang, John

To gain a better understanding of the complex transients in a utility grid with a large number of solar PV installations coupled by PWM inverters during the protection and restoration period of the power grid, in this project a kW-level experimental system with dominating inverter-based resources and a hardware-in-loop simulation system with transmission and distribution models, as well as several SEL protective relays have been built and used. The major research findings of the project are summarized below in two perspectives: Experimental research: A self-organized ultra-high frequency solitary waveform is discovered and demonstrated in the hardware experimental system. Despite themore »« less
https://doi.org/10.2172/1859726

Full Text Available

Similar Records