In earlier work we have introduced an efficient hardware fault-tolerant approach for reliable execution of tasks. The proposed approach called the Hardware Fault-Tolerant (HFT) approach. Also, we have introduced the concept of dynamic group maximum matching, which is used to group nodes of a graph into disjoint groups with different sizes dynamically. Furthermore, we have proposed the Dynamic G...

There is a need for better integration of the fault tolerant and the control designs for safety critical systems such as aircraft. The dependability of current designs is assessed primarily with measures of the interconnection of fault tolerant components: the reliability function and the mean time to failure. These measures do not directly take into account the interaction of the fault toleran...

Replication is widely used to improve fault tolerance in distributed and multi-agent systems. In this paper, we present a different point of view on replication in multi-agent systems. The approach we propose is based on role concept. We define a specific “fault tolerant role” which encapsulates all behaviors related to replication-based fault tolerance in this work. Our strategy is mainly focu...

In this work we study a new approach of fault tolerant control schema.The suggested strategy is an active Fault Tolerant Control (FTC) strategy that reconfigures the controller on-line taking into account changes due to the faults where both the block of fault detection and the block of the controller are formulated as a Linear Matrix Inequality (LMI) problem. The problem of fault estimation is...

The star graph possess many nice topological properties. Edge fault tolerance is an important issue for a network since the edges in the network may fail sometimes. In this paper, we show that the n-dimensional star graph is (n 3)-edge fault tolerant hamiltonian laceable, (n 3)-edge fault tolerant strongly hamiltonian laceable, and (n 4)edge fault tolerant hyper hamiltonian laceable. All these ...

This paper presents the reliability studies of fault-tolerant Zeta Networks (ZTNs): a MIN, designed specially for an irregular class of hybrid networks. The reliability of ZTNs under Dynamic Full Access (DFA) is studied. The metrics used are mean time to failure (MTTF) and cost-effectiveness. Studies of tight Upper Bound (UB) and Lower Bound (LB) of the MTTF shows that ZTNs are more reliable an...

In this paper, we propose a new fault-tolerant model for replication in distributed-file systems. We combine the advantages of the modular redundancy, primary-stand-by, and weighted priority schemes to address the fault-tolerant model. To fulfill the fault-tolerant requirements, we use the ideas of directoryoriented replication and the extended prefix table while incorporating a two-level heap ...

Remote Procedure Call (RPC) is the most popular model to facilitate the building of distributed programs. However, it only provides a restricted availability of update operations and does not support fault-tolerant. The combination of RPC and data replication techniques has been developed to support fault-tolerant from Remote Procedure Call (RPC). However, different data replication techniques ...

Fault-tolerance is the survival attribute of the real-time software system. The software should provide correct results in the face of various failures. A major technological concern for the coming years is the ever widening gap between the demand for high quality, robust software and its supply. Software fault tolerance is basically the design faults in the computer system. Its function is to ...

This paper proposes a new dynamic and algorithm-based approach to achieve fault tolerance using 3D cellular genetic algorithms (Dynamic Fault-Tolerant 3D-cGA). The proposed algorithm is an improved version of our previous algorithm (Fault-Tolerant 3D-cGA) that introduces and utilizes a dynamic adaptation feature to achieve further improvement. In Dynamic Fault-Tolerant 3D-cGA, faulty individual...