Dr. Matteo Corti
![Dr. Matteo Corti](/de/die-eth-zuerich/organisation/abteilungen/informatikdienste/personen/person-detail.person_image.jpeg?persid=NTg5MDc=)
Dr. Matteo Corti
Stellvertretender Leiter ID Applications
Zusätzliche Informationen
I was born in Ticino (the southern part of Switzerland where people speak Italian) in 1974. I lived there until 1993 when I moved to Zürich to study computer science at the Swiss Federal Institute of Technology
After graduation I joined the Laboratory for Software Technology under the supervision of Prof. Thomas Gross to work in the field of compiler construction. I defended my thesis Approximating the Worst-Case Execution Time of Soft Real-Time Applications in March 2005.
After working for three month as as a compiler engineer at Freescale Semiconductor in Schlieren, Zürich, Switzerland I joined in November 2005 the Information and Communication Services of the ETH Zürich.
From May 2008 to May 2013 I was the head of the Identity/Access Management & eServices group of the Information and Communication Services of the ETH Zurich.
From June 2013 to December 2021 I was the head of the ITS User Services (ID Basisdienste).
From January 2022 I am the Operation Manager of the new Section ID Applications.
vertical_align_bottomCV PDFPublikationen
- Approximating the worst-case execution of soft real-time applicationsMatteo CortiDoctoral Thesis, Zürich, ETH Zürich, 2005.
- Approximation of the worst-case execution time using structural analysisMatteo Corti and Thomas Gross4th ACM International Conference on Embedded Software (EMSOFT 2004), Pisa, Italy, pp.269-277, New York, NY: Association for Computing Machinery, September 27-29, 2004.
We present a technique to approximate the worst-case execution time that combines structural analysis with a loop-bounding algorithm based on local induction variable analysis. Structural analysis is an attractive foundation for several reasons: it delivers better bounds on the number of executions for each basic block than previous approaches, its complexity is well understood, and it allows the compiler to easily work on Java bytecode without requiring access to the original program source. There are two major steps. We first compute (min, max) bounds on the number of iterations for each loop. Then we use precise structural information to propagate these bounds to the whole control-flow graph and compute a bound for each basic block. Such a fine-grained result eases the identification of infeasible paths and improves the approximation of the worst-case execution time of a function or method. This analysis was successfully implemented in an ahead-of-time Java bytecode to native compiler and produces input for a worst-case execution time estimator. We describe the effectiveness in reducing the worst-case execution time for a number of programs from small kernels and soft-real-time applications.
- Instruction Duration Estimation by Partial Trace EvaluationMatteo Corti and Thomas GrossWork in Progress (WIP) Session of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS 2004), Toronto, Canada Zurich: ETH Zurich, May 25-28, 2004.
Hard and soft real time systems require, for each process, the worst-case execution time (WCET), which is needed by the scheduler’s admission tests and subsequently limits a task’s execution time during operation. A worst-case execution time analysis is usually performed in two distinct steps: first the program is analyzed to extract semantic information and determine maximal bounds on the number of iterations for each basic block. In a second step the duration of the different program’s instructions is computed with respect to the used hardware platform. Modern systems with preemption and modern architectures with non-constant instruction duration (due to pipelining, branch prediction and different level of caches) hinder a fast and precise compu tation of a program’s WCET. We present a technique to approximate the instruction duration on modern processors using precise block bounds. Instead of simulating the CPU behavior on all the possible paths we apply the principle of locality limiting the effects of a given instruction to a restricted time allowing us to analyze large applications in linear time.
- Approximation of Worst-Case Execution Time for Preemptive Multitasking SystemsMatteo Corti, Roberto Brega and Thomas GrossACM SIGPLAN Workshop on Languages, Compilers, and Tools for Embedded Systems (LCTES 2000), Vancouver, Canada, pp.178-198, Berlin; Heidelberg: Springer, 18-Jun-00.
- A Real-Time Profiler/Analyser for XOberon PPCMatteo CortiMaster Thesis, Zurich, ETH Zurich, 1998.