Includes bibliographical references (p. 23-24).Supported by NSF. NSF-DDM-8903385 Supported by ARO. DAAL03-86-K-0171by Emmanouel A. Varvarigos and Dimitri P. Bertsekas
This paper compares three link conflict resolution strategies applied to multicomputers with symmetr...
In this dissertation, we propose and analyze several strategies for routing and task allocation in m...
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel...
Includes bibliographical references (p. 34-35).Supported by the NSF. NSF-DDM-8903385 Supported by th...
The growing acceptance of B-ISDN (Broadband Integrated Services Digital Network) requires entirely ...
A large potential exists for increasing the communication performance of hypercube multiprocessors. ...
This paper proposes a routing algorithm for the interconnection of multiple processors based on the ...
Various schemes for routing in high speed networks with few buffers are investigated. Deflection rou...
Many parallel algorithms exhibit a hypercube communication topology. Such algorithms can easily be e...
The interconnection network is one of the most crucial components in any multicomputer as it greatly...
The switching strategy determines the way messages visit intermediate routers. Existing evaluation s...
In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends...
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...
This paper compares three link conflict resolution strategies applied to multicomputers with symmetr...
In this dissertation, we propose and analyze several strategies for routing and task allocation in m...
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel...
Includes bibliographical references (p. 34-35).Supported by the NSF. NSF-DDM-8903385 Supported by th...
The growing acceptance of B-ISDN (Broadband Integrated Services Digital Network) requires entirely ...
A large potential exists for increasing the communication performance of hypercube multiprocessors. ...
This paper proposes a routing algorithm for the interconnection of multiple processors based on the ...
Various schemes for routing in high speed networks with few buffers are investigated. Deflection rou...
Many parallel algorithms exhibit a hypercube communication topology. Such algorithms can easily be e...
The interconnection network is one of the most crucial components in any multicomputer as it greatly...
The switching strategy determines the way messages visit intermediate routers. Existing evaluation s...
In multicomputers that utilize circuit switching or wormhole routing, communication overhead depends...
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...
This paper compares three link conflict resolution strategies applied to multicomputers with symmetr...
In this dissertation, we propose and analyze several strategies for routing and task allocation in m...
. Efficient communication in networks is a prerequisite to exploit the performance of large parallel...
Add to ORKG