Timing predictability of cache replacement policies

Timing predictability of cache replacement policies

Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution times of a system’s tasks. In this context, predictable behavior of system components is crucial for the derivation of tight and thus useful bounds. This paper presents r...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Real-time systems 2007-11, Vol.37 (2), p.99-122
Hauptverfasser: Reineke, Jan, Grund, Daniel, Berg, Christoph, Wilhelm, Reinhard
Format: Artikel
Sprache:eng
Schlagworte:
Empirical analysis
Policies
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 122
container_issue 2
container_start_page 99
container_title Real-time systems
container_volume 37
creator Reineke, Jan
Grund, Daniel
Berg, Christoph
Wilhelm, Reinhard
description Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution times of a system’s tasks. In this context, predictable behavior of system components is crucial for the derivation of tight and thus useful bounds. This paper presents results about the predictability of common cache replacement policies. To this end, we introduce three metrics, evict, fill, and mls that capture aspects of cache-state predictability. A thorough analysis of the LRU, FIFO, MRU, and PLRU policies yields the respective values under these metrics. To the best of our knowledge, this work presents the first quantitative, analytical results for the predictability of replacement policies. Our results support empirical evidence in static cache analysis.
doi_str_mv 10.1007/s11241-007-9032-3
format Article
fullrecord <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_30131962</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>30131962</sourcerecordid><originalsourceid>FETCH-LOGICAL-c304t-341053bd9f570019bbcf24c7972d04485692a122af1b93237fe8915eeb0929763</originalsourceid><addsrcrecordid>eNpdkEtLAzEUhYMoWEd_gLsBwV303tzMpFlK8QUFN3UdMmmiKfMymS76751SV67OWXwcDh9jtwgPCKAeM6KQyOfKNZDgdMYWWCniSEs6ZwvQQvBaSrpkVznvAKBCpReMNrGL_Vc5Jr-NbrJNbON0KIdQOuu-fZn82FrnO99P5Ti00UWfr9lFsG32N39ZsM-X583qja8_Xt9XT2vuCOTESSJU1Gx1qBQA6qZxQUintBJbkHJZ1VpYFMIGbDQJUsEvNVbeN_NZrWoq2P1pd0zDz97nyXQxO9-2tvfDPhsCJNS1mMG7f-Bu2Kd-_maEqLQEoFlFwfBEuTTknHwwY4qdTQeDYI4SzUmiOdajREP0C3hdYi0</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2259400357</pqid></control><display><type>article</type><title>Timing predictability of cache replacement policies</title><source>Springer Nature - Complete Springer Journals</source><creator>Reineke, Jan ; Grund, Daniel ; Berg, Christoph ; Wilhelm, Reinhard</creator><creatorcontrib>Reineke, Jan ; Grund, Daniel ; Berg, Christoph ; Wilhelm, Reinhard</creatorcontrib><description>Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution times of a system’s tasks. In this context, predictable behavior of system components is crucial for the derivation of tight and thus useful bounds. This paper presents results about the predictability of common cache replacement policies. To this end, we introduce three metrics, evict, fill, and mls that capture aspects of cache-state predictability. A thorough analysis of the LRU, FIFO, MRU, and PLRU policies yields the respective values under these metrics. To the best of our knowledge, this work presents the first quantitative, analytical results for the predictability of replacement policies. Our results support empirical evidence in static cache analysis.</description><identifier>ISSN: 0922-6443</identifier><identifier>EISSN: 1573-1383</identifier><identifier>DOI: 10.1007/s11241-007-9032-3</identifier><language>eng</language><publisher>New York: Springer Nature B.V</publisher><subject>Empirical analysis ; Policies</subject><ispartof>Real-time systems, 2007-11, Vol.37 (2), p.99-122</ispartof><rights>Real-Time Systems is a copyright of Springer, (2007). All Rights Reserved.</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c304t-341053bd9f570019bbcf24c7972d04485692a122af1b93237fe8915eeb0929763</citedby><cites>FETCH-LOGICAL-c304t-341053bd9f570019bbcf24c7972d04485692a122af1b93237fe8915eeb0929763</cites></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27901,27902</link.rule.ids></links><search><creatorcontrib>Reineke, Jan</creatorcontrib><creatorcontrib>Grund, Daniel</creatorcontrib><creatorcontrib>Berg, Christoph</creatorcontrib><creatorcontrib>Wilhelm, Reinhard</creatorcontrib><title>Timing predictability of cache replacement policies</title><title>Real-time systems</title><description>Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution times of a system’s tasks. In this context, predictable behavior of system components is crucial for the derivation of tight and thus useful bounds. This paper presents results about the predictability of common cache replacement policies. To this end, we introduce three metrics, evict, fill, and mls that capture aspects of cache-state predictability. A thorough analysis of the LRU, FIFO, MRU, and PLRU policies yields the respective values under these metrics. To the best of our knowledge, this work presents the first quantitative, analytical results for the predictability of replacement policies. Our results support empirical evidence in static cache analysis.</description><subject>Empirical analysis</subject><subject>Policies</subject><issn>0922-6443</issn><issn>1573-1383</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2007</creationdate><recordtype>article</recordtype><sourceid>BENPR</sourceid><recordid>eNpdkEtLAzEUhYMoWEd_gLsBwV303tzMpFlK8QUFN3UdMmmiKfMymS76751SV67OWXwcDh9jtwgPCKAeM6KQyOfKNZDgdMYWWCniSEs6ZwvQQvBaSrpkVznvAKBCpReMNrGL_Vc5Jr-NbrJNbON0KIdQOuu-fZn82FrnO99P5Ti00UWfr9lFsG32N39ZsM-X583qja8_Xt9XT2vuCOTESSJU1Gx1qBQA6qZxQUintBJbkHJZ1VpYFMIGbDQJUsEvNVbeN_NZrWoq2P1pd0zDz97nyXQxO9-2tvfDPhsCJNS1mMG7f-Bu2Kd-_maEqLQEoFlFwfBEuTTknHwwY4qdTQeDYI4SzUmiOdajREP0C3hdYi0</recordid><startdate>20071101</startdate><enddate>20071101</enddate><creator>Reineke, Jan</creator><creator>Grund, Daniel</creator><creator>Berg, Christoph</creator><creator>Wilhelm, Reinhard</creator><general>Springer Nature B.V</general><scope>AAYXX</scope><scope>CITATION</scope><scope>8FE</scope><scope>8FG</scope><scope>AFKRA</scope><scope>ARAPS</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>P5Z</scope><scope>P62</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>20071101</creationdate><title>Timing predictability of cache replacement policies</title><author>Reineke, Jan ; Grund, Daniel ; Berg, Christoph ; Wilhelm, Reinhard</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c304t-341053bd9f570019bbcf24c7972d04485692a122af1b93237fe8915eeb0929763</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2007</creationdate><topic>Empirical analysis</topic><topic>Policies</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Reineke, Jan</creatorcontrib><creatorcontrib>Grund, Daniel</creatorcontrib><creatorcontrib>Berg, Christoph</creatorcontrib><creatorcontrib>Wilhelm, Reinhard</creatorcontrib><collection>CrossRef</collection><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>ProQuest Central UK/Ireland</collection><collection>Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>Advanced Technologies &amp; Aerospace Database</collection><collection>ProQuest Advanced Technologies &amp; Aerospace Collection</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Real-time systems</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Reineke, Jan</au><au>Grund, Daniel</au><au>Berg, Christoph</au><au>Wilhelm, Reinhard</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Timing predictability of cache replacement policies</atitle><jtitle>Real-time systems</jtitle><date>2007-11-01</date><risdate>2007</risdate><volume>37</volume><issue>2</issue><spage>99</spage><epage>122</epage><pages>99-122</pages><issn>0922-6443</issn><eissn>1573-1383</eissn><abstract>Hard real-time systems must obey strict timing constraints. Therefore, one needs to derive guarantees on the worst-case execution times of a system’s tasks. In this context, predictable behavior of system components is crucial for the derivation of tight and thus useful bounds. This paper presents results about the predictability of common cache replacement policies. To this end, we introduce three metrics, evict, fill, and mls that capture aspects of cache-state predictability. A thorough analysis of the LRU, FIFO, MRU, and PLRU policies yields the respective values under these metrics. To the best of our knowledge, this work presents the first quantitative, analytical results for the predictability of replacement policies. Our results support empirical evidence in static cache analysis.</abstract><cop>New York</cop><pub>Springer Nature B.V</pub><doi>10.1007/s11241-007-9032-3</doi><tpages>24</tpages></addata></record>
fulltext fulltext
identifier ISSN: 0922-6443
ispartof Real-time systems, 2007-11, Vol.37 (2), p.99-122
issn 0922-6443
1573-1383
language eng
recordid cdi_proquest_miscellaneous_30131962
source Springer Nature - Complete Springer Journals
subjects Empirical analysis
Policies
title Timing predictability of cache replacement policies
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-02-02T11%3A19%3A19IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Timing%20predictability%20of%20cache%20replacement%20policies&rft.jtitle=Real-time%20systems&rft.au=Reineke,%20Jan&rft.date=2007-11-01&rft.volume=37&rft.issue=2&rft.spage=99&rft.epage=122&rft.pages=99-122&rft.issn=0922-6443&rft.eissn=1573-1383&rft_id=info:doi/10.1007/s11241-007-9032-3&rft_dat=%3Cproquest_cross%3E30131962%3C/proquest_cross%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2259400357&rft_id=info:pmid/&rfr_iscdi=true