Low-latency scheduling in large switches
- 3 December 2007
- proceedings article
- Published by Association for Computing Machinery (ACM)
Abstract
Scheduling in large switches is challenging. Arbiters must operate at high rates to keep up with the high switching rates demanded by multi-gigabit-per-second link rates and short cells. Low-latency requirements of some applications also challenge the design of schedulers. In this paper, we propose the Parallel Wrapped Wave Front Arbiter with Fast Scheduler (PWWFA-FS). We analyze its performance, present simulation results, discuss its implementation, and show how this scheme can provide low latency under light load while scaling to large switches with multi-terabit-per-second throughput and hundreds of ports.Keywords
This publication has 7 references indexed in Scilit:
- PWWFA: The Parallel Wrapped Wave Front Arbiter for Large SwitchesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2007
- PPAwFE: a novel high speed crossbar scheduling algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Low-latency pipelined crossbar arbitrationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Proximity communicationPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2004
- The iSLIP scheduling algorithm for input-queued switchesIEEE/ACM Transactions on Networking, 1999
- 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