94 search results - page 1 / 19 » Tight Bounds for Parallel Randomized Load Balancing |
CORR
2011
Springer
13 years 6 months ago
2011
Springer
SOFSEM
2010
Springer
14 years 8 months ago
2010
Springer
We extend the lower bound of Adler et. al [1] and Berenbrink [3] for parallel randomized load balancing algorithms. The setting in these asynchronous and distributed algorithms is...
RSA
1998
13 years 10 months ago
1998
It is well known that after placing n balls independently and uniformly at random into n bins, the fullest bin holds (logn=log logn) balls with high probability. Recently, Azar et...
SIGMETRICS
2010
ACM
14 years 4 months ago
2010
ACM
In this paper, we analyze the performance of random load resampling and migration strategies in parallel server systems. Clients initially attach to an arbitrary server, but may s...
ICALP
2007
Springer
14 years 5 months ago
2007
Springer
As defined by Aumann in 1959, a strong equilibrium is a Nash equilibrium that is resilient to deviations by coalitions. We give tight bounds on the strong price of anarchy for loa...