{"id":"https://openalex.org/W4253783080","doi":"https://doi.org/10.1109/micro.2003.1253193","title":"Generational cache management of code traces in dynamic optimization systems","display_name":"Generational cache management of code traces in dynamic optimization systems","publication_year":2003,"publication_date":"2003-01-01","ids":{"openalex":"https://openalex.org/W4253783080","doi":"https://doi.org/10.1109/micro.2003.1253193"},"language":"en","primary_location":{"id":"doi:10.1109/micro.2003.1253193","is_oa":false,"landing_page_url":"https://doi.org/10.1109/micro.2003.1253193","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 36th Annual IEEE/ACM International Symposium on Microarchitecture, 2003. MICRO-36.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5046756907","display_name":"Kim Hazelwood","orcid":"https://orcid.org/0000-0002-2713-8507"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Hazelwood","raw_affiliation_strings":["Harvard University","Division of Engineering and Applied Sciences, Harvard University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Division of Engineering and Applied Sciences, Harvard University, USA","institution_ids":["https://openalex.org/I136199984"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058599127","display_name":"Michael D. Smith","orcid":"https://orcid.org/0000-0001-6844-7923"},"institutions":[{"id":"https://openalex.org/I136199984","display_name":"Harvard University","ror":"https://ror.org/03vek6s52","country_code":"US","type":"education","lineage":["https://openalex.org/I136199984"]},{"id":"https://openalex.org/I2801851002","display_name":"Harvard University Press","ror":"https://ror.org/006v7bf86","country_code":"US","type":"other","lineage":["https://openalex.org/I136199984","https://openalex.org/I2801851002"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M.D. Smith","raw_affiliation_strings":["Harvard University","Division of Engineering and Applied Sciences, Harvard University, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Harvard University","institution_ids":["https://openalex.org/I2801851002"]},{"raw_affiliation_string":"Division of Engineering and Applied Sciences, Harvard University, USA","institution_ids":["https://openalex.org/I136199984"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8743,"has_fulltext":false,"cited_by_count":20,"citation_normalized_percentile":{"value":0.79332501,"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":"169","last_page":"179"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9983999729156494,"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.8615784645080566},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7591453790664673},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7143404483795166},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.6569149494171143},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.6392116546630859},{"id":"https://openalex.org/keywords/smart-cache","display_name":"Smart Cache","score":0.578679084777832},{"id":"https://openalex.org/keywords/cache-coloring","display_name":"Cache coloring","score":0.578457236289978},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.5698825716972351},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5598270893096924},{"id":"https://openalex.org/keywords/unreachable-code","display_name":"Unreachable code","score":0.534101128578186},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.531994640827179},{"id":"https://openalex.org/keywords/dead-code","display_name":"Dead code","score":0.530426025390625},{"id":"https://openalex.org/keywords/redundant-code","display_name":"Redundant code","score":0.48439937829971313},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.48271533846855164},{"id":"https://openalex.org/keywords/page-cache","display_name":"Page cache","score":0.4484729766845703},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.40131014585494995},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.3195125460624695},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.2641987204551697},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2320210039615631}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8615784645080566},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7591453790664673},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7143404483795166},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.6569149494171143},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.6392116546630859},{"id":"https://openalex.org/C167713795","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"Smart Cache","level":5,"score":0.578679084777832},{"id":"https://openalex.org/C201148951","wikidata":"https://www.wikidata.org/wiki/Q5015976","display_name":"Cache coloring","level":4,"score":0.578457236289978},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.5698825716972351},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5598270893096924},{"id":"https://openalex.org/C50951305","wikidata":"https://www.wikidata.org/wiki/Q2482534","display_name":"Unreachable code","level":5,"score":0.534101128578186},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.531994640827179},{"id":"https://openalex.org/C47434764","wikidata":"https://www.wikidata.org/wiki/Q1770035","display_name":"Dead code","level":5,"score":0.530426025390625},{"id":"https://openalex.org/C151578736","wikidata":"https://www.wikidata.org/wiki/Q1251793","display_name":"Redundant code","level":4,"score":0.48439937829971313},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.48271533846855164},{"id":"https://openalex.org/C36340418","wikidata":"https://www.wikidata.org/wiki/Q7124288","display_name":"Page cache","level":5,"score":0.4484729766845703},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.40131014585494995},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3195125460624695},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.2641987204551697},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2320210039615631},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/micro.2003.1253193","is_oa":false,"landing_page_url":"https://doi.org/10.1109/micro.2003.1253193","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. 36th Annual IEEE/ACM International Symposium on Microarchitecture, 2003. MICRO-36.","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":18,"referenced_works":["https://openalex.org/W73255814","https://openalex.org/W1918432491","https://openalex.org/W2043344147","https://openalex.org/W2112053513","https://openalex.org/W2120342118","https://openalex.org/W2141157907","https://openalex.org/W2161261909","https://openalex.org/W2554187658","https://openalex.org/W4230001087","https://openalex.org/W4231002400","https://openalex.org/W4233075742","https://openalex.org/W4238502383","https://openalex.org/W4248121615","https://openalex.org/W4250948891","https://openalex.org/W6603001910","https://openalex.org/W6640272449","https://openalex.org/W6684040092","https://openalex.org/W6730163302"],"related_works":["https://openalex.org/W2161969548","https://openalex.org/W2036000779","https://openalex.org/W2112669344","https://openalex.org/W116913286","https://openalex.org/W4244016640","https://openalex.org/W3008325674","https://openalex.org/W1141223778","https://openalex.org/W1539844444","https://openalex.org/W2045218056","https://openalex.org/W179346248"],"abstract_inverted_index":{"A":[0],"dynamic":[1,62,70,162],"optimizer":[2],"is":[3],"a":[4,10,24,129,150,196],"runtime":[5],"software":[6],"system":[7],"that":[8,93,139],"groups":[9],"program's":[11,46],"instruction":[12],"sequences":[13],"into":[14,155],"traces,":[15,18,118],"optimizes":[16],"those":[17],"stores":[19],"the":[20,31,35,41,45,51,57,61,66,74,94,161,205],"optimized":[21,32],"traces":[22,168,176,190],"in":[23,34,50,56,141,160,181],"software-based":[25],"code":[26,33,36,52,84,99,117,137,167,189,197,212],"cache,":[27,152],"and":[28,54,96,127,174,202],"then":[29],"executes":[30],"cache.":[37],"To":[38],"maximize":[39],"performance,":[40],"vast":[42],"majority":[43],"of":[44,60,69,82,98,114,147],"execution":[47],"should":[48],"occur":[49],"cache":[53,85,100,131,198],"not":[55],"different":[58],"aspects":[59],"optimization":[63],"system.":[64],"In":[65,88],"past,":[67],"designers":[68],"optimizers":[71],"have":[72],"used":[73],"SPEC2000":[75],"benchmark":[76],"suite":[77],"to":[78,119],"justify":[79],"their":[80,171],"use":[81],"simple":[83],"management":[86,101,132],"schemes.":[87],"this":[89,186],"paper,":[90],"we":[91,105],"show":[92],"problem":[95],"importance":[97],"changes":[102],"dramatically":[103],"as":[104],"move":[106],"from":[107,195],"SPEC2000,":[108],"with":[109,177,209],"its":[110],"relatively":[111],"small":[112],"number":[113],"dynamically":[115],"generated":[116],"large":[120],"interactive":[121],"Windows":[122],"applications.":[123],"We":[124],"also":[125],"propose":[126],"evaluate":[128],"new":[130],"algorithm":[133,165],"based":[134,169],"on":[135,170],"generational":[136],"caches":[138],"results":[140],"an":[142],"average":[143],"miss":[144],"rate":[145],"reduction":[146],"18%":[148],"over":[149],"unified":[151],"which":[153],"translates":[154],"19%":[156],"fewer":[157],"instructions":[158],"spent":[159],"optimizer.":[163],"The":[164],"categorizes":[166],"expected":[172],"lifetimes":[173,179],"group":[175],"similar":[178],"together":[180],"separate":[182],"storage":[183],"areas.":[184],"Using":[185],"algorithm,":[187],"short-lived":[188],"can":[191],"easily":[192],"be":[193],"removed":[194],"without":[199,203],"introducing":[200],"fragmentation":[201],"suffering":[204],"performance":[206],"penalties":[207],"associated":[208],"evicting":[210],"long-lived":[211],"traces.":[213]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}