Load balancing of indivisible unit size tokens in dynamic and heterogeneous networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3221, Issue , 2004, Pages 640-651

  Elsässer, Robert ^a   Monien, Burkhard ^a   Schamberger, Stefan ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; DIFFUSION; HETEROGENEOUS NETWORKS;

ARBITRARILY DIVISIBLE LOADS; DIFFUSION ALGORITHM; HETEROGENEOUS SYSTEMS; HETEROGENEOUS TOPOLOGIES; HOMOGENEOUS NETWORK; LOAD BALANCING ALGORITHMS; PARALLEL AND DISTRIBUTED APPLICATIONS; RANDOMIZED STRATEGY;

NETWORK MANAGEMENT;

EID: 35048866353     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30140-0_57     Document Type: Article

References (22)

1. G. Cybenko. Load balancing for distributed memory multiprocessors. J. Par. Dist. Comp., 7:279-301, 1989.
2. S. Muthukrishnan, B. Ghosh, and M. H. Schultz. First and second order diffusive methods for rapid, coarse, distributed load balancing. Theo. Comp. Syst., 31:331-354, 1998.
3. R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Par. Comp., 25(7):789-812, 1999.
4. R. Elsässer, B. Monien, and R. Preis. Diffusion schemes for load balancing on heterogeneous networks. Theo. Comp. Syst., 35:305-320, 2002.
5. V. S. Sunderarm and G. A. Geist. Heterogeneous parallel and distributed computing. Par. Comp., 25:1699-1721, 1999.
6. R. Elsässer, B. Monien, and S. Schamberger. Load balancing in dynamic networks. In I-SPAN, 2004.
7. Y. Rabbani, A. Sinclair, and R. Wanka. Local divergence of markov chains and the analysis of iterative load-balancing schemes. In FOCS, pages 694-703, 1998.
8. R. Elsässer and B. Monien. Load balancing of unit size tokens and expansion properties of graphs. In SPAA, pages 266-273, 2003.
9. A. Cortes, A. Ripoll, F. Cedo, M. A. Senar, and E. Luque. An asynchronous and iterative load balancing algorithm for discrete load model. J. Par. Dist. Comp., 62:1729-1746, 2002.
10. J. E. Gehrke, C. G. Plaxton, and R. Rajaraman. Rapid convergence of a local load balancing algorithm for asynchronous rings. Theo. Comp. Sci., 220:247-265, 1999.
11. M. E. Houle, E. Tempero, and G. Turner. Optimal dimension-exchange token distribution on complete binary trees. Theo. Comp. Sci., 220:363-376, 1999.
12. M. E. Houle, A. Symvonis, and D. R. Wood. Dimension-exchange algorithms for load balancing on trees. In Sirocco, pages 181-196, 2002.
13. B. Ghosh, F. T. Leighton, B. M. Maggs, S. Muthukrishnan, C. G. Plaxton, R. Rajaraman, A. Richa, R. E. Tarjan, and D. Zuckerman. Tight analyses of two local load balancing algorithms. SIAM J. Computing, 29:29-64, 1999.
14. D. M. Cvetkovic, M. Doob, and H. Sachs. Spectra of Graphs. Johann Ambrosius Barth, 3rd edition, 1995.
15. B. Ghosh, S. Muthukrishnan, and M. H. Schultz. First and second order diffusive methods for rapid, coarse, distributed load balancing. In SPAA, pages 72-81, 1996.
16. J. A. Fill. Eigenvalue bounds on convergence to stationarity for nonreversible markov chains, with an application to the exclusion process. Ann. Appl. Probab., 1:62-87, 1991.
17. M. Mihail. Conductance and convergence of markov chains: a combinatorial treatment of expanders. In FOCS, pages 526-531, 1989.
18. G. Golub. Bounds for the round-off errors in the richardson second order method. BIT, 2:212-223, 1962.
19. T. Hagerup and C. Rüb. A guided tour of chernoff bounds. Inform. Proc. Letters, 36(6):305-308, 1990.
20. P. Sanders. Analysis of nearest neighbor load balancing algorithms for random loads. Par. Comp., 25:1013-1033, 1999.
21. Y. Wang and X.-Y. Li. Geometric spanners for wireless ad hoc networks. In ICDCS, pages 171-180. IEEE, 2002.
22. D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.