MCBF: A high-performance scheduling algorithm for buffered crossbar switches

Lotfi Mhamdi*, Mounir Hamdi

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

91 Citations (Scopus)

Abstract

The buffered crossbar architecture is becoming very attractive for the design of high performance routers due the unique features it offers. Recently, many distributed scheduling algorithms have been proposed for this architecture. Despite their distributed nature, the existing schemes require quite a bit of hardware and timing complexity. In this letter, we propose a novel scheduling scheme named the most critical buffer first (MCBF). This scheme is based only on the internal buffer information and requires much less hardware than the existing schemes. Yet, it exhibits good performance and outperforms all its competitors. More interestingly, MCBF shows optimal stability performance while being almost a stateless algorithm.

Original languageEnglish
Pages (from-to)451-453
Number of pages3
JournalIEEE Communications Letters
Volume7
Issue number9
DOIs
Publication statusPublished - Sept 2003
Externally publishedYes

Keywords

  • Buffered crossbar fabric
  • Scheduling algorithms

Fingerprint

Dive into the research topics of 'MCBF: A high-performance scheduling algorithm for buffered crossbar switches'. Together they form a unique fingerprint.

Cite this