Repository logo

Infoscience

  • English
  • French
Log In
Logo EPFL, École polytechnique fédérale de Lausanne

Infoscience

  • English
  • French
Log In
  1. Home
  2. Academic and Research Output
  3. Conferences, Workshops, Symposiums, and Seminars
  4. BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs to Avoid Congestion
 
conference paper

BARP-A Dynamic Routing Protocol for Balanced Distribution of Traffic in NoCs to Avoid Congestion

Lotfi-Kamran, P.  
•
Daneshtalab, M.
•
Lucas, C.
Show more
2008
Design, Automation and Test in Europe
Design, Automation and Test in Europe, 2008. DATE '08

A novel routing algorithm, named Balanced Adaptive Routing Protocol (BARP), is proposed for NoCs to provide adaptive routing and ensure deadlock-free and livelock-free routing at the same time. By evenly distributing input packets of a router among all its shortest path output ports, a novel adaptive routing protocol for avoiding congestion condition emerges. It is observed that BARP can achieve better performance compared to static XY routing, oddeven routing and dynamic XY routing.

  • Details
  • Metrics
Type
conference paper
DOI
10.1109/DATE.2008.4484871
Author(s)
Lotfi-Kamran, P.  
Daneshtalab, M.
Lucas, C.
Navabi, Z.
Date Issued

2008

Publisher place

Munich

Published in
Design, Automation and Test in Europe
Start page

1408

End page

1413

Editorial or Peer reviewed

REVIEWED

Written at

OTHER

EPFL units
PARSA  
Event nameEvent placeEvent date
Design, Automation and Test in Europe, 2008. DATE '08

Munich

March 10-14, 2008

Available on Infoscience
May 23, 2009
Use this identifier to reference this record
https://infoscience.epfl.ch/handle/20.500.14299/40203
Logo EPFL, École polytechnique fédérale de Lausanne
  • Contact
  • infoscience@epfl.ch

  • Follow us on Facebook
  • Follow us on Instagram
  • Follow us on LinkedIn
  • Follow us on X
  • Follow us on Youtube
AccessibilityLegal noticePrivacy policyCookie settingsEnd User AgreementGet helpFeedback

Infoscience is a service managed and provided by the Library and IT Services of EPFL. © EPFL, tous droits réservés