Worst-case end-to-end delays evaluation for SpaceWire networks

Ferrandiz, Thomas; Frances, Fabrice; Fraboul, Christian

doi:10.1007/s10626-011-0103-1

Cited by 8 publications

(4 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The recursive calculus was designed in Ferrandiz et al (2009), Ferrandiz et al (2011 to compute bounds on the SpaceWire technology, a wormholebased technology. The recursive calculus is one of the rare methods that fully take into account the back-pressure mechanism of the wormhole switching.…”

Section: Approaches Without Network Calculusmentioning

confidence: 99%

Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks

Boyer

Graillat

Dinechin

et al. 2020

Performance Evaluation

View full text Add to dashboard Cite

The Kalray MPPA2-256 processor integrates 256 processing cores and 32 management cores on a chip. Theses cores are grouped into clusters and clusters are connected by a high-performance network on chip (NoC). This NoC provides hardware mechanisms (ingress traffic limiters) that can be configured to offer service guarantees.This paper introduces a network calculus formulation, designed to configure the NoC traffic limiters, that also computes guarantee upper bounds on the NoC traversal latencies. This network calculus formulation accounts for the traffic shaping performed by the NoC links, and can be solved using linear programming. This paper then shows how existing network calculus approaches (the Separated Flow Analysis -SFA ; the Total Flow Analysis -TFA ; the Linear Programming approach -LP) can be adapted to analyze this NoC. The delay bounds obtained by the four approaches are then compared on two case studies: a small configuration coming from a previous study, and a realistic configuration with 128 or 256 flows.From theses cases studies, it appears that modeling the shaping introduced by NoC links is of major importance to get accurate bounds. And when all packets have the same size, modeling it reduces the bound by 20%-25% on average.

show abstract

Section: Approaches Without Network Calculusmentioning

confidence: 99%

Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks

Boyer

Graillat

Dinechin

et al. 2020

Performance Evaluation

View full text Add to dashboard Cite

show abstract

“…The network calculus (Le Boudec and Thiran, 2001) has been extended to multi-priority switched ethernet network (Sofack and Boyer) as well. Similarly, Herpel et al (2009), Chokshi and Bhaduri (2010) and Ferrandiz et al (2011) propose methods to evaluate lower and upper bounds of communication delays in other classical real-time networks such as CAN, Flexray, and SpaceWire. Generally speaking, these methods involve the communication path parameters (route in the network, throughput of the network nodes, maximum size of the messages allocated to the path, .…”

Section: Problem Descriptionmentioning

confidence: 99%

End-to-end latency and temporal consistency analysis in networked real-time systems

Lauer

Boniol

Pagetti

2014

IJCCBS

View full text Add to dashboard Cite

. End-to-end latency and temporal consistency analysis in networked real-time systems. International Journal of Critical ComputerBased Systems, Inderscience, 2014, vol. 5 (n°3/4), pp. 172-196 Abstract: Critical embedded systems are often designed as a set of real-time tasks, running on shared computing modules, and communicating through networks. Because of their critical nature, such systems have to meet strict timing properties. To help the designers to prove the correctness of their system, the real-time systems community has developed numerous approaches for analysing the worst case scenarios either on the processors (e.g., worst case response time of a task) or on the networks (e.g., worst case traversal time of a message). These approaches provide results only for local components behaviours. However, there is a growing need for having a global view of the system, in order to determine end-to-end properties. Such a property applies to functional chains which describe the behaviour of sequences of tasks. We propose an approach to analyse worst case behaviour along functional chains in critical embedded systems. It is based on mixed integer linear programming (MILP) and is general in the sense that it can be applied to a variety of end-to-end properties. This paper focuses on two essential properties: end-to-end latency and temporal consistency. This work was supported by the French National Research Agency within the SATRIMMAP project.Keywords: real-time systems; embedded systems; worst-case analysis; latency; temporal consistency; mixed integer linear programming; MILP.Reference to this paper should be made as follows: Lauer, M., Boniol, F., Pagetti, C. and Ermont, J. (2014) 'End-to-end latency and temporal consistency analysis in networked real-time systems', Int.

show abstract

“…The Network Calculus [LBT01] method has been extended to switched networks with several priorities level [SB12]. Similarly, [HHKG09,CB10,FFF11] propose methods for evaluating lower and upper bounds of communication delays in other classical real-time networks such as CAN, Flexray, and SpaceWire. Generally speaking, these methods involve the communication path parameters (route in the network, throughput of the network nodes, maximum size of the messages allocated to the path,.…”

Section: The Analysis Approach: Overviewmentioning

confidence: 99%

Freshness and Reactivity Analysis in Globally Asynchronous Locally Time-Triggered Systems

Boniol

Lauer

Pagetti

2013

Lecture Notes in Computer Science

View full text Add to dashboard Cite

OATAO is an open access repository that collects the work of Toulouse researchers and makes it freely available over the web where possible. Abstract. Critical embedded systems are often designed as a set of real-time tasks, running on shared computing modules, and communicating through networks. Because of their critical nature, such systems have to meet timing properties. To help the designers to prove the correctness of their system, the real-time systems community has developed numerous approaches for analyzing the worst case times either on the processors (e.g. worst case execution time of a task) or on the networks (e.g. worst case traversal time of a message). However, there is a growing need to consider the complete system and to be able to determine end-to-end properties. Such properties apply to a functional chain which describes the behavior of a sequence of functions, not necessarily hosted on a shared module, from an input until the production of an output. This paper explores two end-to-end properties: freshness and reactivity, and presents an analysis method based on Mixed Integer Linear Programming (MILP). This work is supported by the French National Research Agency within the Satrimmap project 1 .

show abstract

Worst-case end-to-end delays evaluation for SpaceWire networks

Cited by 8 publications

References 11 publications

Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks

Bounding the delays of the MPPA network-on-chip with network calculus: Models and benchmarks

End-to-end latency and temporal consistency analysis in networked real-time systems

Freshness and Reactivity Analysis in Globally Asynchronous Locally Time-Triggered Systems

Contact Info

Product

Resources

About