Partial Program Admission by Path Enumeration
نویسندگان
چکیده
Real-time systems on non-preemptive platforms require a means of bounding the execution time of programs for admission purposes. Worst-Case Execution Time (WCET) is most commonly used to bound program execution time. While bounding a program’s WCET statically is possible, computing its true WCET is difficult without significant semantic knowledge. We present an algorithm for partial program admission, suited for non-preemptive platforms, using dynamic programming to perform explicit enumeration of program paths. Paths – possible or not – are bounded by the available execution time and admitted on a path-by-path basis without requiring semantic knowledge of the program beyond its Control Flow Graph (CFG).
منابع مشابه
Exploiting Branch Constraints without Exhaustive Path Enumeration
Statically estimating the worst case execution time (WCET) of a program is important for real-time software. This is difficult even in the programming language level due to the inherent difficulty in detecting and exploiting infeasible paths in a program’s control flow graph. In this paper, we propose an efficient method to exploit infeasible path information for WCET estimation of a loop witho...
متن کاملThe Auspicious Couple: Symbolic Execution and WCET Analysis
We have recently shown that symbolic execution together with the implicit path enumeration technique can successfully be applied in the Worst-Case Execution Time (WCET) analysis of programs. Symbolic execution offers a precise framework for program analysis and tracks complex program properties by analyzing single program paths in isolation. This path-wise program exploration of symbolic execut...
متن کامل(−1)–enumeration of Plane Partitions with Complementation Symmetry
We compute the weighted enumeration of plane partitions contained in a given box with complementation symmetry where adding one half of an orbit of cubes and removing the other half of the orbit changes the weight by −1 as proposed by Kuperberg in [7, pp.25/26]. We use nonintersecting lattice path families to accomplish this for transpose–complementary, cyclically symmetric transpose–complement...
متن کاملOn Enumeration of Near to Best Solutions in Discrete and Dynamic Programming
[6] Lawler, E. A procedure for computing the K best solutions to discrete optimization problems and its application to the shortest path problem, Manag.
متن کاملHistory-based Schemes and Implicit Path Enumeration
The Implicit Path Enumeration Technique is often used to compute the WCET of control-intensive programs. This method does not consider execution paths as ordered sequences of basic blocks but instead as sets of basic blocks with their respective execution counts. This way of describing an execution path is adequate to compute its execution time, provided that safe individual WCETs for the block...
متن کامل