By Topic

Practical High-Throughput Crossbar Scheduling

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Chrysos, N ; Foundation for Research and Technology - Hellas (FORTH), Heraklion ; Dimitrakopoulos, G.

We combine ideas from randomized backlog-aware schedulers, and their round-robin counterparts, to propose a practical deterministic crossbar scheduler. Our design has the time complexity of single iteration iSLIP, and achieves almost full throughput, approaching the ideal maximum weight- matching performance, without being heavily affected by short virtual-output-queues or traffic burstiness. Moreover, the proposed algorithm provides deterministic service guarantees, while with simple additions, it distributes the bandwidth of congested links in a weighted fair manner. To prove the efficiency of the new algorithm, a 32×32 scheduler was implemented in hardware at 130nm, satisfying the constraints of above 100 Gb/s line rates, and 40 Byte IP packets

Published in:

Micro, IEEE  (Volume:PP ,  Issue: 99 )