English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Global: Zendy Plus annual

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

This paper addresses the problem of worst-case timing analysis ofheterogeneous wormhole NoCs, i.e., routers with different buffer sizes andtransmission speeds, when consecutive packet queuing (CPQ) occurs. The lattermeans that there are several consecutive packets of one flow queuing in thenetwork. This scenario happens in the case of bursty traffic but also fornon-schedulable traffic. Conducting such an analysis is known to be achallenging issue due to the sophisticated congestion patterns when enablingbackpressure mechanisms. We tackle this problem through extending theapplicability domain of our previous work for computing maximum delay boundsusing Network Calculus, called Buffer-aware worst-case Timing Analysis (BATA).We propose a new Graph-based approach to improve the analysis of indirectblocking due to backpressure, while capturing the CPQ effect and keeping theinformation about dependencies between flows. Furthermore, the introducedapproach improves the computation of indirect-blocking delay bounds in terms ofcomplexity and ensures the safety of these bounds even for non-schedulabletraffic. We provide further insights into the tightness and complexity issuesof worst-case delay bounds yielded by the extended BATA with the Graph-basedapproach, denoted G-BATA. Our assessments show that the complexity hasdecreased by up to 100 times while offering an average tightness ratio of 71%,with reference to the basic BATA. Finally, we evaluate the yielded improvementswith G-BATA for a realistic use case against a recent state-of-the-artapproach. This evaluation shows the applicability of G-BATA under more generalassumptions and the impact of such a feature on the tightness and computationtime.

Graph-based Approach for Buffer-aware Timing Analysis of Heterogeneous Wormhole NoCs under Bursty Traffic