{"id":"https://openalex.org/W2009031452","doi":"https://doi.org/10.1145/2247684.2247687","title":"Identifying optimal multicore cache hierarchies for loop-based parallel programs via reuse distance analysis","display_name":"Identifying optimal multicore cache hierarchies for loop-based parallel programs via reuse distance analysis","publication_year":2012,"publication_date":"2012-06-11","ids":{"openalex":"https://openalex.org/W2009031452","doi":"https://doi.org/10.1145/2247684.2247687","mag":"2009031452"},"language":"en","primary_location":{"id":"doi:10.1145/2247684.2247687","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2247684.2247687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness","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/A5081161562","display_name":"Meng-Ju Wu","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":true,"raw_author_name":"Meng-Ju Wu","raw_affiliation_strings":["University of Maryland at College Park","University of Maryland, at College Park"],"affiliations":[{"raw_affiliation_string":"University of Maryland at College Park","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland, at College Park","institution_ids":["https://openalex.org/I66946132"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042239243","display_name":"Donald Yeung","orcid":"https://orcid.org/0000-0003-0341-2644"},"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":"Donald Yeung","raw_affiliation_strings":["University of Maryland at College Park","University of Maryland, at College Park"],"affiliations":[{"raw_affiliation_string":"University of Maryland at College Park","institution_ids":["https://openalex.org/I66946132"]},{"raw_affiliation_string":"University of Maryland, at College Park","institution_ids":["https://openalex.org/I66946132"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5081161562"],"corresponding_institution_ids":["https://openalex.org/I66946132"],"apc_list":null,"apc_paid":null,"fwci":2.9211,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.90608334,"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":"2","last_page":"11"},"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.9988999962806702,"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/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.8554898500442505},{"id":"https://openalex.org/keywords/multi-core-processor","display_name":"Multi-core processor","score":0.8111286163330078},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7304860949516296},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7156722545623779},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.6140367388725281},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.516240119934082},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.4851149320602417},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.48257794976234436},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.4441753029823303},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.39376628398895264},{"id":"https://openalex.org/keywords/computer-architecture","display_name":"Computer architecture","score":0.32191240787506104},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1600707769393921}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8554898500442505},{"id":"https://openalex.org/C78766204","wikidata":"https://www.wikidata.org/wiki/Q555032","display_name":"Multi-core processor","level":2,"score":0.8111286163330078},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7304860949516296},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7156722545623779},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.6140367388725281},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.516240119934082},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.4851149320602417},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.48257794976234436},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.4441753029823303},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.39376628398895264},{"id":"https://openalex.org/C118524514","wikidata":"https://www.wikidata.org/wiki/Q173212","display_name":"Computer architecture","level":1,"score":0.32191240787506104},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1600707769393921},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/2247684.2247687","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2247684.2247687","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2012 ACM SIGPLAN Workshop on Memory Systems Performance and Correctness","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.645.8001","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.645.8001","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://maggini.eng.umd.edu/pub/mspc-2012.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W21782772","https://openalex.org/W1574846734","https://openalex.org/W1965100924","https://openalex.org/W1984624033","https://openalex.org/W2014538051","https://openalex.org/W2016842024","https://openalex.org/W2032616619","https://openalex.org/W2062296288","https://openalex.org/W2101181484","https://openalex.org/W2120368896","https://openalex.org/W2134633067","https://openalex.org/W2137675939","https://openalex.org/W2143670137","https://openalex.org/W2145021036","https://openalex.org/W2145871983","https://openalex.org/W2155131419","https://openalex.org/W2162935108","https://openalex.org/W2169875292","https://openalex.org/W2397454561","https://openalex.org/W2535359146","https://openalex.org/W2781554472","https://openalex.org/W4239813889"],"related_works":["https://openalex.org/W1979099492","https://openalex.org/W4205439893","https://openalex.org/W2061075966","https://openalex.org/W2147122795","https://openalex.org/W3147501184","https://openalex.org/W2167303720","https://openalex.org/W2046128376","https://openalex.org/W2268996566","https://openalex.org/W2038423975","https://openalex.org/W2363672756"],"abstract_inverted_index":{"Understanding":[0],"multicore":[1,64,76,84,119],"memory":[2,77],"behavior":[3],"is":[4,24,63],"crucial,":[5],"but":[6,52],"can":[7,54,70],"be":[8,55],"challenging":[9],"due":[10],"to":[11,48,87,116],"the":[12,131],"complex":[13],"cache":[14,90,120,133],"hierarchies":[15,134],"employed":[16],"in":[17,33,40],"modern":[18],"CPUs.":[19],"In":[20,79],"today's":[21],"hierarchies,":[22,121],"performance":[23],"determined":[25],"by":[26],"complicated":[27],"thread":[28],"interactions,":[29,51],"such":[30],"as":[31],"interference":[32],"shared":[34],"caches":[35],"and":[36,38,57,122,139],"replication":[37],"communication":[39],"private":[41],"caches.":[42],"Researchers":[43],"normally":[44],"perform":[45],"extensive":[46],"simulations":[47],"study":[49],"these":[50],"this":[53,80],"costly":[56],"not":[58],"very":[59],"insightful.":[60],"An":[61],"alternative":[62],"reuse":[65],"distance":[66],"(RD)":[67],"analysis,":[68],"which":[69,105],"provide":[71],"extremely":[72],"rich":[73],"information":[74],"about":[75],"behavior.":[78],"paper,":[81],"we":[82],"apply":[83],"RD":[85,106],"analysis":[86,107],"better":[88],"understand":[89],"system":[91],"design.":[92],"We":[93,111,127],"focus":[94],"on":[95],"loop-based":[96],"parallel":[97],"programs,":[98],"an":[99],"important":[100],"class":[101],"of":[102],"programs":[103],"for":[104],"provides":[108],"high":[109],"accuracy.":[110],"propose":[112],"a":[113],"novel":[114],"framework":[115],"identify":[117],"optimal":[118,132],"extract":[123],"several":[124],"new":[125],"insights.":[126],"also":[128],"characterize":[129],"how":[130],"vary":[135],"with":[136],"core":[137],"count":[138],"problem":[140],"size.":[141]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}