Copyright © (2005) by IEEE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distrubuted for profit. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.
Pipelined crossbar arbitration schemes overcome the time constraints of iterative matching algorithms, allowing support for higher line rates. One such scheme is the fast lowlatency parallel pipelined crossbar arbitration scheme (FLPPR) introduced in [1]. We optimize its performance by applying advanced pre- and post-filter functions. By means of simulation we show that we can simultaneously achieve excellent latency–throughput characteristics under uniform traffic, high maximum throughput under nonuniform traffic, and prevent starvation.
By: Cyriel Minkenberg; Ilias Iliadis; Francois Abel
Published in: RZ3636 in 2005
LIMITED DISTRIBUTION NOTICE:
This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.
Questions about this service can be mailed to reports@us.ibm.com .