Sparse topologies with small spectrum size

Authors:
R. Elsässer;R. Královič;B. Monien
Affiliations:
University of Paderborn, Paderborn, Germany;Comenius University, Bratislava MFF-UK, Slovakia;University of Paderborn, Paderborn, Germany
Venue:
Theoretical Computer Science - Selected papers in honor of Lawrence Harper
Year:
2003

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 Laplace matrix. Determining this number is of theoretical interest as well as of practical impact. Sparse graphs with small spectra exhibit excellent structural properties and can act as interconnection topologies. In this paper, for any n we present graphs, for which the product of their vertex degree and the number of different eigenvalues is small. It is known that load balancing can be performed on such graphs in a small number of steps.