264 search results - page 7 / 53 » Bounding the number of tolerable faults in majority-based sy... |
TC
2011
14 years 4 months ago
2011
—Mounting concerns over variability, defects and noise motivate a new approach for digital circuitry: stochastic logic, that is to say, logic that operates on probabilistic signa...
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
Given a set of n different deterministic finite state machines (DFSMs) modeling a distributed system, we examine the problem of tolerating f crash or Byzantine faults in such a ...
108
click to vote
DSN
2005
IEEE
15 years 3 months ago
2005
IEEE
Since sensor data gathering is the primary functionality of sensor networks, it is important to provide a fault tolerant method for reasoning about sensed events in the face of ar...
NSDI
2007
14 years 11 months ago
2007
Byzantine fault tolerant systems behave correctly when no more than f out of 3f + 1 replicas fail. When there are more than f failures, traditional BFT protocols make no guarantee...
PDP
2002
IEEE
2002
IEEE
A Fault-Tolerant Reservation-Based Strategy for Scheduling Aperiodic Tasks in Multiprocessor Systems
15 years 2 months ago
Periodic and aperiodic tasks co-exist in many realtime systems. The periodic tasks typically arise from sensor data or control loops, while the aperiodic tasks generally arise fro...