{"id":"https://openalex.org/W3136309632","doi":"https://doi.org/10.1109/pact.2013.6618832","title":"PS-cache: an energy-efficient cache design for chip multiprocessors","display_name":"PS-cache: an energy-efficient cache design for chip multiprocessors","publication_year":2013,"publication_date":"2013-10-01","ids":{"openalex":"https://openalex.org/W3136309632","doi":"https://doi.org/10.1109/pact.2013.6618832","mag":"3136309632"},"language":"en","primary_location":{"id":"doi:10.1109/pact.2013.6618832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact.2013.6618832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques","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/A5043064742","display_name":"Youngjoon Jo","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Youngjoon Jo","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5017941444","display_name":"Michael Goldfarb","orcid":"https://orcid.org/0000-0002-6622-095X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Michael Goldfarb","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075916086","display_name":"Milind Kulkarni","orcid":"https://orcid.org/0000-0001-6827-345X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Milind Kulkarni","raw_affiliation_strings":["School of Electrical and Computer Engineering, Purdue University, USA"],"affiliations":[{"raw_affiliation_string":"School of Electrical and Computer Engineering, Purdue University, USA","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5043064742"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.33666637,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"407","last_page":"408"},"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.9993000030517578,"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.9993000030517578,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T12292","display_name":"Graph Theory and Algorithms","score":0.996999979019165,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"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.874686598777771},{"id":"https://openalex.org/keywords/simd","display_name":"SIMD","score":0.790010929107666},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7747882604598999},{"id":"https://openalex.org/keywords/tree-traversal","display_name":"Tree traversal","score":0.7180658578872681},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.5892937779426575},{"id":"https://openalex.org/keywords/implementation","display_name":"Implementation","score":0.4570380449295044},{"id":"https://openalex.org/keywords/locality","display_name":"Locality","score":0.44687020778656006},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.12741243839263916}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.874686598777771},{"id":"https://openalex.org/C150552126","wikidata":"https://www.wikidata.org/wiki/Q339387","display_name":"SIMD","level":2,"score":0.790010929107666},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7747882604598999},{"id":"https://openalex.org/C140745168","wikidata":"https://www.wikidata.org/wiki/Q1210082","display_name":"Tree traversal","level":2,"score":0.7180658578872681},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.5892937779426575},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.4570380449295044},{"id":"https://openalex.org/C2779808786","wikidata":"https://www.wikidata.org/wiki/Q6664603","display_name":"Locality","level":2,"score":0.44687020778656006},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.12741243839263916},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/pact.2013.6618832","is_oa":false,"landing_page_url":"https://doi.org/10.1109/pact.2013.6618832","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 22nd International Conference on Parallel Architectures and Compilation Techniques","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8799999952316284}],"awards":[],"funders":[{"id":"https://openalex.org/F4320309667","display_name":"Purdue Research Foundation","ror":"https://ror.org/007n03h88"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W1985239701","https://openalex.org/W1991780427","https://openalex.org/W2013156670","https://openalex.org/W2025442915","https://openalex.org/W2040281526","https://openalex.org/W2057623365","https://openalex.org/W2068306188","https://openalex.org/W2081188973","https://openalex.org/W2097921974","https://openalex.org/W2104814486","https://openalex.org/W2108556169","https://openalex.org/W2118031182","https://openalex.org/W2124861237","https://openalex.org/W2125338937","https://openalex.org/W2142761843","https://openalex.org/W2151224499","https://openalex.org/W2152365613","https://openalex.org/W2154900718","https://openalex.org/W2162726111","https://openalex.org/W2165558283","https://openalex.org/W2167988313","https://openalex.org/W2170577595","https://openalex.org/W3120740533","https://openalex.org/W3141704526","https://openalex.org/W4235486518","https://openalex.org/W6674878074","https://openalex.org/W6675933016"],"related_works":["https://openalex.org/W170547082","https://openalex.org/W2136735429","https://openalex.org/W2587876411","https://openalex.org/W2358332176","https://openalex.org/W4229950834","https://openalex.org/W1587123803","https://openalex.org/W2128075414","https://openalex.org/W1487545099","https://openalex.org/W3213145857","https://openalex.org/W2102102707"],"abstract_inverted_index":{"Repeated":[0],"tree":[1,77,142],"traversals":[2,29,47,82,92],"are":[3,99,147],"ubiquitous":[4],"in":[5,104],"many":[6],"domains":[7],"such":[8],"as":[9,115],"scientific":[10],"simulation,":[11],"data":[12],"mining":[13],"and":[14,22,122],"graphics.":[15],"Modern":[16],"commodity":[17],"processors":[18],"support":[19],"SIMD":[20,51,120,130],"instructions,":[21],"using":[23],"these":[24,41],"instructions":[25],"to":[26,35,53,101,136,149],"process":[27],"multiple":[28],"at":[30],"once":[31],"has":[32,69],"the":[33,54,89,105,129],"potential":[34],"provide":[36],"substantial":[37],"performance":[38],"improvements.":[39],"Unfortunately":[40],"algorithms":[42,165],"often":[43],"feature":[44],"highly":[45],"diverging":[46,133],"which":[48,79,93],"inhibit":[49],"efficient":[50,119],"utilization,":[52],"point":[55],"that":[56,91,124,166],"other,":[57],"less":[58],"profitable":[59],"sources":[60],"of":[61,132,152],"vectorization":[62,169],"must":[63],"be":[64],"exploited":[65],"instead.":[66],"Previous":[67],"work":[68],"proposed":[70],"traversal":[71,143],"splicing,":[72],"a":[73,116],"locality":[74],"transformation":[75],"for":[76,118],"traversals,":[78,134],"dynamically":[80],"reorders":[81],"based":[83,87],"on":[84,88,154],"previous":[85],"behavior,":[86],"insight":[90],"have":[94],"behaved":[95],"similarly":[96,103],"so":[97],"far":[98],"likely":[100],"behave":[102],"future.":[106],"In":[107],"this":[108,112],"work,":[109],"we":[110],"cast":[111],"dynamic":[113],"reordering":[114],"scheduling":[117],"execution,":[121],"show":[123],"it":[125],"can":[126,162],"dramatically":[127],"improve":[128],"utilization":[131],"close":[135],"ideal":[137],"utilization.":[138],"For":[139],"five":[140],"irregular":[141],"algorithms,":[144],"our":[145,160],"techniques":[146,161],"able":[148],"deliver":[150],"speedups":[151],"2.78":[153],"average":[155],"over":[156],"baseline":[157],"implementations.":[158],"Furthermore":[159],"effectively":[163],"SIMDize":[164],"prior,":[167],"manual":[168],"attempts":[170],"could":[171],"not.":[172]},"counts_by_year":[],"updated_date":"2025-11-25T21:42:39.735039","created_date":"2025-10-10T00:00:00"}