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 ...

Fault-tolerant quantum computing will require accurate estimates of the resource overhead under different error correction strategies, but standard metrics such as gate fidelity and diamond distance have been shown to be poor predictors logical performance. We present a scalable experimental approach based on Pauli reconstruction predict performance concatenated codes. Numerical evidence demons...

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...

Fault tolerant design is a technique emerging in Integrated Circuits (IC’s) to deal with the increasing error susceptibility (Soft Errors, or Single Event Upsets, SEU) caused by e.g. alpha particles. A side effect of these methods is that they also compensate for manufacturing defects (the Hard Errors). Currently, yield engineers focus on perfecting the manufacturing process and designers spend...

For the interconnection network topology, it is usually represented by a graph. When a network is used, processors and/or links faults may happen. Thus, it is meaningful to consider faulty networks. We consider k-regular graphs in this paper. We define a k-regular hamiltonian and hamiltonian connected graph G is super fault-tolerant hamiltonian if G remains hamiltonian after removing at most k ...

This paper introduces different views for understanding problems and faults with the goal of defining a method for the formal specification of systems. The idea of Layered Fault Tolerant Specification (LFTS) is proposed to make the method extensible to fault tolerant systems. The principle is layering the specification in different levels, the first one for the normal behavior and the others fo...