94 search results - page 13 / 19 » Tight Bounds for Parallel Randomized Load Balancing |
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
In the classical balls-and-bins paradigm, where n balls are placed independently and uniformly in n bins, typically the number of bins with at least two balls in them is Θ(n) and ...
PODC
2005
ACM
14 years 1 months ago
2005
ACM
We propose a scheme for building peer-to-peer overlay networks for broadcasting using network coding. The scheme addresses many practical issues such as scalability, robustness, c...
IPPS
2006
IEEE
14 years 1 months ago
2006
IEEE
In this paper a novel job allocation scheme in distributed systems (TAG) is modelled using the Markovian process algebra PEPA. This scheme requires no prior knowledge of job size ...
PDCN
2004
13 years 9 months ago
2004
A novel combination of emergent algorithmic methods, powerful computational platforms and supporting infrastructure is described. These complementary tools and technologies are us...
JEA
1998
13 years 7 months ago
1998
We introduce a new deterministic parallel sorting algorithm based on the regular sampling approach. The algorithm uses only two rounds of regular all-to-all personalized communica...