Interconnection Networks Based on a Generalization of Cube-Connected Cycles
IEEE Transactions on Computers
Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Horizons of parallel computation
Journal of Parallel and Distributed Computing
ICS '90 Proceedings of the 4th international conference on Supercomputing
Periodically Regular Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Introduction to Parallel Processing: Algorithms and Architectures
Introduction to Parallel Processing: Algorithms and Architectures
Lee Distance and Topological Properties of k-ary n-cubes
IEEE Transactions on Computers
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)
IEEE Transactions on Parallel and Distributed Systems
Performance, Algorithmic, and Robustness Attributes of Perfect Difference Networks
IEEE Transactions on Parallel and Distributed Systems
Swapped interconnection networks: Topological, performance, and robustness attributes
Journal of Parallel and Distributed Computing - Special issue: Design and performance of networks for super-, cluster-, and grid-computing: Part II
A Group Construction Method with Applications to Deriving Pruned Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Further mathematical properties of Cayley digraphs applied to hexagonal and honeycomb meshes
Discrete Applied Mathematics
Further properties of cayley digraphs and their applications to interconnection networks
TAMC'06 Proceedings of the Third international conference on Theory and Applications of Models of Computation
Mathematical and Computer Modelling: An International Journal
| Hi-index | 0.00 |
Incomplete or pruned k-ary n-cube, n ≥ 3, is derived as follows. All links of dimension n - 1 are left in place and links of the remaining n- 1 dimensions are removed, except for one, which is chosen periodically from the remaining dimensions along the intact dimension n - 1. This leads to a node degree of 4 instead of the original 2n and results in regular networks that are Cayley graphs, provided that n - 1 divides k. For n = 3 (n = 5), the preceding restriction is not problematic, as it only requires that k be even (a multiple of 4). In other cases, changes to the basis network to be pruned, or to the pruning algorithm, can mitigate the problem. Incomplete k-ary n-cube maintains a number of desirable topological properties of its unpruned counterpart despite having fewer links. It is maximally connected, has diameter and fault diameter very close to those of k-ary n-cube, and an average internode distance that is only slightly greater. Hence, the cost/performance tradeoffs offered by our pruning scheme can in fact lead to useful, and practically realizable, parallel architectures. We study pruned k-ary n-cubes in general and offer some additional results for the special case n = 3.