2400 search results - page 58 / 480 » Systems Failures |
162
click to vote
NETWORKING
2004
15 years 7 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...
167
click to vote
ICSE
2009
IEEE-ACM
15 years 3 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...
203
click to vote
IPPS
2007
IEEE
16 years 13 days 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 ...
169
click to vote
OSDI
2004
ACM
16 years 6 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...
145
click to vote
SPAA
2009
ACM
16 years 6 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...