Marion G. Harmon, T. P. Baker, and David B. Whalley. A retargetable technique for predicting execution time of code segments. Journal of Real-Time Systems, pages 159--182, July 1994.  Home/Search   Document Details and Download   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 ....

M. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. Real-Time Systems Symp., Dec. 1992.

....real time systems relies on #######knowledge of the worst case execution time (WCET) of hard real time tasks to check if the deadline of a task can be met. A safe upper bound on the WCET of a task can be provided through static analysis, dynamic analysis or even a combination of both techniques [34, 30, 15, 41, 24, 16, 1, 22, 23, 9, 29, 38]. Regardless of the methods utilized to obtain the WCET of tasks, experiments show a wide variation between longest and shortest execution times for manyembedded applications. In [38] execution times of real world embedded tasks vary by as much as 87 relative to their measured WCET. Speci ....

M. Harmon, T. P.Baker, and D. B. Whalley.A retargetable technique for predicting execution time. In #### ######### ####### #########, pages 68-77, December 1992.

....AREAS. dedicated real time OS general purpose OS application hardware compiler fixed dynamic hardware interval integrated directed Quality Availability design compile design run run run run run design time through static analysis, profiling, or direct measurements [18], 19] When all details of the workload are known and the schedulability is verified at design time we classify such systems under fixed real time . When details of the workload, such as WCET or even the tasks themselves, are only known at run time we classify such systems under dynamic ....

Marion G. Harmon, Theodore P. Baker, and David B. Whalley, "A retargetable technique for predicting execution time," in IEEE Real-Time Systems Symposium, 1992, pp. 68--77.

.... also particularly desirable to be able to do so for high level languages [37, 30] Since Shaw proposed timing schema for analyzing system running time based on high level languages [37] a number of people have extended it for analysis in the presence of compiler optimizations [30, 10] pipelining [17, 24], cache memory [3, 24, 12] etc. However, there is still a serious limitation of the timing schema, even in the absence of lowlevel complications. This is the inability to provide loop bounds, recursion depths, or execution paths automatically and accurately for the analysis [29, 2] For example, ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. In Proceedings of the 11th IEEE Real-Time Systems Symposium, pages 68--77. IEEE CS Press, Los Alamitos, Calif., Dec. 1992.

....experimentally unachievable measurement. Yet static analysis is developing at a rapid pace, and tools are being produced which can yield tighter results. The technique reported in [29] is based on a simple source level timing schema, and it is fairly straightforward to implement in a tool. In [13] another approach for more accurate timing was pro posed; the resulting tool was able to analyze micro instruction streams using machine description rules, and thus it was retargetable to various architectures. On the other hand, neither approach dresses the problem of predicting ....

M. Harmon, T. Baker, and D. Whalley. A retargetable technique for predicting execution time. In Proceedings of IEEE Real-Time Systems Symposium, pages 68 77. IEEE Computer Society Press, December 1992.

.... in put(P, m) and input(Q, x) as well as a 20ms deadline between the events generated by input(P, m) and output(R, y) Meanwhile, the bracketed 20ms denotes that the un observable statement S requires a maximum of 20ms to execute, a bound obtained by a timing analysis tool (e.g. [11, 18, 24, 25, 29]) Consequently, the program possesses an inherent conflict, since S requires 20ms to execute while it is only allowed 10ms. We address this problem by an approach we call feasible code synthesis. In our example this would involve decomposing S and, if possible, moving instructions not dependent ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. In Proceedings IEEE Real-Time Systems Symposium, pages 68 77. IEEE Computer Society Press, December 1992.

....unknown until admission control time. It resulted in innovative planning based scheduling algorithms that provide online guarantees for dynamically arriving tasks [18, 25, 28, 33, 37, 43, 44] Task execution times where assumed to be known, e.g. using pre run time code analysis techniques such as [15, 38, 42]. The results of the analysis depend on specific platform hardware and operating system. The analysis, therefore, needed to be repeated for each target platform. With the advent of a new category of soft real time applications such as multimedia, real time databases, and e commerce, the concept ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time of code segments. Journal of Real-Time Systems, 7(2):159--182, September 1994.

....the WCET. This has always to be done in a way that does not underestimate at all, but reduces overestimations to the essential necessary part, as in this case. Most work in the field of WCET either focuses on the high (i.e. programming code) level [2, 6, 8] or on the low (i.e. hardware) level [9, 13]. High level methods usually try to predict timing with respect to mutually depending program parts that could exclude each other, in a given program to be analysed. The approach in this paper can be classified to the same level, but in contrast to these methods, the behaviour of the program (the ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A Retargetable Technique for Predicting Execution Time of Code Segments. Journal of Real-Time Systems, 7(2):159--182, 1994.

....during WCET analysis. Especially, when using variable bitrates during encoding (for achieving the highest possible compression) the decoding times of the pictures in these streams have large differences, thus may result in enormous overestimations when using simple WCET techniques like [1, 8, 10]. In this document we show methods for two scenarios (video on demand and live video) that do not limit the streams but try to reduce the gap between worst case and the actual execution times. To the authors knowledge this is the first paper addressing WCET analysis of MPEG decoding . In ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A Retargetable Technique for Predicting Execution Time of Code Segments. Journal of Real-Time Systems, 7(2):159--182, 1994.

....Section 6 gives concluding remarks. 2 Basic Assumptions and Problem Description The following task model is assumed: ffl A set V of strictly periodic tasks. Each task p 2 V has a period length, T p a worst case execution time, C p (to be estimated by timing analysis programs (e.g. [3, 9, 21, 24, 40, 47]) 2 In order to not get confused with the notions of allocation and scheduling, the term List Processing was preferred in this article. The Slack Method: A New Method for Static Allocation of Hard Real Time Tasks 3 a relative deadline (the hard real time condition) D p , before which p ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A Retargetable Technique for Predicting Execution Time of Code Segments. Journal of Real-Time Systems, 7(2):159--182, 1994.

....of the overall problem into sub problems, in order to handle complexity. In appendix A.1 it is shown how client server systems can be handled in the context of this thesis. Most of the recent work in the field of static timing analysis of real time programs focusses on the impact of pipelining [91, 44] and caching [67, 65] strategies. Though these are also imported problems, the new approach presented in this chapter emphasises the false path problem. However, the effects of pipelines and caches are included based on the computation times of the basic blocks, which is outlined in Subsection ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A Retargetable Technique for Predicting Execution Time of Code Segments. Journal of RealTime Systems, 7(x):159--182, 1994.

.... is particularly desirable to be able to do so for high level languages [46, 37, 38] For analyzing system running time, since Shaw proposed timing schema for high level languages [46] a number of people have extended it for analysis in the presence of compiler optimizations [37, 12] pipelining [20, 28], cache memory [4, 28, 14] etc. However, there remains an obvious and serious limitation of the timing schema, even in the absence of low level complications. This is the inability to provide loop bounds, recursion depths, or execution paths automatically and accurately for the analysis [36, 3] ....

M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. In Proceedings of the 11th IEEE Real-Time Systems Symposium, pages 68-77. IEEE CS Press, Los Alamitos, Calif., Dec. 1992.

....where the exact machine instructions and virtual addresses of the data references are unknown. In the past few years, research in the static analysis of WCET of programs has increased. Conventional methods for static analysis have been extended from unoptimized programs on simple CISC processors [7, 22, 21] to optimized programs on pipelined RISC processors [9, 17, 28] and from uncached architectures to instruction caches [3, 11, 15] However, there has been little previous work on predicting WCET for data caching. Only three previous attempts have been reported. Rawat and Nilsen [23] used a graph ....

....B: Blocks 2, 4, 5 Path A: Blocks 2,3, 5 Paths in the loop: load of s[i] load of c[i] load of k[i] r[8] B[r[17] 24) 24; # 16. ldsb [ l1] o0 r[9] R[r[16] # 17. ld [ l0] o1 r[9] r[9] r[8] # 18. add o1, o0, o1 PC=L17; # 19. ba L17 r[12] r[12] r[9] # 20. add o4, o1, o4 r[8] W[r[7]] 16) 16; # 21. ldsh [ g7] o0 r[12] r[12] r[8] # 22. add o4, o0, o4 Instructions 1 through 11 Instructions 12 through 15 Block 1 Block 2 Block 3 Block 4 Instructions 23 through 28 Instructions 29 through 30 Block 5 Block 6 L17 data line 0 data line 1 data line 2 data line 3 2 3 4 ....

M. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. In IEEE Symposium on Real-Time Systems, pages 68--77, December 1992.

No context found.

Marion G. Harmon, T. P. Baker, and David B. Whalley. A retargetable technique for predicting execution time of code segments. Journal of Real-Time Systems, pages 159--182, July 1994.

No context found.

Marion G. Harmon, T. P. Baker, and David B. Whalley. A retargetable technique for predict84 ing execution time. In Proceedings of the 13th Real-Time Systems Symposium, pages 68--77, December 1992.

No context found.

M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time of code segments. Real-Time Systems, pages 159--182, Sept. 1994.

No context found.

M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time of code segments. Real-Time Systems, pages 159--182, Sept. 1994.

No context found.

M. G. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time of code segments. Real-Time Systems, pages 159--182, Sept. 1994.

No context found.

M. G. Harmon, T. P. Baker, and D. B. Whalley, "A retargetable technique for predicting execution time," in Proc. IEEE Real-Time Systems Symp., 1992, pp. 68--77.

No context found.

M. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. In IEEE Real-Time Systems Symposium, pages 68--77, Dec. 1992.

No context found.

M. Harmon, T. P. Baker, and D. B. Whalley. A retargetable technique for predicting execution time. IEEE Real-Time Systems Symposium, pp. 68-77, Dec. 1992.

No context found.

M. Harmon, T. Baker, and D. Whalley. A Retargetable Technique for Predicting Execution Time of Code Segments. Real-Time Systems Journal, 7(2):159--182, September 1994.

No context found.

Marion G. Harmon, T.P. Baker, and David B. Whalley. A Retargetable Technique for Predicting Execution Time of Code Segments. Real-Time Systems, 7:159--182, 1994.

No context found.

Marion G. Harmon, T. P. Baker, and David B. Whalley. A retargetable technique for predicting execution time of code segments. Real-Time Systems, 7#2#:159#182, September 1994. 15

No context found.

Marion G. Harmon, T. P. Baker, and David B. Whalley. A retargetable technique for predicting execution time of code segments. Real-Time Systems, 7#2#:159#182, September 1994.

First 50 documents  Next 50

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