{"id":"https://openalex.org/W2023571387","doi":"https://doi.org/10.1109/hpcsim.2012.6266969","title":"Adapted discrete-based entropy cache replacement algorithm","display_name":"Adapted discrete-based entropy cache replacement algorithm","publication_year":2012,"publication_date":"2012-07-01","ids":{"openalex":"https://openalex.org/W2023571387","doi":"https://doi.org/10.1109/hpcsim.2012.6266969","mag":"2023571387"},"language":"en","primary_location":{"id":"doi:10.1109/hpcsim.2012.6266969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"},"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/A5067971630","display_name":"Filipe Montefusco Scoton","orcid":null},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":true,"raw_author_name":"Filipe Scoton","raw_affiliation_strings":["University of Sao Paulo, Brazil","University of S\u00e3o Paulo"],"affiliations":[{"raw_affiliation_string":"University of Sao Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]},{"raw_affiliation_string":"University of S\u00e3o Paulo","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5090404332","display_name":"Jorge Mamoru Kobayashi","orcid":null},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Jorge Kobayashi","raw_affiliation_strings":["University of Sao Paulo, Brazil","University of S\u00e3o Paulo"],"affiliations":[{"raw_affiliation_string":"University of Sao Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]},{"raw_affiliation_string":"University of S\u00e3o Paulo","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038631835","display_name":"M\u00e1rio Donato Marino","orcid":"https://orcid.org/0000-0001-8336-9150"},"institutions":[{"id":"https://openalex.org/I17974374","display_name":"Universidade de S\u00e3o Paulo","ror":"https://ror.org/036rp1748","country_code":"BR","type":"education","lineage":["https://openalex.org/I17974374"]}],"countries":["BR"],"is_corresponding":false,"raw_author_name":"Mario Donato Marino","raw_affiliation_strings":["University of Sao Paulo, Brazil","University of S\u00e3o Paulo"],"affiliations":[{"raw_affiliation_string":"University of Sao Paulo, Brazil","institution_ids":["https://openalex.org/I17974374"]},{"raw_affiliation_string":"University of S\u00e3o Paulo","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5067971630"],"corresponding_institution_ids":["https://openalex.org/I17974374"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.09396665,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"534","last_page":"540"},"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.9998999834060669,"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.9998999834060669,"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/T10502","display_name":"Advanced Memory and Neural Computing","score":0.9988999962806702,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9987999796867371,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.8552618026733398},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.728447675704956},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.697155237197876},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.6547955870628357},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6213862895965576},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5731453895568848},{"id":"https://openalex.org/keywords/entropy","display_name":"Entropy (arrow of time)","score":0.5567182302474976},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5494151711463928},{"id":"https://openalex.org/keywords/locality-of-reference","display_name":"Locality of reference","score":0.46280497312545776},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.380094051361084}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8552618026733398},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.728447675704956},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.697155237197876},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.6547955870628357},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6213862895965576},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5731453895568848},{"id":"https://openalex.org/C106301342","wikidata":"https://www.wikidata.org/wiki/Q4117933","display_name":"Entropy (arrow of time)","level":2,"score":0.5567182302474976},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5494151711463928},{"id":"https://openalex.org/C27602214","wikidata":"https://www.wikidata.org/wiki/Q1868547","display_name":"Locality of reference","level":3,"score":0.46280497312545776},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.380094051361084},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/hpcsim.2012.6266969","is_oa":false,"landing_page_url":"https://doi.org/10.1109/hpcsim.2012.6266969","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on High Performance Computing & Simulation (HPCS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1967537658","https://openalex.org/W1995875735","https://openalex.org/W2122108187","https://openalex.org/W2124350608","https://openalex.org/W2135089498","https://openalex.org/W2144650313","https://openalex.org/W2993383518"],"related_works":["https://openalex.org/W2147122795","https://openalex.org/W2061075966","https://openalex.org/W3147501184","https://openalex.org/W2167303720","https://openalex.org/W2268996566","https://openalex.org/W2109715593","https://openalex.org/W3161817247","https://openalex.org/W2007500636","https://openalex.org/W2012518269","https://openalex.org/W2068309140"],"abstract_inverted_index":{"It":[0],"is":[1,161,188],"fundamental":[2],"to":[3,10,19,91,148,163,190,198,224],"predict":[4],"cache":[5,21,30,107,132,150,177],"line":[6,22,31,96,108,133],"reuse":[7],"in":[8,39,60],"order":[9,18],"improve":[11],"miss":[12,186,221],"rates":[13,222],"and":[14,143,157,168,195,207],"consequently":[15],"performance.":[16],"In":[17,50],"estimate":[20,92],"reuse,":[23],"we":[24],"assume":[25],"that":[26,139,159,184],"a":[27,61,65,73,86,105],"sequence":[28,66],"of":[29,55,67,75,82,85,95,125,131,145,178,215],"addresses":[32],"can":[33,69],"be":[34,70],"treated":[35],"randomly":[36],"as":[37,44,72],"characters":[38,68],"an":[40,175,179],"arbitrary":[41],"language":[42],"such":[43],"proposed":[45],"by":[46,64,111,120,127,226],"the":[47,53,83,93,112,117,122,129,141,213],"Information":[48,113],"Theory.":[49],"this":[51],"theory,":[52],"occurrence":[54],"each":[56],"character":[57],"previously":[58],"occurred":[59],"message":[62],"composed":[63],"used":[71],"measurement":[74],"information":[76],"-":[77],"named":[78],"entropy.":[79],"The":[80],"computation":[81],"entropy":[84,119],"program":[87],"working":[88],"set":[89],"helps":[90],"chances":[94,130],"reuse.":[97,134],"We":[98,152],"propose":[99],"Adapted":[100],"Discrete-based":[101],"Entropy":[102,114],"Algorithm":[103],"(ADEA),":[104],"novel":[106],"replacement":[109],"inspired":[110],"which":[115],"measures":[116],"discrete":[118],"capturing":[121],"referential":[123],"locality":[124],"programs":[126],"estimating":[128],"Furthermore,":[135,212],"ADEA":[136,154,170],"presents":[137],"functions":[138,218],"control":[140],"essency":[142],"recency":[144],"memory":[146],"access":[147],"avoid":[149],"pinning.":[151,228],"present":[153],"circuit":[155],"complexity":[156],"show":[158,183],"it":[160],"comparable":[162],"other":[164],"implementations.":[165],"By":[166],"modeling":[167],"evaluating":[169],"using":[171],"Simple":[172],"Scalar":[173],"for":[174],"L2":[176],"OOO":[180],"processor,":[181],"results":[182],"ADEA's":[185,216],"rate":[187],"up":[189,223],"60%":[191],"lower":[192],"than":[193],"LRU":[194],"36%":[196],"compared":[197],"adaptive":[199],"policies":[200],"Least":[201],"Recently":[202],"Used":[203],"Insertion":[204,209],"Policy":[205,210],"(LIP)":[206],"Bimodal":[208],"(BIP).":[211],"use":[214],"decay":[217],"improves":[219],"its":[220],"46%":[225],"avoiding":[227]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}