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 without resorting to exhaustive path enumeration. The efficiency of our approach is demonstrated with a real-life control-intensive program.
منابع مشابه
An Effective Branch-and-Bound Algorithm for Convex Quadratic Integer Programming
We present a branch-and-bound algorithm for minimizing a convex quadratic objective function over integer variables subject to convex constraints. In a given node of the enumeration tree, corresponding to the fixing of a subset of the variables, a lower bound is given by the continuous minimum of the restricted objective function. We improve this bound by exploiting the integrality of the varia...
متن کامل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...
متن کاملBalanced Multi-process Parallel Algorithm for Chemical Compound Inference with Given Path Frequencies
To enumerate chemical compounds with given path frequencies is a fundamental procedure in Chemoand Bio-informatics. The applications include structure determination, novel molecular development, etc. The problem complexity has been proven as NP-hard. Many methods have been proposed to solve this problem. However, most of them are heuristic algorithms. Fujiwara et al. propose a sequential branch...
متن کاملSystematic conformational search with constraint satisfaction
The Problem: The goal of this project is to systematically enumerate feasible conformations (three-dimensional configurations) of a flexible molecule, subject to a given set of constraints on the distances between atoms and on the torsional angles of rotatable bonds. Without any constraints, the conformation space of a flexible molecule is astronomical (exponential in the number of degrees of f...
متن کاملEfficient enumeration of monocyclic chemical graphs with given path frequencies
BACKGROUND The enumeration of chemical graphs (molecular graphs) satisfying given constraints is one of the fundamental problems in chemoinformatics and bioinformatics because it leads to a variety of useful applications including structure determination and development of novel chemical compounds. RESULTS We consider the problem of enumerating chemical graphs with monocyclic structure (a gra...
متن کامل