Subgraph-Based Refinement of Worst-Case Execution Time Bounds
Florian Brandner
,
Alexander Jordan
2014
Reports
hal-00978015v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Criticality: static profiling for real-time programs
Florian Brandner
,
Stefan Hepp
,
Alexander Jordan
Journal articles
hal-01108039v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Refinement of worst-case execution time bounds by graph pruning
Florian Brandner
,
Alexander Jordan
Journal articles
hal-01108029v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Efficient Context Switching for the Stack Cache
Sahar Abbaspour
,
Florian Brandner
,
Amine Naji
,
Mathieu Jan
Proceedings of the 23rd International Conference on Real Time and Networks Systems , Julien Forget (Université de Lille, France), Nov 2015, Lille, France. pp.10,
⟨10.1145/2834848.2834861⟩
Conference papers
hal-01246348v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Analysis of preemption costs for the stack cache
Amine Naji
,
Sahar Abbaspour
,
Florian Brandner
,
Mathieu Jan
Journal articles
cea-01773654v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Alignment of Memory Transfers of a Time-Predictable Stack Cache
Sahar Abbaspour
,
Florian Brandner
2014, pp.4
Other publications
hal-01108105v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More
Lazy Spilling for a Time-Predictable Stack Cache: Implementation and Analysis
Sahar Abbaspour
,
Alexander Jordan
,
Florian Brandner
14th International Workshop on Worst-Case Execution Time Analysis , Jul 2014, Madrid, Spain. pp.83-92
Conference papers
hal-01056216v1
Actions
Share
Gmail
Facebook
Twitter
LinkedIn
More