Sciweavers

1119 search results - page 49 / 224
» Computing in the Presence of Timing Failures
Sort
View
IANDC
2007
84views more  IANDC 2007»
13 years 9 months ago
The perfectly synchronized round-based model of distributed computing
ectly-synchronized round-based model provides the powerful abstraction of op failures with atomic and synchronous message delivery. This abstraction makes distributed programming ...
Carole Delporte-Gallet, Hugues Fauconnier, Rachid ...
ICCAD
2006
IEEE
183views Hardware» more  ICCAD 2006»
14 years 6 months ago
Soft error derating computation in sequential circuits
Soft error tolerant design becomes more crucial due to exponential increase in the vulnerability of computer systems to soft errors. Accurate estimation of soft error rate (SER), ...
Hossein Asadi, Mehdi Baradaran Tahoori
PERCOM
2007
ACM
14 years 3 months ago
An Adaptive Algorithm for Fault Tolerant Re-Routing in Wireless Sensor Networks
A substantial amount of research on routing in sensor networks has focused upon methods for constructing the best route, or routes, from data source to sink before sending the dat...
Michael Gregoire, Israel Koren
DSN
2007
IEEE
14 years 3 months ago
Architecture-Level Soft Error Analysis: Examining the Limits of Common Assumptions
This paper concerns the validity of a widely used method for estimating the architecture-level mean time to failure (MTTF) due to soft errors. The method first calculates the fai...
Xiaodong Li, Sarita V. Adve, Pradip Bose, Jude A. ...
PODC
1994
ACM
14 years 1 months ago
A Checkpoint Protocol for an Entry Consistent Shared Memory System
Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application's executio...
Nuno Neves, Miguel Castro, Paulo Guedes