2,361 Hits in 6.0 sec

A Brief Note on Single Source Fault Tolerant Reachability [article]

Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi
2019 arXiv   pre-print
Formally, a spanning subgraph H of G is a k-Fault Tolerant Reachability Subgraph (k-FTRS) if it has the following property.  ...  We consider the problem of single source reachability (SSR) from s in presence of failures of edges (or vertices).  ...  Such a graph H is called a k-Fault Tolerant Reachability Subgraph (k-FTRS).  ... 
arXiv:1904.08150v1 fatcat:mnbbmbo2ubaddheo2t56rnmqi4

A Framework for Experimental Validation and Performance Evaluation in Fault Tolerant Distributed System

Hein Meling
2007 2007 IEEE International Parallel and Distributed Processing Symposium  
In this paper, a framework for experimental validation and performance evaluation of fault management in a fault tolerant distributed system is presented.  ...  The framework provides a facility to execute experiments in a configured target system. It is based on injecting faults or other events needed to test the fault handling capability of the system.  ...  . • Machine name on which the event was recorded. • Event type and a brief description.  ... 
doi:10.1109/ipdps.2007.370600 dblp:conf/ipps/Meling07 fatcat:fcyb7vucffavfh75xhc534okmm

DeFT: A Deadlock-Free and Fault-Tolerant Routing Algorithm for 2.5D Chiplet Networks [article]

Ebadollah Taheri and Sudeep Pasricha and Mahdi Nikdast
2021 arXiv   pre-print
Unfortunately, existing fault-tolerant routing techniques proposed for 2D and 3D on-chip networks cannot be applied to chiplet networks.  ...  Compared to the state-of-the-art routing algorithms in 2.5D chiplet systems, our simulation results show that DeFT improves network reachability by up to 75% with a fault rate of up to 25% and reduces  ...  Fault-Tolerance Analysis To assess DeFT's ability to tolerate faults, we analyze network reachability in the presence of faults, similar to [13] .  ... 
arXiv:2112.09234v1 fatcat:wtpb4zpa65h3bpjtbuz732rs2m

GAVS+: An Open Platform for the Research of Algorithmic Game Solving [chapter]

Chih-Hong Cheng, Alois Knoll, Michael Luttenberger, Christian Buckl
2011 Lecture Notes in Computer Science  
., it now allows to explore concurrent / probabilistic / distributed games, and games played on pushdown graphs.  ...  This paper presents a major revision of the tool GAVS.  ...  -(Fault-tolerant strategy generation) We outline steps for game creation and solving when faults are introduced in GAVS+ using this example.  ... 
doi:10.1007/978-3-642-19835-9_22 fatcat:ge6lpnr46nbhxl6i2hkgwor3ii

A routing methodology for achieving fault tolerance in direct networks

M.E. Gomez, N.A. Nordbotten, J. Flich, P. Lopez, A. Robles, J. Duato, T. Skeie, O. Lysne
2006 IEEE transactions on computers  
This paper presents a new fault-tolerant routing methodology that does not degrade performance in the absence of faults and tolerates a reasonably large number of faults without disabling any healthy node  ...  Specifically, we propose disabling adaptive routing and/or using misrouting on a per-packet basis. We also propose the use of more than one intermediate node for some paths.  ...  However, although I+D+M and I+M provide a slightly worse performance, note that they tolerate a larger number of faults (up to seven faults). I+M 15.  ... 
doi:10.1109/tc.2006.46 fatcat:l6hrjtkn7bej5nkiuwybynrtbq

Alarm placement in systems with fault propagation

K.B. Lakshmanan, Daniel J. Rosenkrantz, S.S. Ravi
2000 Theoretical Computer Science  
We study algorithms that attempt to minimize the number of alarms to be placed so that a fault at any single component can be detected and uniquely diagnosed.  ...  We present optimal algorithms for three special classes of graphs -tree structured graphs, single-entry single-exit series-parallel graphs and two level graphs.  ...  In particular, [17] was brought to their attention by one of the referees.  ... 
doi:10.1016/s0304-3975(98)90214-6 fatcat:p44dfbpm6bhljfg2nfxxeogtgq

System Description for a Scalable, Fault-Tolerant, Distributed Garbage Collector [article]

N. Allen, T. Terriberry
2002 arXiv   pre-print
Of particular note is the development of fault-tolerant cooperation between traces and a heuristic that aggressively reduces the set of suspect objects.  ...  We describe an efficient and fault-tolerant algorithm for distributed cyclic garbage collection.  ...  back tracings on a single cycle.  ... 
arXiv:cs/0207036v1 fatcat:adxou2ye3zeadnz7fwa7jdqhdi

Formal Techniques for Synchronized Fault-Tolerant Systems [chapter]

Ben L. Di Vito, Ricky W. Butler
1993 Dependable Computing for Critical Applications 3  
We present the formal verification of synchronizing aspects of the Reliable Computing Platform (RCP), a fault-tolerant computing system for digital flight control applications.  ...  Our formalization is based on an extended state machine model incorporating snapshots of local processors' clocks.  ...  His suggestions during the early phases of model formulation and decomposition lead to a significantly more manageable proof activity.  ... 
doi:10.1007/978-3-7091-4009-3_7 fatcat:xxirbg2vrbbldci2dxgkitysqe

A Software Based Approach for Providing Network Fault Tolerance in Clusters with uDAPL interface: MPI Level Design and Performance Evaluation

Abhinav Vishnu, Prachi Gupta, Amith Mamidala, Dhabaleswar Panda
2006 ACM/IEEE SC 2006 Conference (SC'06)  
In this paper, we design a network fault tolerant MPI using uDAPL interface, making this design portable for existing and upcoming interconnects.  ...  Using a heterogeneous combinations of IBA and Ammasso-GigE, we are able to improve the performance by 10-15% for different NAS Parallel Benchmarks on 8x1 configuration.  ...  This helps us understand the overhead incurred by network fault tolerance modules, when such faults occur. We begin with a brief description of our experimental testbed.  ... 
doi:10.1109/sc.2006.5 fatcat:okgzbioj5bgsbdy76e2g3o5tw4

Scalable systems software---A software based approach for providing network fault tolerance in clusters with uDAPL interface

Abhinav Vishnu, Prachi Gupta, Amith R. Mamidala, Dhabaleswar K. Panda
2006 Proceedings of the 2006 ACM/IEEE conference on Supercomputing - SC '06  
In this paper, we design a network fault tolerant MPI using uDAPL interface, making this design portable for existing and upcoming interconnects.  ...  Using a heterogeneous combinations of IBA and Ammasso-GigE, we are able to improve the performance by 10-15% for different NAS Parallel Benchmarks on 8x1 configuration.  ...  This helps us understand the overhead incurred by network fault tolerance modules, when such faults occur. We begin with a brief description of our experimental testbed.  ... 
doi:10.1145/1188455.1188545 dblp:conf/sc/VishnuGMP06 fatcat:gpnejxsgibdivkz5wsrxgbl7ka


Shuguang Feng, Shantanu Gupta, Amin Ansari, Scott A. Mahlke, David I. August
2011 Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture - MICRO-44 '11  
Given the rise of processor reliability as a first-order design constraint, there has been a growing interest in low-cost, non-intrusive techniques for transient fault detection.  ...  Experimental results show that Encore, with just 14% of runtime overhead, can safely recover, on average from 97% of transient faults when coupled with existing detection schemes.  ...  , fault tolerance.  ... 
doi:10.1145/2155620.2155667 dblp:conf/micro/FengGAMA11 fatcat:uoanodtx4zhslgdz6ygwbykjje

E-Cube+ Routing Protocol for Wireless Sensor Networks in the Presence of Network Failures

Bo-Chao Cheng, Guo-Tan Liao, Yuan-Fu Chen, Huan Chen
2015 International Journal of Distributed Sensor Networks  
In this paper, we propose a fault-tolerant tableless routing protocol called E-cube + , inspired from e-cube routing protocol, to support intelligent rerouting.  ...  A range of fault-tolerant routing properties of E-cube + (such as loop-freeness, failure recovery guarantees, and bounded latency) have been derived and analyzed.  ...  Of course, the path selection technique has a big impact on the fault tolerance capabilities [29] .  ... 
doi:10.1155/2015/231514 fatcat:r4wi2ihyvzdgxhi3mealaalhya

Tutorial: Parameterized Verification with Byzantine Model Checker [chapter]

Igor Konnov, Marijana Lazić, Ilina Stoilkovska, Josef Widder
2020 Lecture Notes in Computer Science  
Threshold guards are a basic primitive of many fault-tolerant algorithms that solve classical problems of distributed computing, such as reliable broadcast, two-phase commit, and consensus.  ...  parameter, as well as t; (4) and the parameters are restricted by a resilience condition, e.g., n > 3t.  ...  This survey is based on the results of a long-lasting research agenda [12, 47, 49, 50, 57, 60, 78] .  ... 
doi:10.1007/978-3-030-50086-3_11 fatcat:u7ivnerr6jfj5nzt56vue7xkyu

Jgroup/ARM: a distributed object group platform with autonomous replication management

Hein Meling, Alberto Montresor, Bjarne E. Helvik, Ozalp Babaoglu
2008 Software, Practice & Experience  
We also report on an experience using Jgroup to provide fault-tolerant transactions.  ...  The Jgroup/ARM framework shares many of its goals with other fault-tolerance frameworks, notably , AQuA [20] and FT CORBA [6] .  ...  ACKNOWLEDGEMENTS The authors wish to thank Heine Kolltveit and Rohnny Moland for commenting on the discussion of replicated transactions.  ... 
doi:10.1002/spe.853 fatcat:zakxyjznwrbnln2zkqagsku7hu

Adding distribution and fault tolerance to jason

Álvaro Fernández Díaz, Clara Benac Earle, Lars-Ake Fredlund
2012 Proceedings of the 2nd edition on Programming systems, languages and applications based on actors, agents, and decentralized control abstractions - AGERE! '12  
Moreover, there is no support for fault tolerance.  ...  The fault tolerance techniques implemented allow the agents to detect, and hence react accordingly, when other agents have stopped working for some reason (e.g., due to a software or a hardware failure  ...  of the elegant approach to fault detection and fault tolerance.  ... 
doi:10.1145/2414639.2414651 dblp:conf/agere/DiazEF12 fatcat:ejpvwcg65fagxi7gv2dfeylyli
« Previous Showing results 1 — 15 out of 2,361 results