Load balancing of unit size tokens and expansion properties of graphs

Annual ACM Symposium on Parallel Algorithms and Architectures

Volumn , Issue , 2003, Pages 266-273

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

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTATION THEORY; EIGENVALUES AND EIGENFUNCTIONS; FLOW CONTROL; GRAPH THEORY; ITERATIVE METHODS; MARKOV PROCESSES;

DIFFUSION ALGORITHMS;

PARALLEL PROCESSING SYSTEMS;

EID: 0037703308     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. D. Aldous. On the markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probab. Engrg. Inform. Sci., 1:33-46, 1987.
2. N. Alon. Eigenvalues and expanders. Combinatorica, 6(2):83-96, 1986.
3. N. Alon, Z. Galil, and V. Milman. Better expanders and superconcentrators. J. of Algorithms, 8:337-347, 1987.
4. 1, isoperimetric inequalities for graphs, and superconcentrators. J. of Combin. Theory, B(38):73-88, 1985.
5. J. Boillat. Load balancing and poisson equation in a graph. Concurrency - Practice & Experience, 2:289-313, 1990.
6. J. Cheeger. A lower bound for the smallest eigenvalue of the laplacian. Problems in analysis, pages 195-199, 1970.
7. H. Chernoff. A measure of asymptotic efficiency for tests of a hypothesis based on the sum of observations. Ann. Math. Stat., 23:493-507, 1952.
8. F. Chung. Spectral Graph Theory, volume 92 of CBMS Regional conference series in mathematics. American Mathematical Society, 1997.
9. A. Cortes, A. Ripoll, F. Cedo, M. Senar, and E. Luque. An asynchronous and iterative load balancing algorithm for discrete load model. Journal of Parallel and Distributed Computing, 62:1729-1746, 2002.
10. G. Cybenko. Load balancing for distributed memory multiprocessors. Journal of Parallel and Distributed Computing, 7:279-301, 1989.
11. R. Diekmann, A. Frommer, and B. Monien. Efficient schemes for nearest neighbor load balancing. Parallel Computing, 25(7):789-812, 1999.
12. R. Elsässer, B. Monien, and R. Preis. Diffusion schemes for load balancing on heterogeneous networks. Theory of Computing Systems, 35:305-320, 2002.
13. J. Fill. Eigenvalue bounds on convergence to stationarity for nonreversible markov chains with an application to the exclusion process. Annals of Applied Probability, 1:62-87, 1991.
14. G. Fox, R. Williams, and P. Messina. Parallel Computing Works! Morgan Kaufmann, 1994.
15. 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.
16. D. Gillman. A Chernoff bound for random walks on expander graphs. SIAM J. on Computing, 27(4):1203-1220, 1998.
17. G. Golub. Bounds for the round-off errors in the richardson second order method. BIT, 2:212-223, 1962.
18. T. Hagerup and C. Rüb. A guided tour of Chernoff bounds. Information Processing Letters, 36(6):305-308, 1990.
19. M. Jerrum and A. Sinclair. Approximating the permanent. SIAM J. on Computing, 18:1149-1178, 1989.
20. N. Kahale. Eigenvalues and expansion of regular graphs. Journal of the ACM, 42:1091-1106, 1995.
21. L. Lovász and M. Simonovits. Random walks in a convex body and an improved volume algorithm. Random Structures Algorithms, 4:359-412, 1993.
22. M. Mihail. Conductance and convergence of markov chains: a combinatorial treatment of expanders. In Proc. of the 37th Conf. on Foundations of Computer Science, pages 526-531, 1989.
23. B. Mohar. Isoperimetric inequalities, growth, and the spectrum of graphs. Lin. Alg. Appl., 103:119-131, 1988.
24. B. Mohar. Isoperimetric numbers of graphs. J. Combin. Theory, 47(3):274-291, 1989.
25. S. Muthukrishnan, B. Ghosh, and M. Schultz. First and second order diffusive methods for rapid, coarse, distributed load balancing. Theory of Computing Systems, 31:331-354, 1998.
26. A. Pothen, H. Simon, and K. Liu. Partitioning sparse matrices with eigenvectors of graphs. SIAM J. on Matrix Analysis and Applications, ll(3):430-452, 1990.
27. M. Raab and A. Steger. "Balls into bins" a simple and tight analysis. In Proc. of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, pages 159-170, 1998.
28. Y. Rabani, A. Sinclair, and R. Wanka. Local divergence of markov chains and the analysis of iterative load-balancing schemes. In Proc. of the 39th Conf. on Foundations of Computer Science, pages 694-703, 1998.
29. A. Sinclair and M. Jerrum. Approximate counting, uniform generation, and rapidly mixing markov chains. Inform, and Comput., 82:93-113, 1989.
30. R. Tanner. Explicit construction of concentrators from generalized n-gons. Algebraic Discrete Methods, 5:287-294, 1984.