Banyan networks for partitioning multiprocessor systems
ISCA '73 Proceedings of the 1st annual symposium on Computer architecture
De bruijn communications networks.
De bruijn communications networks.
Parallel Processing with the Perfect Shuffle
IEEE Transactions on Computers
Data Manipulating Functions in Parallel Processors and Their Implementations
IEEE Transactions on Computers
The Indirect Binary n-Cube Microprocessor Array
IEEE Transactions on Computers
Access and Alignment of Data in an Array Processor
IEEE Transactions on Computers
Generalized Connection Networks for Parallel Processor Intercommunication
IEEE Transactions on Computers
Cm*: a modular, multi-microprocessor
AFIPS '77 Proceedings of the June 13-16, 1977, national computer conference
Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance
IEEE Transactions on Computers
Distributed fault-tolerance of tree structures
IEEE Transactions on Computers
Hypernet: A communication-efficient architecture for constructing massively parallel computers
IEEE Transactions on Computers
Flexible oblivious router architecture
IBM Journal of Research and Development
PAS '97 Proceedings of the 2nd AIZU International Symposium on Parallel Algorithms / Architecture Synthesis
Design of HM2p A Hierarchical Multimicroprocessor for General-Purpose Applications
IEEE Transactions on Computers
Self-healing in binomial graph networks
OTM'07 Proceedings of the 2007 OTM Confederated international conference on On the move to meaningful internet systems - Volume Part II
HPGRID: a novel architectural model for resource management systems
Proceedings of the 2011 International Conference on Communication, Computing & Security
International Journal of Computer Applications in Technology
Topological properties of the recursive Petersen architecture
Mathematical and Computer Modelling: An International Journal
Binomial graph: a scalable and fault-tolerant logical network topology
ISPA'07 Proceedings of the 5th international conference on Parallel and Distributed Processing and Applications
| Hi-index | 15.00 |
A new interconnection topology for incrementally expansible multicomputer systems is described, which combines the easy expansibility of tree structures with the compactness of the n-dimensional hypercube. The addition of n-cube links to the binary tree structure provides direct paths between nodes which have frequent data exchange in algorithms such as sorting and fast Fourier transforms (FFT's). The derivation of a family of such Hypertree structures is outlined, and the basic properties such as average path length, uniformity of the distribution of message traffic, and routing algorithms are analyzed.