Scaling Up the Memory Interference Analysis for Hard Real-Time Many-Core Systems

Autor: Maximilien Dupont de Dinechin, Matthieu Moy, Claire Maiza, Matheus Schuh

Publikováno v: DATE 2020-Design, Automation and Test in Europe Conference
DATE 2020-Design, Automation and Test in Europe Conference, Mar 2020, Grenoble, France. pp.1-4
DATE

In RTNS 2016, Rihani et al. [7] proposed an algorithm to compute the impact of interference on memory accesses on the timing of a task graph. It calculates a static, time-triggered schedule, i.e. a release date and a worst-case response time for each

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::7108e6aa979024a42c7b320aee7718d5
https://hal.archives-ouvertes.fr/hal-02431273/document

Fast and exact analysis for LRU caches

Autor: David Monniaux, Jan Reineke, Claire Maiza, Valentin Touzeau

Publikováno v: Proceedings of the ACM on Programming Languages
Proceedings of the ACM on Programming Languages, ACM, 2019, 3 (POPL), ⟨10.1145/3290367⟩
Proceedings of the ACM on Programming Languages, 2019, 3 (POPL), ⟨10.1145/3290367⟩

For applications in worst-case execution time analysis and in security, it is desirable to statically classify memory accesses into those that result in cache hits, and those that result in cache misses. Among cache replacement policies, the least re

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::59d555de8235e429b7521eef5043d0cb
https://hal.archives-ouvertes.fr/hal-01908648

An extensible framework for multicore response time analysis

Autor: Robert I. Davis, Vincent Nélis, Jan Reineke, Leandro Soares Indrusiak, Claire Maiza, Sebastian Altmeyer

Publikováno v: Real-Time Systems, 54(3). Springer Netherlands
Repositório Científico de Acesso Aberto de Portugal
Repositório Científico de Acesso Aberto de Portugal (RCAAP)
instacron:RCAAP

In this paper, we introduce a multicore response time analysis (MRTA) framework, which decouples response time analysis from a reliance on context-independent WCET values. Instead, the analysis formulates response times directly from the demands plac

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::ac6c8f956f51116e8436eb45a17ff464
https://dare.uva.nl/personal/pure/en/publications/an-extensible-framework-for-multicore-response-time-analysis(a926c998-ce00-4270-b3be-863f72e5fda4).html

Online and offline scheduling with cache-related preemption delays

Autor: Pascal Richard, Joël Goossens, Claire Maiza, Thomas Chapeaux, Laurent George, Guillaume Phavorin

Publikováno v: Real-Time Systems
Real-Time Systems, Springer Verlag, 2017, pp.1-38. ⟨10.1007/s11241-017-9275-6⟩
Real-time systems, 54 (3

International audience; In this paper, we consider the problem of scheduling hard real-time tasks subjected to preemption delays on a uniprocessor system. While most of the existing work focus on either reducing these additional delays or improving t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::a59d0e9e679fb3f9a2adf7ac4e96f7cb
https://hal.archives-ouvertes.fr/hal-01779467

How to compute worst-case execution time by optimization modulo theory and a clever encoding of program semantics

Autor: Mihail Asavoae, David Monniaux, Julien Henry, Claire Maiza

Publikováno v: ACM SIGPLAN Notices
LCTES 2014
ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2014
ACM SIGPLAN/SIGBED Conference on Languages, Compilers and Tools for Embedded Systems 2014, Jun 2014, Edimbourg, United Kingdom. pp.1-10
HAL
LCTES

In systems with hard real-time constraints, it is necessary to compute upper bounds on the worst-case execution time (WCET) of programs; the closer the bound to the real WCET, the better. This is especially the case of synchronous reactive control lo

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::596e39b66268a9b0e8319055a3e6b042
https://doi.org/10.1145/2666357.2597817