Real-time communication analysis for networks with two-stage arbitration

Abstract

Current on-chip and macro networks use multi-stage arbitration schemes which independently assign different resources such as crossbar inputs and outputs to individual traffic streams. To use these networks in real-time systems, their worst-case behavior must be proved analytically in order to ensure the required timing guarantees. Current analysis approaches, however, do not capture the multi-stage arbitration accurately. In this paper, we propose an analysis that maps the multi-stage arbitration to a schedulability analysis of multiprocessors with shared resources. This allows the exploitation of knowledge about the worst-case behavior of the individual traffic streams, which is required to provide nonsymmetric guarantees. Using this scheduling analysis approach, a detailed analysis solution for a common multi-stage arbitration scheme (iSLIP) is presented. Finally, we evaluate the proposed approach experimentally and compare it to previous work.

Providing Integrity in Real-Time Networks-on-Chip

“…The adopted strategy allows us to find out the number of entries required to achieve the bounded performance. Similar analysis approaches are seen in the literature [40], [44]. A violation of the assumption can be monitored during runtime and be safely reported.…”

Modeling of Ethernet AVB Networks for Worst-Case Timing Analysis

“…A similar approach has been shown for regular Ethernet in Rox and Ernst (2010) and for networks-on-chip in e.g. Shi and Burns (2008) and Diemer et al (2011). A study of the timing properties of Ethernet AVB has been presented by Imtiaz et al (2009).…”

Worst-Case Communication Time Analysis for On-Chip Networks With Finite Buffers

“…They also presented a contention analysis to estimate the worst-case latency of individual flows, considering both direct and indirect interference. In [20], the authors presented a schedulability analysis for real-time communications in wormhole networks using a round-robin arbitration scheme with multiple stages. This work was later extended in [21] to include a best-effort NoC.…”

“…Schedulability Analysis for [14] computer systems [12] real-time system using NoC with fixed-priority arbitration [15] real-time system using NoC with fixed-priority arbitration (extended to include self-blocking contention) [16] real-time system using NoC with fixed-priority arbitration (considering end-to-end latency and task dependencies) [17] real-time system using NoC with fixed-priority arbitration (reducing pessimism by analyzing traffic flow interference in sections of respective paths) [18] real-time system using NoC with Hop-based arbiter [19] real-time system using NoC with Earliest-Deadline-First policy and wormhole switching [20] real-time system using NoC with round-robin arbitration and multiple stages [21] best-effort NoC with round-robin arbitration and multiple stages [22] 2D mesh NoC with round-robin arbiter and two routing algorithms [23] NoC with round-robin arbiter (considering worst-case scenarios, unblocking delay, and influence of indirect flows)…”