David Griffin
ABSTRACT
The analysis of random replacement caches is an area that has recently attracted considerable attention in the field of probabilistic real-time systems. A major problem with performing static analysis on such a cache is that the relatively large number of successor states on a cache miss (equal to the cache associativity) renders approaches such as Collecting Semantics intractable. Other approaches must contend with non-trivial behaviours, such as the non-independence of accesses to the cache, which tends to lead to overly pessimistic or computationally expensive analyses.
Utilising techniques from the field of Lossy Compression, where compactly representing large volumes of data without losing valuable data is the norm, this paper outlines a technique for applying compression to the Collecting Semantics of a Random Replacement Cache. This yields a Must and May analysis. Experimental evaluation shows that, with appropriate parameters, this technique is more accurate and significantly faster than current state-of-the-art techniques.
- S. Edgar, "Estimation of worst-case execution time using statistical analysis," Ph.D. dissertation, University of York, 2002.Google Scholar
- L. David and I. Puaut, "Static determination of probabilistic execution times," in Proceedings. 16th Euromicro Conference on Real-Time Systems (ECRTS), June 2004, pp. 223--230. Google ScholarDigital Library
- F. Cazorla, E. Quiñones, T. Vardanega, L. Cucu, B. Triquet, G. Bernat, E. Berger, J. Abella, F. Wartel, M. Houston, L. Santinelli, L. Kosmidis, C. Lo, and D. Maxim, "Proartis: Probabilistically analysable real-time systems," Transactions on Embedded Computing Systems, 2012. Google ScholarDigital Library
- L. Cucu-Grosjean, L. Santinelli, M. Houston, C. Lo, T. Vardanega, L. Kosmidis, J. Abella, E. Mezzetti, E. Quiñones, and F. J. Cazorla, "Measurement-based probabilistic timing analysis for multi-path programs." in ECRTS, R. Davis, Ed. IEEE Computer Society, 2012, pp. 91--101. Google ScholarDigital Library
- R. I. Davis, L. Santinelli, S. Altmeyer, C. Maiza, and L. Cucu-Grosjean, "Analysis of probabilistic cache related pre-emption delays," in 25th Euromicro Conference on Real-Time Systems (ECRTS). IEEE, 2013, pp. 168--179. Google ScholarDigital Library
- S. Altmeyer and R. I. Davis, "On the correctness, optimality and precision of static probabilistic timing analysis," in 17th Design, Automation and Test in Europe Conference (DATE). EDAA, 2014. Google ScholarDigital Library
- J. Watkinson, Compression in Video and Audio. Focal Press, 1995. Google ScholarDigital Library
- K. S. G. Brandenburg, "ISO/MPEG-1 audio: A generic standard for coding of high-quality digital audio," J. Audio Engineering Soc, vol. 42, no. 10, pp. 780--792, 1994.Google Scholar
- D. Griffin, B. Lesage, A. Burns, and R. I. Davis, "Lossy compression for worst-case execution time analysis of PLRU caches," in RTNS '14: Proceedings of the 22nd International Conference on Real-Time and Network Systems. Versailles, France: ACM, New York, NY, USA, 2014. Google ScholarDigital Library
- P. Cousot and R. Cousot, "Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints," in Conference Record of the Fourth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages. Los Angeles, California: ACM Press, New York, NY, 1977, pp. 238--252. Google ScholarDigital Library
- F. Mueller, "Timing analysis for instruction caches," Real-Time Systems, vol. 18, pp. 217--247, May 2000. Google ScholarDigital Library
- Y. Liang and T. Mitra, "Cache modeling in probabilistic execution time analysis," in Proceedings of the 45th Annual Design Automation Conference, ser. DAC '08. New York, NY, USA: ACM, 2008, pp. 319--324. Google ScholarDigital Library
- L. Cucu-Grosjean, "Independance - a misunderstood property of and for probabilistic real-time systems," in Alan Burns 60th Anniversary, N. Audsley and S. Baruah, Eds., Mar. 2013.Google Scholar
- T. Lundqvist and P. Stenström, "Timing anomalies in dynamically scheduled microprocessors," in RTSS '99: Proceedings of the 20th IEEE Real-Time Systems Symposium. Washington, DC, USA: IEEE Computer Society, 1999, pp. 12--21. Google ScholarDigital Library
- D. Grund and J. Reineke, "Toward precise PLRU cache analysis," in Proceedings of 10th International Workshop on Worst-Case Execution Time (WCET) Analysis, B. Lisper, Ed. Austrian Computer Society, July 2010, pp. 28--39.Google Scholar
- Contributors, "Maladärlen WCET benchmarks," http://www.mrtc.mdh.se/projects/wcet/, accessed on 1st September 2013.Google Scholar
Index Terms
- Static Probabilistic Timing Analysis of Random Replacement Caches using Lossy Compression
Recommendations
Static probabilistic timing analysis for real-time systems using random replacement caches
In this paper, we investigate static probabilistic timing analysis (SPTA) for single processor real-time systems that use a cache with an evict-on-miss random replacement policy. We show that previously published formulae for the probability of a cache ...
Introducing hierarchy-awareness in replacement and bypass algorithms for last-level caches
PACT '12: Proceedings of the 21st international conference on Parallel architectures and compilation techniquesThe replacement policies for the last-level caches (LLCs) are usually designed based on the access information available locally at the LLC. These policies are inherently sub-optimal due to lack of information about the activities in the inner-levels of ...
Opportunistic compression for direct-mapped DRAM caches
MEMSYS '18: Proceedings of the International Symposium on Memory SystemsLarge off-chip DRAM caches offer performance and bandwidth improvements for many systems by bridging the gap between on-chip last level caches and off-chip memories. To avoid the high hit latency resulting from serial DRAM accesses for tags and data, ...
Comments