VLSI layout of binary tree structures
Integration, the VLSI Journal
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Performance characteristics of the Connection Machine hypertree network
Journal of Parallel and Distributed Computing - Special issue on performance of supercomputers
Incomplete hypercubes: embeddings of tree-related networks
Journal of Parallel and Distributed Computing
The Josephus cube: a novel interconnection network
Parallel Computing
Embedding Graphs onto the Supercube
IEEE Transactions on Computers
Fibonacci Cubes-A New Interconnection Topology
IEEE Transactions on Parallel and Distributed Systems
X-Tree: A tree structured multi-processor computer architecture
ISCA '78 Proceedings of the 5th annual symposium on Computer architecture
Near-Optimal Embeddings of Trees into Fibonacci Cubes
SSST '96 Proceedings of the 28th Southeastern Symposium on System Theory (SSST '96)
| Hi-index | 0.00 |
The tree interconnection network lends itself to several suitably structured applications. However, the low connectivity at each node, traffic congestion and single point of failure at the root node reduce reliability and availability. Both the hypertree and X-tree are fault-tolerant variants of the basic tree network and have been the focus of more recent implementation and research interest. In this paper, we introduce a recently proposed family of interconnection networks known as the Josephus Cubes and show how hypertrees, X-trees and ringed X-trees of arbitrary height can be near-optimally embedded in this novel interconnection network. Embedding techniques used for both hypertree and X-trees are simple and may be recursively applied.