Add to ORKGIncludes bibliographical references (p. 34-35).Supported by the NSF. NSF-DDM-8903385 Supported by the ARO. DAAL03-92-G-0115by Emmanouel A. Varvarigos and Dimitri P. Bertsekas
An efficient interconnection network that provides high bandwidth and low latency interprocessor com...
This paper compares message routing capabilities of important networks proposed for general-purpose ...
In a routing problem, a set of packets must be routed from their sources to their destinations along...
Various schemes for routing in high speed networks with few buffers are investigated. Deflection rou...
Includes bibliographical references (p. 23-24).Supported by NSF. NSF-DDM-8903385 Supported by ARO. D...
Includes bibliographical references (p. 24-26).Cover title. "October 1990".Research supported by the...
In this paper, we describe an O(log N)-bit-step randomized algorithm for bit-serial message routing ...
The growing acceptance of B-ISDN (Broadband Integrated Services Digital Network) requires entirely ...
There has been a lot of interest in recent times on the performance analysis of routing algorithms f...
This paper presents a comparative performance study of adaptive and deterministic routing algorithms...
Routing h-relations is considered on hypercubes consisting of N processing units (PUs). In the full-...
The interconnection network is one of the most crucial components in any multicomputer as it greatly...
Abstract. We give near optimal bufferless routing algorithms for leveled networks. N packets with pr...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
A new hypercube-type structure, the folded hypercube (FHC), which is basically a standard hypercube ...
An efficient interconnection network that provides high bandwidth and low latency interprocessor com...
This paper compares message routing capabilities of important networks proposed for general-purpose ...
In a routing problem, a set of packets must be routed from their sources to their destinations along...
Various schemes for routing in high speed networks with few buffers are investigated. Deflection rou...
Includes bibliographical references (p. 23-24).Supported by NSF. NSF-DDM-8903385 Supported by ARO. D...
Includes bibliographical references (p. 24-26).Cover title. "October 1990".Research supported by the...
In this paper, we describe an O(log N)-bit-step randomized algorithm for bit-serial message routing ...
The growing acceptance of B-ISDN (Broadband Integrated Services Digital Network) requires entirely ...
There has been a lot of interest in recent times on the performance analysis of routing algorithms f...
This paper presents a comparative performance study of adaptive and deterministic routing algorithms...
Routing h-relations is considered on hypercubes consisting of N processing units (PUs). In the full-...
The interconnection network is one of the most crucial components in any multicomputer as it greatly...
Abstract. We give near optimal bufferless routing algorithms for leveled networks. N packets with pr...
Hypercube algorithms are developed for a variety of communication-intensive tasks such as transposin...
A new hypercube-type structure, the folded hypercube (FHC), which is basically a standard hypercube ...
An efficient interconnection network that provides high bandwidth and low latency interprocessor com...
This paper compares message routing capabilities of important networks proposed for general-purpose ...
In a routing problem, a set of packets must be routed from their sources to their destinations along...