2400 search results - page 58 / 480 » Systems Failures |
NETWORKING
2004
13 years 9 months ago
2004
Probabilistic inference was shown effective in non-deterministic diagnosis of end-to-end service failures. Since exact probabilistic diagnosis is known to be an NP-hard problem, a...
ICSE
2009
IEEE-ACM
13 years 5 months ago
2009
IEEE-ACM
Abstract. At our behest or otherwise, while our software is being executed, a huge variety of design assumptions is continuously matched with the truth of the current condition. Wh...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
— Frequent failure occurrences are becoming a serious concern to the community of high-end computing, especially when the applications and the underlying systems rapidly grow in ...
OSDI
2004
ACM
14 years 8 months ago
2004
ACM
Detecting network path anomalies generally requires examining large volumes of traffic data to find misbehavior. We observe that wide-area services, such as peerto-peer systems an...
SPAA
2009
ACM
14 years 8 months ago
2009
ACM
Dining philosophers is a classic scheduling problem for local mutual exclusion on arbitrary conflict graphs. We establish necessary conditions to solve wait-free dining under even...