Routing for generalized chordal rings

Authors:
Bruce W. Arden;Kit-Ming W. Tang
Affiliations:
Department of Electrical Engineering, University of Rochester, Rochester NY;Department of Electrical Engineering, University of Rochester, Rochester NY
Venue:
CSC '90 Proceedings of the 1990 ACM annual conference on Cooperation
Year:
1990

Citing 1
Cited 3

Strategies for interconnection networks: some methods from graph theory

Journal of Parallel and Distributed Computing

Vertex-transitivity and routing for Cayley graphs in GCR representations

SAC '92 Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's
Periodically Regular Chordal Rings

IEEE Transactions on Parallel and Distributed Systems
A universal performance factor for multi-criteria evaluation of multistage interconnection networks

Future Generation Computer Systems - Systems performance analysis and evaluation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A recursive routing algorithm is presented for generalized chordal ring (GCR) graphs. This algorithm consists of two parts. The first part deals with an one-time establishment of a database, and the second part determines a path of length less than or equal to 2l where l is the smallest integer that such a path exists. Note that l ≤ d where d satisfies 2d-1 diameter ≤ 2d. The inherent symmetry and the modular arithmetic connectivity of the GCR are exploited to achieve a parallel time complexity of O(log2 diameter) and a serial time complexity of O(diameter).