Academia.eduAcademia.edu

Worst-Case Execution Time Analysis

description1,028 papers
group151 followers
lightbulbAbout this topic
Worst-Case Execution Time (WCET) Analysis is a method used in real-time systems to determine the maximum time a task or program segment may take to execute under the most unfavorable conditions. It is crucial for ensuring that time constraints are met in safety-critical applications.
lightbulbAbout this topic
Worst-Case Execution Time (WCET) Analysis is a method used in real-time systems to determine the maximum time a task or program segment may take to execute under the most unfavorable conditions. It is crucial for ensuring that time constraints are met in safety-critical applications.

Key research themes

1. How can execution trace and model-based analyses enhance understanding and prediction of worst-case execution time violations in real-time embedded systems?

Execution trace analysis and model-based timing validation approaches focus on capturing system behavior through runtime or simulated execution traces to diagnose and predict latency violations or WCET bounds in complex real-time embedded systems. These techniques address challenges in identifying root causes of timing anomalies and improve timing model correctness, critical for safety-critical CPS and real-time applications with stringent temporal requirements.

Key finding: The paper introduces PLAN, a technique that builds a dependency graph from allocation models involving hardware and software components, then analyzes execution traces to classify transactions for their impact on latency... Read more
Key finding: This work applies static analysis using abstract interpretation to predict WCET on complex pipelines and caches of the Motorola ColdFire 5307 processor. It offers a safe upper bound to WCET, significantly tighter than... Read more
Key finding: The paper demonstrates that worst-case instruction execution time does not always correspond to worst-case program execution time in dynamically scheduled processors, revealing timing anomalies where longer individual... Read more
Key finding: The paper presents a framework for jointly deriving and formally validating timing models of software and hardware in cyber-physical systems. It formalizes timing behaviors using TLA+ and Sail languages, links... Read more
Key finding: Proposes an assembly-level path feasibility detection method that incorporates partially-known variable analysis to prune infeasible paths during WCET calculation, reducing overestimation by eliminating dead paths not... Read more

2. How can power-aware cache analysis be integrated into worst-case execution time estimation to achieve energy-efficient real-time systems without compromising timing guarantees?

This cluster addresses the intersection of WCET analysis and energy efficiency by modeling cache utilization at the compiler and analysis levels to identify and shut-off non-useful cache portions. It seeks to optimize cache power consumption while maintaining strict timing constraints through static program analysis, leading to improved energy-aware WCET bounds applicable to embedded systems with limited power budgets.

by Wenlei Bao and 
1 more
Key finding: Introduces a power-aware WCET analysis framework (PWCET) that uses compiler-based analysis to calculate the useful cache sizes, enabling the identification of non-useful cache that can be turned off to save power without... Read more
Key finding: The paper presents a technique combining static source code analysis with dynamic runtime performance monitoring via hardware performance counters to approximate WCET in systems with preemptive multitasking and dynamic module... Read more

3. How can multi-threading and synchronization constructs be modeled to reduce overly pessimistic worst-case execution time estimates in real-time systems?

This theme examines the impact of multi-threading and critical section contention on WCET overestimations. By carefully modeling resource contention and the sequential execution proportions within loops, alternative WCET calculation models reduce pessimism, leading to tighter WCET bounds. Addressing multi-thread interference effects allows more accurate and efficient resource and energy management in real-time and embedded software analysis.

Key finding: Proposes a refined WCET calculation model accounting for the proportional execution times of computation versus critical sections in multi-threaded loops, alleviating the overestimation caused when worst-case blocking... Read more

All papers in Worst-Case Execution Time Analysis

The use of metaheuristic search techniques for the automatic generation of test data has been a burgeoning interest for many researchers in recent years. Previous attempts to automate the test generation process have been limited, having... more
We consider the following scheduling problem. There are m parallel machines and n independent .jobs. Each job is to be assigned to one of the machines. The processing of .job j on machine i requires time Pip The objective is to lind a... more
In a little over four decades, the Indian Space Program has carved a niche for itself with the unique application driven program oriented towards National development. The end-to-end capability approach of the space projects in the... more
We consider the following scheduling problem. There are m parallel machines and n independent .jobs. Each job is to be assigned to one of the machines. The processing of .job j on machine i requires time Pip The objective is to lind a... more
Hard real-time avionics systems like flight control software are expected to always react in time. Consequently, it is essential for the timing validation of the software that the worst-case execution time (WCET) of all tasks on a given... more
An approach of the worst case analysis of the analog electronic circuits based on the circuit description in parameter space is proposed. A DC, AC or transient worst-case analysis can be performed only testing the circuit for the vertices... more
The Galois (or concept) lattice produced from a binary relation has been proved useful for many applications. Building the Galois lattice can be considered as a conceptual clustering method since it results in a concept hierarchy. This... more
In previous works, the authors have developed the Model of Manufactured Part (MMP) [1], a method for modeling the different geometrical deviation impacts on the part produced (error stack-up) in a multi-stage machining process. They also... more
Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component for statically deriving... more
In this paper we present a task model that makes an efficient utilization of the slack available in hard real time systems that support Dynamic Voltage Scheduling. Slack-Stealing methods proposed in hard real-time literature consider that... more
In this paper we present an extension to current schedulability analysis techniques for periodic tasks with offsets, scheduled under a preemptive fixed priority scheduler. Previous techniques allowed only static offsets restricted to... more
by Frank Werner and 
1 more
This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup and removal times. The processing of each job includes at most two operations... more
An approach of the worst case analysis of the analog electronic circuits based on the circuit description in parameter space is proposed. A DC, AC or transient worst-case analysis can be performed only testing the circuit for the vertices... more
One popular hardware device for performing fast routing lookups and packet classification is a ternary content-addressable memory (TCAM). A TCAM searches the header of the incoming packet against all entries in the forwarding table or the... more
by Frank Werner and 
1 more
This article addresses the job-shop problem of minimizing the schedule length (makespan) for processing n jobs on two machines with sequence-dependent setup times and removal times. The processing of each job includes at most two... more
The resource allocation problem seeks to find an optimal allocation of a limited amount of resource to a number of activities for optimizing the objective under the resource constraint. Most existing methods use mathematical programming... more
In this paper, we propose a de®nition for the Generalized Minimal Spanning Tree (GMST) of a graph. The GMST requires spanning at least one node out of every set of disjoint nodes (node partition) in a graph. The analysis of the GMST... more
Hard real-time embedded systems employ high-capacity memories such as Dynamic RAMs (DRAMs) to cope with increasing data and code sizes of modern designs. However, memory controller design has so far largely focused on improving... more
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesimal changes to its outputs. The analysis can be used to... more
As software profiling is conducted to determine which section of program demand high processing computation in monocular SLAM inverse depth estimation, matrix multiplication is identified to be one of the most time consuming process. The... more
The Galois (or concept) lattice produced from a binary relation has been proved useful for many applications. Building the Galois lattice can be considered as a conceptual clustering method since it results in a concept hierarchy. This... more
Caches have become increasingly important with the widening gap between main memory and processor speeds. However, they are a source of unpredictability due to their characteristics, resulting in programs behaving in a different way than... more
The Real-time Specification for Java and the upcoming, and more restricted, Safety Critical Java standard have been designed to allow programmers to avoid pauses caused by automatic memory management algorithms. Dynamic memory is... more
In a little over four decades, the Indian Space Program has carved a niche for itself with the unique application driven program oriented towards National development. The end-to-end capability approach of the space projects in the... more
In this paper we present synchronisation techniques for hard real-time (HRT) capable execution of parallelised applications on embedded multi-core processors. We show how commonly used software synchronisation techniques can be... more
In preemptive real-time systems, scheduling analyses need-in addition to the worst-case execution time-the context-switch cost. In case of preemption, the preempted and the preempting task may interfere on the cache memory. This... more
In this paper, we focus on applications with quantitative QoS (Quality of Service) requirements in their end-toend response time. Two types of quantitative QoS garantees can be delivered by a network: deterministic and probabilistic. The... more
The nonlinear resource allocation problem addresses the important issue which seeks to find an optimal allocation of a limited amount of resource to a number of tasks for optimizing a nonlinear objective over the given resource... more
We analyze the worst-case ratio of a natural heuristic for the bin packing problem, which proceeds by ÿlling one bin at a time, each as much as possible. We show a nontrivial upper bound on this ratio of 4 3 + ln 4 3 = 1:6210 : : :,... more
Methods for Worst-Case Execution Time (WCET) analysis have been known for some time, and recently commercial tools have emerged. However, the technique has so far not been much used to analyse real production codes. Here, we present a... more
With the development of grid computing, Data Grid, as an important branch of Grid Computing focuses on supporting an efficient management mechanism for controlled sharing and large amounts of distributed data. Data intensive jobs are one... more
This paper presents and illustrates a reliability analysis method developed with a focus on Controller-Area-Network-based automotive systems. The method considers the effect of faults on schedulability analysis and its impact on the... more
Knowledge about the Worst-Case Execution-Time (WCET) is of primordial importance in the validation of real-time systems. A WCET estimation must be safe and tight. Tightness in WCET estimation is highly desirable for an efficient... more
The automation of Power Grids by means of Supervisory Control and Data Acquisition (SCADA) systems has led to an improvement of Power Grid operations and functionalities but also to pervasive cyber interdependencies between Power Grids... more
In this paper we consider the problem of designing controllers for linear plants to be implemented in embedded platforms under stringent real-time constraints. These include preemptive scheduling schemes, under which the maximum execution... more
Starting at the 65-nm node, stress engineering to improve the performance of transistors has been a major industry focus. An intrinsic stress source-shallow trench isolation (STI)-has not been fully utilized up to now for circuit... more
Many real-time (RT) embedded systems can benefit from a memory hierarchy to bridge the processor/memory speed gap. These RT embedded systems usually utilize a cacheless architecture to avoid the time variability which complicates the... more
Worst Case Execution Time (WCET) computation is crucial to the overall timing analysis of real-time embedded systems. Facing the ever increasing complexity of such systems, techniques dedicated to WCET analysis can take advantage of... more
Hardware transactional memory is a promising synchronization technology for chip-multiprocessors. It simplifies programming of concurrent applications and allows for higher concurrency than lock based synchronization. Standard... more
In this paper we present a task model that makes an efficient utilization of the slack available in hard real time systems that support Dynamic Voltage Scheduling. Slack-Stealing methods proposed in hard real-time literature consider that... more
Caches are a source of unpredictability since it is very diffic ult to predict if a memory access results in a cache hit or miss. In systems running multiple tasks stee red by a preempting scheduler, it is even impossible to determine the... more
Cache memories are commonly avoided in real-time systems because of their unpredictable behavior. Recently, some research has been done to obtain tighter bounds on the worst case execution time (WCET) of cached programs. These techniques... more
This paper deals with single-hidden-layer feedforward nets, studying various aspects of classification power and interpolation capability. In particular, a worst-case analysis shows that direct input to output connections in threshold... more
High-performance microprocessors, e.g., multithreaded and multicore processors, are being implemented in embedded real-time systems because of the increasing computational requirements. These complex microprocessors have two major... more
This paper addresses the forbidden-state problem of general marked graphs with uncontrollable transitions. The models need not to be safe nor cyclic. Control requirements are expressed as the conjunction of general mutual exclusion... more
This paper addresses the forbidden-state problem of general marked graphs with uncontrollable transitions. The models need not to be safe nor cyclic. Control requirements are expressed as the conjunction of general mutual exclusion... more
The determination of upper bounds on execution times, commonly called Worst-Case Execution Times (WCETs), is a necessary step in the development and validation process for hard real-time systems. This problem is hard if the underlying... more
Download research papers for free!