313 search results - page 22 / 63 » Computing synchronizer failure probabilities |
101
click to vote
STOC
1994
ACM
15 years 3 months ago
1994
ACM
Shannon's Coding Theorem shows that in order to reliably transmit a message of T bits over a noisy communication channel, only a constant slowdown factor is necessary in the ...
110
click to vote
TON
2010
14 years 10 months ago
2010
Abstract—Distributed routing algorithms may give rise to transient loops during path recomputation, which can pose significant stability problems in high-speed networks. We pres...
120
click to vote
ATAL
2004
Springer
15 years 5 months ago
2004
Springer
In this paper we will examine two main aspects of trust dynamics: a) How direct experiences involving trust, with their successes or failures, influence the future trust of an age...
TKDE
1998
14 years 11 months ago
1998
-- We estimate the availability, reliability, and mean transaction time (response time) for repairable database configurations, centralized or distributed, in which each service co...
124
click to vote
ICDCS
2011
IEEE
13 years 11 months ago
2011
IEEE
—The number of real-world applications that require QoS guarantees is constantly increasing and they often follow the publish/subscribe (pub/sub) messaging paradigm, which provid...