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

The buffered crossbar architecture is becoming very attractive for the design of high performance routers due the unique features it offers. Many distributed scheduling algorithms have been proposed for this architecture. Despite their distributed nature, the existing schemes require quite a bit of...

Full description

Saved in:
Bibliographic Details
Published in:IEEE communications letters 2003-09, Vol.7 (9), p.451-453
Main Authors: Mhamdi, L., Hamdi, M.
Format: Article
Language:English
Subjects:
Algorithm design and analysis
Algorithms
Applied sciences
Architecture
Buffers
Computer architecture
Exact sciences and technology
Fabrics
Hardware
Optimization
Packet switching
Round robin
Routers
Scheduling
Scheduling algorithm
Stability
Switches
Switching and signalling
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Timing
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:The buffered crossbar architecture is becoming very attractive for the design of high performance routers due the unique features it offers. 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. 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.
ISSN:1089-7798
1558-2558
DOI:10.1109/LCOMM.2003.815665