There are various kinds of means to provide fault tolerance in a system and it deeply depends on the system architecture and tolerance requirements. This paper discusses our fault resilience method in the distributed system for motor controllers with several micro processing units. It targets realizing high availability on data processing function using process takeover and parallelism by softw...

The Khushab anticline is located in the Zagros fold-thrust belt in the Lurestan. This anticline is affected by the Balarud fault zone, which is a part of Mountain Front Fault between the Lurestan and Dezful Embayment zones. Based on the measurement of the elements of fold style, this anticline is analyzed. According to these measurements, this anticline is a noncylindrical, asymmetrical and dis...

1 This work was supported by Esprit project 6731 FTMPS “Fault Tolerant Massively Parallel Systems” Abstract This paper presents Xception, a software fault injection and monitoring environment. Xception uses the advanced debugging and performance monitoring features existing in most of the modern processors to inject more realistic faults by software, and to monitor the activation of the faults ...

This paper presents the performance evaluation of a software fault manager for distributed applications. Dubbed STAR, it uses the natural redundancy existing in networks of workstations to offer a high level of fault tolerance. Fault management is transparent to the supported parallel applications. STAR is application independent, highly configurable and easily portable to UNIX-like operating s...

The (n, k)-star graph is a generalized version of the n-star graph, which belongs to the class of Cayley graphs, and has been recognized as an attractive alternative to an n-cube for building massively parallel computers. Recently, Chen et al. showed that an (n, k)-star graph is 6-weak-vertex-pancyclic for k < n–1, that is, each vertex of an (n, k)-star graph is contained in a cycle of length r...

A fast algorithm for the fault simulation using data level parallelism is implemented on the Connection Machine. The algorithm employed is the PPSFP (Paralle l Pattern Single Fault Propagation) type. The input of the algorithm is the PI (Primary Input) test patterns obtained from a cellular automata pseudo-random pattern generator. The output of this system is a fault simulation table that desc...

The alternating group graph, which belongs to the class of Cayley graphs, is one of the most versatile interconnection networks for parallel and distributed computing. In this paper, adopting the conditional fault model in which each vertex is assumed to be incident with two or more fault-free edges, we show that an n-dimensional alternating group graph can tolerate up to 4n − 13 edge faults, w...

This paper presents a parallel ATPG to speed up the test pattern generation process. The ATPG adopts the master-slave architecture to reduce the inter-process communication. Also, a smart fault list broadcast and fault partition technique is proposed to reduce test pattern inflation. Simulation results show that close to linear speed-up can be achieved for up to 7 slave processes.

Enhancingcurrentmulticomputer routers for fault-tolerant routing with modest increase in routing complexity and resource requirements is addressed. The proposed method handles solid faults in meshes, which includes all convex faults and many practical nonconvex faults, for example, faults in the shape of L or T. As examples of the proposed method, adaptive andnonadaptive fault-tolerant routing ...