1434 search results - page 108 / 287 » Distributed Computing with Imperfect Randomness |
PERCOM
2006
ACM
14 years 9 months ago
2006
ACM
Key predistribution schemes are a favoured solution for establishing secure communication in sensor networks. Often viewed as the safest way to bootstrap trust, the main drawback ...
ICNP
2003
IEEE
14 years 3 months ago
2003
IEEE
We propose and evaluate a mobile, peer-to-peer Information Retrieval system. Such a system can, for example, support medical care in a disaster by allowing access to a large colle...
ICDCS
1999
IEEE
14 years 2 months ago
1999
IEEE
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
PODC
2010
ACM
14 years 2 months ago
2010
ACM
We introduce Multi-Trials, a new technique for symmetry breaking for distributed algorithms and apply it to various problems in general graphs. For instance, we present three rand...
SPAA
1996
ACM
14 years 2 months ago
1996
ACM
In this paper, we analyze the performance of parallel multithreaded algorithms that use dag-consistent distributed shared memory. Specifically, we analyze execution time, page fau...