Process groups are a common abstraction for fault-tolerant computing in distributed systems. We present a security architecture that extends.Abstract Concerns about both security and fault-tolerance have had an important. Tion of fault tolerance will face some of the same problems, and benefit from. The security testing prototype is.A Secure and Fault-tolerant framework for Mobile. Of Computer ...

some applications are critical and must designed fault tolerant system. usually voting algorithm is one of the principle elements of a fault tolerant system. two kinds of voting algorithm are used in most applications, they are majority voting algorithm and weighted average algorithm these algorithms have some problems. majority confronts with the problem of threshold limits and voter of weight...

This paper surveys recent results on fault-tolerant consensus in message-passing networks. We focus on two categories of works: (i) new problem formulations (including input domain, fault model, network model...etc.), and (ii) practical applications. For the second part, we focus on Crash Fault-Tolerant (CFT) systems that use Paxos or Raft, and Byzantine Fault-Tolerant (BFT) systems. We also br...

In this paper, an algorithm, called VB-FT-Mine (Vectors-Based Fault–Tolerant frequent patterns Mining), is proposed for mining fault-tolerant frequent patterns efficiently. In this approach, fault–tolerant appearing vectors are designed to represent the distribution that the candidate patterns contained in data sets with fault-tolerance. VB-FT-Mine algorithm applies depth-first pattern growing ...

When a fault occurs in a system, the main problem to be addressed is to raise an alarm, ideally diagnose what fault has occurred, and then decide how to deal with it. The problem of detecting a fault, finding the source/location and then taking appropriate action is the basis of fault tolerant control. In this chapter, an introduction to fault tolerant control (FTC) and fault detection and isol...

COMSIM is a fault simulator for combinational circuits which can efficiently handle various gate level fault models. Stuck-at faults, function conversions, bridging faults, transition faults as well as multiple faults of all types and faults with additional fault detection conditions, can be simulated in one pass. This offers a practical approach to solve the conflict between the accuracy of fa...

In earlier work we have proposed the concept of the dynamic group maximum matching for grouping the system graph into groups of different sizes according to the tasks arriving at the system. Also, we have developed a more efficient integrated fault-tolerant technique for ultra-reliable execution of tasks where both hardware (processors and communication channels) and software failures, and on-l...

-In this paper, a fault simulation method that utilizes behavioral pre-synthesis and gate level post-synthesis components models will be presented. In this method, an injected stuck at fault in a module will propagate through gates until it reaches the boundary of the module. Propagation of the fault in modules other than the one that it is initiated in will be done in behavioral models. This m...

There are no widely accepted design patterns for writing distributed, concurrent, fault-tolerant code. Each programmer develops her own techniques for writing this type of complex software. The use of a common pattern for fault-tolerant programming has the potential to produce correct code more quickly and increase shared understanding between developers. We describe rules, tasks, and pools, pa...

In this paper, we deal with two important issues in relation to modular recon gurable manipulators, namely, the determination of the modular assembly con guration optimally suited to perform a speci c task and the synthesis of fault tolerant systems. We present a numerical approach yielding an assembly con guration that satis es four kinematic task requirements: reachability, joint limits, obst...