Scalable sparse topologies with small spectrum

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

Volumn 2010, Issue , 2001, Pages 218-229

  Elsässer, Robert ^a   Královič, Rastislav ^b   Monien, Burkhard ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

^b Physics and Informatics   (Slovakia)

Author keywords

[No Author keywords available]

Indexed keywords

EIGENVALUES AND EIGENFUNCTIONS; ELECTRIC NETWORK TOPOLOGY; MATRIX ALGEBRA;

EIGENVALUES; FUNDAMENTAL PROPERTIES; INTERCONNECTION TOPOLOGIES; LAPLACIAN MATRICES; MAXIMAL DEGREE; POLYLOGARITHMIC; SYMMETRY PROPERTIES;

GRAPH THEORY;

EID: 26344468791     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44693-1_19     Document Type: Conference Paper

References (18)

1. Akers, S.B., Harel, D., Krishnamurthy, B.: The Star Graph: An Attractive Alternative to the n-Cube, Proc. of the International Conference on Parallel Processing, 1987, pp.393–400.
2. Akers, S.B., Krishnamurthy, B.: A Group-Theoretic Model for Symmetric Interconnection Networks, IEEE Transactions on Computers 38, 1989, pp. 555–565.
3. Biggs, N. L.:Algebraic Graph Theory, (2nd ed.), Cambridge University Press, Cambridge, 1993.
4. Brouwe, A. E., Cohen, A. M., Neumaier A.: Distance-Regular Graphs, Springer Verlag 1989.
5. Chung, F.R.K.: Spectral Graph Theory, American Mathematical Society, 1994.
6. Cybenko, G: Load balancing for distributed memory multiprocessors J. of Parallel and Distributed Computing 7, 1989, pp. 279–301.
7. Cvetković, D. M., Doob, M., Sachs, H.: Spectra of graphs, Theory and Application, Academic Press, 1980.
8. Decker, T., Monien, B., Preis, R.: Towards Optimal Load Balancing Topologies, Proceedings of the 6th EuroPar Conference, LNCS, 2000, to appear.
9. Delorme, C., Tillich, J. P.: The spectrum of DeBruijn and Kautz Graphs, European Journal of Combinatorics 19, 1998, pp. 307–319.
10. Diekmann R., Frommer, A., Monien, B.: Efficient schemes for nearest neighbor load balancing, Parallel Computing 25, 1999, pp. 789–812.
11. Elsässer, R., Frommer, A., Monien, B., Preis, R.: Optimal and Alternating-Direction Load Balancing, EuroPar’99, LNCS 1685, 1999, pp. 280–290.
12. Flatto, L., Odlyzko, A.M., Wales, D.B.: Random Shuffles and Group Representations, The Annals of Probability 13, 1985 pp. 154–178.
13. Gosh, B., Muthukrishnan, S., Schultz, M.H.: First and Second order diffusive methods for rapid, coarse, distributed load balancing, SPAA, 1996, pp. 72–81.
14. Hu, Y.F., Blake, R.J.: An improved diffusion algorithm for dynamic load balancing, Parallel Computing 25, 1999, pp. 417–444.
15. Hu, Y.F., Blake, R.J., Emerson, D.R.: An optimal migration algorithm for dynamic load balancing, Concurrency: Prac. and Exp. 10, 1998, pp. 467–483.
16. Hubaut, X. L.:Strongly Regular Graphs, Discrete Math. 13, 1975, pp. 357–381.
17. Tillich, J.-P.: The spectrum of the double-rooted tree, personal communication.
18. Xu, C., Lau, F.C.M.: Load Balancing in Parallel Computers, Kluwer, 1997.