| S.-S. Lim. Instruction Cache and Pipelining Analysis Techniques for Real-Time Systems. Master's thesis in preparation, Seoul National University, 1994. |
.... that m is the maximum cycle mean of G and thus D ;i;j Theta m (m Gamma w ji ) Moreover, it can be shown that D 0 ;i;j Gamma D ;i;j , which indicates the looseness of the approximation, is bounded above by 3 Theta (m Gamma wmin) where wmin is the minimum weight of an arc in A [17]. We can expect this bound to be very tight since m wmin . Remember that P consists of the paths in W (exp) L W (S1 ) that cannot be pruned by each other. Once D 0 Gamma1;i;j (or D Gamma1;i;j if possible) is calculated, wcta(wp ij ) is given by wcta(wp ij ) p i :t max D 0 ....
....analysis is safe in the sense that it does not underestimate the WCET of the loop statement. The degradation of accuracy resulting from this conservative assumption can be reduced by considering a sequence of k (k 1) iterations at the same time in the analysis rather than just one iteration [17]. In this case, each vertex represents an execution of a sequence of k iterations and w ij is the execution time of sequence j when its execution is immediately preceded by an execution of sequence i . This analysis corresponds to the analysis of the loop unrolled k times and trades increased ....
S.-S. Lim. Instruction Cache and Pipelining Analysis Techniques for Real-Time Systems. Master's thesis in preparation, Seoul National University, 1994.
.... that m is the maximum cycle mean of G and thus D ;i;j Theta m (m Gamma w ji ) Moreover, it has been shown that D 0 ;i;j Gamma D ;i;j , which indicates the looseness of the approximation, is bounded above by 3 Theta (m Gamma wmin ) where wmin is the minimum weight of an arc in A [25]. We can expect this bound to be very tight since m wmin . Remember that P consists of the paths in W (exp) L W (S 1 ) that cannot be pruned by each other. Interference Up to now, we have assumed that tasks execute without preemption. However, b 2 b 3 2 3 b 4 b 3 b 2 b 3 b 2 b 4 b b 2 b ....
....case timing analysis is safe in the sense that the result does not underestimate the WCET of the loop statement. The degradation of accuracy resulting from this conservative assumption can be reduced by analyzing a sequence of k (k 1) iterations at the same time rather than just one iteration [25]. In this case, each vertex represents an execution of a sequence of k iterations and w ij is the execution time of sequence j when its execution is immediately preceded by an execution of sequence i . This analysis corresponds to the analysis of the loop unrolled k times and trades increased ....
S.-S. Lim, "Instruction Cache and Pipelining Analysis Technique for Real-Time Systems," Master 's thesis, Seoul National University, 1995.
....are conservative, the resulting worst case execution time estimate is correct in the sense that it does not underestimate the WCET. The degradation of accuracy resulting from the conservative assumptions can be reduced by considering k (k 1) paths at the same time rather than just one path[10]. In this case, each node denotes an execution of a sequence of k paths and w ij is the execution time of sequence j when its execution is immediately preceded by an execution of sequence i . This analysis corresponds to the analysis of the loop unrolled k times and trades increased analysis ....
S.-S. Lim. Instruction cache and pipelining analysis techniques for real-time systems. Master's thesis in preparation, 1994.
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