Topological properties of the recursive Petersen architecture

Authors:
A. A. Nanavati;S. S. Iyengar;A. El-Amawy
Affiliations:
Department of Computer Science, Louisiana State University Baton Rouge, LA 70803, U.S.A.;Department of Computer Science, Louisiana State University Baton Rouge, LA 70803, U.S.A.;Department of Electrical Engineering, Louisiana State University Baton Rouge, LA 70803, U.S.A.
Venue:
Mathematical and Computer Modelling: An International Journal
Year:
1995

Citing 7
Cited 0

The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI

IEEE Transactions on Computers
Bridged hypercube networks

Journal of Parallel and Distributed Computing
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Properties and Performance of Folded Hypercubes

IEEE Transactions on Parallel and Distributed Systems
Parallel Processing with the Perfect Shuffle

IEEE Transactions on Computers
The Universality of the Shuffle-Exchange Network

IEEE Transactions on Computers
Hypertree: A Multiprocessor Interconnection Topology

IEEE Transactions on Computers

Quantified Score

Hi-index	0.98

Visualization

Abstract

The Petersen graph is gaining popularity as an interconnection network because of its several interesting properties. The recursive Petersen architecture is very compact and has some very interesting topological properties. In this paper, we study its topological properties in detail. Two labeling schemes are suggested. Basic routing and broadcasting have been discussed. The most attractive features are its logarithmic (to the base 10) diameter and high symmetry.