WCET computation
A constraint-based WCET computation framework
... 1. INTRODUCTION OTAWA is a tool dedicated to the analysis of critical real-time systems. The worst case execution time (WCET) computation is one of the crucial analyses it provides. In a previous paper ...
5
From Relevant High-level Properties to WCET Computation Improvement
... In this work, we presented a classification, aiming to simplify identification and extraction (manual or automatic) of the program properties useful for WCET computation. We express these properties in FFX, ...
10
Shared Data Caches Conflicts Reduction for WCET Computation in Multi-Core Architectures.
... This paper presents a WCET computation method for tasks in the context of multi-core architectures with non- inclusive data cache hierarchies. Similarly to [12, 7], we estimate shared data cache related ...
11
Hardware architecture specification and constraint-based WCET computation
... To evaluate the WCET of the basic block, we describe the execution of an instruction path on a processor as a 2 This definition makes sense when instructions terminate in program order, [r] ...
11
Hardware architecture specification and constraint-based WCET computation
... To evaluate the WCET of the basic block, we describe the execution of an instruction path on a processor as a 2 This definition makes sense when instructions terminate in program order, [r] ...
12
OTAWA, a Framework for Experimenting WCET Computations
... From the commercialized domain, we have mainly two tools, Bound-T and aiT. Bound-T [4] is a complete multi-target solution for WCET computation developed by Tidorum Ltd, Finland and supported by the ...
9
A Contribution to Branch Prediction Modeling in WCET Analysis
... the computation of Worst-Case Execution Times relies on static analysis of the code, the challenge is to model with enough safety and accuracy the behaviour of intrisically dynamic ...
7
Validating Static WCET Analysis: A Method and Its Application
... The binary decoder is generated by the the GLISS [13] tool from a description of the target processor’s ISA written in Sim-NML [18]. An ISS (instruction-set simulator) is also generated from the same description. Being ...
11
WCET ANALYSIS OF MULTI-LEVEL SET-ASSOCIATIVE DATA CACHES
... 5. Experimental results 5.1. Experimental setup Cache analysis and WCET estimation. The experiments were conducted on MIPS R2000/R3000 binary code compiled with gcc 4.1 with no optimization and with the default ...
13
Accurate analysis of memory latencies for WCET estimation
... [11]) or extracted automatically from the code [2][5][8][10]; (2) the execution times of sequential parts of code (basic blocks) must be determined taking into account the parameters of the target hardware ...
11
A Framework to Quantify the Overestimations of Static WCET Analysis
... the WCET Several uses of the overestimation metric (U ) – difference between the upper and lower bounds on the WCET – can be envisioned: An obvious application is the qualification of a particular estimated ...
11
Improving WCET Analysis Precision through Automata Product
... The first noticeable fact is that the inclusion of any of the two PPAs described improves the WCET precision. Indeed, with no information about the if-then statements, the path selected by the static analyser for ...
11
Reconciling Compiler Optimizations and WCET Estimation Using Iterative Compilation
... Compilers translate high-level languages into binary code, fit for microprocessors. Modern compilers typically apply tens of optimizations (loop transformations, dead code elimination, factorization of redundant code, ...
14
Model Checking of Cache for WCET Analysis Refinement
... the WCET of a task is unknown and schedulers make use of safe over-approximations given by static WCET ...over-approximation, WCET analysis has to gain information about the underlying hardware ...
5
Assessing Software Abstractions in WCET Analysis of Reactive Programs
... The experiment consists of applying the tools presented in Section 2 without any human intervention. A dedicated website 4 explains how to reproduce it. O TAWA is already an automated tool, but O SIM requires an ...
24
Formal Verification of Loop Bound Estimation for WCET Analysis
... of next observable vertices. Given a vertex n that is not in the slice such that DObs(n) = d, they state that at least one of the successors of n has a distance equal to d − 1; some successors may have a greater ...
24
Community computation
... We also present community coding formulations for P2P media streaming with application level multicast to maximize the sum of the utilities of all the peer nodes, given [r] ...
192
Computation Research
... TOCS has been given additional power and flexibility by the addition of display facilities, capabilities for limited algebraic manipulation, the editing facilities of[r] ...
2
Computation Research
... Because we expected roots near integer values of v, we chose the same method I as before to estimate their value. The resulting sixth-degree polynomial yielded roo[r] ...
2
Computation Research
... Probably the most common application of the method of least squares is the determi- nation of constants in an empirical formula whose form is to be inferred fro[r] ...
3