Sökning: onr:"swepub:oai:DiVA.org:kth-63611" >
Worst-Case Delay An...
Worst-Case Delay Analysis of Variable Bit-Rate Flows in Network-on-Chip with Aggregate Scheduling
-
- Jafari, Fahimeh (författare)
- KTH,Elektroniksystem
-
- Jantsch, Axel (författare)
- KTH,Elektroniksystem
-
- Lu, Zhonghai (författare)
- KTH,Elektroniksystem
-
(creator_code:org_t)
- IEEE, 2012
- 2012
- Engelska.
-
Ingår i: Proceedings of the Design and Test in Europe Conference (DATE). - : IEEE. - 9783981080186 ; , s. 538-541
- Relaterad länk:
-
http://web.it.kth.se...
-
visa fler...
-
https://urn.kb.se/re...
-
https://doi.org/10.1...
-
visa färre...
Abstract
Ämnesord
Stäng
- Aggregate scheduling in routers merges several flows into one aggregate flow. We propose an approach for computing the end-to-end delay bound of individual flows in a FIFO multiplexer under aggregate scheduling. A synthetic case study exhibits that the end-to-end delay bound is up to 33.6% tighter than the case without considering the traffic peak behavior.
Ämnesord
- TEKNIK OCH TEKNOLOGIER -- Elektroteknik och elektronik (hsv//swe)
- ENGINEERING AND TECHNOLOGY -- Electrical Engineering, Electronic Engineering, Information Engineering (hsv//eng)
Nyckelord
- Delay analysis
- End-to-end delay bounds
- Network on chip
- Variable bit rate
Publikations- och innehållstyp
- ref (ämneskategori)
- kon (ämneskategori)
Hitta via bibliotek
Till lärosätets databas