Results 221 to 230 of about 15,383 (260)
Some of the next articles are maybe not open access.
Proceedings ICCI `92: Fourth International Conference on Computing and Information, 2003
In a network of communicating processes performing a distributed computation, one can replicate some or all of the communicating processes on different nodes to increase successful probability of the distributed computation against node failures. The authors use communicating sequential process (CSP) to express this scheme by appropriately translating ...
Shyan-Ming Yuan, Chin-Juan Chen
openaire +1 more source
In a network of communicating processes performing a distributed computation, one can replicate some or all of the communicating processes on different nodes to increase successful probability of the distributed computation against node failures. The authors use communicating sequential process (CSP) to express this scheme by appropriately translating ...
Shyan-Ming Yuan, Chin-Juan Chen
openaire +1 more source
Review of Economic Studies, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +3 more sources
Fault Tolerant Sorting Networks
SIAM Journal on Discrete Mathematics, 1991Summary: A general technique for enhancing the reliability of sorting networks and other comparator based networks is presented. The technique converts any network that uses unreliable comparators to a fault tolerant network that produces the correct output with overwhelming probability, even if each comparator is faulty with some probability smaller ...
Shay Assaf, Eli Upfal
openaire +1 more source
1987
Publisher Summary The chapter provides an overview of fault-tolerant computing design, including both hardware and software techniques. The emphasis is directed toward practical applications rather than theory. Fault-tolerant computing is defined as the ability to compute in the presence of errors.
openaire +1 more source
Publisher Summary The chapter provides an overview of fault-tolerant computing design, including both hardware and software techniques. The emphasis is directed toward practical applications rather than theory. Fault-tolerant computing is defined as the ability to compute in the presence of errors.
openaire +1 more source
Fault-tolerant fault tolerance for component-based automation systems
Proceedings of the 4th international ACM Sigsoft symposium on Architecting critical systems, 2013To guarantee high availability, automation systems must be fault-tolerant. To this end, they must provide redundant solutions for the critical parts of the system. Classical fault tolerance patterns such as standby or N-modular redundancy provide system stability in the case of a fault.
Manuel Oriol +4 more
openaire +1 more source
SOSP History Day 2015, 2015
Ken Birman's talk focused on controversies surrounding fault-tolerance and consistency. Looking at the 1990's, he pointed to debate around the so-called CATOCS question (CATOCS refers to causally and totally ordered communication primitives) and drew a parallel to the more modern debate about consistency at cloud scale (often referred to as the CAP ...
openaire +1 more source
Ken Birman's talk focused on controversies surrounding fault-tolerance and consistency. Looking at the 1990's, he pointed to debate around the so-called CATOCS question (CATOCS refers to causally and totally ordered communication primitives) and drew a parallel to the more modern debate about consistency at cloud scale (often referred to as the CAP ...
openaire +1 more source
Adaptive fault-tolerance fault-tolerance for cyber-physical systems
2013 International Conference on Computing, Networking and Communications (ICNC), 2013Cyber-physical systems are increasingly used in life-critical applications, where the probability of catastrophic failure has to be kept below very low levels. Massive fault-tolerance has been used to mask failure to achieve such low levels. However, fault-tolerance is expensive.
C. Mani Krishna 0001, Israel Koren
openaire +1 more source
Fault-tolerant convergence routing
Proceedings of ICNP - 1994 International Conference on Network Protocols, 1997This paper presents fault-tolerant protocols for fast packet switch networks with convergence routing. The objective is to provide, after a link or a node (switch) failure, fast reconfiguration and continuous host-to-host communication. Convergence routing is a variant of deflection routing, which combines in a dynamic fashion, the on-line routing ...
BULENT YENER +3 more
openaire +2 more sources
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
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
A scalability hierarchical fault tolerance strategy: Community Fault Tolerance
2014 20th International Conference on Automation and Computing, 2014Most 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