P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Technische Universitat Wien, Vienna, December 1993. old ID: PUSCHNER:93.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....mode of operation is a subset of the complex pipeline rather than a dedicated processor. Over the past decade, various research groups have investigated static approaches for bounding WCET of realtime programs. Static analysis has been extended from unoptimized programs on simple CISC processors [10,29,30,33] to optimized programs on pipelined RISC processors [12,18,42] and from uncached architectures to architectures with instruction caches [2,14,16,26] and data caches [11,15,17,34] Lundqvist and Stenstrom modified an architectural simulator to determine WCET bounds by considering alternate ....

P. Puschner. Zeitanalyse von Echtzeitprogrammen. Ph.D. Thesis, Dept. of CS, Technical University Vienna, Dec. 1993.

....systems, and was subjected to a major coordinated program of validation via fault injection by several of the groups in PDCS2. In the domain of hard real time systems, for a schedule to be constructed, knowledge is required about maximum execution times. The SOTA work has been done in [161], which includes knowledge about application speci c constraints in the analysis. Tools developed to support the MARS real time OS provide for analysis of worst case execution times. SOTA work has been done on assessing the most e ective policy for scheduling in hard real time systems. The choice ....

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Technical University of Vienna, January 1994.

....Overhead of Static Cache Simulation 12. Related Work Recently, a number of research groups have addressed various issues in the area of predicting the WCET of real time programs. Conventional methods for static analysis have been extended from unoptimized programs on simple CISC processors [28, 26, 10, 27] to optimized programs on pipelined RISC processors [33, 19, 13] and from uncached architectures to instruction caches [4, 17, 15] and data caches [29, 16, 18] The possibility of an extension of Park s timing schema for set associative caches is brie y mentioned in [19] Li et al. 18] have ....

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Dept. of CS, Technical University Vienna, December 1993. 31

....for user selected segments of the program or the entire program. 3 2. Related Work In the past few years, research in the area of predicting the WCET of programs has intensified. Conventional methods for static analysis have been extended from unoptimized programs on simple CISC processors [23, 20, 9, 22] to optimized programs on pipelined RISC processors [30, 17, 11] and from uncached architectures to instruction caches [2, 15, 13] and data caches [24, 14, 16] While there has been some related work in analyzing data caching, there has been no previous work on wrap around fill caches in the ....

....2. sethi hi( B) l4 r[18] HI[ A] # 3. sethi hi( A) l2 r[25] 204; # 4. mov 204, i1 r[26] HI[10200] # 5. sethi hi(10200) i2 r[26] r[26] LO[10200] # 6. add i2, lo(10200) i2 r[20] 4 r[25] # 13. add i1,4, l4 r[20] r[20] r[28] # 14. add l4, i4, l4 r[21] r[25] r[27] # 15. add i1, i3, l5 r[22]=r[25] r[28] # 16. add i1, i4, l6 r[21] r[21] r[22] # 17. sub l5, l6, l5 r[22] r[24] # 18. mov i0, l6 ST=HI[ Rand] LO[ Rand] 68,0; # 21. call Rand,0 R[r[20] r[21] r[8] # 22. st o0, l4 l5] R[r[20] r[8] # 23. st o0, l4] PC=RT; # 32. ret NL=RS[ # 33. restore ....

[Article contains additional citation context not shown here]

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Dept. of CS, Technical University Vienna, December 1993.

.... before shorter paths are pruned until only the longest, worst case path remains [13, 10] In another approach, integer linear programming (ILP) was used to describe constraints on the execution paths to derive the WCET from these constraints, first by Puschner and most recently by Li et al. [18, 19, 12]. Li et al. enhanced this method by a set of finite state automata, one for each cache line with conflicts. The automata simulated the behavior of direct mapped caches and was described by constraints placed at the reference points of program lines in the control flow. The ILP solver would then ....

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Dept. of CS, Technical University Vienna, December 1993.

.... before shorter paths are pruned until only the longest, worst case path remains [14, 11] In another approach, integer linear programming (ILP) was used to describe constraints on the execution paths to derive the WCET from these constraints, first by Puschner and most recently by Li et al. [19, 13]. Li et al. enhanced this method by a set of finite state automata, one for each cache line with conflicts. The automata simulated the behavior of direct mapped caches and was described by constraints placed at the reference points of program lines in the control flow. The ILP solver would then ....

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Dept. of CS, Technical University Vienna, December 1993.

....number of iterations of every loop etc. Puschner Koza, 1989] If tight bounds are to be found, then the available semantic information about the program must be expressed in some form and entered into the worst case execution time analysis tool. An example of such an elaborate tool is given by [Puschner, 1993]. Compiler Analysis: The next problem concerns the determination of the worst case execution time of the basic language constructs of the source language under the assumption that the worst case execution time of the machine language commands are known. For this purpose the code generation ....

Puschner, P. (1993). Zeitanalyse von Echtzeitprogrammen. PhD, Technical University of Vienna.

....but neither has it been formalized nor has an implementation or even results been reported. In another approach, integer linear programming (ILP) was used to describe constraints on the execution paths to derive the WCET from these constraints, first by Puschner and most recently by Li et al. [13, 8]. Li et al. enhanced this method by a set of finite state automata, one for each cache line with conflicts, that simulate the behavior of set associative instruction caches and is described by constraints placed at the reference points of program lines in the control flow. The ILP solver would ....

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Dept. of CS, Technical University Vienna, December 1993.

No context found.

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD thesis, Technische Universitat Wien, Vienna, December 1993. old ID: PUSCHNER:93.

No context found.

P. Puschner. Zeitanalyse von Echtzeitprogrammen. PhD Thesis, Technische Universitat Wien, Vienna, December 1993.

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