Theme-Logo
  • Login
  • Home
  • Course
  • Publication
  • Theses
  • Reports
  • Published books
  • Workshops / Conferences
  • Supervised PhD
  • Supervised MSc
  • Supervised projects
  • Education
  • Language skills
  • Positions
  • Memberships and awards
  • Committees
  • Experience
  • Scientific activites
  • In links
  • Outgoinglinks
  • News
  • Gallery
publication name Evaluation of The Scalability of Round Robin Arbiters for NoC Routers on FPGA
Authors Maher Abdelrasoul, Mohammed Ragab, Victor Goulart
year 2013
keywords Network-on-Chip, Round Robin Arbiter, Scalability, FPGA
journal
volume Not Available
issue Not Available
pages Not Available
publisher IEEE 7th International Symposium on Embedded Multicore Socs (MCSoC), 2013
Local/International International
Paper Link http://ieeexplore.ieee.org/document/6657905/
Full paper download
Supplementary materials Not Available
Abstract

Network-on-Chip (NoC) performance is directly influenced by latency of routers and throughput obtained in some specific topologies. The arbitration inside routers plays an important role in the whole system performance. The size of the arbiters is affected by the node degree and number of virtual channels of the routers. In the literature most of arbiter designs were targeting VLSI, but the mapping of these architectures to the programmable logic and interconnect of an FPGA is not explored. In this paper, we re-evaluate the most famous Round Robin Arbiter (RRA) architectures on FPGA to fulfill this gap. We compare RRA implementations with respect to speed and area. This work will allow NoC designers to scrupulously choose the suitable design of RRA trading-off performance and area.

Benha University © 2023 Designed and developed by portal team - Benha University