1325 search results - page 1 / 265 » Quasirandom Load Balancing |
SODA
2010
ACM
14 years 2 months ago
2010
ACM
We propose a simple distributed algorithm for balancing indivisible tokens on graphs. The algorithm is completely deterministic, though it tries to imitate (and enhance) a random ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
Quasi-random graphs can be informally described as graphs whose edge distribution closely resembles that of a truly random graph of the same edge density. Recently, Shapira and Yu...
INFOCOM
2012
IEEE
11 years 7 months ago
2012
IEEE
—This paper considers a component-level deceleration technique in BS operation, called speed-scaling, that is more conservative than entirely shutting down BSs, yet can conserve ...
JCIT
2010
12 years 11 months ago
2010
In this paper a novel adaptive load balancing routing algorithm in Ad hoc networks based on a gossiping mechanism is proposed. Unlike previously published algorithms, this algorit...
CIKM
2011
Springer
12 years 4 months ago
2011
Springer
The effectiveness and scalability of MapReduce-based implementations of complex data-intensive tasks depend on an even redistribution of data between map and reduce tasks. In the...