| References: [1] Ackland, B. D., Anesko, A., Brinthaupt, D. M., Daubert, S. J., Kalavade, A., Knobloch, J., Micca, E., Moturi, M., Nicol, C. J., O’Neill, J. H., Othmer, J. H., Säckinger, E., Singh, K. J., Sweet, J., Terman, C. J., Williams, J. (2000). A single-chip, 1.6 billion, 16-b mac/s multiprocessor DSP. IEEE Journal of Solid-State Circuits, 35(3), 412–423. doi:10.1109/4.826824.
[2] Belady, Laszlo A. (1966). A study of replacement algorithms for a virtual-storage computer. IBM Systems Journal, 5(2), 78–101. doi:10.1147/sj.52.0078.
[3] Borodin, Allan., El-Yaniv, Ran. (1998). Online computation and competitive analysis. Cambridge University Press.
[4]Cazorla, Francisco J., Quiñones, Eduardo, Vardanega, Tullio, Cucu, Liliana, Triquet, Benoit, Bernat, Guillem, Berger, Emery, Abella, Jaume, Wartel, Franck, Houston, Michael, Santinelli, Luca, Kosmidis, Leonidas, Lo, Code, & Maxim, Dorin. (2013). PROARTIS: Probabilistically analyzable real-time systems. ACM Transactions on Embedded Computing Systems, 12(2s), 94:1–94:26. https://doi.org/10.1145/2465787.2465796.
[5] Cucu-Grosjean, Liliana, Santinelli, Luca, Houston, Michael, Lo, Code, Vardanega, Tullio, Kosmidis, Leonidas, Abella, Jaume, Mezzetti, Enrico, Quiñones, Eduardo., Cazorla, Francisco J. (2012). Measurement-based probabilistic timing analysis for multi-path programs. In 24th Euromicro Conference on Real-Time Systems, ECRTS’12, Pisa, Italy (pp. 91–101). Washington, DC, USA: IEEE Computer Society. doi:10.1109/ECRTS.2012.31.
[6] Davis, Robert I. (2013). Improvements to static probabilistic timing analysis for systems with random cache replacement policies. In 2013 4th Real-Time Scheduling Open Problems Seminar, RTSOPS’13, July 2013.
[7] Davis, Robert I., Santinelli, Luca, Altmeyer, Sebastian, Maiza, Claire., Cucu-Grosjean, Liliana. (2013). Analysis of probabilistic cache related pre-emption delays. In 25th Euromicro Conference on Real-Time Systems, ECRTS’13, Paris, France (pp. 168–179). doi:10.1109/ ECRTS.2013.27.
[8] Dupont de Dinechin, Benoît, van Amstel, Duco, Poulhiès, Mar., Lager, Guillaume. (2014). Time-critical computing on a single-chip massively parallel processor. In Design, Automation & Test in Europe Conference & Exhibition, DATE’14, Dresden, Germany (pp. 513–518). doi:10.7873/DATE2014.110.
[9] Ferdinand, Christian, Wilhelm, Reinhard. (1999). Efficient and precise cache behavior prediction for realtime systems. Real-Time Systems, 17(2-3), 131–181. doi:10.1023/ A:1008186323068.
[10] Grund, Daniel. (2012). Static Cache Analysis for Real-Time Systems – LRU, FIFO, PLRU. PhD thesis, Saarland University. Retrieved from https://www.epubli.de/shop/buch/StaticCache-Analysis-for-Real-Time-Systems-Daniel-Grund-9783844216998/13092.
[11] Grund, Danie., Reineke, Jan. (2009). Abstract interpretation of FIFO replacement. In Static Analysis, 16th International Symposium, SAS’09, Los Angeles, CA, USA (pp. 120–136). Springer. doi:10.1007/978-3-642-03237-0_10.
[12] Grund, Danie., Reineke, Jan. (2010). Precise and efficient FIFO-replacement analysis based on static phase detection. In 22nd Euromicro Conference on Real-Time Systems,
[13] Grund, Daniel., Reineke, Jan. (2010). Toward precise PLRU cache analysis. In 10th International Workshop on Worst-Case Execution Time Analysis, WCET’10, Brussels, Belgium (pp. 23–35). Schloss Dagstuhl – Leibniz-Zentrum für Informatik, Germany. doi:10.4230/ OASIcs.WCET.2010.23.
[14] Guan, Nan, Lv, Mingsong, Yi, Wang., Yu, Ge. (2012). WCET analysis with MRU caches: Challenging LRU for predictability. In 2012 IEEE 18th Real Time and Embedded Technology and Applications Symposium, Beijing, China (pp. 55–64). IEEE. doi:10.1109/RTAS.2012.31.
[15] Guan, Nan, Yang, Xinping, Lv, Mingsong., Yi, Wang. (2013). FIFO cache analysis for WCET estimation: a quantitative approach. In Design, Automation and Test in Europe, DATE’13, Grenoble, France (pp. 296–301). EDA Consortium San Jose, CA, USA / ACM DL, March 2013. URL: http://dl.acm.org/citation.cfm?id=2485362.
[16] Hahn, Sebastian., Grund, Daniel. (2012). Relational cache analysis for static timing analysis. In 24th Euromicro Conference on Real-Time Systems, ECRTS’12, Pisa, Italy (pp. 102–111). IEEE Computer Society. doi:10.1109/ECRTS.2012.14.
[17] Heckmann, Reinhold, Langenbach, Marc, Thesing, Stephan., Wilhelm, Reinhard. (2003). The influence of processor architecture on the design and the results of WCET tools. Proceedings of the IEEE, 91(7), 1038–1054. doi:10.1109/JPROC.2003.814618.
[18] Freescale Semiconductor Inc. (2005). MPC7450 RISC microprocessor family reference manual, rev. 5.
[19] Komm, Dennis, Kràlovic, Rastislav, Kràlovic, Richard., Mömke, Tobias. (2014). Randomized online algorithms with high probability guarantees. In 31st International Symposium on Theoretical Aspects of Computer Science, STACS’14, Lyon, France (pp. 470–481). Schloss Dagstuhl – Leibniz-Zentrum für Informatik. doi:10.4230/LIPIcs.STACS.2014.470. nes, Eduardo, Cazorla, Francisco J. (2013). A cache design for probabilistically analysable real-time systems. In Design, Automation and Test in Europe, DATE’13, Grenoble, France (pp. 513–518). EDA Consortium San Jose, CA, USA / ACM DL, March 2013. URL: http://dl.acm.org/ citation.cfm?id=2485416.
[21] Kosmidis, Leonidas, Abella, Jaume, Quiñones, Eduardo, & Cazorla, Francisco J. (2013). Efficient cache designs for probabilistically analysable realtime systems. IEEE Transactions on Computers, 99(PrePrints), 1. doi:10.1109/TC.2013.182.
[22] Kosmidis, Leonidas, Curtsinger, Charlie, Quiñones, Eduardo, Abella, Jaume, Berger, Emery D., Cazorla, Francisco J. (2013). Probabilistic timing analysis on conventional cache designs. In Design, Automation and Test in Europe, DATE’13, Grenoble, France (pp. 603–606). EDA Consortium San Jose, CA, USA / ACM DL, March 2013. URL: http://dl.acm.org/ citation.cfm?id=2485435.
[23] Kosmidis, Leonidas, Quiñones, Eduardo, Abella, Jaume, Vardanega, Tullio, & Cazorla, Francisco J. (2013). Achieving timing composability with measurement-based probabilistic timing analysis. In 2013 16th IEEE Symposium on Object/Component/Service-oriented Real-time Distributed Computing, ISORC’13.
[24] Lundqvist, Thomas, Stenström, Per. (1999). Timing anomalies in dynamically scheduled microprocessors. In 20th IEEE Real-Time Systems Symposium, Phoenix, AZ, USA (pp. 12–21). IEEE Computer Society. doi:10.1109/REAL.1999.818824.
[25] Quiñones, Eduardo, Berger, Emery D., Bernat, Guillem., Cazorla, Francisco J. (2009). Using randomized caches in probabilistic real-time systems. In 21st Euromicro Conference on RealTime Systems, ECRTS 2009, Dublin, Ireland (pp. 129–138). IEEE Computer Society. doi:10.1109/ ECRTS.2009.30.
[26] Reineke, Jan. (2008). Caches in WCET Analysis. PhD thesis, Universität des Saarlandes. URL: http://rw4.cs.uni-saarland.de/~reineke/publications/DissertationCa chesInWCET Analysis.pdf.
[27] Reineke, Jan., Grund, Daniel. (2013). Sensitivity of cache replacement policies. ACM Transactions on Embedded Computing Systems, 12(1s), 42. doi:10.1145/2435227.2435238.
[28] Reineke, Jan, Grund, Daniel, Berg, Christoph., Wilhelm, Reinhard. (2007). Timing predictability of cache replacement policies. Real-Time Systems, 37(2), 99–122. doi:10.1007/ s11241-007-9032-3.
[29] Reineke, Jan, Wachter, Björn, Thesing, Stephan, Wilhelm, Reinhard, Polian, Ilia, Eisinger, Jochen, & Becker, Bernd. (2006). A definition and classification of timing anomalies. In 6th International Workshop on Worst-Case Execution Time Analysis, WCET’06, Dresden, Germany. Schloss Dagstuhl – Leibniz-Zentrum für Informatik. doi:10.4230/OASIcs.WCET.2006.671.
[30] Sen, Rathijit., Wood, David A. (2013). Reuse-based online models for caches. In ACM SIGMETRICS / International Conference on Measurement and Modeling of Computer Systems, SIGMETRICS’13, Pittsburgh, PA, USA (pp. 279–292). ACM. doi:10.1145/2465529.2465756.
[31] Wilhelm, Reinhard, Engblom, Jakob, Ermedahl, Andreas, Holsti, Niklas, Thesing, Stephan, Whalley, David B., Bernat, Guillem, Ferdinand, Christian, Heckmann, Reinhold, Mitra, Tulika, Mueller, Frank, Puaut, Isabelle, Puschner, Peter P., Staschulat, Jan, & Stenström, Per. (2008). The worst-case execution time problem – overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems, 7(3). doi:10.1145/1347375.1347389.
[32] Zhou, Shuchang. (2010). An efficient simulation algorithm for cache of random replacement policy. In Network and Parallel Computing, IFIP International Conference, NPC’10, Zhengzhou, China (pp. 144–154). Springer. doi:10.1007/978-3-642-15672-4_13. |
Author Rights 
