点击次数：

论文类型：会议论文

发表时间：2007-05-27

收录刊物：EI、CPCI-S

卷号：4489

期号：PART 3

页面范围：419-+

摘要：The complexity of modern program increases the difficulty to compute the upper bound worst case execution time fast and accurately. A new estimation method for WCET estimation is presented that uses graph theory to solve the program complexity problem. In this method, program basic blocks are represented as vertices in an undirected graph. The resulting graph can be partitioned into connected subgraphs with no edges between them. These subgraphs can in turn be broken into biconnected components. The combinational problem is reduced to finding the maximum energy of these small biconnected components and combining the results to identify the global maximum energy information, that is the worst case execution time. This algorithm will allow to analyze more complex program and can makes the execution time upper bound more accurate.