A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. In Proc. of the ACM SIGPLAN Wrokshop on Language, Compiler and Tool Support for Real-Time Systems, 1994.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....actual execution paths taken through the code (Section 4.4) 4.1 Extraction of Timing Information Before deciding on the locations of the PMHs in the code, prior timing knowledge about an application is needed. Software timing analysis is one way in which this information can be determined. In [16], the compiler estimates the performance of a piece of code in fine grained execution time analysis. Other techniques use static and dynamic path analysis [15] While such techniques could be used to guide the insertion of PMHs, it is beyond the scope of our work. Instead, we rely on program ....

Vrchoticky A. Compilation Support for Fine-Grained Execution time Analysis Workshop on Language, Compiler, and Tool Support for Real-Time Systems 1994.

....goal of the PMH placement algorithm is to ensure that there exits at least one PMH executed during each ISR interval. We assume that we have an estimate for the worst case timing for each branch in the application s code (from pre processing) either through profiling or static dynamic analysis [15, 14]. This timing information is used in the PMH placement algorithms and in conveying the remaining time to the operating system. The PMH placement algorithm traverses the PG and, for each path, it uses a cycle counter ac that is incremented by the worst case cycles of each traversed region of the ....

Vrchoticky A. Compilation Support for Fine-Grained Execution time Analysis Workshopon Language, Compiler, and Tool Support for Real-Time Systems 1994.

.... Park, Shaw 1990, Harmon, Baker, Whalley 1992, Zhang, Burns, Nicholson 1993, Li, Malik, Wolfe 1995] and they built compiler prototypes to translate high level source programs annotated with path information into code that is both executable and analyzable with respect to its WCET [Stoyenko 1987, Vrchoticky 1994] Despite the existence of the necessary research results in all these areas, there exists no commercial compiler on the market that translates both source code and information about possible execution paths during compilation, this way supporting WCET analysis. Real time system programmers must ....

....hardware. Since compilers translate between the mentioned representations of programs and thus have access to both path information and the machine code, the incorporation of WCET analysis into a compiler seems appropriate. Indeed prototype tools for combined compilation and WCET analysis exist [Vrchoticky 1994]. In contrast to these approaches the proposed WCET analysis method separates WCET analysis from compilation. The work on the proposed method is motivated by the following arguments: ffl Off the shelf solutions to combined compilation and WCET analysis do not exist. Also, there is no hope that ....

A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. In Proceedings of the ACM SIGPLAN Workshop on Language, Compiler and Tool Support for Real-Time Systems, Orlando FL, June 1994.

....In Section 5, we describe an initial implementation of a timing analyzer for TMS320C6201 and present the experimental results. The conclusion and future work are given in Section 6. 2. Related Work The effects of compiler optimizations on the WCET analysis have been recently studied by Vrchoticky [15] and Engblom, Ermedahl, and Altenbernd [2] In order to maintain the source level correspondence during the optimization phases, Vrchoticky proposed an extension of a hierarchical program representation called a timing tree. In this approach, as the optimization phases proceed, an initial timing ....

A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. In Proceedings of the ACM SIGPLAN Workshop on Languages, Compilers and Tools for Real-Time Systems, June 1994.

....and how they are builtin his article Compilation Support for Fine Grained Execution Time Analysis . As previously mentioned, the Timing Trees are hierarchical representations of the block structures of procedures. To give a closer look how these Trees might look like, an example taken from [Vrc94] will be presented. Fig. 15 shows the MODULA R code and the timing tree for a procedure gcd (greatest common divisor) In the upper right corner of the non hidden nodes, you can see the line numbers of the corresponding source code statements. You can also see a label providing the corresponding ....

A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. Technical report, Technical University of Vienna, 1994.

No context found.

A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. In Proc. of the ACM SIGPLAN Wrokshop on Language, Compiler and Tool Support for Real-Time Systems, 1994.

No context found.

A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. In In Proceedings of the ACM SIGPLAN Workshop on Language, Compiler and Tool Support for Real-Time Systems, Orlando FL, June 1994.

No context found.

A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. In Proceedings of the ACM SIGPLAN Workshop on Language, Compiler and Tool Support for Real-Time Systems, Orlando FL, June 1994. 10

No context found.

A. Vrchoticky. Compilation Support for Fine-Grained Execution Time Analysis. In Proceedings of the ACM SIGPLAN Workshop on Language, Compiler, and Tool Support for Real-Time Systems, Orlando, Florida, June 1994.

No context found.

Vrchoticky, A. Compilation Support for Fine-Grained Execution Time Analysis. in ACM Workshop on Language, Compiler, and Tool Support for Real-Time Systems (in conjuntion with the 1994 ACM SIGPLAN PLDI conference). 1994. Walt Disney World, Florida: University of Maryland.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC