Matteo Corti


Last Name

Corti

First Name

Matteo

ORCID

0000-0002-1746-1108

Organisational unit

06059 - Hosting and Application Management / Hosting and Application Management

Filters

1998 - 199912000 - 20054
Reset filters

Search Results

Publications 1 - 5 of 5
  • Instruction Duration Estimation by Partial Trace Evaluation
    Item type: Conference Paper
    Corti, Matteo; Gross, Thomas (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 the worst-case execution time using structural analysis
    Item type: Conference Paper
    Corti, Matteo; Gross, Thomas (2004)
    EMSOFT 2004: Proceedings of the 4th ACM International Conference on Embedded Software
    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.
  • Approximation of Worst-Case Execution Time for Preemptive Multitasking Systems
    Item type: Conference Paper
    Corti, Matteo; Brega, Roberto; Gross, Thomas (2001)
    Lecture Notes in Computer Science ~ Languages, compilers, and tools for embedded systems : proceedings
  • Approximating the worst-case execution of soft real-time applications
    Item type: Doctoral Thesis
    Corti, Matteo (2005)
  • A Real-Time Profiler/Analyser for XOberon PPC
    Item type: Master Thesis
    Corti, Matteo (1998)
Publications 1 - 5 of 5