Hypercube Multiprocessors with Bus Connections for Improving Communication Performance

Authors:
Tsutomu Ishikawa
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1995

Citing 7
Cited 2

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Array processor with multiple broadcasting

Journal of Parallel and Distributed Computing
Spanning Multiaccess Channel Hypercube Computer Interconnection

IEEE Transactions on Computers
Enhanced Hypercubes

IEEE Transactions on Computers
The Twisted N-Cube with Application to Multiprocessing

IEEE Transactions on Computers
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Bused Hypercubes and Other Pin-Optimal Networks

IEEE Transactions on Parallel and Distributed Systems

Mapping Parallel Application Communication Topology to Rhombic Overlapping-Cluster Multiprocessors

The Journal of Supercomputing
Routing Algorithms on the Bus-Based Hypercube Network

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	14.98

Visualization

Abstract

A modified hypercube with multiple buses used as bypass routes is proposed. This is achieved by partitioning all PEs into subsets using coding theory and by connecting all PEs in each subset to a bus. The basic structure for small systems reduces the diameter to two (one on a bus plus one on a link). In the generalized structure for large systems, it is reduced to less than about one-third that of the regular hypercube.