{"id":"https://openalex.org/W7160629069","doi":"https://doi.org/10.48550/arxiv.2605.05471","title":"Beyond Static Policies: Exploring Dynamic Policy Selection for Single-Thread Performance Optimization","display_name":"Beyond Static Policies: Exploring Dynamic Policy Selection for Single-Thread Performance Optimization","publication_year":2026,"publication_date":"2026-05-06","ids":{"openalex":"https://openalex.org/W7160629069","doi":"https://doi.org/10.48550/arxiv.2605.05471"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.05471","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05471","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.05471","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135688646","display_name":"Yanxin Zhang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Zhang, Yanxin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135686832","display_name":"Ian McDougall","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"McDougall, Ian","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135661764","display_name":"Junnan Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Junnan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135684755","display_name":"Shayne Wadle","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wadle, Shayne","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135668871","display_name":"Vikas Singh","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Singh, Vikas","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5028943049","display_name":"Karthikeyan Sankaralingam","orcid":"https://orcid.org/0000-0002-8315-2389"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sankaralingam, Karthikeyan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"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.9458000063896179,"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.9458000063896179,"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.015799999237060547,"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/T10101","display_name":"Cloud Computing and Resource Management","score":0.005799999926239252,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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.6338000297546387},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.6255999803543091},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.5382000207901001},{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.48750001192092896},{"id":"https://openalex.org/keywords/performance-improvement","display_name":"Performance improvement","score":0.4092999994754791},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.3944000005722046}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8019000291824341},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.6338000297546387},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.6255999803543091},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.5382000207901001},{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.48750001192092896},{"id":"https://openalex.org/C2778915421","wikidata":"https://www.wikidata.org/wiki/Q3643177","display_name":"Performance improvement","level":2,"score":0.4092999994754791},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.3944000005722046},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.38839998841285706},{"id":"https://openalex.org/C93682380","wikidata":"https://www.wikidata.org/wiki/Q2025226","display_name":"Static timing analysis","level":2,"score":0.3878999948501587},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.3614000082015991},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.3490999937057495},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.31540000438690186},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3009999990463257},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2973000109195709},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.2687999904155731},{"id":"https://openalex.org/C149635348","wikidata":"https://www.wikidata.org/wiki/Q193040","display_name":"Embedded system","level":1,"score":0.2581999897956848}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.05471","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05471","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.05471","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.05471","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"For":[0],"over":[1],"a":[2,34,47,69,74,140,174,187,214],"decade,":[3],"processor":[4,76,175],"design":[5,26],"has":[6,28],"focused":[7],"on":[8],"implementing":[9],"sophisticated":[10],"policies":[11,39,83,184],"for":[12,112,132,217],"various":[13],"components":[14],"of":[15,38,78,101,135,144,156,177,203],"the":[16,59,125,157,168,204],"out-of-order":[17],"pipeline,":[18],"including":[19],"cache":[20,113],"replacement":[21,114],"and":[22,115,138,198],"prefetching.":[23,116],"The":[24],"prevailing":[25],"philosophy":[27],"been":[29],"to":[30,147,167,196,227],"build":[31],"processors":[32],"with":[33],"single,":[35],"static":[36,127],"selection":[37,212],"across":[40,93,108],"these":[41],"different":[42,51,55,64],"mechanisms.":[43],"This":[44],"paper":[45],"investigates":[46],"fundamental":[48],"question:":[49],"do":[50],"workloads,":[52],"or":[53],"even":[54],"execution":[56,99,136],"phases":[57,100,137,152],"within":[58],"same":[60],"workload,":[61],"benefit":[62],"from":[63,81],"policy":[65,110,128,211],"combinations?":[66],"We":[67],"present":[68],"comprehensive":[70],"analysis":[71],"exploring":[72],"whether":[73],"hypothetical":[75],"capable":[77,176],"dynamically":[79,178],"selecting":[80],"multiple":[82,109],"could":[84],"significantly":[85],"outperform":[86],"traditional":[87],"static-policy":[88],"processors.":[89],"Using":[90],"ChampSim-based":[91],"simulation":[92],"49":[94,158],"benchmarks":[95],"segmented":[96],"into":[97],"490":[98],"20M":[102],"instructions":[103],"each,":[104],"we":[105,171],"evaluate":[106],"performance":[107,122,131,201,220],"combinations":[111],"Our":[117],"findings":[118],"reveal":[119],"that":[120,173,209,222],"significant":[121],"headroom":[123],"exists:":[124],"best":[126],"achieves":[129],"optimal":[130],"only":[133],"19.18\\%":[134],"incurs":[139],"mean":[141,191],"IPC":[142,164,192],"loss":[143,165,193],"1.54\\%":[145,195],"compared":[146],"an":[148],"oracle.":[149,169],"Moreover,":[150],"85":[151],"(17.35\\%),":[153],"spanning":[154],"14":[155],"applications,":[159],"exhibit":[160],"more":[161],"than":[162],"2.5\\%":[163],"relative":[166],"Furthermore,":[170],"demonstrate":[172],"switching":[179],"between":[180],"two":[181],"carefully":[182],"chosen":[183],"can":[185],"achieve":[186],"13.6$\\times$":[188],"reduction":[189],"in":[190],"(from":[194],"0.11\\%)":[197],"match":[199],"oracle":[200],"52.65\\%":[202],"time.":[205],"These":[206],"results":[207],"suggest":[208],"dynamic":[210],"represents":[213],"promising":[215],"avenue":[216],"unlocking":[218],"single-thread":[219],"improvements":[221],"have":[223],"become":[224],"increasingly":[225],"difficult":[226],"achieve.":[228]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-09T00:00:00"}