Data movement techniques for the pyramid computer
SIAM Journal on Computing
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Pruned three-dimensional toroidal networks
Information Processing Letters
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Algorithmic construction of Hamiltonians in pyramids
Information Processing Letters
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
The recursive transpose-connected cycles (RTCC) interconnection network for multiprocessors
Proceedings of the 2005 ACM symposium on Applied computing
A deadlock free shortest path routing algorithm for WK-recursive meshes
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Nonflat surface level pyramid: a high connectivity multidimensional interconnection network
The Journal of Supercomputing
| Hi-index | 0.00 |
We present and evaluate a new pyramid topology for interconnection networks, based on the Recursive Transpose-Connected Cycles (RTCC) network, which we refer to as the RTCC-pyramid. An L level RTCCpyramid uses an RTCC network structure in each level as an alternative to the Mesh network used to construct the conventional mesh-pyramid network. We study some important properties of these topologies such as diameter and average distance. In addition, a routing algorithms based on the routing in RTCC network is proposed. We prove that this form of the pyramid topology is Hamiltonian-connected, i.e. a Hamiltonian path can be constructed from any node to any other node in the network. We conclude that, insight of most of the mentioned properties, the RTCC-pyramid is a more suitable topology to base both hardware architectures and software structures on, compared to the conventional pyramid topology.