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 im-portant to total program execution time than increasing the bandwidth. The second observation is that, from the stand-point of message latency, existing routing strategies tend not to make productive use of much of their available link capac-ity. The scheme that we propose addresses these issues and leads to substantial performance improvements across a broad range of message loads.
In this paper we introduce the hypercube topology and show effects over the performance of communica...
In real-time computing applications, it is important to have parallel computing systems that not onl...
Includes bibliographical references (p. 34-35).Supported by the NSF. NSF-DDM-8903385 Supported by th...
A large potential exists for increasing the communication performance of hypercube multiprocessors. ...
A new hypercube-type structure, the folded hypercube (FHC), which is basically a standard hypercube ...
Hypercube algorithms are developed for a variety of commun-ication-intensive tasks such as transposi...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
Many parallel algorithms exhibit a hypercube communication topology. Such algorithms can easily be e...
One of the most important contemporary issues in concurrent computing is network performance, for wi...
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel...
An abstract hypercube architecture made up of computing elements (nodes) has been simulated, in whic...
Includes bibliographical references (p. 23-24).Supported by NSF. NSF-DDM-8903385 Supported by ARO. D...
We consider several basic communication problems in a hypercube network of processors. These include...
Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending...
Abstract-For massively parallel computing mechanism, broadcasting is widely used in a variety of app...
In this paper we introduce the hypercube topology and show effects over the performance of communica...
In real-time computing applications, it is important to have parallel computing systems that not onl...
Includes bibliographical references (p. 34-35).Supported by the NSF. NSF-DDM-8903385 Supported by th...
A large potential exists for increasing the communication performance of hypercube multiprocessors. ...
A new hypercube-type structure, the folded hypercube (FHC), which is basically a standard hypercube ...
Hypercube algorithms are developed for a variety of commun-ication-intensive tasks such as transposi...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
Many parallel algorithms exhibit a hypercube communication topology. Such algorithms can easily be e...
One of the most important contemporary issues in concurrent computing is network performance, for wi...
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel...
An abstract hypercube architecture made up of computing elements (nodes) has been simulated, in whic...
Includes bibliographical references (p. 23-24).Supported by NSF. NSF-DDM-8903385 Supported by ARO. D...
We consider several basic communication problems in a hypercube network of processors. These include...
Hypercube algorithms may be developed for a variety of communication-intensive tasks such as sending...
Abstract-For massively parallel computing mechanism, broadcasting is widely used in a variety of app...
In this paper we introduce the hypercube topology and show effects over the performance of communica...
In real-time computing applications, it is important to have parallel computing systems that not onl...
Includes bibliographical references (p. 34-35).Supported by the NSF. NSF-DDM-8903385 Supported by th...