{"id":"https://openalex.org/W2132620176","doi":"https://doi.org/10.1109/ispass.2003.1190246","title":"Memory reference reuse latency: Accelerated warmup for sampled microarchitecture simulation","display_name":"Memory reference reuse latency: Accelerated warmup for sampled microarchitecture simulation","publication_year":2003,"publication_date":"2003-10-01","ids":{"openalex":"https://openalex.org/W2132620176","doi":"https://doi.org/10.1109/ispass.2003.1190246","mag":"2132620176"},"language":"en","primary_location":{"id":"doi:10.1109/ispass.2003.1190246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispass.2003.1190246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS 2003.","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/A5011977996","display_name":"J.W. Haskins","orcid":null},"institutions":[{"id":"https://openalex.org/I66946132","display_name":"University of Maryland, College Park","ror":"https://ror.org/047s2c258","country_code":"US","type":"education","lineage":["https://openalex.org/I66946132"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"J.W. Haskins","raw_affiliation_strings":["Center for Computing Sciences, Bowie, MD, USA","Center for Comput. Sci., Bowie, MD, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Center for Computing Sciences, Bowie, MD, USA","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"Center for Comput. Sci., Bowie, MD, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5074818897","display_name":"Kevin Skadron","orcid":"https://orcid.org/0000-0002-8091-9302"},"institutions":[{"id":"https://openalex.org/I51556381","display_name":"University of Virginia","ror":"https://ror.org/0153tk833","country_code":"US","type":"education","lineage":["https://openalex.org/I51556381"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"K. Skadron","raw_affiliation_strings":["Department of Computer Science, University of Virginia, Charlottesville, VA, USA","University of Virginia'"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Virginia, Charlottesville, VA, USA","institution_ids":["https://openalex.org/I51556381"]},{"raw_affiliation_string":"University of Virginia'","institution_ids":["https://openalex.org/I51556381"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":8.3684,"has_fulltext":false,"cited_by_count":70,"citation_normalized_percentile":{"value":0.98470314,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"195","last_page":"203"},"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/T11181","display_name":"Advanced Data Storage Technologies","score":0.9997000098228455,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.996399998664856,"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.8623126149177551},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7718416452407837},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7202837467193604},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.7128353714942932},{"id":"https://openalex.org/keywords/memory-hierarchy","display_name":"Memory hierarchy","score":0.5802663564682007},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5364243388175964},{"id":"https://openalex.org/keywords/instructions-per-cycle","display_name":"Instructions per cycle","score":0.49441981315612793},{"id":"https://openalex.org/keywords/cache-pollution","display_name":"Cache pollution","score":0.48593297600746155},{"id":"https://openalex.org/keywords/cluster","display_name":"Cluster (spacecraft)","score":0.4689818024635315},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.4375230669975281},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.4309671223163605},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.3634282350540161},{"id":"https://openalex.org/keywords/central-processing-unit","display_name":"Central processing unit","score":0.1775732934474945}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8623126149177551},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7718416452407837},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7202837467193604},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.7128353714942932},{"id":"https://openalex.org/C2778100165","wikidata":"https://www.wikidata.org/wiki/Q1589327","display_name":"Memory hierarchy","level":3,"score":0.5802663564682007},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5364243388175964},{"id":"https://openalex.org/C156972235","wikidata":"https://www.wikidata.org/wiki/Q1443434","display_name":"Instructions per cycle","level":3,"score":0.49441981315612793},{"id":"https://openalex.org/C113166858","wikidata":"https://www.wikidata.org/wiki/Q5015981","display_name":"Cache pollution","level":5,"score":0.48593297600746155},{"id":"https://openalex.org/C164866538","wikidata":"https://www.wikidata.org/wiki/Q367351","display_name":"Cluster (spacecraft)","level":2,"score":0.4689818024635315},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.4375230669975281},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.4309671223163605},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.3634282350540161},{"id":"https://openalex.org/C49154492","wikidata":"https://www.wikidata.org/wiki/Q5300","display_name":"Central processing unit","level":2,"score":0.1775732934474945},{"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":2,"locations":[{"id":"doi:10.1109/ispass.2003.1190246","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ispass.2003.1190246","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2003 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS 2003.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.64.9553","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.64.9553","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.virginia.edu/~skadron/Papers/mrrl_ispass03.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.46000000834465027}],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W1838930658","https://openalex.org/W1865305164","https://openalex.org/W1990046344","https://openalex.org/W1993988399","https://openalex.org/W2013863826","https://openalex.org/W2032094184","https://openalex.org/W2048352387","https://openalex.org/W2079632486","https://openalex.org/W2101295899","https://openalex.org/W2107493680","https://openalex.org/W2110999128","https://openalex.org/W2136452714","https://openalex.org/W2145969784","https://openalex.org/W2153456949","https://openalex.org/W2154307647","https://openalex.org/W3110060933","https://openalex.org/W4214856315","https://openalex.org/W4237453740","https://openalex.org/W4250743708","https://openalex.org/W4253029824","https://openalex.org/W4253202538","https://openalex.org/W6680675138"],"related_works":["https://openalex.org/W2012518269","https://openalex.org/W2086718556","https://openalex.org/W2167303720","https://openalex.org/W2061075966","https://openalex.org/W2146079099","https://openalex.org/W1965891727","https://openalex.org/W1860107648","https://openalex.org/W15724499","https://openalex.org/W1496086148","https://openalex.org/W57688818"],"abstract_inverted_index":{"This":[0],"paper":[1],"proposes":[2],"to":[3,34,40,43,74,124,134,139,142,166,203],"speedup":[4,181],"sampled":[5],"microprocessor":[6],"simulations":[7],"by":[8,90,172,183,207],"reducing":[9],"warmup":[10,187],"times":[11,171],"without":[12],"sacrificing":[13],"simulation":[14,169],"accuracy.":[15],"It":[16],"exploiting":[17],"the":[18,22,35,44,47,96,116,159,178,204],"observation":[19],"that":[20,25,31,59],"of":[21,46,95,118,175,177,197],"memory":[23,97,110,127],"references":[24,30,98,123],"precede":[26,60],"a":[27,61,93,104,136],"sample":[28,62,105],"cluster,":[29],"occur":[32],"nearest":[33],"cluster":[36,48,63,141],"are":[37],"more":[38],"likely":[39],"be":[41,87],"germane":[42],"execution":[45],"itself.":[49],"Hence,":[50],"while":[51,190],"modeling":[52,92,156],"all":[53,210],"cache":[54,81,144,152,212],"and":[55,72,82,99,130,146,153,213],"branch":[56,83,147,154,214],"predictor":[57,84,148,155,215],"interactions":[58],"would":[64],"reliably":[65],"establish":[66],"their":[67],"state,":[68],"this":[69],"is":[70],"overkill":[71],"leads":[73],"long-running":[75],"simulations.":[76],"Instead,":[77],"accurately":[78],"establishing":[79],"simulated":[80],"state":[85],"can":[86],"accomplished":[88],"quickly":[89],"only":[91],"subset":[94],"control-flow":[100],"instructions":[101,120],"immediately":[102],"preceding":[103],"cluster.":[106],"Our":[107],"technique":[108],"measures":[109],"reference":[111],"reuse":[112],"latencies":[113],"(MRRLs)":[114],"-":[115,129],"number":[117],"completed":[119],"between":[121],"consecutive":[122],"each":[125,140],"unique":[126],"location":[128],"uses":[131],"these":[132],"data":[133],"choose":[135],"point":[137],"prior":[138],"engage":[143],"hierarchy":[145],"modeling.":[149],"By":[150],"starting":[151],"late":[157],"in":[158,195],"pre-cluster":[160,186,211],"instruction":[161],"stream,":[162],"we":[163],"were":[164],"able":[165],"reduce":[167],"overall":[168],"running":[170],"an":[173,192],"average":[174,193],"90.62%":[176],"maximum":[179],"potential":[180],"(accomplished":[182],"performing":[184],"no":[185],"at":[188],"all),":[189],"generating":[191],"error":[194],"IPC":[196,205],"less":[198],"than":[199],"1%,":[200],"both":[201],"relative":[202],"generated":[206],"warming":[208],"up":[209],"interactions.":[216]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}