Sébastien Le Nours
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
Sébastien Le Nours has a total of 22 co-authors. Here are the top co-authors by number of shared publications:
- Sebastien Pillement
Nantes Université, CNRS, IETR UMR 6164
5 shared publications - Kim Grüttner
German Aerospace Center (DLR), Oldenburg, Germany
3 shared publications - Ralf Stemmer
German Aerospace Center (DLR), Oldenburg, Germany
3 shared publications - Quentin Dariol
Nantes Université - IETR UMR CNRS 6164, France and German Aerospace Center (DLR), Germany
2 shared publications Adam Postula
University of Queensland
1 shared publication- Andrea Pinna
CNRS, LIP6, Sorbonne Université, Paris, France
1 shared publication
Latest Publications
- 17 February 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 175
A measurement-based calibration approach for highly scalable timing and energy modeling of EdgeAI multi-core systems
- 17 February 2026
- Published by Elsevier in Journal of Systems Architecture
- Vol. 175
A measurement-based calibration approach for highly scalable timing and energy modeling of EdgeAI multi-core systems
- Open Access
- 30 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Reconfigurable Technology and Systems
- Vol. 18 (3) , 1-22
VERSATILE: Very Fast Partial Reconfiguration Controller
Dynamically reconfigurable architectures allow sharing of hardware resources, which is particularly beneficial for small low-end FPGAs. Based on the online modification of parts of the circuit, these architectures require partial reconfiguration of the chip. Reducing resource availability or usage comes at the cost of a performance penalty affecting execution time. The challenge lies in bitstream management, especially for complex applications that often exceed the internal memory capacity of the FPGA (BRAM). Consequently, the time penalty arises from the need to retrieve partial bitstreams from external memory (e.g., often a DDR) each time it is necessary. Current state-of-the-art reconfiguration controllers are limited to a throughput of 400 MB/s, significantly penalizing reconfiguration times and making dynamic reconfiguration unattractive for real-life applications (e.g., video processing, machine learning applications, and continual and federated learning for embedded systems). This article introduces a novel partial reconfiguration controller architecture that achieves a throughput of up to 1.396 GB/s, a 3.49× acceleration over existing controllers. The reduced reconfiguration time allows the practical use of dynamic reconfiguration with fewer performance penalties. Additionally, the article compares various reconfiguration controllers in terms of time penalties and offers a tradeoff between algorithm complexity, FPGA resources, and performance.
- 30 September 2025
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Reconfigurable Technology and Systems
- Vol. 18 (3) , 1-22
Open AccessVERSATILE: Very Fast Partial Reconfiguration Controller
Dynamically reconfigurable architectures allow sharing of hardware resources, which is particularly beneficial for small low-end FPGAs. Based on the online modification of parts of the circuit, these architectures require partial reconfiguration of the chip. Reducing resource availability or usage comes at the cost of a performance penalty affecting execution time. The challenge lies in bitstream management, especially for complex applications that often exceed the internal memory capacity of the FPGA (BRAM). Consequently, the time penalty arises from the need to retrieve partial bitstreams from external memory (e.g., often a DDR) each time it is necessary. Current state-of-the-art reconfiguration controllers are limited to a throughput of 400 MB/s, significantly penalizing reconfiguration times and making dynamic reconfiguration unattractive for real-life applications (e.g., video processing, machine learning applications, and continual and federated learning for embedded systems). This article introduces a novel partial reconfiguration controller architecture that achieves a throughput of up to 1.396 GB/s, a 3.49× acceleration over existing controllers. The reduced reconfiguration time allows the practical use of dynamic reconfiguration with fewer performance penalties. Additionally, the article compares various reconfiguration controllers in terms of time penalties and offers a tradeoff between algorithm complexity, FPGA resources, and performance.
- Open Access
- 17 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 79-86
Fast Yet Accurate Timing and Power Prediction of Artificial Neural Networks Deployed on Clock-Gated Multi-Core Platforms
When deploying Artificial Neural Networks (ANNs) onto multi-core embedded platforms, an intensive evaluation flow is necessary to find implementations that optimize resource usage, timing and power. ANNs require indeed significant amounts of computational and memory resources to execute, while embedded execution platforms offer limited resources with strict power budget. Concurrent accesses from processors to shared resources on multi-core platforms can lead to bottlenecks with impact on performance and power. Existing approaches show limitations to deliver fast yet accurate evaluation ahead of ANN deployment on the targeted hardware. In this paper, we present a modeling flow for timing and power prediction in early design stage of fully-connected ANNs on multi-core platforms. Our flow offers fast yet accurate predictions with consideration of shared communication resources and scalability in regards of the number of cores used. The flow is evaluated on real measurements for 42 mappings of 3 fully-connected ANNs executed on a clock-gated multi-core platform featuring two different communication modes: polling or interrupt-based. Our modeling flow predicts timing with accuracy and power with accuracy on the tested mappings for an average simulation time of 0.23 s for 100 iterations. We then illustrate the application of our approach for efficient design space exploration of ANN implementations.
- 17 January 2023
- Published by Association for Computing Machinery (ACM)
- p. 79-86
Open AccessFast Yet Accurate Timing and Power Prediction of Artificial Neural Networks Deployed on Clock-Gated Multi-Core Platforms
When deploying Artificial Neural Networks (ANNs) onto multi-core embedded platforms, an intensive evaluation flow is necessary to find implementations that optimize resource usage, timing and power. ANNs require indeed significant amounts of computational and memory resources to execute, while embedded execution platforms offer limited resources with strict power budget. Concurrent accesses from processors to shared resources on multi-core platforms can lead to bottlenecks with impact on performance and power. Existing approaches show limitations to deliver fast yet accurate evaluation ahead of ANN deployment on the targeted hardware. In this paper, we present a modeling flow for timing and power prediction in early design stage of fully-connected ANNs on multi-core platforms. Our flow offers fast yet accurate predictions with consideration of shared communication resources and scalability in regards of the number of cores used. The flow is evaluated on real measurements for 42 mappings of 3 fully-connected ANNs executed on a clock-gated multi-core platform featuring two different communication modes: polling or interrupt-based. Our modeling flow predicts timing with accuracy and power with accuracy on the tested mappings for an average simulation time of 0.23 s for 100 iterations. We then illustrate the application of our approach for efficient design space exploration of ANN implementations.
- Open Access
- 20 July 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (14) , 6649
A Measurement-Based Message-Level Timing Prediction Approach for Data-Dependent SDFGs on Tile-Based Heterogeneous MPSoCs
Fast yet accurate performance and timing prediction of complex parallel data flow applications on multi-processor systems remains a very difficult discipline. The reason for it comes from the complexity of the data flow applications w.r.t. data dependent execution paths and the hardware platform with shared resources, like buses and memories. This combination may lead to complex timing interferences that are difficult to express in pure analytical or classical simulation-based approaches. In this work, we propose the combination of timing measurement and statistical simulation models for probabilistic timing and performance prediction of Synchronous Data Flow (SDF) applications on MPSoCs with shared memories. We exploit the separation of computation and communication in our SDF model of computation to set-up simulation-based performance prediction models following different abstraction approaches. We especially propose a message-level communication model driven by a data-dependent probabilistic execution phase timing model. We compare our work against measurement on two case-studies from the computer vision domain: a Sobel filter and a JPEG decoder. We show that the accuracy and execution time of our modeling and evaluation framework outperforms existing approaches and is suitable for a fast yet accurate design space exploration.
- 20 July 2021
- Published by MDPI AG in Applied Sciences
- Vol. 11 (14) , 6649
Open AccessA Measurement-Based Message-Level Timing Prediction Approach for Data-Dependent SDFGs on Tile-Based Heterogeneous MPSoCs
Fast yet accurate performance and timing prediction of complex parallel data flow applications on multi-processor systems remains a very difficult discipline. The reason for it comes from the complexity of the data flow applications w.r.t. data dependent execution paths and the hardware platform with shared resources, like buses and memories. This combination may lead to complex timing interferences that are difficult to express in pure analytical or classical simulation-based approaches. In this work, we propose the combination of timing measurement and statistical simulation models for probabilistic timing and performance prediction of Synchronous Data Flow (SDF) applications on MPSoCs with shared memories. We exploit the separation of computation and communication in our SDF model of computation to set-up simulation-based performance prediction models following different abstraction approaches. We especially propose a message-level communication model driven by a data-dependent probabilistic execution phase timing model. We compare our work against measurement on two case-studies from the computer vision domain: a Sobel filter and a JPEG decoder. We show that the accuracy and execution time of our modeling and evaluation framework outperforms existing approaches and is suitable for a fast yet accurate design space exploration.
- 22 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 12 (4) , 117-120
A Generic Executable Model for Fast Yet Accurate Contention Simulation in Multiprocessor Systems
- 22 January 2020
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Embedded Systems Letters
- Vol. 12 (4) , 117-120
A Generic Executable Model for Fast Yet Accurate Contention Simulation in Multiprocessor Systems
- 8 August 2019
- Published by Springer Nature
- p. 281-293
System-Level Modeling and Simulation of MPSoC Run-Time Management Using Execution Traces Analysis
- 8 August 2019
- Published by Springer Nature
- p. 281-293
System-Level Modeling and Simulation of MPSoC Run-Time Management Using Execution Traces Analysis
- Open Access
- 11 December 2017
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 90 (12) , 1667-1685
A Hybrid Simulation Approach for Fast and Accurate Timing Analysis of Multi-Processor Platforms Considering Communication Resources Conflicts
- 11 December 2017
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 90 (12) , 1667-1685
Open AccessA Hybrid Simulation Approach for Fast and Accurate Timing Analysis of Multi-Processor Platforms Considering Communication Resources Conflicts
- 19 June 2013
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 73 (3) , 267-279
A Case Study of Simulation and Performance Evaluationof a SDR Baseband Architecture
- 19 June 2013
- Published by Springer Nature in Journal of Signal Processing Systems
- Vol. 73 (3) , 267-279
A Case Study of Simulation and Performance Evaluationof a SDR Baseband Architecture