Timing Analysis for Data and Wrap-Around Fill Caches |
| |
Authors: | White Randall T Mueller Frank Healy Chris Whalley David Harmon Marion |
| |
Affiliation: | (1) Computer Science Department, Florida State University, Tallahassee, FL, 32306-4530;(2) Institut für Informatik, Humboldt-Universität zu Berlin, 10099 Berlin, (Germany);(3) Computer & Information Systems Department, Florida A&M University, Tallahassee, FL, 32307-3101 |
| |
Abstract: | The contributions of this paper are twofold. First, an automatic tool-based approach is described to bound worst-case data cache performance. The approach works on fully optimized code, performs the analysis over the entire control flow of a program, detects and exploits both spatial and temporal locality within data references, and produces results typically within a few seconds. Results obtained by running the system on representative programs are presented and indicate that timing analysis of data cache behavior usually results in significantly tighter worst-case performance predictions. Second, a method to deal with realistic cache filling approaches, namely wrap-around-filling for cache misses, is presented as an extension to pipeline analysis. Results indicate that worst-case timing predictions become significantly tighter when wrap-around-fill analysis is performed. Overall, the contribution of this paper is a comprehensive report on methods and results of worst-case timing analysis for data caches and wrap-around caches. The approach taken is unique and provides a considerable step toward realistic worst-case execution time prediction of contemporary architectures and its use in schedulability analysis for hard real-time systems. |
| |
Keywords: | Timing analysis data cache wrap-around fill cache worst-case execution time |
本文献已被 SpringerLink 等数据库收录! |
|