Computing tight WCET bounds in the presence of timing anomalies - found in almost any modern hardware architecture - is a major challenge of timing analysis. In this paper, we renew the discussion about timing anomalies, demonstrating that even simple hardware architectures are prone to timing anomalies. We furthermore complete the list of timing-anomalous cache replacement policies, proving that the most-recently-used replacement policy (MRU) also exhibits a domino effect.
@InProceedings{gebhard:OASIcs.WCET.2010.1, author = {Gebhard, Gernot}, title = {{Timing Anomalies Reloaded}}, booktitle = {10th International Workshop on Worst-Case Execution Time Analysis (WCET 2010)}, pages = {1--10}, series = {Open Access Series in Informatics (OASIcs)}, ISBN = {978-3-939897-21-7}, ISSN = {2190-6807}, year = {2010}, volume = {15}, editor = {Lisper, Bj\"{o}rn}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.WCET.2010.1}, URN = {urn:nbn:de:0030-drops-28201}, doi = {10.4230/OASIcs.WCET.2010.1}, annote = {Keywords: Timing Anomalies, Domino Effects, MRU Replacement Policy, LEON2} }
Feedback for Dagstuhl Publishing