Y. H. Bae. Data Cache Analysis Techniques for Real-Time Systems. Master's thesis in preparation, Seoul National University, 1994.  Home/Search   Document Not in Database   Summary   Related Articles   Check

....not known at compile time as misses and completely ignoring those references in the calculation of first reference and last reference. Even in the case where such hardware support is not available, WCET analysis of data caches is still possible although it is with a consequential loss of accuracy[1]. 3 In a set associative cache, the index of the mapped set is given by instruction block number modulo number of sets in the cache. 4 Conclusion In this paper, we described a technique that accurately estimates the WCETs of tasks in the presence of instruction caches. In the proposed ....

Y. H. Bae. Data cache analysis techniques for real-time systems. Master's thesis in preparation, 1994.

....are not known at compile time as misses and completely ignoring them in the calculation of first referenceand last reference. Even when such hardware support is not available, the worst case timing analysis of data caches is still possible although it is with a consequential loss of accuracy [2]. The second difference stems from accesses to local variables. In general, data area for local variables of a function, called the activation record of the function, is pushed and poped on a runtime stack as the associated function is called and returns. In most C language implementations, a ....

....to tmax . However, if a later analysis reveals that the write access is not a leader, we subtract the incorrectly attributed write back delay from tmax . This global analysis can be performed by providing one bit to each block in first reference and last reference and augmenting the Phi operation [2]. 6 Experimental results In order to assess the effects of the extended timing schema on the accuracy of resultant WCET estimation, we choose a set of four simple programs as our benchmarks and compare their WCET predictions using a timing tool described in [25] Our timing tool consists of a ....

Y. H. Bae. Data Cache Analysis Techniques for Real-Time Systems. Master's thesis in preparation, Seoul National University, 1994.

....and last reference. Even when such hardware support is not available, the worst case timing analysis of data caches is still possible by taking two cache miss penalties for each data reference whose address cannot be determined at compile time, and then ignoring the reference in the analysis [27]. The one cache miss penalty is due to the fact that the reference may miss in the cache. The other is due to the fact that the reference may replace a cache block that contributes a cache hit in our analysis. The second difference stems from accesses to local variables. In general, data area for ....

....program syntax tree reveals that the write access is not a tail, we subtract the incorrectly attributed write back delay from t max . This global analysis can be performed by providing a few bits to each block in first reference and last reference and augmenting the Phi and pruning operations [27]. VI EXPERIMENTAL RESULTS We tested whether our extended timing schema approach could produce useful WCET bounds by building a timing tool based on the approach and comparing the WCET bounds predicted by the timing tool to the measured times. Our timing tool consists of a compiler and a timing ....

[Article contains additional citation context not shown here]

Y. H. Bae, "Data Cache Analysis Techniques for Real-Time Systems," Master's thesis, Seoul National University, 1995.

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