Results 311 to 320 of about 2,461,573 (347)
Some of the next articles are maybe not open access.

A scalability hierarchical fault tolerance strategy: Community Fault Tolerance

2014 20th International Conference on Automation and Computing, 2014
Most of hierarchical fault tolerance strategies did not pay much attention to scalability of fault tolerance. In distributed system, scalability is a very important feature. To tolerant failures when the scale of the system changing is a normal and important scenario.
Jianping Chen   +3 more
openaire   +1 more source

Toward a Smart Cloud: A Review of Fault-Tolerance Methods in Cloud Systems

IEEE Transactions on Services Computing, 2018
This paper presents a comprehensive survey of the state-of-the-art work on fault tolerance methods proposed for cloud computing. The survey classifies fault-tolerance methods into three categories: 1) ReActive Methods (RAMs); 2) PRoactive Methods (PRMs);
Mukosi Abraham Mukwevho, Turgay Çelik
semanticscholar   +1 more source

Fault tolerance

ACM SIGOPS Operating Systems Review, 1993
The purpose of this paper is to single out and generalize about the essential features and properties of synchronization and to argue in favour of the idea of designing and developing fault tolerance for distributed computer system on the basis of a multilevel synchronization system. We propose to consider designing and developing a hierarchical system
openaire   +2 more sources

SCADA with Fault Tolerant CORBA on Fault Tolerant LANE ATM

19th IEEE International Parallel and Distributed Processing Symposium, 2005
The development of complex industrial distributed systems is highly benefited from distributed object computing middleware such as CORBA. Such applications demand a high degree of reliability, and need to be resilient to faults. The OMG has addressed these requirements as part of the fault tolerant CORBA (FT-CORBA) specification.
A. David Selvakumar   +2 more
openaire   +1 more source

On Fault-Tolerant Networks for Sorting

SIAM Journal on Computing, 1985
Summary: The study of constructing reliable systems from unreliable components goes back to the work of von Neumann, and of Moore and Shannon. The present paper studies the use of redundancy to enhance reliability for sorting and related networks built from unreliable comparators. Two models of fault-tolerant networks are discussed.
Andrew Chi-Chih Yao, F. Frances Yao
openaire   +2 more sources

Randomness versus Fault-Tolerance

Journal of Cryptology, 2000
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Ran Canetti   +3 more
openaire   +2 more sources

An Optimized Byzantine Fault Tolerance Algorithm for Consortium Blockchain

Peer-to-Peer Networking and Applications, 2021
Yuxi Li, Liang Qiao, Zhihan Lv
semanticscholar   +1 more source

Tracing Fault Tolerance

1993
A fault may cause a process to behave abnormally, and a fault hypothesis divides such abnormal behaviour into exceptional and catastrophic behaviours. The set of normal and exceptional behaviours can be considered the set of acceptable behaviours. In this report traces, or communication histories, are used to denote the behaviour of a process.
openaire   +2 more sources

FAULT TOLERANT ROUTING IN THE SUPERCUBE

Parallel Processing Letters, 1993
In this paper we study the fault-tolerant properties of the Supercube, a new inter-connection network recently introduced by Sen [15]. The Supercube is a generalization of the Hypercube that can be realized for any number of nodes and not only for powers of 2. Moreover, it has the same diameter and connectivity of the Hypercube.
AULETTA, Vincenzo   +2 more
openaire   +2 more sources

Fault-tolerant graphs for tori

Proceedings Second International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'96), 1998
Summary: Motivated by the design of fault-tolerant multiprocessor interconnection networks, this paper considers the following problem: Given a positive integer \(t\) and a graph \(H\), construct a graph \(G\) from \(H\) by adding a minimum number \(\Delta(t,H)\) of edges so that even after deleting any \(t\) edges from \(G\) the remaining graph ...
Toshinori YAMADA, Shuichi UENO
openaire   +2 more sources

Home - About - Disclaimer - Privacy