Scalable Sparse Topologies with Small Spectrum

Authors:
Robert Elsässer;Rastislav Kralovi;Burkhard Monien
Affiliations:
-;-;-
Venue:
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Year:
2001

Citing 8
Cited 0

A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
Dynamic load balancing for distributed memory multiprocessors

Journal of Parallel and Distributed Computing
First and second order diffusive methods for rapid, coarse, distributed load balancing (extended abstract)

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The spectrum of de Bruijn and Kautz graphs

European Journal of Combinatorics
An improved diffusion algorithm for dynamic load balancing

Parallel Computing
Efficient schemes for nearest neighbor load balancing

Parallel Computing - Special issue on parallelization techniques for numerical modelling
Load Balancing in Parallel Computers: Theory and Practice

Load Balancing in Parallel Computers: Theory and Practice
Optimal and Alternating-Direction Load Balancing Schemes

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

One of the fundamental properties of a graph is the number of distinct eigenvalues of its adjacency or Laplacian matrix. Determining this number is of theoretical interest and also of practical impact. Graphs with small spectra exhibit many symmetry properties and are well suited as interconnection topologies. Especially load balancing can be done on such interconnection topologies in a small number of steps. In this paper we are interested in graphs with maximal degree O(log n), where n is the number of vertices, and with a small number of distinct eigenvalues. Our goal is to find scalable families of such graphs with polylogarithmic spectrum in the number of vertices. We present also the eigenvalues of the Butterfly graph.