By Topic

Exhaustive limited service round robin matching algorithm for buffered crossbar switches

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
$33 $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)
I. Radusinovic ; Dept. of Electr. Eng., Montenegro Univ., Podgorica, Serbia ; Z. Veljovic

In this paper a high performance and simple scheduling algorithm for combined input-crosspoint crossbar switches, called exhaustive round-robin with limited service (ELRR) is presented and analyzed. We propose using of this scheduling system for arbitration at inputs and crosspoints. If the virtual output queue (crosspoint buffer) becomes empty, the input (crosspoint) arbiter updates its pointer to the next location in a fixed order. Otherwise, the pointer remains at the current virtual output queue (crosspoint buffer). To avoid unfairness under some extremely unbalanced traffic pattern limited service matching is presented. It is shown that this new solution offers high performance for several admissible traffic patterns using only one-cell crosspoint buffers.

Published in:

TELSIKS 2005 - 2005 uth International Conference on Telecommunication in ModernSatellite, Cable and Broadcasting Services  (Volume:2 )

Date of Conference:

28-30 Sept. 2005