646 search results - page 108 / 130 » Generalized efficiency bounds in distributed resource alloca... |
100
click to vote
SRDS
1999
IEEE
15 years 6 months ago
1999
IEEE
We study how to efficiently diffuse updates to a large distributed system of data replicas, some of which may exhibit arbitrary (Byzantine) failures. We assume that strictly fewer...
132
click to vote
CORR
2008
Springer
15 years 1 months ago
2008
Springer
Gossip algorithms have recently received significant attention, mainly because they constitute simple and robust message-passing schemes for distributed information processing over...
123
click to vote
CLUSTER
2006
IEEE
15 years 5 months ago
2006
IEEE
One of the most important collective communication patterns used in scientific applications is the complete exchange, also called All-to-All. Although efficient complete exchange ...
124
click to vote
CIKM
2006
Springer
15 years 5 months ago
2006
Springer
We propose an In-Network Data-Centric Storage (INDCS) scheme for answering ad-hoc queries in sensor networks. Previously proposed In-Network Storage (INS) schemes suffered from St...
113
click to vote
VEE
2009
ACM
15 years 8 months ago
2009
ACM
Clusters provide powerful computing environments, but in practice much of this power goes to waste, due to the static allocation of tasks to nodes, regardless of their changing co...