Fat-trees: universal networks for hardware-efficient supercomputing
IEEE Transactions on Computers
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Multiple alignment, communication cost, and graph matching
SIAM Journal on Applied Mathematics
Limits on Interconnection Network Performance
IEEE Transactions on Parallel and Distributed Systems
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
Principles and Practices of Interconnection Networks
Principles and Practices of Interconnection Networks
Flattened butterfly: a cost-efficient topology for high-radix networks
Proceedings of the 34th annual international symposium on Computer architecture
Generalized Hypercube and Hyperbus Structures for a Computer Network
IEEE Transactions on Computers
High-radix interconnection networks
High-radix interconnection networks
HyperX: topology, routing, and packaging of efficient large-scale networks
Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis
Topological Structure and Analysis of Interconnection Networks
Topological Structure and Analysis of Interconnection Networks
On the Topological Properties of Grid-Based Interconnection Networks
The Computer Journal
Hi-index | 0.00 |
In modern world, all sciences especially engineering have insatiable demand for more power of processing. Although the use of modern micro-architectures has increased the performance of processors, this increment is only part of speeding up in responding such these demands. In fact, the need of some applications to parallel systems in large scales makes these systems more popular. Therefore, these systems are only the possible way of performing enormous computing power for applications with high performance computing. This paper comprehensively studies the topological properties of a class of n-D networks that are called HyperX from different aspects. In this paper we are going to provide a detailed description of HyperX topology in an algebraic framework with basic features (such as regularity, symmetry, etc.). The important parameters in this topology are evaluated parametrically and compared with other topologies. Having expressed this fact, we emphasize that our study is among the very few attempts reported in the literature to analyze the important parameters that can capture the performance behavior of HyperX topology. Since HyperX has many advantages of high radix switch components, it becomes a serious competitor against the other topologies and high radix networks. Hence, this study leads to finding an optimum topology for these kinds of networks.