Improving the Worst-Case Execution Time Accuracy by Inter-Task Instruction Cache Analysis

Nemer, Fadia; Cassé, Hugues; Sainrat, Pascal; Awada, Ali

doi:10.1109/sies.2007.4297313

Cited by 5 publications

(5 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…• Furthermore, the Cheddar project has also contributed in many research projects related to model driven engineering or real-time system performance analysis (Gilles and Hugues 2008;França et al 2007;Hugues et al 2008;Revest et al 2007;Nemer et al 2007). For example, in the context of the European IST ASSERT project, Hugues et al (2008) have shown that Cheddar can be used in a process in which a real-time system is modelled with AADL and verified by Cheddar or CPN-AMI (Hamez et al 2006 These first encouraging experiments may lead to numerous future works.…”

Section: Discussionmentioning

confidence: 99%

Investigating the usability of real-time scheduling theory with the Cheddar project

Singhoff

Plantec

Dissaux³

et al. 2009

Real-Time Syst

View full text Add to dashboard Cite

This article deals with real-time critical systems modelling and verification. Real-time scheduling theory provides algebraic methods and algorithms in order to make timing constraints verifications of these systems. Nevertheless, many industrial projects do not perform analysis with real-time scheduling theory even if demand for use of this theory is large and the industrial application field is wide (avionics, aerospace, automotive, autonomous systems, . . . ). The Cheddar project investigates why real-time scheduling theory is not used and how its usability can be increased. The project was launched at the University of Brest in

show abstract

Section: Discussionmentioning

confidence: 99%

Investigating the usability of real-time scheduling theory with the Cheddar project

Singhoff

Plantec

Dissaux³

et al. 2009

Real-Time Syst

View full text Add to dashboard Cite

show abstract

“…• An actual formula is being generated (lines [14][15][16][17]. This formula is passed to and processed by a SAT solver (lines [18][19][20], which determines it to be satisfiable. As reported in line 21, the SAT solver spent approximately 4 ms to compute a model.…”

Section: C2mentioning

confidence: 99%

“…In the following, we are going to demonstrate how to apply the test suite generation functionality in CBMC. The program pid.c in Listing 11 is an excerpt from a realtime embedded benchmark PapaBench [19], and implements part of a fly-by-wire autopilot for an Unmanned Aerial Vehicle (UAV). We have adjusted it slightly for our purposes.…”

Section: Test Inputsmentioning

confidence: 99%

CBMC: The C Bounded Model Checker

Kroening¹,

Schrammel²,

Tautschnig³

2023

Preprint

View full text Add to dashboard Cite

The C Bounded Model Checker (CBMC) [9] demonstrates the violation of assertions in C programs, or proves safety of the assertions under a given bound. CBMC implements a bit-precise translation of an input C program, annotated with assertions and with loops unrolled to a given depth, into a formula. If the formula is satisfiable, then an execution leading to a violated assertion exists.CBMC is one of the most successful software verification tools. Its main advantages are its precision, robustness and simplicity. CBMC is shipped as part of several Linux distributions. It has been used by thousands of software developers to verify real-world software, such as the Linux kernel, and powers commercial software analysis and test generation tools. Table 1 gives an overview of CBMC's features.CBMC is also a versatile tool that can be applied to solve many practical program analysis problems such as bug finding, property checking, test input generation, detection of security vulnerabilities, equivalence checking and program synthesis. This chapter will give an introduction into CBMC, including practical examples and pointers to further reading. Moreover, we give insights about the development of CBMC itself, showing how its performance evolved over the last decade.Section 2 gives an overview of the verification approach implemented by CBMC. Section 3 gives a tutorial on how to use CBMC for various verification problems. A strength of CBMC is its proven applicability to real-world C programs; Section 4

show abstract

“…Some WCET estimation techniques pay attention to the effect of private caches on WCETs. In [31], when analyzing the timing behavior of a task, Nemer et al take into account the set of memory blocks that has been stored in the instruction cache (by the execution of previous tasks on the same core) at the beginning of its execution. Similarly, Potop-Butucaru et al [39], assuming task mapping on cores known, jointly perform cache analysis and timing analysis of parallel applications.…”

Section: Related Workmentioning

confidence: 99%

Cache-conscious off-line real-time scheduling for multi-core platforms: algorithms and implementation

2019

View full text Add to dashboard Cite

Most schedulability analysis techniques for multi-core architectures assume a single Worst-Case Execution Time (WCET) per task, which is valid in all execution conditions. This assumption is too pessimistic for parallel applications running on multi-core architectures with local instruction or data caches, for which the WCET of a task depends on the cache contents at the beginning of its execution, itself depending on the tasks that were executed immediately before the task under study. In this paper, we propose two scheduling techniques for multi-core architectures equipped with local instruction and data caches. The two techniques schedule a parallel application modeled as a task graph, and generate a static partitioned nonpreemptive schedule, that takes benefit of cache reuse between pairs of consecutive tasks. We propose an exact method, using an Integer Linear Programming (ILP) formulation, as well as a heuristic method based on list scheduling. The efficiency of the techniques is demonstrated through an implementation of these cache-conscious schedules on a real multi-core hardware: a 16-core cluster of the Kalray MPPA-256, Andey generation. We point out implementation issues that arise when implementing the schedules on this particular platform. In addition, we propose strategies to adapt the schedules to the identified implementation factors. An experimental evaluation reveals that our proposed scheduling methods significantly reduce the length of schedules as compared to cache-agnostic scheduling methods. Furthermore, our experiments show that among the identified implementation factors, shared bus contention has the most impact.

show abstract

Improving the Worst-Case Execution Time Accuracy by Inter-Task Instruction Cache Analysis

Cited by 5 publications

References 9 publications

Investigating the usability of real-time scheduling theory with the Cheddar project

Investigating the usability of real-time scheduling theory with the Cheddar project

CBMC: The C Bounded Model Checker

Cache-conscious off-line real-time scheduling for multi-core platforms: algorithms and implementation

Contact Info

Product

Resources

About