{"id":"https://openalex.org/W2564076424","doi":"https://doi.org/10.1145/3017992","title":"Some Mathematical Facts About Optimal Cache Replacement","display_name":"Some Mathematical Facts About Optimal Cache Replacement","publication_year":2016,"publication_date":"2016-12-16","ids":{"openalex":"https://openalex.org/W2564076424","doi":"https://doi.org/10.1145/3017992","mag":"2564076424"},"language":"en","primary_location":{"id":"doi:10.1145/3017992","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3017992","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3017992&type=pdf","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"http://dl.acm.org/ft_gateway.cfm?id=3017992&type=pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048383896","display_name":"Pierre Michaud","orcid":"https://orcid.org/0000-0001-7037-4014"},"institutions":[{"id":"https://openalex.org/I4210133778","display_name":"Centre Inria de l'Universit\u00e9 de Rennes","ror":"https://ror.org/04040yw90","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1326498283","https://openalex.org/I4210133778"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Pierre Michaud","raw_affiliation_strings":["Inria, RENNES Cedex","PACAP - Pushing Architecture and Compilation for Application Performance (Campus de Beaulieu 35042 Rennes cedex - France)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria, RENNES Cedex","institution_ids":["https://openalex.org/I4210133778"]},{"raw_affiliation_string":"PACAP - Pushing Architecture and Compilation for Application Performance (Campus de Beaulieu 35042 Rennes cedex - France)","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5048383896"],"corresponding_institution_ids":["https://openalex.org/I4210133778"],"apc_list":null,"apc_paid":null,"fwci":1.9216,"has_fulltext":true,"cited_by_count":18,"citation_normalized_percentile":{"value":0.8612401,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":"13","issue":"4","first_page":"1","last_page":"19"},"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.9998000264167786,"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.9998000264167786,"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.9990000128746033,"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.9961000084877014,"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/cache","display_name":"Cache","score":0.7283852100372314},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6332386136054993},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.5630471706390381},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.5351852774620056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3410690128803253},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.32604193687438965},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.30876901745796204},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.14501330256462097}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7283852100372314},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6332386136054993},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.5630471706390381},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.5351852774620056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3410690128803253},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.32604193687438965},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.30876901745796204},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.14501330256462097},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3017992","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3017992","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3017992&type=pdf","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},{"id":"pmh:oai:HAL:hal-01411156v2","is_oa":false,"landing_page_url":"https://inria.hal.science/hal-01411156","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Architecture and Code Optimization, 2016, 13 (4), ⟨10.1145/3017992⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"doi:10.1145/3017992","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3017992","pdf_url":"http://dl.acm.org/ft_gateway.cfm?id=3017992&type=pdf","source":{"id":"https://openalex.org/S26056741","display_name":"ACM Transactions on Architecture and Code Optimization","issn_l":"1544-3566","issn":["1544-3566","1544-3973"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Architecture and Code Optimization","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2564076424.pdf","grobid_xml":"https://content.openalex.org/works/W2564076424.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W139022163","https://openalex.org/W1487184349","https://openalex.org/W1564146033","https://openalex.org/W1647086036","https://openalex.org/W1855438859","https://openalex.org/W1963831729","https://openalex.org/W1968518156","https://openalex.org/W1974872983","https://openalex.org/W1976316975","https://openalex.org/W1985049706","https://openalex.org/W1985264830","https://openalex.org/W1987225815","https://openalex.org/W2006524576","https://openalex.org/W2032094184","https://openalex.org/W2043557409","https://openalex.org/W2061901770","https://openalex.org/W2067242943","https://openalex.org/W2072194234","https://openalex.org/W2143443573","https://openalex.org/W2162504096","https://openalex.org/W2164705534","https://openalex.org/W2515818068","https://openalex.org/W4234542536","https://openalex.org/W4239937081"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2544423928","https://openalex.org/W2052122378","https://openalex.org/W2152099439","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W1984163603"],"abstract_inverted_index":{"This":[0],"article":[1],"exposes":[2],"and":[3,28,54],"proves":[4],"some":[5],"mathematical":[6,37],"facts":[7,38],"about":[8,64],"optimal":[9,65],"cache":[10],"replacement":[11],"that":[12,47],"were":[13],"previously":[14],"unknown":[15],"or":[16],"not":[17],"proved":[18],"rigorously.":[19],"An":[20],"explicit":[21],"formula":[22],"is":[23],"obtained,":[24],"giving":[25],"OPT":[26,48,59],"hits":[27],"misses":[29],"as":[30],"a":[31,45,55],"function":[32],"of":[33],"past":[34],"references.":[35],"Several":[36],"are":[39,51],"derived":[40],"from":[41],"this":[42],"formula,":[43],"including":[44],"proof":[46],"miss":[49],"curves":[50],"always":[52],"convex,":[53],"new":[56],"algorithm":[57],"called":[58],"tokens":[60],",":[61],"for":[62],"reasoning":[63],"replacement.":[66]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":5}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}