5966 search results - page 308 / 1194 » Distributed Caching Algorithms for Content Distribution Netw... |
160
click to vote
SODA
2010
ACM
16 years 4 months ago
2010
ACM
We consider the problem of fault-tolerant agreement in a crash-prone synchronous system. We present a new randomized consensus algorithm that achieves optimal communication effici...
183
click to vote
GI
2008
Springer
15 years 7 months ago
2008
Springer
: As data and services are increasingly distributed in the network, rather than stored in a fixed location, one can imagine a scenario in which the Personal Computer, intended as a...
135
click to vote
WDAG
2009
Springer
16 years 1 months ago
2009
Springer
Given an undirected graph and 0 ≤ ≤ 1, a set of nodes is called -near clique if all but an fraction of the pairs of nodes in the set have a link between them. In this paper we...
183
click to vote
AMC
2007
15 years 6 months ago
2007
In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order...
179
click to vote
WWW
2006
ACM
16 years 7 months ago
2006
ACM
Peer-to-peer (P2P) Web search has gained a lot of interest lately, due to the salient characteristics of P2P systems, namely scalability, fault-tolerance and load-balancing. Howev...