17,601 research outputs found
Dual Failure Resilient BFS Structure
We study {\em breadth-first search (BFS)} spanning trees, and address the
problem of designing a sparse {\em fault-tolerant} BFS structure, or {\em
FT-BFS } for short, resilient to the failure of up to two edges in the given
undirected unweighted graph , i.e., a sparse subgraph of such that
subsequent to the failure of up to two edges, the surviving part of
still contains a BFS spanning tree for (the surviving part of) . FT-BFS
structures, as well as the related notion of replacement paths, have been
studied so far for the restricted case of a single failure. It has been noted
widely that when concerning shortest-paths in a variety of contexts, there is a
sharp qualitative difference between a single failure and two or more failures.
Our main results are as follows. We present an algorithm that for every
-vertex unweighted undirected graph and source node constructs a
(two edge failure) FT-BFS structure rooted at with edges. To
provide a useful theory of shortest paths avoiding 2 edges failures, we take a
principled approach to classifying the arrangement these paths. We believe that
the structural analysis provided in this paper may decrease the barrier for
understanding the general case of faults and pave the way to the
future design of -fault resilient structures for . We also provide
a matching lower bound, which in fact holds for the general case of
and multiple sources . It shows that for every , and
integer , there exist -vertex graphs with a source set
of cardinality for which any FT-BFS structure rooted
at each , resilient to up to -edge faults has
edges
An optimal fixed-priority assignment algorithm for supporting fault-tolerant hard real-time systems
The main contribution of this paper is twofold. First, we present an appropriate schedulability analysis, based on response time analysis, for supporting fault-tolerant hard real-time systems. We consider systems that make use of error-recovery techniques to carry out fault tolerance. Second, we propose a new priority assignment algorithm which can be used, together with the schedulability analysis, to improve system fault resilience. These achievements come from the observation that traditional priority assignment policies may no longer be appropriate when faults are being considered. The proposed schedulability analysis takes into account the fact that the recoveries of tasks may be executed at higher priority levels. This characteristic is very important since, after an error, a task certainly has a shorter period of time to meet its deadline. The proposed priority assignment algorithm, which uses some properties of the analysis, is very efficient. We show that the method used to find out an appropriate priority assignment reduces the search space from O(n!) to O(n/sup 2/), where n is the number of task recovery procedures. Also, we show that the priority assignment algorithm is optimal in the sense that the fault resilience of task sets is maximized as for the proposed analysis. The effectiveness of the proposed approach is evaluated by simulation
- β¦