{"id":"https://openalex.org/W2328769609","doi":"https://doi.org/10.1109/hpca.2016.7446067","title":"Modeling cache performance beyond LRU","display_name":"Modeling cache performance beyond LRU","publication_year":2016,"publication_date":"2016-03-01","ids":{"openalex":"https://openalex.org/W2328769609","doi":"https://doi.org/10.1109/hpca.2016.7446067","mag":"2328769609"},"language":"en","primary_location":{"id":"doi:10.1109/hpca.2016.7446067","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpca.2016.7446067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on High Performance Computer Architecture (HPCA)","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"http://hdl.handle.net/1721.1/113093","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008156365","display_name":"Nathan Beckmann","orcid":"https://orcid.org/0000-0001-6301-714X"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Nathan Beckmann","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5023312480","display_name":"Daniel S\u00e1nchez","orcid":"https://orcid.org/0000-0002-2453-2904"},"institutions":[{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Daniel Sanchez","raw_affiliation_strings":["Massachusetts Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Massachusetts Institute of Technology","institution_ids":["https://openalex.org/I63966007"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5008156365"],"corresponding_institution_ids":["https://openalex.org/I63966007"],"apc_list":null,"apc_paid":null,"fwci":9.3102,"has_fulltext":false,"cited_by_count":49,"citation_normalized_percentile":{"value":0.98447772,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"225","last_page":"236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9923999905586243,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8673484325408936},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.8424668312072754},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.7650790214538574},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.5663986802101135},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5591931939125061},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.5542751550674438},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.5243231058120728},{"id":"https://openalex.org/keywords/spec#","display_name":"Spec#","score":0.5174182653427124},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.47027164697647095},{"id":"https://openalex.org/keywords/smart-cache","display_name":"Smart Cache","score":0.4497902989387512},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.4468124508857727},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.44331681728363037},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.42289769649505615},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.41824066638946533}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8673484325408936},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8424668312072754},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.7650790214538574},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.5663986802101135},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5591931939125061},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5542751550674438},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.5243231058120728},{"id":"https://openalex.org/C2778565505","wikidata":"https://www.wikidata.org/wiki/Q2207566","display_name":"Spec#","level":2,"score":0.5174182653427124},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.47027164697647095},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.4497902989387512},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.4468124508857727},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.44331681728363037},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.42289769649505615},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.41824066638946533},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/hpca.2016.7446067","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpca.2016.7446067","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE International Symposium on High Performance Computer Architecture (HPCA)","raw_type":"proceedings-article"},{"id":"pmh:oai:dspace.mit.edu:1721.1/113093","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/113093","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT Web Domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"}],"best_oa_location":{"id":"pmh:oai:dspace.mit.edu:1721.1/113093","is_oa":true,"landing_page_url":"http://hdl.handle.net/1721.1/113093","pdf_url":null,"source":{"id":"https://openalex.org/S4306400425","display_name":"DSpace@MIT (Massachusetts Institute of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I63966007","host_organization_name":"Massachusetts Institute of Technology","host_organization_lineage":["https://openalex.org/I63966007"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by-nc-sa","license_id":"https://openalex.org/licenses/cc-by-nc-sa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"MIT Web Domain","raw_type":"http://purl.org/eprint/type/ConferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":68,"referenced_works":["https://openalex.org/W1967648049","https://openalex.org/W1972541532","https://openalex.org/W1977959746","https://openalex.org/W1978201796","https://openalex.org/W1987225815","https://openalex.org/W1999786966","https://openalex.org/W2004301625","https://openalex.org/W2024717934","https://openalex.org/W2029577083","https://openalex.org/W2043557409","https://openalex.org/W2053362661","https://openalex.org/W2061574886","https://openalex.org/W2072753794","https://openalex.org/W2072873664","https://openalex.org/W2081358713","https://openalex.org/W2090994050","https://openalex.org/W2093941454","https://openalex.org/W2095258606","https://openalex.org/W2099257471","https://openalex.org/W2101308451","https://openalex.org/W2102709380","https://openalex.org/W2107223062","https://openalex.org/W2109432325","https://openalex.org/W2109562980","https://openalex.org/W2112686638","https://openalex.org/W2113235308","https://openalex.org/W2113520225","https://openalex.org/W2118518065","https://openalex.org/W2119234384","https://openalex.org/W2120629815","https://openalex.org/W2123325903","https://openalex.org/W2124173332","https://openalex.org/W2124350608","https://openalex.org/W2129381159","https://openalex.org/W2131490969","https://openalex.org/W2140590655","https://openalex.org/W2141332195","https://openalex.org/W2143773524","https://openalex.org/W2143835304","https://openalex.org/W2144954274","https://openalex.org/W2149412112","https://openalex.org/W2150139096","https://openalex.org/W2150181997","https://openalex.org/W2151326614","https://openalex.org/W2152529103","https://openalex.org/W2159793853","https://openalex.org/W2164705534","https://openalex.org/W2169660454","https://openalex.org/W2174102096","https://openalex.org/W2215383979","https://openalex.org/W2324320295","https://openalex.org/W2471657096","https://openalex.org/W2545500460","https://openalex.org/W2547815835","https://openalex.org/W2751555667","https://openalex.org/W2752779325","https://openalex.org/W3029601593","https://openalex.org/W3112784795","https://openalex.org/W3138609485","https://openalex.org/W3139860299","https://openalex.org/W3142886131","https://openalex.org/W4241057782","https://openalex.org/W6677772544","https://openalex.org/W6680681368","https://openalex.org/W6688017428","https://openalex.org/W6720307539","https://openalex.org/W6728936925","https://openalex.org/W6778437264"],"related_works":["https://openalex.org/W2808189470","https://openalex.org/W2073111925","https://openalex.org/W1977811592","https://openalex.org/W1593668660","https://openalex.org/W2366155859","https://openalex.org/W3048741691","https://openalex.org/W2093563397","https://openalex.org/W2552662970","https://openalex.org/W2109631284","https://openalex.org/W2315978852"],"abstract_inverted_index":{"Modern":[0],"processors":[1],"use":[2,27,158],"high-performance":[3,23,81,100,140],"cache":[4,17,42,52,96,164],"replacement":[5,82,101,114,127],"policies":[6,24,115,141],"that":[7],"outperform":[8],"traditional":[9],"alternatives":[10],"like":[11],"least-recently":[12],"used":[13],"(LRU).":[14],"Unfortunately,":[15],"current":[16],"models":[18,113],"do":[19],"not":[20],"capture":[21],"these":[22,55,84],"as":[25,116],"most":[26],"stack":[28,110],"distances,":[29,111],"which":[30],"are":[31,86],"inherently":[32],"tied":[33],"to":[34,57,64,88,157,161],"LRU":[35],"or":[36,71],"its":[37],"variants.":[38],"Accurate":[39],"predictions":[40,56],"of":[41,69,109,134],"performance":[43],"enable":[44],"many":[45],"optimizations":[46,85],"in":[47,62],"multicore":[48],"systems.":[49],"For":[50],"example,":[51],"partitioning":[53],"uses":[54,104],"divide":[58],"capacity":[59],"among":[60],"applications":[61],"order":[63],"maximize":[65],"performance,":[66],"guarantee":[67],"quality":[68],"service,":[70],"achieve":[72],"other":[73],"system":[74],"objectives.":[75],"Without":[76],"an":[77],"accurate":[78],"model":[79,97,124,130,160],"for":[80,99],"policies,":[83],"unavailable":[87],"modern":[89],"processors.":[90],"We":[91],"present":[92,151],"a":[93,152],"new":[94],"probabilistic":[95],"designed":[98],"policies.":[102,128],"It":[103],"absolute":[105],"reuse":[106],"distances":[107],"instead":[108],"and":[112,145],"abstract":[117],"ranking":[118],"functions.":[119],"These":[120],"innovations":[121],"let":[122],"us":[123],"arbitrary":[125],"age-based":[126],"Our":[129],"achieves":[131],"median":[132],"error":[133],"less":[135],"than":[136],"1%":[137],"across":[138],"several":[139],"on":[142],"both":[143],"synthetic":[144],"SPEC":[146],"CPU2006":[147],"benchmarks.":[148],"Finally,":[149],"we":[150],"case":[153],"study":[154],"showing":[155],"how":[156],"the":[159],"improve":[162],"shared":[163],"performance.":[165]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":10},{"year":2017,"cited_by_count":12},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}