Results 241 to 250 of about 96,897 (263)
Some of the next articles are maybe not open access.
Designing masking fault-tolerance via nonmasking fault-tolerance
IEEE Transactions on Software Engineering, 1998Masking fault-tolerance guarantees that programs continually satisfy their specification in the presence of faults. By way of contrast, nonmasking fault-tolerance does not guarantee as much: it merely guarantees that when faults stop occurring, program executions converge to states from where programs continually (re)satisfy their specification.
A. Arora, S.S. Kulkarni
openaire +1 more source
Circuits, Systems, and Signal Processing, 1987
Parallel sorting algorithms have been proposed for VLSI implementation. Random defects in the silicon wafer and fabrication errors render processors in the wafer faulty, and may cause these algorithms to fail despite a significant number of nonfaulty processors.
Varman, P. J. +2 more
openaire +2 more sources
Parallel sorting algorithms have been proposed for VLSI implementation. Random defects in the silicon wafer and fabrication errors render processors in the wafer faulty, and may cause these algorithms to fail despite a significant number of nonfaulty processors.
Varman, P. J. +2 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
Fault Tolerant Sequential Machines
IEEE Transactions on Computers, 1971A machine representation of permanent memory faults is introduced where, if M is a sequential machine representing some fault free system, a memory fault is represented by a function μ on the states of M, and the result of the fault by an appropriately determined machine Mμ.
openaire +1 more source