C. Healy, M. Sjodin, V. Rustagi, D. Whalley, , and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Journal of Real-Time Systems, 18(23) :129--156, May 2000. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
Modeling Complex Flows for Worst-Case Execution Time Analysis - Engblom, Ermedahl (2000) (7 citations) (Correct)
.... x B For every iteration of the scope an execution of A implies an execution of B (node B can still be executed on its own) scope : 5. 10 : x A = 1 Node A must execute on all the iterations numbered 5 thru 10. This type of iteration based facts can be derived using ow analysis methods like [9, 12]. scope : 1. 2,1. 10] x A 2 Node A cannot be executed more than twice over the rst ten iterations of the inner scope for the rst two iterations of the outer scope. 5. Conversion of ow information to IPET Calculation Our WCET tool uses the IPET calculation method to nd the WCET and ....
C. Healy, M. Sjodin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Journal of Real-Time Systems, May 2000.
Modeling Complex Flows for Worst-Case Execution Time Analysis - Engblom, Ermedahl (2000) (7 citations) (Correct)
....x B For every iteration of the scope an execution of A implies an execution of B (node B can still be executed on its own) ffl scope : 5. 10 : x A = 1 Node A must execute on all the iterations numbered 5 thru 10. This type of iteration based facts can be derived using flow analysis methods like [9, 12]. ffl scope : 1. 2,1. 10] x A 2 Node A cannot be executed more than twice over the first ten iterations of the inner scope for the first two iterations of the outer scope. 5. Conversion of flow information to IPET Calculation Our WCET tool uses the IPET calculation method to find the WCET ....
C. Healy, M. Sjodin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Journal of Real-Time Systems, May 2000.
Tight Timing Estimation with the Newton-Gregory Formulae - van Engelen, Gallivan, Walsh (2003) (1 citation) Self-citation (Van engelen) (Correct)
No context found.
C. Healy, M. Sj odin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems, pages 121--148, May 2000.
Unknown - Self-citation (Van engelen) (Correct)
....time (WCET) estimation has important applications in scheduling and real time embedded systems. Traditional timing analysis statically determines the maximum execution time of a program, which requires the maximum number of loop iterations to be statically known. Recent work on WCET estimation [4] incorporated work on scheduling [5] to bound the number of iterations of non rectangular loops to derive tight WCET estimations. The method requires the bounds of the outer loop to be constant or to be bounded by constants, resulting in a loosening of the WCET bound. Supported in part by NSF ....
....0 p(c 1 , b = max(c 0 , c 0 c 1 (b where c 1 is the upper bound on the execution time of the loop body c 1 . The bound c 1 may be established by an iterative algorithm that simulates the cache behavior of the loop body repeatedly until the timing of the loop body converges, see e.g. [4, 8]. This WCET bound can be very loose for triangular loop nests, because the inner loop is bounded by a non negative constant over the entire iteration space of the inner loop. The definition of the WCET bound (4) requires the coefficients # j of # to be computed in order to evaluate (3) The ....
C. Healy, M. Sj odin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems, pages 121--148, May 2000.
Worst-Case Execution-Time Analysis for Embedded.. - Engblom, Ermedahl.. (2000) (7 citations) Self-citation (Sjodin) (Correct)
No context found.
C. Healy, M. Sjodin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting Timing Analysis by Automatic Bounding of Loop Iterations. Journal of Real-Time Systems, May 2000.
Combining Symbolic Execution and Path Enumeration in.. - Kebbal And Sainrat (Correct)
No context found.
C. Healy, M. Sjodin, V. Rustagi, D. Whalley, , and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Journal of Real-Time Systems, 18(23) :129--156, May 2000.
Model Generation for Temporal Properties of Reactive Components - Moss, Muller (Correct)
No context found.
C. Healy, M. Sjodin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Real-Time Systems, 18(2/3):129--156, May 2000.
Validating a Worst-Case Execution Time Analysis Method.. - Engblom, Ermedahl, al. (2001) (1 citation) (Correct)
No context found.
C. Healy, M. Sjodin, V. Rustagi, D. Whalley, and R. van Engelen. Supporting timing analysis by automatic bounding of loop iterations. Journal of Real-Time Systems, May 2000.
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