Tyck till om SwePub Sök
här!
Sökning: id:"swepub:oai:DiVA.org:kth-160659" >
An analytical model...
An analytical model for worst-case reorder buffer size of multi-path minimal routing NoCs
-
Du, G. (författare)
-
Li, M. (författare)
-
- Lu, Zhonghai (författare)
- KTH,Elektroniksystem
-
visa fler...
-
Gao, M. (författare)
-
Wang, C. (författare)
-
visa färre...
-
(creator_code:org_t)
- IEEE, 2014
- 2014
- Engelska.
-
Ingår i: Proceedings - 2014 8th IEEE/ACM International Symposium on Networks-on-Chip, NoCS 2014. - : IEEE. - 9781479953479 ; , s. 49-56
- Relaterad länk:
-
https://urn.kb.se/re...
-
visa fler...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- 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%.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik -- Kommunikationssystem (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering -- Communication Systems (hsv//eng)
Nyckelord
- 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
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas