{"id":"https://openalex.org/W2139082401","doi":"https://doi.org/10.1109/tc.2003.1183947","title":"Probabilistic miss equations: evaluating memory hierarchy performance","display_name":"Probabilistic miss equations: evaluating memory hierarchy performance","publication_year":2003,"publication_date":"2003-03-01","ids":{"openalex":"https://openalex.org/W2139082401","doi":"https://doi.org/10.1109/tc.2003.1183947","mag":"2139082401"},"language":"en","primary_location":{"id":"doi:10.1109/tc.2003.1183947","doi":"https://doi.org/10.1109/tc.2003.1183947","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1183947","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071884571","display_name":"Basilio B. Fraguela","orcid":"https://orcid.org/0000-0002-3438-5960","observed_orcids":["https://orcid.org/0000-0002-3438-5960"]},"institutions":[{"id":"https://openalex.org/I11019714","display_name":"Universidade da Coru\u00f1a","ror":"https://ror.org/01qckj285","country_code":"ES","type":"education","lineage":["https://openalex.org/I11019714"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"B.B. Fraguela","raw_affiliation_strings":["Universidade da Coru\u00f1a, Coruna, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade da Coru\u00f1a, Coruna, Spain","institution_ids":["https://openalex.org/I11019714"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5070686724","display_name":"Ram\u00f3n Doallo","orcid":"https://orcid.org/0000-0002-6011-3387","observed_orcids":["https://orcid.org/0000-0002-6011-3387"]},"institutions":[{"id":"https://openalex.org/I11019714","display_name":"Universidade da Coru\u00f1a","ror":"https://ror.org/01qckj285","country_code":"ES","type":"education","lineage":["https://openalex.org/I11019714"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"R. Doallo","raw_affiliation_strings":["Universidade da Coru\u00f1a, Coruna, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universidade da Coru\u00f1a, Coruna, Spain","institution_ids":["https://openalex.org/I11019714"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5113573576","display_name":"Emilio L. Zapata","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I82767444","display_name":"Universidad de M\u00e1laga","ror":"https://ror.org/036b2ww28","country_code":"ES","type":"education","lineage":["https://openalex.org/I82767444"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"E.L. Zapata","raw_affiliation_strings":["Department de Arquitectura de Computadores, Complejo Polit\u00e9cnico, Universidad de M\u00e1laga, Malaga, Spain"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department de Arquitectura de Computadores, Complejo Polit\u00e9cnico, Universidad de M\u00e1laga, Malaga, Spain","institution_ids":["https://openalex.org/I82767444"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":{"value":2645,"currency":"USD","value_usd":2645},"apc_paid":null,"fwci":2.7402,"has_fulltext":false,"cited_by_count":30,"citation_normalized_percentile":{"value":0.91016949,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":97},"biblio":{"volume":"52","issue":"3","first_page":"321","last_page":"336"},"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.9984999895095825,"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.9984999895095825,"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/T10363","display_name":"Low-power high-performance VLSI design","score":0.00019999999494757503,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":9.999999747378752e-05,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/set-associative-cache","display_name":"set-associative cache","score":0.8140000104904175},{"id":"https://openalex.org/keywords/lru-replacement-policy","display_name":"LRU replacement policy","score":0.9470000267028809},{"id":"https://openalex.org/keywords/nested-loops","display_name":"nested loops","score":0.8080000281333923},{"id":"https://openalex.org/keywords/processor-memory-performance-gap","display_name":"processor-memory performance gap","score":0.7360000014305115},{"id":"https://openalex.org/keywords/cache-performance-prediction","display_name":"cache performance prediction","score":0.5680000185966492},{"id":"https://openalex.org/keywords/program-optimization","display_name":"program optimization","score":0.8220000267028809}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.846458375453949},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.7713508605957031},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6234037280082703},{"id":"https://openalex.org/C31170391","wikidata":"https://www.wikidata.org/wiki/Q188619","display_name":"Hierarchy","level":2,"score":0.5574126839637756},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.5471287965774536},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5369147658348083},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5086039304733276},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4778934717178345},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.4709761142730713},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.3558697998523712},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3482389748096466},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.25238245725631714},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.20346692204475403},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.13889968395233154},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C34447519","wikidata":"https://www.wikidata.org/wiki/Q179522","display_name":"Market economy","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tc.2003.1183947","doi":"https://doi.org/10.1109/tc.2003.1183947","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tc.2003.1183947","pdf_url":null,"source":{"id":"https://openalex.org/S157670870","display_name":"IEEE Transactions on Computers","issn_l":"0018-9340","issn":["0018-9340","0016-9340","1557-9956","2326-3814"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["ccf-a","cwts-core","dongbi-a","jufo-3","norway-2","poland-140","russia-white-list-2"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Computers","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W112400010","https://openalex.org/W1489227727","https://openalex.org/W1562841074","https://openalex.org/W1585279792","https://openalex.org/W1843640069","https://openalex.org/W1977118386","https://openalex.org/W1980999196","https://openalex.org/W1991501286","https://openalex.org/W2002598467","https://openalex.org/W2008311319","https://openalex.org/W2022552750","https://openalex.org/W2027615723","https://openalex.org/W2028088660","https://openalex.org/W2032732648","https://openalex.org/W2060327922","https://openalex.org/W2065705265","https://openalex.org/W2098220211","https://openalex.org/W2100928955","https://openalex.org/W2103666812","https://openalex.org/W2115283682","https://openalex.org/W2117395866","https://openalex.org/W2119609467","https://openalex.org/W2140384194","https://openalex.org/W2144026549","https://openalex.org/W2147620657","https://openalex.org/W2158737060","https://openalex.org/W2159316256","https://openalex.org/W2167013139","https://openalex.org/W2170990025","https://openalex.org/W2244841219","https://openalex.org/W3004256893","https://openalex.org/W4231782387","https://openalex.org/W4237236552","https://openalex.org/W4237888150","https://openalex.org/W4241646948","https://openalex.org/W4249365149","https://openalex.org/W4249818463","https://openalex.org/W6980693441"],"related_works":["https://openalex.org/W7099538190","https://openalex.org/W1770732045","https://openalex.org/W2007712750","https://openalex.org/W1796231360","https://openalex.org/W2099216749","https://openalex.org/W2131771876","https://openalex.org/W7096174114","https://openalex.org/W2507640525","https://openalex.org/W26624998","https://openalex.org/W2144954274"],"abstract_inverted_index":{"The":[0,79],"increasing":[1],"gap":[2],"between":[3,102],"processor":[4],"and":[5,24,38,94,134],"main":[6],"memory":[7,14],"speeds":[8],"makes":[9,112],"the":[10,13,18,84,113,123,151],"role":[11],"of":[12,115,128],"hierarchy":[15],"behavior":[16,30],"in":[17,49,88],"system":[19],"performance":[20],"essential.":[21],"Both":[22,92],"hardware":[23],"software":[25],"techniques":[26],"to":[27,53,137,158],"improve":[28],"this":[29,50,108],"require":[31],"good":[32,47,126],"analysis":[33,114],"tools":[34],"that":[35],"help":[36],"predict":[37],"understand":[39],"such":[40],"behavior.":[41],"Analytical":[42],"modeling":[43,69],"arises":[44],"as":[45,98,100],"a":[46,66],"choice":[48],"field":[51],"due":[52],"its":[54,58,89,139,156],"high":[55],"speed":[56],"if":[57],"traditional":[59],"limited":[60],"precision":[61],"is":[62],"overcome.":[63],"We":[64],"present":[65],"modular":[67],"analytical":[68],"strategy":[70],"for":[71],"arbitrary":[72],"set-associative":[73],"caches":[74],"with":[75,118],"LRU":[76],"replacement":[77],"policy.":[78],"model":[80,124,152],"differs":[81],"from":[82],"all":[83],"previous":[85],"related":[86],"works":[87],"probabilistic":[90],"approach.":[91],"perfectly":[93],"nonperfectly":[95],"nested":[96],"loops":[97],"well":[99],"reuse":[101],"different":[103],"nests":[104],"are":[105],"considered":[106],"by":[107],"model,":[109],"so":[110],"it":[111],"complete":[116],"programs":[117],"regular":[119],"computations":[120],"feasible.":[121],"Moreover,":[122],"achieves":[125],"levels":[127],"accuracy":[129],"while":[130],"being":[131],"extremely":[132],"fast":[133],"flexible":[135],"enough":[136],"allow":[138],"extension.":[140],"Our":[141],"approach":[142],"has":[143,153],"been":[144],"extensively":[145],"validated":[146],"using":[147],"well-known":[148],"benchmarks.":[149],"Finally,":[150],"also":[154],"proven":[155],"ability":[157],"drive":[159],"code":[160],"optimizations":[161],"even":[162],"more":[163],"successfully":[164],"than":[165],"current":[166],"production":[167],"compilers.":[168]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2026-10-30T12:39:25.321706","created_date":"2016-06-24T00:00:00"}