Interconnection Networks Based on a Generalization of Cube-Connected Cycles

Authors:
G. E. Carlsson;J. E. Cruthirds;H. B. Sexton;C. G. Wright
Affiliations:
Univ. of California at San Diego, La Jolla;Univ. of South Alabama, Mobile;Naval Ocean Systems Center, San Diego, CA;LUCID, Inc., Palo Alto, CA
Venue:
IEEE Transactions on Computers
Year:
1985

Citing 0
Cited 16

Spanning Multiaccess Channel Hypercube Computer Interconnection

IEEE Transactions on Computers
Constructing the vertex-transitive graphs of order 24

Journal of Symbolic Computation
DASP: a general-purpose MIMD parallel computer using distributed associative processing

Proceedings of the 1989 ACM/IEEE conference on Supercomputing
A unified approach to off-line permutation routing on parallel networks

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
An overview of supertoroidal networks

SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Small Diameter Symmetric Networks From Linear Groups

IEEE Transactions on Computers
Wavelength Division Multiple Access Channel Hypercube Processor Interconnection

IEEE Transactions on Computers
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four

IEEE Transactions on Parallel and Distributed Systems
Class-Congruence Property and Two-Phase Routing of Borel Cayley Graphs

IEEE Transactions on Computers
Optimal Total Exchange in Cayley Graphs

IEEE Transactions on Parallel and Distributed Systems
A tabular method for verification of data exchange algorithms on networks of parallel processors

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

ICPP '97 Proceedings of the international Conference on Parallel Processing
Sparse networks tolerating random faults

Discrete Applied Mathematics - Special issue on international workshop on algorithms, combinatorics, and optimization in interconnection networks (IWACOIN '99)
Incomplete k-ary n-cube and its derivatives

Journal of Parallel and Distributed Computing
Perfect Difference Networks and Related Interconnection Structures for Parallel and Distributed Systems

IEEE Transactions on Parallel and Distributed Systems
Forwarding index of cube-connected cycles

Discrete Applied Mathematics

Quantified Score

Hi-index	14.99

Visualization

Abstract

A generalization of the cube-connected cycles of Preparata and Vuillemin is described which retains the symmetry of these architectures while allowing for constructions of greater density and of arbitrary degree. These constructions are of a type known as Cayley graphs, and their analysis is greatly facilitated by the applicability of methods from abstract algebra.