We propose a deterministic fault-tolerant and deadlock-free routing protocol in 2-dimensional (2-D) meshes based on Wu’s fault-tolerant odd–even turn model and Wang’s rectilinear-monotone polygonal fault block model. The fault-tolerant odd–even turn protocol, also called extended X–Y routing, was originally proposed to achieve fault-tolerant and deadlock-free routing among traditional, rectangu...

ÐThis paper describes a modular approach for the construction of fault-tolerant agreement protocols. The approach is based on a generic consensus service. Fault-tolerant agreement protocols are built using a client-server interaction, where the clients are the processes that must solve the agreement problem and the servers implement the consensus service. This service is accessed through a gene...

In this paper we consider the problem of efficiently constructing k-vertex fault-tolerant geometric tspanners in R (for k ≥ 0 and t > 1). Vertex fault-tolerant spanners were introduced by Levcopoulus et. al in 1998. For k = 0, we present an O(n log n) method using the algebraic computation tree model to find a t-spanner with degree bound O(1) and weight O(ω(MST )). This resolves an open problem...

A long-term trend in high-performance computing is the increasing number of nodes in parallel computing platforms, which entails a higher failure probability. Fault tolerant programming environments should be used to guarantee the safe execution of critical applications. Research in fault tolerant MPIs has led to the development of several fault tolerant MPI environments. Different approaches a...

In this paper we present two new fault-tolerant routing algorithm for hypercubes. The first algorithm requires only local knowledge of the faulls whereas the s m n d algorithm requires global knowledge. Unlike previous fault-tolerant muting algorithms, our algorithms take into considemtion the dynamic conditions (link contention) of the network. We have shoum that checking for dynamic condition...

We introduce a new method, N-Version Genetic Programming (NVGP), for building fault tolerant software by building an ensemble of automatically generated modules in such a way as to maximize their collective fault masking ability. The ensemble itself is an example of n-version modular redundancy for fault tolerance, where the output of the ensemble is the most frequent output of n independent mo...

In this paper, we present an approach to embed our formal Generic Fault Tolerant Software Architecture (GFTSA) model in the PVS theorem prover to achieve automatic verification support for reasoning about fault tolerant system properties. In order to make the verification process more efficient and systematic, we also propose a template approach for the auto-generation of specifications and pro...

Many papers on the fully connected cubic networks have been published for the past several years due to its favorite properties. In this paper, we consider the fault-tolerant hamiltonian connectivity and fault-tolerant hamiltonicity of the fully connected cubic network. We use FCCNn to denote the fully connected cubic network of level n. Let G = (V, E) be a graph. The fault-tolerant hamiltonian...

With the introduction of clustered messaging brokers and the fault-tolerant Mobile Connector, we can guarantee the exactly-once consumption of messages by agents. The context-aware messaging allowed us to decrease the messaging overhead which has to be present in any fault-tolerant solution. This paper proposes a complete fault-tolerant layer for multi-agent systems (EFTL) that does not restric...

With the introduction of clustered messaging brokers and the fault-tolerant Mobile Connector, we can guarantee the exactly-once consumption of messages by agents. The context-aware messaging allowed us to decrease the messaging overhead which has to be present in any fault-tolerant solution. This paper proposes a complete fault-tolerant layer for multi-agent systems (EFTL) that does not restric...