Mathieu Jan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Mathieu Jan has a total of 77 co-authors. Here are the top co-authors by number of shared publications:
Gabriel Antoniu
INRIA - Rennes Research Centre, Campus de Beaulieu, 35042 Rennes cedex, France
6 shared publications- Florian Brandner
LTCI, Télécom Paris, Institut Polytechnique de Paris, Palaiseau, France
4 shared publications - Alexandru Iosup
Vrije Universiteit Amsterdam, Amsterdam, Netherlands
3 shared publications Belgacem Ben Hedia
CEA, LIST
2 shared publicationsChristian Fraboul
IRIT INP-ENSEEIHT, Univ. de Toulouse, Toulouse, France
2 shared publicationsDamien Chabrol
KRONO-SAFE, Orsay, France
2 shared publications
Latest Publications
- 11 April 2022
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 24 (3) , 415-440
Formal modeling and verification for amplification timing anomalies in the superscalar TriCore architecture
- 11 April 2022
- Published by Springer Nature in International Journal on Software Tools for Technology Transfer
- Vol. 24 (3) , 415-440
Formal modeling and verification for amplification timing anomalies in the superscalar TriCore architecture
- 18 February 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 203-227
Towards Formal Co-validation of Hardware and Software Timing Models of CPSs
- 18 February 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 203-227
Towards Formal Co-validation of Hardware and Software Timing Models of CPSs
- 26 July 2019
- Published by Springer Nature in Real-Time Systems
- Vol. 56 (2) , 124-170
Work-conserving dynamic time-division multiplexing for multi-criticality systems
- 26 July 2019
- Published by Springer Nature in Real-Time Systems
- Vol. 56 (2) , 124-170
Work-conserving dynamic time-division multiplexing for multi-criticality systems
- 6 February 2018
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (3) , 700-744
Analysis of preemption costs for the stack cache
- 6 February 2018
- Published by Springer Nature in Real-Time Systems
- Vol. 54 (3) , 700-744
Analysis of preemption costs for the stack cache
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Modeling legacy code with BIP: how to reduce the gap between formal description and real-time implementation
To reduce the gap between high-level functional descriptions and real-time multitasking implementation, this paper proposes a set of modeling and code generation principles. Modeling principles are based on integration of a specific BIP concurrent component. This component follows a specific behavioral pattern based on periodic activation of data consumption, data processing and data production. It acts as a periodic task at execution stage. The pattern proposes two variants for eventtriggered and time-triggered platforms. The approach has been tested on three case studies, showing the interest of formalization for behavioral verification. The proposed pattern allows real-time validation and offers classical advantages of high-level modeling.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-8
Modeling legacy code with BIP: how to reduce the gap between formal description and real-time implementation
To reduce the gap between high-level functional descriptions and real-time multitasking implementation, this paper proposes a set of modeling and code generation principles. Modeling principles are based on integration of a specific BIP concurrent component. This component follows a specific behavioral pattern based on periodic activation of data consumption, data processing and data production. It acts as a periodic task at execution stage. The pattern proposes two variants for eventtriggered and time-triggered platforms. The approach has been tested on three case studies, showing the interest of formalization for behavioral verification. The proposed pattern allows real-time validation and offers classical advantages of high-level modeling.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 86-96
Reducing the Contention Experienced by Real-Time Core-to-I/O Flows over a Tilera-Like Network on Chip
Many-core architectures are promising hardware to design real-time systems. However, the worst-case behavior of the Network-on-Chip (NoC) for both core-to-core and core-to-Input/Output (I/O) communications of critical applications must be established. The mapping over the NoC of both critical and non-critical applications has an impact on the network contention these critical communications exhibit. So far, all existing mapping strategies have focused on core-to-core communications. However, many-cores in embedded real-time systems will be integrated within backbone Ethernet networks, as they mostly provide Ethernet controllers as I/O interfaces. In a previous work we have shown that Ethernet packets can be dropped due to an internal congestion in a Tilera-like NoC. In this work, we describe and evaluate a mapping strategy for such Tilera-like NoCs that minimizes the contention of core-to-I/O critical flows in order to solve this problem. Experimental results on real avionics applications show significant improvements of core-to-IO flows transmission delays, without significantly impacting transmission delays of core-to-core flows.
- 1 September 2016
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 86-96
Reducing the Contention Experienced by Real-Time Core-to-I/O Flows over a Tilera-Like Network on Chip
Many-core architectures are promising hardware to design real-time systems. However, the worst-case behavior of the Network-on-Chip (NoC) for both core-to-core and core-to-Input/Output (I/O) communications of critical applications must be established. The mapping over the NoC of both critical and non-critical applications has an impact on the network contention these critical communications exhibit. So far, all existing mapping strategies have focused on core-to-core communications. However, many-cores in embedded real-time systems will be integrated within backbone Ethernet networks, as they mostly provide Ethernet controllers as I/O interfaces. In a previous work we have shown that Ethernet packets can be dropped due to an internal congestion in a Tilera-like NoC. In this work, we describe and evaluate a mapping strategy for such Tilera-like NoCs that minimizes the contention of core-to-I/O critical flows in order to solve this problem. Experimental results on real avionics applications show significant improvements of core-to-IO flows transmission delays, without significantly impacting transmission delays of core-to-core flows.
- Open Access
- 4 November 2015
- Published by Association for Computing Machinery (ACM)
- p. 119-128
Efficient context switching for the stack cache
International audienceThe design of tailored hardware has proven a successful strategy to reduce the timing analysis overhead for (hard) real-time systems. The stack cache is an example of such a design that has been proven to provide good average-case performance, while being easy to analyze.So far, however, the analysis of the stack cache was limited to individual tasks, ignoring aspects related to multitasking. A major drawback of the original stack cache design is that, due to its simplicity, it cannot hold the data of multiple tasks at the same time. Consequently, the entire cache content needs to be saved and restored when a task is preempted.We propose (a) an analysis exploiting the simplicity of the stack cache to bound the overhead induced by task preemption and (b) an extension of the design that allows to (partially) hide the overhead by virtualizing stack caches
- 4 November 2015
- Published by Association for Computing Machinery (ACM)
- p. 119-128
Open AccessEfficient context switching for the stack cache
International audienceThe design of tailored hardware has proven a successful strategy to reduce the timing analysis overhead for (hard) real-time systems. The stack cache is an example of such a design that has been proven to provide good average-case performance, while being easy to analyze.So far, however, the analysis of the stack cache was limited to individual tasks, ignoring aspects related to multitasking. A major drawback of the original stack cache design is that, due to its simplicity, it cannot hold the data of multiple tasks at the same time. Consequently, the entire cache content needs to be saved and restored when a task is preempted.We propose (a) an analysis exploiting the simplicity of the stack cache to bound the overhead induced by task preemption and (b) an extension of the design that allows to (partially) hide the overhead by virtualizing stack caches
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21503109,p. 1-10
Wormhole networks properties and their use for optimizing worst case delay analysis of many-cores
Many-core architectures are promising hardware to design hard real-time systems as they are based on simpler and thus more predictable processors than multi-core systems. However, the worst-case behavior of the Network-on-Chip (NoC) for both inter-core and core to external memories or peripherals communications must be established. Several NoCs targeting hard real-time systems, made of specific hardware extensions, have been designed. However, none of these extensions are currently available in commercially existing NoC-based many-core architectures, that instead rely on wormhole switching with round-robin arbitration. In this paper, we thus demonstrate three properties of such NoC-based wormhole networks to identify worst-case scenarios and reduce the pessimism when modeling flows in contentions. We then describe and evaluate an algorithm to compute Worst-Case Traversal Time (WCTT) of flows that uses these properties. In particular, our results show that the pessimism can be reduced up to 50% compared to current state-of-the-art real-time packet schedulability analysis.
- 1 June 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21503109,p. 1-10
Wormhole networks properties and their use for optimizing worst case delay analysis of many-cores
Many-core architectures are promising hardware to design hard real-time systems as they are based on simpler and thus more predictable processors than multi-core systems. However, the worst-case behavior of the Network-on-Chip (NoC) for both inter-core and core to external memories or peripherals communications must be established. Several NoCs targeting hard real-time systems, made of specific hardware extensions, have been designed. However, none of these extensions are currently available in commercially existing NoC-based many-core architectures, that instead rely on wormhole switching with round-robin arbitration. In this paper, we thus demonstrate three properties of such NoC-based wormhole networks to identify worst-case scenarios and reduce the pessimism when modeling flows in contentions. We then describe and evaluate an algorithm to compute Worst-Case Traversal Time (WCTT) of flows that uses these properties. In particular, our results show that the pessimism can be reduced up to 50% compared to current state-of-the-art real-time packet schedulability analysis.
- 10 September 2014
- Published by Springer Nature in Real-Time Systems
- Vol. 51 (2) , 153-191
Scheduling algorithms to reduce the static energy consumption of real-time systems
- 10 September 2014
- Published by Springer Nature in Real-Time Systems
- Vol. 51 (2) , 153-191
Scheduling algorithms to reduce the static energy consumption of real-time systems
- Open Access
- 16 October 2013
- Published by Association for Computing Machinery (ACM)
- p. 99-108
A scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems
- 16 October 2013
- Published by Association for Computing Machinery (ACM)
- p. 99-108
Open AccessA scheduling algorithm to reduce the static energy consumption of multiprocessor real-time systems