1187 search results - page 225 / 238 » On Modeling Cross-Talk Faults |
PODC
2010
ACM
14 years 15 days ago
2010
ACM
: The Borowsky-Gafni (BG) simulation algorithm is a powerful reduction algorithm that shows that t-resilience of decision tasks can be fully characterized in terms of wait-freedom....
PODC
2009
ACM
14 years 9 months ago
2009
ACM
Global consistency or Byzantine Agreement (BA) and reliable point-to-point communication are two of the most important and well-studied problems in distributed computing. Informal...
SAC
2010
ACM
14 years 3 months ago
2010
ACM
Byzantine consensus in asynchronous message-passing systems has been shown to require at least 3f + 1 processes to be solvable in several system models (e.g., with failure detecto...
IPSN
2009
Springer
14 years 3 months ago
2009
Springer
Data Driven Time Synchronization (DDTS) provides synchronization across sensors by using underlying characteristics of data collected by an embedded sensing system. We apply the c...
CASES
2009
ACM
14 years 3 months ago
2009
ACM
Accurate estimation of the tick length of a synchronous program is essential for efficient and predictable implementations that are devoid of timing faults. The techniques to dete...