Load balancing in dynamic networks

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

Volumn , Issue , 2004, Pages 193-200

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

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATION THEORY; COMPUTER SIMULATION; EIGENVALUES AND EIGENFUNCTIONS; GATEWAYS (COMPUTER NETWORKS); ITERATIVE METHODS; LAPLACE TRANSFORMS; PARALLEL ALGORITHMS; TELECOMMUNICATION LINKS; TELECOMMUNICATION NETWORKS;

BALANCING FLOW; DYNAMIC NETWORK; LOAD BALANCING; PARALLEL COMPUTERS;

PARALLEL PROCESSING SYSTEMS;

EID: 3543060095     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ispan.2004.1300480     Document Type: Conference Paper

References (21)

1. Y. Afek, E. Gafni, and A. Rosen. The slide mechanism with applications in dynamic networks. In Proc. of the 11th ACM Symposium on Principles of Distributed Computing, pages 35-46, 1992.
2. W. Aiello, B. Awerbuch, B. Maggs, and S. Rao. Approximate load balancing on dynamic and asynchronous networks. In 25th ACM Symposium on Theory of Computing (STOC), pages 632-641, 1993.
3. B. Awerbuch, Y. Mansour, and N. Shavit. End-to-end communication with polynomial overhead. In Proc. of the 30th Annual Symposium on Foundations of Computer Science, pages 358363, 1989.
4. D. Bertsekas and J. Tsitsiklis. Parallel and Distributed Computation, Numerical Methods. Prentice-Hall, 1989.
5. J. Boillat. Load balancing and poisson equation in a graph. Concurrency - Practice & Experience, 2:289-313, 1990.
6. B. Bollobás. Random Graphs. Academic Press, 1985.
7. G. Cybenko. Load balancing for distributed memory multi-processors. Journal of Parallel and Distributed Computing, 7:279-301, 1989.
8. R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789-812, 1999.
9. R. Elsässer, R. Kralovio, and B. Monien. Sparse topologies with small spectrum size. Theoretical Computer Science, 307:549-565, 2003.
10. R. Elsässer, B. Monien, and R. Preis. Diffusion schemes for load balancing on heterogeneous networks. Theory of Computing Systems, 35:305-320, 2002.
11. P. Erdös and A. Rényi. On random graphs 1. Publ. Math. Debrecen, 6:290-297, 1959.
12. 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 Journal on Computing, 29:29-64, 1999.
13. Y. Hu, R. Blake, and D. Emerson. An optimal migration algorithm for dynamic load balancing. Concurrency: Practice & Experience, 10(6):467-483, 1998.
14. D. B. Johnson and D. A. Maltz. Dynamic source routing in ad hoc wireless networks. In Imielinski and Korth, editors, Mobile Computing, volume 353. Kluwer Academic Publishers, 1996.
15. F. Leighton. Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann Publishers, 1992.
16. A. Lubotzky, R. Phillips, and P. Sarnak. Ramanujan graphs. Combinatorica, 8(3):261-277, 1988.
17. S. Muthukrishnan, B. Ghosh, and M. Schultz. First- and second-order diffusive methods for rapid, coarse, distributed load balancing. Theory of Computing Systems, 31(4):331-354, 1998.
18. Y. Wang and X.-Y. Li. Geometric spanners for wireless ad hoc networks. In 22nd International Conference on Distributed Computing Systems (ICDCS'02), pages 171-180. IEEE, 2002.
19. K. Weber. On components of random subgraphs of the n-cube. Random Graphs, 2:263-278, 1992.
20. J. H. Wilkinson. The Algebraic Eigenvalue Problem. Oxford University Press, 1965.
21. C. Xu and F. Lau. Load Balancing in Parallel Computers. Kluwer, 1997.