Florian Brandner
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
Florian Brandner has a total of 52 co-authors. Here are the top co-authors by number of shared publications:
Andreas Krall
Technische Universität Wien
8 shared publications- Martin Schoeberl
Technical University of Denmark
6 shared publications - Mathieu Jan
IRISA/INRIA
4 shared publications - Mihail Asavoae
Université Paris Saclay, CEA List, Palaiseau, France
4 shared publications Alexander Jordan
3 shared publicationsDietmar Ebner
Vienna University of Technology, Vienna, Austria
3 shared publications
Latest Publications
- 28 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 298-305
Leveraging Reusable Code and Proofs to Design Complex DRAM Controllers - A Case Study
Critical real-time systems are getting more and more complex and require ever more computing power. Multi-core platforms, GPUs, and custom accelerators promise to deliver this needed performance. However, these platforms are notoriously hard to analyze and lack predictability in terms of timing properties. Computer architectures and platforms that offer both predictability and performance are thus needed. This work investigates the use of the interactive proof assistant Coq in order to model complex DRAM memory controllers (MCs) for multi-core platforms. The design of predictable high-performance MCs is particularly challenging, since memory requests have to be processed efficiently, while facing interference from other cores in the system. The problem is exacerbated by the complexity of DRAM devices and the various timing constraints they impose. Specifically, this work extends a previous Coq framework by focusing on reusability, which allows designers to develop and prove complex MCs. As a use-case, we present TDMShelve, an MC balancing performance and isolation.
- 28 August 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 298-305
Leveraging Reusable Code and Proofs to Design Complex DRAM Controllers - A Case Study
Critical real-time systems are getting more and more complex and require ever more computing power. Multi-core platforms, GPUs, and custom accelerators promise to deliver this needed performance. However, these platforms are notoriously hard to analyze and lack predictability in terms of timing properties. Computer architectures and platforms that offer both predictability and performance are thus needed. This work investigates the use of the interactive proof assistant Coq in order to model complex DRAM memory controllers (MCs) for multi-core platforms. The design of predictable high-performance MCs is particularly challenging, since memory requests have to be processed efficiently, while facing interference from other cores in the system. The problem is exacerbated by the complexity of DRAM devices and the various timing constraints they impose. Specifically, this work extends a previous Coq framework by focusing on reusability, which allows designers to develop and prove complex MCs. As a use-case, we present TDMShelve, an MC balancing performance and isolation.
- Open Access
- 14 November 2023
- Published by Springer Nature in Real-Time Systems
- Vol. 59 (4) , 664-704
A formal framework to design and prove trustworthy memory controllers
In order to prove conformance to memory standards and bound memory access latency, recently proposed real-time DRAM controllers rely on paper and pencil proofs, which can be troubling: they are difficult to read and review, they are often shown only partially and/or rely on abstractions for the sake of conciseness, and they can easily diverge from the controller implementation, as no formal link is established between both. We propose a new framework written in Coq, in which we model a DRAM controller and its expected behaviour as a formal specification. The trustworthiness in our solution is two-fold: (1) proofs that are typically done on paper and pencil are now done in Coq and thus certified by its kernel, and (2) the reviewer’s job develops into making sure that the formal specification matches the standards—instead of performing a thorough check of the mathematical formalism. Our framework provides a generic DRAM model capturing a set of controller properties as proof obligations, which all implementations must comply with. We focus on properties related to the assertiveness that timing constraints are respected, every incoming request is handled in bounded time, and the DRAM command protocol is respected. We refine our specification with two implementations based on widely-known arbitration policies—First-in First-Out (FIFO) and Time-Division Multiplexing (TDM). We extract proved code from our model and use it as a “trusted core” on a cycle-accurate DRAM simulator.
- 14 November 2023
- Published by Springer Nature in Real-Time Systems
- Vol. 59 (4) , 664-704
Open AccessA formal framework to design and prove trustworthy memory controllers
In order to prove conformance to memory standards and bound memory access latency, recently proposed real-time DRAM controllers rely on paper and pencil proofs, which can be troubling: they are difficult to read and review, they are often shown only partially and/or rely on abstractions for the sake of conciseness, and they can easily diverge from the controller implementation, as no formal link is established between both. We propose a new framework written in Coq, in which we model a DRAM controller and its expected behaviour as a formal specification. The trustworthiness in our solution is two-fold: (1) proofs that are typically done on paper and pencil are now done in Coq and thus certified by its kernel, and (2) the reviewer’s job develops into making sure that the formal specification matches the standards—instead of performing a thorough check of the mathematical formalism. Our framework provides a generic DRAM model capturing a set of controller properties as proof obligations, which all implementations must comply with. We focus on properties related to the assertiveness that timing constraints are respected, every incoming request is handled in bounded time, and the DRAM command protocol is respected. We refine our specification with two implementations based on widely-known arbitration policies—First-in First-Out (FIFO) and Time-Division Multiplexing (TDM). We extract proved code from our model and use it as a “trusted core” on a cycle-accurate DRAM simulator.
- 3 June 2023
- Published by Springer Nature
- p. 295-311
From the Standards to Silicon: Formally Proved Memory Controllers
- 3 June 2023
- Published by Springer Nature
- p. 295-311
From the Standards to Silicon: Formally Proved Memory Controllers
- 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
- 24 June 2021
- Published by Springer Nature in Real-Time Systems
- Vol. 58 (1) , 36-84
Precise, efficient, and context-sensitive cache analysis
- 24 June 2021
- Published by Springer Nature in Real-Time Systems
- Vol. 58 (1) , 36-84
Precise, efficient, and context-sensitive cache analysis
- 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
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 456-468
Shedding the Shackles of Time-Division Multiplexing
Multi-core architectures pose many challenges in real-time systems, which arise from contention between concurrent accesses to shared memory. Among the available memory arbitration policies, Time Division Multiplexing (TDM) ensures a predictable behavior by bounding access latencies and guaranteed bandwidth to tasks independently from the other tasks. To do so, TDM guarantees exclusive access to the shared memory in a fixed time window. TDM, however, provides a low resource utilization as it is non-work-conserving. Besides, it is very inefficient for resources having highly variable latencies, such as sharing the access to a DRAM memory. The constant length of a TDM slot is, hence, highly pessimistic and causes an underutilization of the memory. To address these limitations, we present dynamic arbitration schemes that are based on TDM. However, instead of arbitrating at the level of TDM slots, our approach operates at the granularity of clock cycles by exploiting slack time accumulated from preceding requests. This allows the arbiter to reorder memory requests, exploit the actual access latencies of requests, and thus improve memory utilization. We demonstrate that our policies are analyzable as they preserve the guarantees of TDM in the worst case, while our experiments show an improved memory utilization on average.
- 1 December 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 456-468
Shedding the Shackles of Time-Division Multiplexing
Multi-core architectures pose many challenges in real-time systems, which arise from contention between concurrent accesses to shared memory. Among the available memory arbitration policies, Time Division Multiplexing (TDM) ensures a predictable behavior by bounding access latencies and guaranteed bandwidth to tasks independently from the other tasks. To do so, TDM guarantees exclusive access to the shared memory in a fixed time window. TDM, however, provides a low resource utilization as it is non-work-conserving. Besides, it is very inefficient for resources having highly variable latencies, such as sharing the access to a DRAM memory. The constant length of a TDM slot is, hence, highly pessimistic and causes an underutilization of the memory. To address these limitations, we present dynamic arbitration schemes that are based on TDM. However, instead of arbitrating at the level of TDM slots, our approach operates at the granularity of clock cycles by exploiting slack time accumulated from preceding requests. This allows the arbiter to reorder memory requests, exploit the actual access latencies of requests, and thus improve memory utilization. We demonstrate that our policies are analyzable as they preserve the guarantees of TDM in the worst case, while our experiments show an improved memory utilization on average.
- 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 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2908, 1-10
Modeling the energy consumption of programs: Thermal aspects and energy/frequency convexity rule (invited paper)
This article summarizes our current studies aiming at a better understanding of the energy consumption of a microprocessor during the execution of an application through a combination of theoretical results and experimental validations, The analysis of the transient thermal behavior and energy gains (ranging from 20 to 40% in some cases) via the adaptation of the clock frequency are of obvious practical interest. A general Passive Cooling Rule (PCR) for an isothermal object subjected to radiation, convection and internal heat generation is proposed. This power-temperature model is observed on an Exynos 5410 processor. Several approximations to this cooling rule are formulated for practical use, particularly online. They are accompanied by general rules for assessing when passive cooling becomes non-negligible compared to active cooling in embedded systems. On another hand, a theoretical framework for the existence of an Energy/Frequency Convexity Rule (EFCR) of program consumption is established. It is validated both by the state of the art and by experimental measurements. Power consumption models are then explained. The novelty of these models is that they take into account certain characteristics of the program execution and that they can be directly reused in any simulation for other processors of similar architecture.
- 1 October 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 2908, 1-10
Modeling the energy consumption of programs: Thermal aspects and energy/frequency convexity rule (invited paper)
This article summarizes our current studies aiming at a better understanding of the energy consumption of a microprocessor during the execution of an application through a combination of theoretical results and experimental validations, The analysis of the transient thermal behavior and energy gains (ranging from 20 to 40% in some cases) via the adaptation of the clock frequency are of obvious practical interest. A general Passive Cooling Rule (PCR) for an isothermal object subjected to radiation, convection and internal heat generation is proposed. This power-temperature model is observed on an Exynos 5410 processor. Several approximations to this cooling rule are formulated for practical use, particularly online. They are accompanied by general rules for assessing when passive cooling becomes non-negligible compared to active cooling in embedded systems. On another hand, a theoretical framework for the existence of an Energy/Frequency Convexity Rule (EFCR) of program consumption is established. It is validated both by the state of the art and by experimental measurements. Power consumption models are then explained. The novelty of these models is that they take into account certain characteristics of the program execution and that they can be directly reused in any simulation for other processors of similar architecture.