Strong Performance Guarantees for Asynchronous Crossbar Schedulers

@article{Turner2006StrongPG,
  title={Strong Performance Guarantees for Asynchronous Crossbar Schedulers},
  author={J. Turner},
  journal={Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications},
  year={2006},
  pages={1-11}
}
  • J. Turner
  • Published 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… CONTINUE READING
    56 Citations
    Strong Performance Guarantees for Asynchronous Buffered Crossbar Schedulers
    • J. Turner
    • Computer Science
    • IEEE/ACM Transactions on Networking
    • 2009
    • 28
    • PDF
    Achieve constant performance guarantees using asynchronous crossbar scheduling without speedup
    • D. Pan, K. Makki, N. Pissinou
    • Computer Science
    • 2010 IEEE International Symposium on Parallel & Distributed Processing (IPDPS)
    • 2010
    • 4
    • PDF
    Flow Based Performance Guarantee Scheduling in Buffered Crossbar Switches
    • D. Pan, Y. Yang
    • Computer Science
    • IEEE Transactions on Communications
    • 2012
    • 2
    • PDF
    SQUID: A Practical 100% Throughput Scheduler for Crosspoint Buffered Switches
    • 8
    • PDF
    Providing flow based performance guarantees for buffered crossbar switches
    • D. Pan, Y. Yang
    • Computer Science
    • 2008 IEEE International Symposium on Parallel and Distributed Processing
    • 2008
    • 12
    • PDF
    On guaranteed smooth switching for buffered crossbar switches
    • 36

    References

    SHOWING 1-10 OF 21 REFERENCES
    When is a Work-Conserving Switch Not?
    • 4
    • PDF
    Practical algorithms for performance guarantees in buffered crossbars
    • 144
    • Highly Influential
    • PDF
    The iSLIP scheduling algorithm for input-queued switches
    • 1,237
    • PDF
    Output-queued switch emulation by fabrics with limited memory
    • 105
    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
    • 55
    Matching output queueing with a combined input output queued switch
    • Shang-Tse Chuang, A. 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
    • 228
    • Highly Influential
    • PDF
    Routers with a single stage of buffering
    • 59
    • PDF
    Variable packet size buffered crossbar (CICQ) switches
    • 106
    • PDF
    On the speedup required for work-conserving crossbar switches
    • 62
    • Highly Influential
    • PDF
    MCBF: a high-performance scheduling algorithm for buffered crossbar switches
    • 111
    • PDF