Applied combinatorics
On group graphs and their fault tolerance
IEEE Transactions on Computers
The architecture and programming of the Ametek series 2010 multicomputer
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Warp: an integrated solution of high-speed parallel computing
Proceedings of the 1988 ACM/IEEE conference on Supercomputing
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
IEEE Transactions on Computers
Cayley Graphs With Optimal Fault Tolerance
IEEE Transactions on Computers
Resource Placement with Multiple Adjacency Constraints in k-ary n-Cubes
IEEE Transactions on Parallel and Distributed Systems
Folded Petersen Cube Networks: New Competitors for the Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A New Family of Cayley Graph Interconnection Networks of Constant Degree Four
IEEE Transactions on Parallel and Distributed Systems
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
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Cayley graph connected cycles: A new class of fixed-degree interconnection networks
HICSS '95 Proceedings of the 28th Hawaii International Conference on System Sciences
Submicron Systems Architecture Project: Semiannual Technical Report
Submicron Systems Architecture Project: Semiannual Technical Report
On the Isomorphism between Cyclic-Cubes and Wrapped Butterfly Networks
IEEE Transactions on Parallel and Distributed Systems
Arbitrary Group Permutations on Hypercube and Nonblocability of Cube-connected Cycles
Automation and Remote Control
Construction of Hamiltonian Circuits in Cayley Graphs Modeling Multiprocessing Computer Systems
Automation and Remote Control
Optimal Total Exchange in Cayley Graphs
IEEE Transactions on Parallel and Distributed Systems
Some characterizations for the wrapped butterfly
Analysis, combinatorics and computing
Hardware for multiconnected networks: a case study
Information Sciences—Informatics and Computer Science: An International Journal - Special issue: Informatics and computer science intelligent systems applications
Edge-disjoint spanning trees for the generalized butterfly networks and their applications
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
A new family of interconnection networks of odd fixed degrees
Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Wirelength of 1-fault hamiltonian graphs into wheels and fans
Information Processing Letters
A fault-tolerant routing strategy for fibonacci-class cubes
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
| Hi-index | 0.00 |
We introduce a new family of interconnection networks that are Cayley graphs with fixed degrees of any even number greater than or equal to four. We call the proposed graphs cyclic-cubes because contracting some cycles in such a graph results in a generalized hypercube. These Cayley graphs have optimal fault tolerance and logarithmic diameters. For comparable number of nodes, a cyclic-cube can have a diameter smaller than previously known fixed-degree networks. The proposed graphs can adopt an optimum routing algorithm known for one of its subfamilies of Cayley graphs. We also show that a graph in the new family has a Hamiltonian cycle and, hence, there is an embedding of a ring. Embedding of meshes and hypercubes are also discussed.