Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on source-level timing schema. Computer, 24(5):48--57, 1991.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....arithmetic inequalities. Preliminary experimental results confirm its effectiveness. 1 Introduction False path analysis is an activity with application in a variety of computer science and engineering domains like for instance high level synthesis [1] 2] worst case execution time estimation [4], 5] 6] and software testing [8] Path based scheduling proposed in [1] considers all execution instances (control paths) The scheduling results can be further ameliorated by introducing the false path analysis technique described in [2] Identification and elimination of false paths leads in ....

....path analysis to obtain high quality results. Another area where false path analysis can be used is Worst Case Execution Time (WCET) estimation. Identification and elimination of false paths is necessary in order to limit the pessimism and makes the estimated lower and upper bounds tighter. In [4], 5] 6] lack of tools led in adapting a manual and thus unsafe approach. In this paper we propose an automatic approach for the identification of false paths. It is based on a special control flow graph representation connected to a hierarchical BDD based, program control representation which ....

Chang Yun Park, Allan C. Shaw, "Experiments with a Program Timing Tool Based on Source-Level Timing Schema", IEEE Computer, pp. 48-57, May 1991

....end having tools to calculate safe and tight Worst Case Execution Time (WCET) bounds can be very valuable. Nevertheless vis vis the many different factors influencing the execution time, this is a quite complicated problem and even more difficult when treated at a high abstraction level. In [1] [2] an approach at the source code level is proposed with the undeniable argument that temporal discrepancies can be traced back to the source code and thus be more effectively treated by the programmer. Also, processor modeling is used to further ameliorate the results and a machine code prediction ....

.... WCET bounds can be computed, are identified and a similar approach is proposed [4] Finally in [5] ILP is used for implicit path enumeration in order to limit the algorithmic complexity and a microarchitecture modeling is used to account for processor features (pipeline, instruction cache) In [2] [3] 5] a lot of pessimism is attributed to the fact that many paths that are infeasible are not excluded from the computations. To remedy this, user annotations to the source code are used. Inevitably since the human factor intervenes, there is no guarantee that these annotations are always ....

[Article contains additional citation context not shown here]

Chang Yun Park, Allan C. Shaw, "Experiments with a Program Timing Tool Based on Source-Level Timing Schema", IEEE Computer, pp. 48-57, May 1991.

....analysis has been studied with an increasing intensity by a number of research groups around the world. The vast majority of existing results are focused on some particular subproblem of WCET analysis, e.g. semantical analysis to determine the possible set of worst case paths [CBW94, EG97, HSRW98, PS90, PS95] or modeling of architectural features such as pipelines and caches [FMW97, HAM 99, LMW96, LBJ 95, LS98, OS97] The advances in WCET analysis, together with the demand for WCET estimates resulting from the industrial deployment of real time scheduling techniques, makes it both ....

.... [FMW97] loops and recursive functions are split into their rst and other iterations, leading to four di erent types of contexts (loop rst, loop other, function call, and recursive function call) Alternatively, the context tree could store information on the form of a timing schema [LBJ 95, PS90, PK89] where the nodes correspond to loops and conditional statements. Given a reasonable de nition of contexts, the context tree is much smaller than a complete unrolling of the execution of the program. Using one node (a loop context) to represent all iterations of a loop, for example, is much ....

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on a source-level timing schema. In Proc. 11 th IEEE Real-Time Systems Symposium (RTSS'90), pages 72-81, December 1990.

....worse case execution time (WCET) of each program to be known in advance. This knowledge enables the designers to analyze the schedulability of each task of the system [4, 8, 9] For this reason, the problem of bounding the WCET of a program has received a great deal of attention in recent years [2, 5, 11, 15]. This paper addresses the problem of how to bound the WCET of a program when it executes concurrently with a cycle stealing DMA I O operation. A DMA controller (DMAC) transfers data between the main memory and I O devices with minimal CPU involvement. A DMAC may operate either in burst mode or in ....

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on source-level timing schema. IEEE Computer, pages 48--57, May 1991.

....of this method. We present our experimental results in Section 6. Finally, Section 7 concludes the paper and discusses future work. 2 Related Work All previous studies on bounding WCET of programs assume that the iteration count of each loop structure in the program being analyzed is bounded [1, 2, 5, 11,14 16]. We also make this assumption here. Both methods described in this paper use the integer linear programming formulation developed by Li and Malik [5] When a program executes on a simple architecture, the execution time c i of a basic block B i (i.e. a straight line sequence of instructions) is ....

....a machine, Mueller, Whalley, and Harmon [12,13] used control flow information to identify potential cache conflicts in a direct mapped instruction cache and to estimate the worst case cache performance in a non preemptive environment. Lim et al. 7] extended the method developed by Park and Shaw [14] to account for the effect of caching and pipelining. Li, Malik, and Wolfe [6] extended their implicit path enumeration method [5] to bound the WCETs of programs on direct mapped instruction cache architectures. This method partitions each basic block into l blocks. An l block is a sequence of ....

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on sourcelevel timing schema. In Proceedings of Real-Time Systems Symposium, Orlando, Florida, March 1990. IEEE.

....specification 2 of the code in Figure 2. The time bounds of the code regions are specified using special computation events embedded in this specification; in a real timing analysis tool, these durations would be derived from the sequential code comprising these regions using techniques like [23]. The automata for the GIL formulas were constructed by hand using a set of reduction rules and the tableau method of [6] These automata are fed to HyTech, which takes their product and computes the set of reachable states. The performance of HyTech (version 1.04) on the analyses described above ....

Chang Yun Park and Alan C. Shaw, "Experiments with a program timing tool based on source-level timing schema," IEEE Computer, pp. 48--57, May 1991.

....specification 2 of the code in Figure 2. The time bounds of the code regions are specified using special computation events embedded in this specification; in a real timing analysis tool, these durations would be derived from the sequential code comprising these regions using techniques like [23]. The automata for the GIL formulas are constructed using a set of reduction rules and the tableau method of [6] These automata are fed to HyTech, which takes their product and computes the set of reachable states. The performance of HyTech (version 1.04) on the analyses described above is given ....

Chang Yun Park and Alan C. Shaw, "Experiments with a program timing tool based on source-level timing schema," IEEE Computer, pp. 48--57, May 1991.

....Mok and his students [2, 4, 29] analyzed the execution times of assembly language programs generated from the compilation of annotated C programs. They used a graph method to find the worst case execution path of a program. The WCET of the program is the execution time of this path. Park and Shaw [36, 37] applied a similar method to source level programs written in a subset of C. Their method is based on the notion of timing schema presented in Shaw [41] Niehaus [33] developed a semanticspreserving transformation for concurrent programming language constructs such as critical sections and ....

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on source-level timing schema. IEEE Computer, pages 48--57, May 1991.

....of all execution paths. The number of the execution paths of a program cannot be bounded unless the iteration count of each loop structure is bounded. All previous studies on bounding WCETs of programs assume that the iteration count of each loop structure in the program being analyzed is bounded [17, 21, 29, 36, 39, 42]. We also make this assumption. There are several approaches that use loop bound information only. Mok and his students [2, 4, 29] analyzed the execution times of assembly language programs generated from the compilation of annotated C programs. They used a graph method to find the worst case ....

....Mok and his students [2, 4, 29] analyzed the execution times of assembly language programs generated from the compilation of annotated C programs. They used a graph method to find the worst case execution path of a program. The WCET of the program is the execution time of this path. Park and Shaw [36, 37] applied a similar method to source level programs written in a subset of C. Their method is based on the notion of timing schema presented in Shaw [41] Niehaus [33] developed a semanticspreserving transformation for concurrent programming language constructs such as critical sections and ....

[Article contains additional citation context not shown here]

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on sourcelevel timing schema. In Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, March 1990.

....of programs has received a great deal of attention in recent years. Mok et al. 3] developed a graphical tool to analyze the timing behavior of assembly language programs and to bound their WCET. This tool requires that the maximum iteration number of each loop structure be known. Park and Shaw [6, 7] developed a similar method for source level programs. Their dynamic path analysis method eliminates infeasible execution paths and thus tightens the prediction of the WCET. Pusher and Koza [8] introduced several new language constructs with which programmers can describe the timing behavior of ....

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on source-level timing schema. IEEE Computer, pages 48--57, May 1991.

....nonpreemptive environment. Zhang and Burns and Nicholson [16] presented a mathematical model of a two stage pipelined processor. They developed a method based on this model to calculate the WCET of a program executed on this processor. Hur et al. 3] extended the method developed by Park and Shaw [12] to analyze the effect of instruction caching and pipelining. However, little research has been done in bounding the WCET of an I O task. Because of the hardware dependent features of I O tasks, determining their WCETs can be difficult. Traditionally, I O tasks are not allowed in time critical ....

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on sourcelevel timing schema. In Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, March 1990.

....speci cation 2 of the code in Figure 2. The time bounds of the code regions are speci ed using special computation events embedded in this speci cation; in a real timing analysis tool, these durations would be derived from the sequential code comprising these regions using techniques like [23]. The automata for the GIL formulas were constructed by hand using a set of reduction rules and the tableau method of [6] These automata are fed to HyTech, which takes their product and computes the set of reachable states. The performance of HyTech (version 1.04) on the analyses described above ....

Chang Yun Park and Alan C. Shaw, \Experiments with a program timing tool based on source-level timing schema," IEEE Computer, pp. 48-57, May 1991.

....is on the computation of worst case execution times for basic blocks the lowest level and most processor dependent component of timing analysis. The higher level goal, that of computing the worst case execution time of a program given timing information on basic blocks, has been considered in [3]. In this paper we use the methodology reported in [2, 3] augmented with our techniques for computing execution times of basic blocks) to compute worst case execution times of programs. We demonstrate our method by analyzing several small programs and compare the analysis to the measured ....

....basic blocks the lowest level and most processor dependent component of timing analysis. The higher level goal, that of computing the worst case execution time of a program given timing information on basic blocks, has been considered in [3] In this paper we use the methodology reported in [2, 3] (augmented with our techniques for computing execution times of basic blocks) to compute worst case execution times of programs. We demonstrate our method by analyzing several small programs and compare the analysis to the measured performance in a live system. Our work is most closely related to ....

[Article contains additional citation context not shown here]

Chang Yun Park and Alan Shaw, "Experiments With a Program Timing Tool Based on Source-Level Timing Schema," Proceedings Real-Time Systems Symposium, 1990, pp. 72-81.

No context found.

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on source-level timing schema. Computer, 24(5):48--57, 1991.

No context found.

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on source-level timing schema. IEEE Computer, pages 48--57, May 1991.

No context found.

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on sourcelevel timing schema. In Proceedings of Real-Time Systems Symposium, Orlando, Florida, March 1990. IEEE.

No context found.

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on source-level timing schema. IEEE Computer, pages 48--57, May 1991.

No context found.

Chang Yun Park and Alan C. Shaw. Experiments with a program timing tool based on sourcelevel timing schema. In Proceedings of the 11th Real-Time Systems Symposium, Orlando, Florida, March 1990.

No context found.

Chang Yun Park and Alan C. Shaw. Experiments with a Program Timing Tool Based on Source-Level Timing Schema. IEEE Computer, 24(5):48--57, May 1991.

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