| Paper: | ITT-P2.3 | ||
| Session: | Communication Technoloiges | ||
| Time: | Friday, May 21, 09:30 - 11:30 | ||
| Presentation: | Poster | ||
| Topic: | Industry Technology Track: Data Communications and Networking | ||
| Title: | BINARY TREE SEARCH ARCHITECTURE FOR EFFICIENT IMPLEMENTATION OF ROUND ROBIN ARBITERS | ||
| Authors: | Emanuel Savin; Cisco Systems | ||
| Tim McSmythurs; Cisco Systems | |||
| James Czilli; Cisco Systems | |||
| Abstract: | A new architecture for the implementation of round robin arbiters(RRAs) with one-hot encoded grant signals is introduced in thispaper. The proposed architecture uses a binary tree search (BTS)mechanism in conjunction with a unit-weighted representation ofthe priority index. It is shown that the proposed BTS RRAarchitecture achieves very significant improvements on time-areacomplexity compared to the most efficient convetional RRAconfiguration to date. | ||
| Back | |||
Home -||-
Organizing Committee -||-
Technical Committee -||-
Technical Program -||-
Plenaries
Paper Submission -||-
Special Sessions -||-
ITT -||-
Paper Review -||-
Exhibits -||-
Tutorials
Information -||-
Registration -||-
Travel Insurance -||-
Housing -||-
Workshops