{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:22:13Z","timestamp":1750306933360,"version":"3.41.0"},"reference-count":20,"publisher":"Association for Computing Machinery (ACM)","issue":"1s","license":[{"start":{"date-parts":[[2013,3,1]],"date-time":"2013-03-01T00:00:00Z","timestamp":1362096000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001736","name":"German-Israeli Foundation for Scientific Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001736","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100004963","name":"Seventh Framework Programme","doi-asserted-by":"publisher","award":["216008"],"award-info":[{"award-number":["216008"]}],"id":[{"id":"10.13039\/501100004963","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2013,3]]},"abstract":"<jats:p>\n            The sensitivity of a cache replacement policy expresses to what extent the execution history may influence the number of cache hits and misses during program execution. We present an algorithm to compute the sensitivity of a replacement policy. We have implemented this algorithm in a tool called R\n            <jats:sc>elacs<\/jats:sc>\n            that can handle a large class of replacement policies including LRU, FIFO, PLRU, and MRU. Sensitivity properties obtained with R\n            <jats:sc>elacs<\/jats:sc>\n            demonstrate that the execution history can have a strong impact on the number of cache hits and misses if FIFO, PLRU, or MRU is used. A simple model of execution time is used to evaluate the impact of cache sensitivity on measured execution times. The model shows that measured execution times may strongly underestimate the worst-case execution time for FIFO, PLRU, and MRU.\n          <\/jats:p>","DOI":"10.1145\/2435227.2435238","type":"journal-article","created":{"date-parts":[[2013,3,19]],"date-time":"2013-03-19T13:34:23Z","timestamp":1363700063000},"page":"1-18","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Sensitivity of cache replacement policies"],"prefix":"10.1145","volume":"12","author":[{"given":"Jan","family":"Reineke","sequence":"first","affiliation":[{"name":"Saarland University, Saarbr\u00fccken"}]},{"given":"Daniel","family":"Grund","sequence":"additional","affiliation":[{"name":"Saarland University, Saarbr\u00fccken"}]}],"member":"320","published-online":{"date-parts":[[2013,3,21]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"Network Flows: Theory, Algorithms, and Applications","author":"Ahuja R. K.","year":"1993","unstructured":"Ahuja , R. K. , Magnanti , T. L. , and Orlin , J. B . 1993 . Network Flows: Theory, Algorithms, and Applications . Prentice-Hall, Inc. , Upper Saddle River, NJ. Ahuja, R. K., Magnanti, T. L., and Orlin, J. B. 1993. Network Flows: Theory, Algorithms, and Applications. Prentice-Hall, Inc., Upper Saddle River, NJ."},{"doi-asserted-by":"publisher","key":"e_1_2_1_2_1","DOI":"10.1145\/986537.986601"},{"key":"e_1_2_1_3_1","volume-title":"Proceedings of the 6th International Workshop on Worst-Case Execution Time (WCET) Analysis. F. Mueller, Ed., Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI)","author":"Berg C.","year":"2006","unstructured":"Berg , C. 2006 . PLRU cache domino effects . In Proceedings of the 6th International Workshop on Worst-Case Execution Time (WCET) Analysis. F. Mueller, Ed., Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI) , Schloss Dagstuhl, Germany. Berg, C. 2006. PLRU cache domino effects. In Proceedings of the 6th International Workshop on Worst-Case Execution Time (WCET) Analysis. F. Mueller, Ed., Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany."},{"doi-asserted-by":"publisher","key":"e_1_2_1_4_1","DOI":"10.5555\/827272.829144"},{"volume-title":"Proceedings of the 5th International Workshop on Worst-Case Execution Time (WCET) Analysis. R. Wilhelm, Ed., Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI)","author":"Deverge J.-F.","unstructured":"Deverge , J.-F. and Puaut , I . 2005. Safe measurement-based WCET estimation . In Proceedings of the 5th International Workshop on Worst-Case Execution Time (WCET) Analysis. R. Wilhelm, Ed., Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI) , Schloss Dagstuhl, Germany. Deverge, J.-F. and Puaut, I. 2005. Safe measurement-based WCET estimation. In Proceedings of the 5th International Workshop on Worst-Case Execution Time (WCET) Analysis. R. Wilhelm, Ed., Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany.","key":"e_1_2_1_5_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_6_1","DOI":"10.1109\/ICPP.2011.15"},{"doi-asserted-by":"publisher","key":"e_1_2_1_7_1","DOI":"10.5555\/646788.703912"},{"doi-asserted-by":"publisher","key":"e_1_2_1_8_1","DOI":"10.5555\/646787.703893"},{"doi-asserted-by":"publisher","key":"e_1_2_1_9_1","DOI":"10.1109\/JPROC.2003.814618"},{"key":"e_1_2_1_10_1","volume-title":"Computer Architecture: A Quantitative Approach","author":"Hennessy J. L.","year":"1996","unstructured":"Hennessy , J. L. and Patterson , D. A . 1996 . Computer Architecture: A Quantitative Approach 2 nd Ed., Morgan Kaufmann . Hennessy, J. L. and Patterson, D. A. 1996. Computer Architecture: A Quantitative Approach 2nd Ed., Morgan Kaufmann.","edition":"2"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of the International Symposium on Theory of Graphs. 209--213","author":"Lawler E.","year":"1966","unstructured":"Lawler , E. 1966 . Optimal cycles in doubly weighted linear graphs . In Proceedings of the International Symposium on Theory of Graphs. 209--213 . Lawler, E. 1966. Optimal cycles in doubly weighted linear graphs. In Proceedings of the International Symposium on Theory of Graphs. 209--213."},{"doi-asserted-by":"publisher","key":"e_1_2_1_13_1","DOI":"10.5555\/827272.829141"},{"doi-asserted-by":"publisher","key":"e_1_2_1_15_1","DOI":"10.1145\/1375657.1375665"},{"doi-asserted-by":"publisher","key":"e_1_2_1_16_1","DOI":"10.1007\/s11241-007-9032-3"},{"doi-asserted-by":"publisher","key":"e_1_2_1_17_1","DOI":"10.1145\/1755888.1755899"},{"unstructured":"Silberschatz A. Galvin P. B. and Gagne G. 2005. Operating System Concepts. Vol. 2nd. Addison-Wesley.   Silberschatz A. Galvin P. B. and Gagne G. 2005. Operating System Concepts. Vol. 2nd. Addison-Wesley.","key":"e_1_2_1_18_1"},{"doi-asserted-by":"publisher","key":"e_1_2_1_19_1","DOI":"10.1023\/A:1008141130870"},{"doi-asserted-by":"publisher","key":"e_1_2_1_20_1","DOI":"10.1145\/885651.781062"},{"doi-asserted-by":"publisher","key":"e_1_2_1_22_1","DOI":"10.1145\/1347375.1347389"},{"doi-asserted-by":"publisher","key":"e_1_2_1_23_1","DOI":"10.1109\/TCAD.2009.2013287"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2435227.2435238","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2435227.2435238","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:35:40Z","timestamp":1750235740000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2435227.2435238"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,3]]},"references-count":20,"journal-issue":{"issue":"1s","published-print":{"date-parts":[[2013,3]]}},"alternative-id":["10.1145\/2435227.2435238"],"URL":"https:\/\/doi.org\/10.1145\/2435227.2435238","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2013,3]]},"assertion":[{"value":"2011-06-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2012-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-03-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}