Worst-case delay analysis of variable bit-rate flows in network-on-chip with aggregate scheduling
Fahimeh Jafari, Axel Jantsch, Zhonghai Lu · 2012
Abstract—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. I.