Practicals & Theses

List of practicals and theses at the institute (see also TI Research Presentations)

Modelling of a Multistage Synchronizer

ECS: Dipl.-Ing. Dr.techn. Andreas STEININGER, 05. 07. 2019

At clock domain boundaries violation of setup- and hold time cannot be avoided. Synchronizers are used to mitigate the metastability that results from these violations. In modern technologies with their parameter variations and narrow timing margins, conventional single stage synchronizers are no more sufficient and need to be cascaded, thus forming multi-stage synchronizers. While theory provides a reasonably good estimation for the reliability (in terms of mean time between upsets, MTBU) of the single stage synchronizer, the MTBU estimation for the multi-stage synchronizer seems to be to simplistic. In particular, the influence of the input thresholds is currently not considered.


Compilation for Predictable Real-Time Systems

CPS: Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Peter PUSCHNER, 01. 03. 2010

Usually, the focus of compiler writers is to generate fast code. Contrasting this, the goal of this thesis is to work on code generation strategies that produce code with predictable timing, i.e., the stability of the timing and a simple prediction of the worst-case execution time are in the center of interest.


Predictable Cache Memory

CPS: Ao.Univ.Prof. Dipl.-Ing. Dr.techn. Peter PUSCHNER, 10. 03. 2006

Cache memories are used to boost the performance of computer memory systems. While the performance benefit of caches is indeed substantial, the use of caches makes the calculation of the run times of code very difficult. The goal of this work is therefore to conceive a new type of hierarchical memory system, that allows for both, a high performance of program execution and a good predictability of code timing.


Limitations on the Analyzability of Real-Time Systems

CPS: Privatdoz. Dipl.-Ing. Dr.techn. Raimund KIRNER, 08. 03. 2006

To operate real-time sytems in a safe way, it is required to know the maximum execution time of the program code. However, there are problems to reason about the program behavior in general (c.f., the Halting Problem).

It is the goal of this work to analyze the problem from the other side, i.e., by analyzing what code structures are predictable. For this one has to also look on program analysis methods to reason about what properties can be derived by such an analysis. It is the goal of this work to find restrictions on the program structures, such that the execution time analysis becomes feasible.