Design and implementation of high-speed symmetric crossbar schedulers
- 20 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3, 1478-1483 vol.3
- https://doi.org/10.1109/icc.1999.765457
Abstract
Crossbar architectures are widely used to implement high-performance network switches and routers. A crossbar switch can transfer cells between multiple ports simultaneously by closing multiple cross points. This crossbar configuration must be determined by an intelligent centralized scheduler that can ensure fairness and high utilization. In this paper, we describe the design and implementation of two symmetric scheduling algorithms for configuring crossbars in input-queued switches that support virtual output queueing. Our target is a fast packet switch that can support 32 ports, each operating at 20 Gbps. Using a 0.35 /spl mu/m CMOS process, the faster of the two schedulers is capable of configuring a 32/spl times/32 crossbar once every 12.61 ns. Our scheduler designs are based on a two-dimensional ripple carry arbiter architecture. To ensure fairness, both architectures support a round robin priority rotation scheme. Based on network simulations, we show that our arbiter designs can achieve near optimal system performance.Keywords
This publication has 6 references indexed in Scilit:
- Designing and implementing a fast crossbar schedulerIEEE Micro, 1999
- Tiny Tera: a packet switch coreIEEE Micro, 1997
- High-speed switch scheduling for local-area networksACM Transactions on Computer Systems, 1993
- Symmetric crossbar arbiters for VLSI communication switchesIEEE Transactions on Parallel and Distributed Systems, 1993
- High-performance multi-queue buffers for VLSI communications switchesACM SIGARCH Computer Architecture News, 1988
- Input Versus Output Queueing on a Space-Division Packet SwitchIEEE Transactions on Communications, 1987