LITES-v002-i001-a001.pdf
- Filesize: 0.49 MB
- 10 pages
Document
Randomized Caches Can Be Pretty Useful to Hard Real-Time Systems
Authors
Tullio Vardanega 
,
-
Part of:
Issue:
LITES, Volume 2, Issue 1
Volume: LITES, Volume 2
Journal: Leibniz Transactions on Embedded Systems (LITES) - License:
Creative Commons Attribution 3.0 Germany license
- Publication Date: 2015-03-23
Cite AsGet BibTex
Enrico Mezzetti, Marco Ziccardi, Tullio Vardanega, Jaume Abella, Eduardo Quiñones, and Francisco J. Cazorla. Randomized Caches Can Be Pretty Useful to Hard Real-Time Systems. In LITES, Volume 2, Issue 1 (2015). Leibniz Transactions on Embedded Systems, Volume 2, Issue 1, pp. 01:1-01:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
https://doi.org/10.4230/LITES-v002-i001-a001
https://doi.org/10.4230/LITES-v002-i001-a001
Abstract
Cache randomization per se, and its viability for probabilistic timing analysis (PTA) of critical real-time systems, are receiving increasingly close attention from the scientific community and the industrial practitioners. In fact, the very notion of introducing randomness and probabilities in time-critical systems has caused strenuous debates owing to the apparent clash that this idea has with the strictly deterministic view traditionally held for those systems. A paper recently appeared in LITES (Reineke, J. (2014). Randomized Caches Considered Harmful in Hard Real-Time Systems. LITES, 1(1), 03:1-03:13.) provides a critical analysis of the weaknesses and risks entailed in using randomized caches in hard real-time systems. In order to provide the interested reader with a fuller, balanced appreciation of the subject matter, a critical analysis of the benefits brought about by that innovation should be provided also. This short paper addresses that need by revisiting the array of issues addressed in the cited work, in the light of the latest advances to the relevant state of the art. Accordingly, we show that the potential benefits of randomized caches do offset their limitations, causing them to be - when used in conjunction with PTA - a serious competitor to conventional designs.
Subject Classification
ACM Subject Classification
- Computer systems organization → Real-time system architecture
- Theory of computation → Probabilistic computation
- Computer systems organization → Special purpose systems
Keywords
- Real-time systems
- Probabilistic WCET
- Randomized caches
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Jaume Abella, Damien Hardy, Isabelle Puaut, Eduardo Quiñones, and Francisco J. Cazorla. On the comparison of deterministic and probabilistic WCET estimation techniques. In 26th Euromicro Conference on Real-Time Systems (ECRTS'14), Madrid, Spain, July 8-11, 2014, pages 266-275. IEEE Computer Society, 2014. URL: http://dx.doi.org/10.1109/ECRTS.2014.16.
- Jaume Abella, Eduardo Quiñones, Franck Wartel, Tullio Vardanega, and Francisco J. Cazorla. Heart of gold: Making the improbable happen to increase confidence in MBPTA. In 26th Euromicro Conference on Real-Time Systems (ECRTS'14), Madrid, Spain, July 8-11, 2014, pages 255-265. IEEE Computer Society, 2014. URL: http://dx.doi.org/10.1109/ECRTS.2014.33.
-
Sebastian Altmeyer, Liliana Cucu-Grosjean, Robert I. Davis, and Benjamin Lesage. Progress on static probabilistic timing analysis for systems with random cache replacement policies. In 5th Real-Time Scheduling Open Problems Seminar (RTSOPS'14), 2014.
- Sebastian Altmeyer and Robert I. Davis. On the correctness, optimality and precision of static probabilistic timing analysis. Technical report, Technical Report YCS-2013-487, University of York, 2014. URL: http://www.cs.york.ac.uk/ftpdir/reports/2013/YCS/487/YCS-2013-487.pdf.
- Guillem Bernat, Antoine Colin, and Stefan M. Petters. WCET analysis of probabilistic hard real-time system. In 23rd IEEE Real-Time Systems Symposium (RTSS'02), Austin, Texas, USA, December 3-5, 2002, pages 279-288. IEEE Computer Society, 2002. URL: http://dx.doi.org/10.1109/REAL.2002.1181582.
- Francisco J. Cazorla, Eduardo Quiñones, Tullio Vardanega, Liliana Cucu, Benoit Triquet, Guillem Bernat, Emery D. Berger, Jaume Abella, Franck Wartel, Michael Houston, Luca Santinelli, Leonidas Kosmidis, Code Lo, and Dorin Maxim. PROARTIS: probabilistically analyzable real-time systems. ACM Trans. Embedded Comput. Syst., 12(2s):94, 2013. URL: http://dx.doi.org/10.1145/2465787.2465796.
- Francisco J. Cazorla, Tullio Vardanega, Eduardo Quiñones, and Jaume Abella. Upper-bounding program execution time with extreme value theory. In 13th International Workshop on Worst-Case Execution Time Analysis (WCET'13), July 9, 2013, Paris, France, volume 30 of Open Access Series in Informatics (OASICS), pages 64-76. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, 2013. URL: http://dx.doi.org/10.4230/OASIcs.WCET.2013.64.
- Liliana Cucu-Grosjean, Luca Santinelli, Michael Houston, Code Lo, Tullio Vardanega, Leonidas Kosmidis, Jaume Abella, Enrico Mezzetti, Eduardo Quiñones, and Francisco J. Cazorla. Measurement-based probabilistic timing analysis for multi-path programs. In 24th Euromicro Conference on Real-Time Systems (ECRTS'12), Pisa, Italy, July 11-13, 2012, pages 91-101. IEEE Computer Society, 2012. URL: http://dx.doi.org/10.1109/ECRTS.2012.31.
- Robert I. Davis, Luca Santinelli, Sebastian Altmeyer, Claire Maiza, and Liliana Cucu-Grosjean. Analysis of probabilistic cache related pre-emption delays. In 25th Euromicro Conference on Real-Time Systems (ECRTS'13), Paris, France, July 9-12, 2013, pages 168-179. IEEE Computer Society, 2013. URL: http://dx.doi.org/10.1109/ECRTS.2013.27.
-
William Feller. An Introduction to Probability Theory and Its Applications. John Willer and Sons, 1996.
- Javier Jalle, Leonidas Kosmidis, Jaume Abella, Eduardo Quiñones, and Francisco J. Cazorla. Bus designs for time-probabilistic multicore processors. In Design, Automation & Test in Europe 2014 (DATE'14), Dresden, Germany, March 24-28, 2014, pages 1-6. IEEE, 2014. URL: http://dx.doi.org/10.7873/DATE.2014.063.
- Leonidas Kosmidis, Jaume Abella, Eduardo Quiñones, and Francisco J. Cazorla. A cache design for probabilistically analysable real-time systems. In Design, Automation & Test in Europe 2013 (DATE'13), Grenoble, France, March 18-22, 2013, pages 513-518. EDA Consortium San Jose, CA, USA / ACM DL, 2013. URL: http://dl.acm.org/citation.cfm?id=2485416.
- Leonidas Kosmidis, Jaume Abella, Eduardo Quiñones, and Francisco J. Cazorla. Multi-level unified caches for probabilistically time analysable real-time systems. In 34th IEEE Real-Time Systems Symposium (RTSS'13), Vancouver, BC, Canada, December 3-6, 2013, pages 360-371. IEEE Computer Society, 2013. URL: http://dx.doi.org/10.1109/RTSS.2013.43.
- Leonidas Kosmidis, Jaume Abella, Franck Wartel, Eduardo Quiñones, Antoine Colin, and Francisco J. Cazorla. PUB: path upper-bounding for measurement-based probabilistic timing analysis. In 26th Euromicro Conference on Real-Time Systems (ECRTS'14), Madrid, Spain, July 8-11, 2014, pages 276-287. IEEE Computer Society, 2014. URL: http://dx.doi.org/10.1109/ECRTS.2014.34.
- Leonidas Kosmidis, Eduardo Quiñones, Jaume Abella, Tullio Vardanega, Ian Broster, and Francisco J. Cazorla. Measurement-based probabilistic timing analysis and its impact on processor architecture. In 17th Euromicro Conference on Digital System Design (DSD'14), Verona, Italy, August 27-29, 2014, pages 401-410. IEEE Computer Society, 2014. URL: http://dx.doi.org/10.1109/DSD.2014.50.
- Eduardo Quiñones, Emery D. Berger, Guillem Bernat, and Francisco J. Cazorla. Using randomized caches in probabilistic real-time systems. In 21st Euromicro Conference on Real-Time Systems (ECRTS'09), Dublin, Ireland, July 1-3, 2009, pages 129-138. IEEE Computer Society, 2009. URL: http://dx.doi.org/10.1109/ECRTS.2009.30.
- Jan Reineke. Randomized caches considered harmful in hard real-time systems. Leibniz Transactions on Embedded Systems (LITES), 1(1):03:1-03:13, 2014. URL: http://dx.doi.org/10.4230/LITES-v001-i001-a003.
- Mladen Slijepcevic, Leonidas Kosmidis, Jaume Abella, Eduardo Quiñones, and Francisco J. Cazorla. DTM: degraded test mode for fault-aware probabilistic timing analysis. In 25th Euromicro Conference on Real-Time Systems (ECRTS'13), Paris, France, July 9-12, 2013, pages 237-248. IEEE Computer Society, 2013. URL: http://dx.doi.org/10.1109/ECRTS.2013.33.
- Reinhard Wilhelm, Jakob Engblom, Andreas Ermedahl, Niklas Holsti, Stephan Thesing, David B. Whalley, Guillem Bernat, Christian Ferdinand, Reinhold Heckmann, Tulika Mitra, Frank Mueller, Isabelle Puaut, Peter P. Puschner, Jan Staschulat, and Per Stenström. The worst-case execution-time problem - overview of methods and survey of tools. ACM Trans. Embedded Comput. Syst., 7(3), 2008. URL: http://dx.doi.org/10.1145/1347375.1347389.
- Shuchang Zhou. An efficient simulation algorithm for cache of random replacement policy. In 7th IFIP International Conference on Network and Parallel Computing (NPC'10), Zhengzhou, China, September 13-15, 2010, volume 6289 of Lecture Notes in Computer Science, pages 144-154. Springer, 2010. URL: http://dx.doi.org/10.1007/978-3-642-15672-4_13.