A Class of Fixed-Degree Cayley-Graph Interconnection Networks Derived by Pruning k-ary n-cubes

Authors:
Ding-Ming Kwai;Behrooz Parhami
Affiliations:
-;-
Venue:
ICPP '97 Proceedings of the international Conference on Parallel Processing
Year:
1997

Citing 9
Cited 3

Interconnection Networks Based on a Generalization of Cube-Connected Cycles

IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks

IEEE Transactions on Computers
The Tera computer system

ICS '90 Proceedings of the 4th international conference on Supercomputing
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Lee Distance and Topological Properties of k-ary n-cubes

IEEE Transactions on Computers
Optimal Routing Algorithm and the Diameter of the Cube-Connected Cycles

IEEE Transactions on Parallel and Distributed Systems
Three-Dimensional Network Topologies

PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Design and analysis of product networks

FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)
Periodically regular chordal ring networks for massively parallel architectures

FRONTIERS '95 Proceedings of the Fifth Symposium on the Frontiers of Massively Parallel Computation (Frontiers'95)

A Unified Formulation of Honeycomb and Diamond Networks

IEEE Transactions on Parallel and Distributed Systems
Pancake problems with restricted prefix reversals and some corresponding Cayley networks

Journal of Parallel and Distributed Computing
Comparing four classes of torus-based parallel architectures: Networkparameters and communication performance

Mathematical and Computer Modelling: An International Journal

Quantified Score

Hi-index	0.02

Visualization

Abstract

We introduce a pruning scheme to reduce the node degree of k-ary n-cube from 2n to 4. The links corresponding to n - 2 of the n dimensions are removed from each node. One of the remaining dimensions is common to all nodes and the other is selected periodically from the remaining n - 1 dimensions. Despite the removal of a large number of links from the k-ary n-cube, this incomplete version still preserves many of its desirable topological properties. In this paper, we show that this incomplete k-ary n-cube belongs to the class of Cayley graphs, and hence, is node-symmetric. It is 4-connected with diameter close to that of the k-ary n-cube.