Worst-case performance analysis of 2-D mesh NoCs using multi-path minimal routing
2012 (English)In: CODES+ISSS'12 - Proceedings of the 10th ACM International Conference on Hardware/Software-Codesign and System Synthesis, Co-located with ESWEEK, ACM , 2012, 123-132 p.Conference paper (Refereed)
In Network-on-Chip (NoC), multi-path routing is often preferable than single-path routing since it can better balance workload and thus provide better performance. However, performance analysis with multi-path routing is much more difficult due to complicated contention scenarios. Based on network calculus, we study worst-case performance of deterministic multi-path minimal routing on 2-D mesh NoCs. We first present a per-flow delay bound analysis technique for multi-path routing, which extends the analysis for singlepath routing but deals with traffic splitting. Then we define a contention matrix to capture network congestion status. Based on the contention matrix, we propose an effective nonuniform traffic splitting strategy to improve worst-case performance. Experiments with synthetic traffic flows and an industrial case show that our analysis can effectively explore the traffic splitting space, and verify the effectiveness of the non-uniform splitting policy.
Place, publisher, year, edition, pages
ACM , 2012. 123-132 p.
Contention matrix, Multi-path routing NoC, Network calculus
Engineering and Technology
IdentifiersURN: urn:nbn:se:kth:diva-114013DOI: 10.1145/2380445.2380469ScopusID: 2-s2.0-84869066057ISBN: 978-145031426-8OAI: oai:DiVA.org:kth-114013DiVA: diva2:588192
10th ACM International Conference on Hardware/Software-Codesign and System Synthesis, CODES+ISSS 2012, Co-located with 8th Embedded Systems Week, ESWEEK 2012, 7 October 2012 through 12 October 2012, Tampere
QC 201301152013-01-152013-01-152013-01-15Bibliographically approved