Graph-Based Approach for Buffer-Aware Timing Analysis of Heterogeneous Wormhole NoCs Under Bursty Traffic
| Autor: | Frederic Giroudot, Ahlem Mifdaoui |
|---|---|
| Přispěvatelé: | Institut Supérieur de l'Aéronautique et de l'Espace - ISAE-SUPAERO (FRANCE), Département d'Ingénierie des Systèmes Complexes (DISC), Institut Supérieur de l'Aéronautique et de l'Espace (ISAE-SUPAERO) |
| Rok vydání: | 2020 |
| Předmět: |
FOS: Computer and information sciences
timing analysis General Computer Science Computer science Distributed computing Réseaux et télécommunications real-time virtual channel 02 engineering and technology Blocking (statistics) 01 natural sciences Networks-on-chip [INFO.INFO-NI]Computer Science [cs]/Networking and Internet Architecture [cs.NI] 010104 statistics & probability 0202 electrical engineering electronic engineering information engineering General Materials Science 0101 mathematics Wormhole Routing NOC wormhole routing Queueing theory Computer Science - Performance Backpressure Network packet network calculus General Engineering Static timing analysis 020206 networking & telecommunications Performance (cs.PF) Transmission (telecommunications) Graph (abstract data type) Network Calculus lcsh:Electrical engineering. Electronics. Nuclear engineering Network calculus lcsh:TK1-9971 |
| Zdroj: | IEEE Access, Vol 8, Pp 32442-32463 (2020) IEEE Access IEEE Access, IEEE, 2020, 8, pp.32442-32463. ⟨10.1109/ACCESS.2020.2973891⟩ |
| ISSN: | 2169-3536 |
| Popis: | This paper addresses the problem of worst-case timing analysis of heterogeneous wormhole NoCs, i.e., routers with different buffer sizes and transmission speeds, when consecutive packet queuing (CPQ) occurs. The latter means that there are several consecutive packets of one flow queuing in the network. This scenario happens in the case of bursty traffic but also for non-schedulable traffic. Conducting such an analysis is known to be a challenging issue due to the sophisticated congestion patterns when enabling backpressure mechanisms. We tackle this problem through extending the applicability domain of our previous work for computing maximum delay bounds using Network Calculus, called Buffer-aware worst-case Timing Analysis (BATA). We propose a new Graph-based approach to improve the analysis of indirect blocking due to backpressure, while capturing the CPQ effect and keeping the information about dependencies between flows. Furthermore, the introduced approach improves the computation of indirect-blocking delay bounds in terms of complexity and ensures the safety of these bounds even for non-schedulable traffic. We provide further insights into the tightness and complexity issues of worst-case delay bounds yielded by the extended BATA with the Graph-based approach, denoted G-BATA. Our assessments show that the complexity has decreased by up to 100 times while offering an average tightness ratio of 71%, with reference to the basic BATA. Finally, we evaluate the yielded improvements with G-BATA for a realistic use case against a recent state-of-the-art approach. This evaluation shows the applicability of G-BATA under more general assumptions and the impact of such a feature on the tightness and computation time. 21 pages, 22 figures, 5 tables |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|