Abstract
Round robin (RR) arbitration is commonly used for scheduling of cells in high-speed packet switches. In this paper, we present an overlapped RR (ORR) arbiter design that fully overlaps RR polling and cell scheduling. The ORR arbiter achieves 100% throughput even when a cell transfer time is less than a worst case polling, or scheduling, cycle. This is done by scheduling blocks of celts during a cell transfer time.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.