{"id":"https://openalex.org/W2022985784","doi":"https://doi.org/10.1109/iccd.2010.5647608","title":"Insertion policy selection using Decision Tree Analysis","display_name":"Insertion policy selection using Decision Tree Analysis","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W2022985784","doi":"https://doi.org/10.1109/iccd.2010.5647608","mag":"2022985784"},"language":"en","primary_location":{"id":"doi:10.1109/iccd.2010.5647608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccd.2010.5647608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Computer Design","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/inria-00492972","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5070152284","display_name":"Samira Khan","orcid":"https://orcid.org/0000-0002-0300-3034"},"institutions":[{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samira Khan","raw_affiliation_strings":["Department of Computer Science, University of Technology, San Antonio, USA","Department of Computer Science University of Texas at San Antonio, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Technology, San Antonio, USA","institution_ids":[]},{"raw_affiliation_string":"Department of Computer Science University of Texas at San Antonio, USA","institution_ids":["https://openalex.org/I45438204"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100612822","display_name":"Daniel A. Jim\u00e9nez","orcid":"https://orcid.org/0000-0001-5658-4883"},"institutions":[{"id":"https://openalex.org/I9617848","display_name":"Universitat Polit\u00e8cnica de Catalunya","ror":"https://ror.org/03mb6wj31","country_code":"ES","type":"education","lineage":["https://openalex.org/I9617848"]},{"id":"https://openalex.org/I2799803557","display_name":"Barcelona Supercomputing Center","ror":"https://ror.org/05sd8tv96","country_code":"ES","type":"facility","lineage":["https://openalex.org/I2799803557","https://openalex.org/I9617848"]},{"id":"https://openalex.org/I45438204","display_name":"The University of Texas at San Antonio","ror":"https://ror.org/01kd65564","country_code":"US","type":"education","lineage":["https://openalex.org/I45438204"]}],"countries":["ES","US"],"is_corresponding":false,"raw_author_name":"Daniel A. Jimenez","raw_affiliation_strings":["Barcelona Supercomputing Center, Spain","Department of Computer Science University of Texas at San Antonio, USA"],"affiliations":[{"raw_affiliation_string":"Barcelona Supercomputing Center, Spain","institution_ids":["https://openalex.org/I9617848","https://openalex.org/I2799803557"]},{"raw_affiliation_string":"Department of Computer Science University of Texas at San Antonio, USA","institution_ids":["https://openalex.org/I45438204"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5070152284"],"corresponding_institution_ids":["https://openalex.org/I45438204"],"apc_list":null,"apc_paid":null,"fwci":1.5161,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.8337829,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"106","last_page":"111"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":1.0,"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":1.0,"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/T12808","display_name":"Ferroelectric and Negative Capacitance Devices","score":0.9997000098228455,"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9994999766349792,"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.8450198173522949},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8215557932853699},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.7234899997711182},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.6258629560470581},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.5603005886077881},{"id":"https://openalex.org/keywords/inefficiency","display_name":"Inefficiency","score":0.5505391359329224},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.5385594964027405},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.4449578523635864},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.4398476779460907},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4264722764492035},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.0845034122467041}],"concepts":[{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.8450198173522949},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8215557932853699},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.7234899997711182},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.6258629560470581},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.5603005886077881},{"id":"https://openalex.org/C2778869765","wikidata":"https://www.wikidata.org/wiki/Q6028363","display_name":"Inefficiency","level":2,"score":0.5505391359329224},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5385594964027405},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.4449578523635864},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.4398476779460907},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4264722764492035},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0845034122467041},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.0},{"id":"https://openalex.org/C175444787","wikidata":"https://www.wikidata.org/wiki/Q39072","display_name":"Microeconomics","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/iccd.2010.5647608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccd.2010.5647608","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE International Conference on Computer Design","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.173.1014","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.173.1014","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cava.cs.utsa.edu/pdfs/crc2010-khan.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.174.8134","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.174.8134","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://cava.cs.utsa.edu/pdfs/iccd2010_insertion_dist.pdf","raw_type":"text"},{"id":"pmh:oai:HAL:inria-00492972v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00492972","pdf_url":null,"source":{"id":"https://openalex.org/S4406922276","display_name":"INRIA a CCSD electronic archive server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JWAC 2010 - 1st JILP Worshop on Computer Architecture Competitions: cache replacement Championship, Jun 2010, Saint Malo, France","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:inria-00492972v1","is_oa":true,"landing_page_url":"https://inria.hal.science/inria-00492972","pdf_url":null,"source":{"id":"https://openalex.org/S4406922276","display_name":"INRIA a CCSD electronic archive server","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"JWAC 2010 - 1st JILP Worshop on Computer Architecture Competitions: cache replacement Championship, Jun 2010, Saint Malo, France","raw_type":"Conference papers"},"sustainable_development_goals":[{"score":0.7699999809265137,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1968029317","https://openalex.org/W2108117840","https://openalex.org/W2109292926","https://openalex.org/W2120629815","https://openalex.org/W2122108187","https://openalex.org/W2124350608","https://openalex.org/W2135089498","https://openalex.org/W2147122795","https://openalex.org/W2152356827","https://openalex.org/W2160996172","https://openalex.org/W4235218387","https://openalex.org/W4240197237","https://openalex.org/W6675903345"],"related_works":["https://openalex.org/W2114386333","https://openalex.org/W2086718556","https://openalex.org/W2012518269","https://openalex.org/W2066160958","https://openalex.org/W2167303720","https://openalex.org/W1965891727","https://openalex.org/W2146079099","https://openalex.org/W1496086148","https://openalex.org/W57688818","https://openalex.org/W1860107648"],"abstract_inverted_index":{"The":[0,15,57],"last-level":[1],"cache":[2,26,40,87,155,173],"(LLC)":[3],"mitigates":[4],"the":[5,19,39,64,72,75,82,86,112,116,128,133,148,154,187],"impact":[6,24],"of":[7,81,124],"long":[8,156],"memory":[9],"access":[10],"latencies":[11],"in":[12,18,38,45,115,132,137,153,174],"today's":[13],"microarchitectures.":[14],"insertion":[16,30,49,130],"policy":[17,31,50,70,180],"LLC":[20,76],"has":[21],"a":[22,163,166,175],"significant":[23],"on":[25],"efficiency.":[27],"A":[28],"fixed":[29],"can":[32],"allow":[33],"useless":[34],"blocks":[35],"to":[36,85,111,126,158],"remain":[37,152],"longer":[41],"than":[42],"necessary,":[43],"resulting":[44],"inefficiency.":[46],"We":[47,119],"introduce":[48],"selection":[51],"using":[52],"Decision":[53],"Tree":[54],"Analysis":[55],"(DTA).":[56],"technique":[58],"requires":[59],"minimal":[60],"hardware":[61],"modification":[62],"over":[63,186,203],"least-recently-used":[65],"(LRU)":[66],"replacement":[67,189],"policy.":[68,190],"This":[69],"uses":[71,181],"fact":[73],"that":[74],"filters":[77],"temporal":[78],"locality.":[79],"Many":[80],"lines":[83,142,151],"brought":[84],"are":[88,95,105,109],"never":[89],"accessed":[90],"again.":[91],"Even":[92],"if":[93],"they":[94,97,104,108],"reaccessed":[96],"do":[98],"not":[99],"experience":[100],"bursts,":[101],"but":[102],"rather":[103],"reused":[106,160],"when":[107],"near":[110],"LRU":[113,117,134,188],"position":[114,131],"stack.":[118,135],"use":[120],"decision":[121],"tree":[122],"analysis":[123],"multi-set-dueling":[125],"choose":[127],"optimal":[129],"Inserting":[136],"this":[138],"position,":[139],"zero":[140],"reuse":[141,150],"minimize":[143],"their":[144],"dead":[145],"time":[146],"while":[147],"non-zero":[149],"enough":[157],"be":[159],"and":[161,198],"avoid":[162],"miss.":[164],"For":[165],"1MB":[167],"16":[168],"way":[169],"set-associative":[170],"last":[171],"level":[172],"single":[176],"core":[177],"processor,":[178],"our":[179],"only":[182],"2,069":[183],"additional":[184],"bits":[185],"On":[191],"average":[192],"it":[193],"reduces":[194],"misses":[195],"by":[196],"5.16%":[197],"achieves":[199],"7.19%":[200],"IPC":[201],"improvement":[202],"LRU.":[204]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}