Strong Performance Guarantees for Asynchronous Crossbar Schedulers

@article{Turner2006StrongPG,
  title={Strong Performance Guarantees for Asynchronous Crossbar Schedulers},
  author={Jonathan S. Turner},
  journal={Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications},
  year={2006},
  pages={1-11}
}
  • J. Turner
  • Published 1 April 2006
  • Computer Science
  • Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Up to now, such performance guarantees have only been developed for crossbars that switch cells rather than variable length packets. Cell-based schedulers may fail to deliver the expected performance guarantees… Expand
Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
  • J. Turner
  • Computer Science
  • IEEE/ACM Transactions on Networking
  • 2009
TLDR
It is shown that there are schedulers for segment-based crossbars, (introduced recently by Katevenis and Passas) that can deliver strong performance guarantees with small buffer requirements and no bandwidth fragmentation, and derivatives of the group by virtual output queue (GVOQ) scheduler of Chuang and the least occupied output first Scheduler of Krishna are defined. Expand
Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makesExpand
Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makesExpand
Strong Performance Guarantees for Asynchronous Buffered Crossbar
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makesExpand
Number : WUCSE-2007-52 2007 Strong Performance Guarantees for Asynchronous Buffered
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makesExpand
Achieve constant performance guarantees using asynchronous crossbar scheduling without speedup
TLDR
The guaranteed-performance asynchronous packet scheduling (GAPS) algorithm for buffered crossbar switches is proposed, and it is proved that GAPS has a bounded crosspoint buffer size of 3L, where L is the maximum packet length. Expand
Flow Based Performance Guarantee Scheduling in Buffered Crossbar Switches
TLDR
This paper presents scheduling algorithms for buffered crossbar switches to achieve flow based performance guarantees with speedup of two and one buffer per crosspoint, and uses the counting method to prove the perfect emulation. Expand
SQUID: A Practical 100% Throughput Scheduler for Crosspoint Buffered Switches
TLDR
It is proved that both SQUISH and SQUID can achieve 100% throughput for any admissible Bernoulli traffic, with the minimum required crosspoint buffer size being as small as a single cell buffer. Expand
Achieving Flow Level Constant Performance Guarantees for CICQ Switches without Speedup
TLDR
This paper presents theFlow-level Fair Scheduling (FFS) algorithm to provide flow level performance guarantees for Combined-Input- Crosspoint-Queued (CICQ) switches, which are special crossbar switches with a small exclusive buffer at each crosspoint of the crossbar. Expand
Providing flow based performance guarantees for buffered crossbar switches
  • Deng Pan, Yuanyuan Yang
  • Computer Science
  • 2008 IEEE International Symposium on Parallel and Distributed Processing
  • 2008
TLDR
This paper presents scheduling algorithms for buffered crossbar switches to achieve flow based performance guarantees with speedup of two and with only one or two buffers at each crosspoint, and presents sequential and parallel matching algorithms for the special urgent matching. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 21 REFERENCES
When is a Work-Conserving Switch Not?
Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of work-conserving crossbar scheduling algorithms now makes it possible to engineerExpand
Practical algorithms for performance guarantees in buffered crossbars
TLDR
This paper explores how a buffered crossbar-a crossbar switch with a packet buffer at each crosspoint-can provide guaranteed performance (throughput, rate, and delay), with less complex, practical scheduling algorithms. Expand
The iSLIP scheduling algorithm for input-queued switches
TLDR
This paper presents a scheduling algorithm called iSLIP, an iterative, round-robin algorithm that can achieve 100% throughput for uniform traffic, yet is simple to implement in hardware, and describes the implementation complexity of the algorithm. Expand
CBF: a high-performance scheduling algorithm for buffered crossbar switches
  • L. Mhamdi, M. Hamdi
  • Computer Science
  • Workshop on High Performance Switching and Routing, 2003, HPSR.
  • 2003
TLDR
A scheduling scheme named critical internal buffer first (CBF), which is based on the internal buffer information only and outperforms all existing schemes in many traffic patterns, and shows very good stability performances without maintaining any kind of information about the input VOQs. Expand
Output-queued switch emulation by fabrics with limited memory
TLDR
It is argued that a buffered crossbar system performing OQ switch emulation is feasible for Oq switch schedulers such as first-in-first-out, strict priority and earliest deadline first, and provides an attractive alternative to both crossbar switch fabrics and to the OQswitch architecture. Expand
Matching output queueing with a combined input output queued switch
  • Shang-Tse Chuang, Ashish Goel, N. McKeown, B. Prabhakar
  • Computer Science
  • IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320)
  • 1999
TLDR
It is demonstrated that a combined input output queueing (CIOQ) switch running twice as fast as an input-queued switch can provide precise emulation of a broad class of packet scheduling algorithms, including WFQ and strict priorities. Expand
Routers with a single stage of buffering
TLDR
An abstract model called Single-Buffered (SB) routers is proposed that includes architectures in which a switch fabric is sandwiched between two stages of buffering, and it is found that the memory bandwidth, and potentially the power consumption of the router is lower than for a CIOQ router. Expand
Variable packet size buffered crossbar (CICQ) switches
TLDR
An architecture, a chip layout and cost analysis, and a performance evaluation of such a 300 Gbps buffered crossbar operating on variable-size packets show that it clearly outperforms unbuffered crossbars. Expand
On the speedup required for work-conserving crossbar switches
TLDR
This work describes the architecture for a work-conserving server using a combined input-output buffered crossbar switch and describes a mechanism to provide delay bounds for real-time traffic using LOOFA. Expand
MCBF: a high-performance scheduling algorithm for buffered crossbar switches
TLDR
This work proposes a novel scheduling scheme named the most critical buffer first (MCBF), which is based only on the internal buffer information and requires much less hardware than the existing schemes and exhibits good performance and outperforms all its competitors. Expand
...
1
2
3
...