High performance hypercube communications

Authors:
G. Buzzard;T. Mudge
Affiliations:
Advanced Computer Architecture Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan;Advanced Computer Architecture Laboratory, Department of Electrical Engineering and Computer Science, University of Michigan, Ann Arbor, Michigan
Venue:
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Year:
1988

Citing 7
Cited 3

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

IEEE Transactions on Computers
Multicomputer networks: message-based parallel processing

Multicomputer networks: message-based parallel processing
Parallel branch and bound algorithms on hypercube multiprocessors

C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Intensive hypercube communication. Prearranged communication in link-bound machines

Journal of Parallel and Distributed Computing
Deadlock-free packet switching networks

STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Deadlock- and livelock-free packet switching networks

STOC '80 Proceedings of the twelfth annual ACM symposium on Theory of computing
On the Performance of k-ary n-cube Interconnection Networks

On the Performance of k-ary n-cube Interconnection Networks

A flexible system call interface for interprocessor communication in a distributed memory multicomputer

ACM SIGOPS Operating Systems Review
Performance measurement and trace driven simulation of parallel CAD and numeric applications on a hypercube multicomputer

ISCA '90 Proceedings of the 17th annual international symposium on Computer Architecture
Performance Measurement and Trace Driven Simulation of Parallel CAD and Numeric Applications on a Hypercube Multicomputer

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we present a high performance message transport scheme that is based upon packet routing. The advantages of our scheme are derived from two observations. The first is that given sufficient support from communications hardware, decreasing the message latency time can be much more important to total program execution time than increasing the bandwidth. The second observation is that, from the standpoint of message latency, existing routing strategies tend not to make productive use of much of their available link capacity. The scheme that we propose addresses these issues and leads to substantial performance improvements across a broad range of message loads.