HIPIQS: a high-performance switch architecture using input queuing

Sivaram, R.; Stunkel, Craig B.; Panda, D.K.

doi:10.1109/71.993207

Cited by 22 publications

(7 citation statements)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For example, it is possible to use dynamic access queues (DAMQ) in order to service packets out of order as in [26]. Another possibility is to use a memory with multiple read ports to service one or more packets from the queue in a single cycle as in HIPIQS [22].…”

Section: Avoiding Head-of-line Blockingmentioning

confidence: 99%

On the design of a high-performance adaptive router for CC-NUMA multiprocessors

Puente

Gregorio

Beivide

et al. 2003

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

Abstract-This work presents the design and evaluation of an adaptive packet router aimed at supporting CC-NUMA traffic. We exploit a simple and efficient packet injection mechanism to avoid deadlock, which leads to a fully adaptive routing by employing only three virtual channels. In addition, we selectively use output buffers for implementing the most utilized virtual paths in order to reduce head-of-line blocking. The careful implementation of these features has resulted in a good trade off between network performance and hardware cost. The outcome of this research is a High-Performance Adaptive Router (HPAR), which adequately balances the needs of parallel applications: minimal network latency at low loads and high throughput at heavy loads. The paper includes an evaluation process in which HPAR is compared with other adaptive routers using FIFO input buffering, with or without additional virtual channels to reduce head-of-line blocking. This evaluation contemplates both the VLSI costs of each router and their performance under synthetic and real application workloads. To make the comparison fair, all the routers use the same efficient deadlock avoidance mechanism. In all the experiments, HPAR exhibited the best response among all the routers tested. The throughput gains ranged from 10 percent to 40 percent in respect to its most direct rival, which employs more hardware resources. Other results shown that HPAR achieves up to 83 percent of its theoretical maximum throughput under random traffic and up to 70 percent when running real applications. Moreover, the observed packet latencies were comparable to those exhibited by simpler routers. Therefore, HPAR can be considered as a suitable candidate to implement packet interchange in next generations of CC-NUMA multiprocessors.

show abstract

Section: Avoiding Head-of-line Blockingmentioning

confidence: 99%

On the design of a high-performance adaptive router for CC-NUMA multiprocessors

Puente

Gregorio

Beivide

et al. 2003

IEEE Trans. Parallel Distrib. Syst.

View full text Add to dashboard Cite

show abstract

“…Although these buffers only need to be big enough to capture the header flit of an incoming worm so that the routing decision can be made as soon as the header flit arrives, deeper buffers are usually required to perform flow control efficiently across long links. A k-port switch typically provides a k Â k crossbar connectivity in order to enable a concurrent transfer of messages from the input buffers to any of the output buffers [2], [30], [35], [38], [39]. However, in many instances, some routing restrictions are used to achieve deadlock-free routing.…”

Section: Network Modelmentioning

confidence: 99%

Efficient multicast on irregular switch-based cut-through networks with up-down routing

Kesavan¹,

Panda

2001

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

ÐThe irregular switch-based network of workstations is fast becoming a cost-effective platform for high performance computing. This paper presents efficient multicasting with reduced link contention on irregular switch-based cut-through interconnection using the popular up*/down* (UD) routing and unicast message passing. First, it is proven that, for an arbitrary irregular network with UD routing, it is not possible to create an ordered list of nodes to implement an arbitrary multicast in a link contention-free manner with a minimal number of communication steps. Next, three different multicast algorithms are proposed with their respective node orderings to reduce link contention: switch-based ordering (SO), switch-based hierarchical ordering (SHO), and chain concatenation ordering (CCO). A variation of the binomial tree-based communication pattern, with unicast message passing, is used on the above orderings to implement multicast. Then, the problem of node contention is described in the case when multiple multicasts occur concurrently in a system. Using source-based information, the CCO algorithm is modified to propose a source-partitioned chain concatenation ordering (SPCCO) algorithm. It is also shown how the SPCCO algorithm reduces the effect of node contention at the cost of link contention. Using detailed simulation experiments, the proposed multicast algorithms are compared with each other as well as with the naive random ordering (RO) algorithm for a range of system sizes, switch sizes, message lengths, input buffer sizes, degrees of connectivity, destination set sizes, and communication start-up times. For the case of single multicast, the CCO algorithm is shown to be the best to implement multicast with reduced link contention and minimum latency. For the case of multiple multicasts, the SPCCO algorithm is shown to be the best when the start-up overhead dominates the propagation overhead and the CCO algorithm is shown to be the best otherwise. The results also highlight the importance of reducing link contention when designing efficient multicast, even for systems with large input buffers in the switches. Thus, these results demonstrate significant potential to be applied to current and future generation NOW systems with irregular interconnection. Index TermsÐParallel computer architecture, cut-through routing, wormhole routing, multicast, broadcast, collective communication, switch-based networks, irregular networks, networks of workstations. ae

show abstract

“…Then the elementary binary additions are now required to transform the entropy fitting into the reliability information. [15][16] The baseband noise spectra produced by transmission deviations and by AM to PM conversion have the property of being functions of the baseband signal. Hence, they are correlated to some degree.…”

Section: External Codementioning

confidence: 99%