Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Spanning Multiaccess Channel Hypercube Computer Interconnection
IEEE Transactions on Computers
Multiprocessor performance
Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Performance of multicomputer networks under Pin-out constraints
Journal of Parallel and Distributed Computing
Pipelined communications in optically interconnected arrays
Journal of Parallel and Distributed Computing
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Wavelength Division Multiple Access Channel Hypercube Processor Interconnection
IEEE Transactions on Computers
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
“Hypermeshes”: optical interconnection networks for parallel computing
Journal of Parallel and Distributed Computing
Performance evaluation of hypermeshes and meshes with wormhole routing
Journal of Systems Architecture: the EUROMICRO Journal - Special quintuple issue: Euromicro 1995 short contributions
Packet routing in fixed-connection networks: a survey
Journal of Parallel and Distributed Computing
Hierarchical Scalable Photonic Architectures for High-Performance Processor Interconnection
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Architecture and Performance of the Hitachi SR2201 Massively Parallel Processor System
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
Optimal embeddings of multiple graphs into a hypermesh
ICPADS '97 Proceedings of the 1997 International Conference on Parallel and Distributed Systems
Theory, Volume 1, Queueing Systems
Theory, Volume 1, Queueing Systems
Graphs and Hypergraphs
One-step t-fault diagnosis for hypermesh optical interconnection multiprocessor systems
Journal of Systems and Software
Conditional diagnosability of hypermeshes under the comparison model
Information Processing Letters
Hi-index | 0.00 |
Hypermeshes are promising candidates for the construction of high performance interconnection networks. Their main advantage is that they present a low diameter, high bandwidth, low latency network, which can naturally embed a wide range of communication patterns. Since a VLSI implementation of such a system is still far-off, we argue that any implementation is pin-out, rather than wire density limited. We will study the networks under this assumption. In this paper we introduce the Hamming hypermesh, which has a lower pin-out, in an attempt to enhance the performance of the network. It is shown both by theoretical work and simulations that this implementation outperforms previously proposed hypermeshes under the constant pin-out argument. Furthermore Hamming hypermeshes have the additional benefit of providing higher bandwidth channels and simpler switching structures. Since it has been shown that complete hypermeshes outperform the mesh, the torus, low dimensional k-ary n-cubes (with and without bypass channels), and multi-stage interconnection networks under the constant pin-out argument, it follows that incomplete hypermeshes outperform them as well.