2084 search results - page 148 / 417 » Proving Time Bounds for Randomized Distributed Algorithms |
184
click to vote
ISPAN
2002
IEEE
15 years 10 months ago
2002
IEEE
In the directed acyclic graph (dag) model of algorithms, consider the following problem for precedence-constrained multiprocessor schedules for array computations: Given a sequenc...
135
click to vote
SIGMETRICS
2006
ACM
15 years 11 months ago
2006
ACM
The Erlang formula is known to be insensitive to the holding time distribution beyond the mean. While calls are generally assumed to arrive as a Poisson process, we prove that it ...
127
click to vote
FOCS
2008
IEEE
15 years 11 months ago
2008
IEEE
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
132
click to vote
IPPS
2008
IEEE
15 years 11 months ago
2008
IEEE
Peer-to-peer (P2P) networks based on consistent hashing functions have an inherent load uneven distribution problem. Things are even worse in unstructured P2P systems. The objecti...
122
click to vote
CSR
2007
Springer
15 years 11 months ago
2007
Springer
Consider a family of sets and a single set, called query set. How can one quickly find a member of the family which has a maximal intersection with the query set? Strict time cons...