An analytical model for worst-case reorder buffer size of multi-path minimal routing NoCs
2014 (English)In: Proceedings - 2014 8th IEEE/ACM International Symposium on Networks-on-Chip, NoCS 2014, IEEE , 2014, 49-56 p.Conference paper (Refereed)
Reorder buffers are often needed in multi-path routing networks-on-chips (NoCs) to guarantee in-order packet delivery. However, the buffer sizes are usually over-dimensioned, due to lack of worst-case analysis, leading to unnecessary larger area overhead. Based on network calculus, we propose an analysis framework for the worst-case reorder buffer size in multi-path minimal routing NoCs. Experiments with synthetic traffic and an industry case show that our method can effectively explore the traffic splitting space, as well as the mapping effects in terms of reorder buffer size with a maximum improvement of 36.50%.
Place, publisher, year, edition, pages
IEEE , 2014. 49-56 p.
Calculations, Microprocessor chips, Network-on-chip, Program compilers, Recording instruments, Analysis frameworks, Area overhead, In-order packet delivery, Multi path routing, Network calculus, Re-order buffers, Traffic splitting, Worst-case analysis
IdentifiersURN: urn:nbn:se:kth:diva-160659DOI: 10.1109/NOCS.2014.7008761ScopusID: 2-s2.0-84922559641ISBN: 9781479953479OAI: oai:DiVA.org:kth-160659DiVA: diva2:791107
8th IEEE/ACM International Symposium on Networks-on-Chip, NoCS 2014, Ferrara, Italy, 17 September 2014 through 19 September 2014
QC 201502262015-02-262015-02-262015-02-26Bibliographically approved