On isomorphisms and similarities between generalized Petersen networks and periodically regular chordal rings

Authors:
Behrooz Parhami
Affiliations:
Department of Electrical & Computer Engineering, University of California, Santa Barbara, CA 93106-9560, USA
Venue:
Information Processing Letters
Year:
2008

Citing 8
Cited 0

Periodically Regular Chordal Rings

IEEE Transactions on Parallel and Distributed Systems
Introduction to Parallel Processing: Algorithms and Architectures

Introduction to Parallel Processing: Algorithms and Architectures
Problems with Comparing Interconnection Networks: Is an Alligator Better Than an Armadillo?

IEEE Parallel & Distributed Technology: Systems & Technology
A survey on multi-loop networks

Theoretical Computer Science
Optimal routing in double loop networks

Theoretical Computer Science
Topological Structure and Analysis of Interconnection Networks

Topological Structure and Analysis of Interconnection Networks
Network topologies: inference, modeling, and generation

IEEE Communications Surveys & Tutorials
Comparing four classes of torus-based parallel architectures: Networkparameters and communication performance

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.89

Visualization

Abstract

Generalized Petersen (GP) networks and periodically regular chordal (PRC) rings have been proposed independently to ameliorate the high latency and extreme fragility of simple ring networks. In this paper, we note that certain GP networks are isomorphic to suitably constructed PRC rings, while other varieties correspond to PRC rings that closely approximate their topological and performance attributes. In the absence of equivalence and similarity proofs in the opposite direction, our results indicate that PRC rings may be preferable to GP networks in the sense of covering a broader family of networks and offering greater flexibility in cost-performance tradeoffs.