{"id":"https://openalex.org/W1976888542","doi":"https://doi.org/10.1145/2688500.2688514","title":"Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency","display_name":"Cache-oblivious wavefront: improving parallelism of recursive dynamic programming algorithms without losing cache-efficiency","publication_year":2015,"publication_date":"2015-01-24","ids":{"openalex":"https://openalex.org/W1976888542","doi":"https://doi.org/10.1145/2688500.2688514","mag":"1976888542"},"language":"en","primary_location":{"id":"doi:10.1145/2688500.2688514","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2688500.2688514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","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/A5101956627","display_name":"Yuan Tang","orcid":"https://orcid.org/0000-0001-6772-9427"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Yuan Tang","raw_affiliation_strings":["Fudan University, China"],"affiliations":[{"raw_affiliation_string":"Fudan University, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5015677036","display_name":"Ronghui You","orcid":"https://orcid.org/0000-0002-7608-4867"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ronghui You","raw_affiliation_strings":["Fudan University, China"],"affiliations":[{"raw_affiliation_string":"Fudan University, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025009140","display_name":"Haibin Kan","orcid":"https://orcid.org/0000-0003-3062-5004"},"institutions":[{"id":"https://openalex.org/I24943067","display_name":"Fudan University","ror":"https://ror.org/013q1eq08","country_code":"CN","type":"education","lineage":["https://openalex.org/I24943067"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Haibin Kan","raw_affiliation_strings":["Fudan University, China"],"affiliations":[{"raw_affiliation_string":"Fudan University, China","institution_ids":["https://openalex.org/I24943067"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026593207","display_name":"Jesmin Jahan Tithi","orcid":"https://orcid.org/0000-0002-2861-8393"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jesmin Jahan Tithi","raw_affiliation_strings":["Stony Brook University, USA"],"affiliations":[{"raw_affiliation_string":"Stony Brook University, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5002918693","display_name":"Pramod Ganapathi","orcid":"https://orcid.org/0000-0001-5090-4444"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Pramod Ganapathi","raw_affiliation_strings":["Stony Brook University, USA"],"affiliations":[{"raw_affiliation_string":"Stony Brook University, USA","institution_ids":["https://openalex.org/I59553526"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025290203","display_name":"Rezaul Chowdhury","orcid":"https://orcid.org/0000-0002-7022-5278"},"institutions":[{"id":"https://openalex.org/I59553526","display_name":"Stony Brook University","ror":"https://ror.org/05qghxh33","country_code":"US","type":"education","lineage":["https://openalex.org/I59553526"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Rezaul A. Chowdhury","raw_affiliation_strings":["Stony Brook University, USA"],"affiliations":[{"raw_affiliation_string":"Stony Brook University, USA","institution_ids":["https://openalex.org/I59553526"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5101956627"],"corresponding_institution_ids":["https://openalex.org/I24943067"],"apc_list":null,"apc_paid":null,"fwci":4.1988,"has_fulltext":false,"cited_by_count":27,"citation_normalized_percentile":{"value":0.94016401,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"205","last_page":"214"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","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/T10101","display_name":"Cloud Computing and Resource Management","score":0.9959999918937683,"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/computer-science","display_name":"Computer science","score":0.8604885935783386},{"id":"https://openalex.org/keywords/cache","display_name":"Cache","score":0.7355958223342896},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.7277005910873413},{"id":"https://openalex.org/keywords/cache-oblivious-algorithm","display_name":"Cache-oblivious algorithm","score":0.569707453250885},{"id":"https://openalex.org/keywords/cache-algorithms","display_name":"Cache algorithms","score":0.5441606044769287},{"id":"https://openalex.org/keywords/cache-invalidation","display_name":"Cache invalidation","score":0.484625905752182},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.4824591279029846},{"id":"https://openalex.org/keywords/stencil","display_name":"Stencil","score":0.45481622219085693},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4545745551586151},{"id":"https://openalex.org/keywords/cpu-cache","display_name":"CPU cache","score":0.31337666511535645},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13494083285331726},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1175016462802887}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8604885935783386},{"id":"https://openalex.org/C115537543","wikidata":"https://www.wikidata.org/wiki/Q165596","display_name":"Cache","level":2,"score":0.7355958223342896},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.7277005910873413},{"id":"https://openalex.org/C59687516","wikidata":"https://www.wikidata.org/wiki/Q5015938","display_name":"Cache-oblivious algorithm","level":5,"score":0.569707453250885},{"id":"https://openalex.org/C38556500","wikidata":"https://www.wikidata.org/wiki/Q13404475","display_name":"Cache algorithms","level":4,"score":0.5441606044769287},{"id":"https://openalex.org/C25536678","wikidata":"https://www.wikidata.org/wiki/Q5015977","display_name":"Cache invalidation","level":5,"score":0.484625905752182},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.4824591279029846},{"id":"https://openalex.org/C76752949","wikidata":"https://www.wikidata.org/wiki/Q7607499","display_name":"Stencil","level":2,"score":0.45481622219085693},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4545745551586151},{"id":"https://openalex.org/C189783530","wikidata":"https://www.wikidata.org/wiki/Q352090","display_name":"CPU cache","level":3,"score":0.31337666511535645},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13494083285331726},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1175016462802887},{"id":"https://openalex.org/C459310","wikidata":"https://www.wikidata.org/wiki/Q117801","display_name":"Computational science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2688500.2688514","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2688500.2688514","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":59,"referenced_works":["https://openalex.org/W76123042","https://openalex.org/W111165306","https://openalex.org/W120901648","https://openalex.org/W938539187","https://openalex.org/W1491838213","https://openalex.org/W1507039213","https://openalex.org/W1532867095","https://openalex.org/W1570895503","https://openalex.org/W1600463518","https://openalex.org/W1655990431","https://openalex.org/W1918193513","https://openalex.org/W1963695588","https://openalex.org/W1965081941","https://openalex.org/W1968013322","https://openalex.org/W1968020161","https://openalex.org/W1972200437","https://openalex.org/W1979457157","https://openalex.org/W1981032891","https://openalex.org/W1987010534","https://openalex.org/W1990061958","https://openalex.org/W2002209075","https://openalex.org/W2003798513","https://openalex.org/W2007572995","https://openalex.org/W2009570821","https://openalex.org/W2028637981","https://openalex.org/W2049960624","https://openalex.org/W2055253125","https://openalex.org/W2059310886","https://openalex.org/W2059898823","https://openalex.org/W2068448872","https://openalex.org/W2072725684","https://openalex.org/W2081422781","https://openalex.org/W2084002994","https://openalex.org/W2087817903","https://openalex.org/W2090843874","https://openalex.org/W2093357625","https://openalex.org/W2097909406","https://openalex.org/W2099281741","https://openalex.org/W2104342377","https://openalex.org/W2104734478","https://openalex.org/W2104861744","https://openalex.org/W2120833345","https://openalex.org/W2124931755","https://openalex.org/W2125955291","https://openalex.org/W2129471558","https://openalex.org/W2131264486","https://openalex.org/W2140917900","https://openalex.org/W2144031643","https://openalex.org/W2147127704","https://openalex.org/W2152971387","https://openalex.org/W2154786353","https://openalex.org/W2159560337","https://openalex.org/W2341171179","https://openalex.org/W2551937430","https://openalex.org/W2711285122","https://openalex.org/W3121778379","https://openalex.org/W3125826253","https://openalex.org/W4245668478","https://openalex.org/W4246219036"],"related_works":["https://openalex.org/W2098406302","https://openalex.org/W2121191383","https://openalex.org/W2538519144","https://openalex.org/W2373751233","https://openalex.org/W2408534334","https://openalex.org/W1505654810","https://openalex.org/W2109265242","https://openalex.org/W2046128376","https://openalex.org/W1860107648","https://openalex.org/W2088918039"],"abstract_inverted_index":{"State-of-the-art":[0],"cache-oblivious":[1],"parallel":[2],"algorithms":[3,37],"for":[4,79,156],"dynamic":[5,110],"programming":[6,111],"(DP)":[7],"problems":[8],"usually":[9],"guarantee":[10],"asymptotically":[11,193],"optimal":[12],"cache":[13,19,190,223],"performance":[14],"without":[15],"any":[16],"tuning":[17],"of":[18,43,54,107,131,153,174],"parameters,":[20],"but":[21],"they":[22],"often":[23],"fail":[24],"to":[25,62,104,144,167,181],"exploit":[26],"the":[27,32,41,52,66,72,93,97,129,186,220],"theoretically":[28],"best":[29],"parallelism":[30],"at":[31,51],"same":[33,221],"time.":[34],"While":[35],"these":[36],"achieve":[38],"cache-optimality":[39,94],"through":[40],"use":[42],"a":[44,105,149,198],"recursive":[45],"divide-and-conquer":[46],"(DAC)":[47],"strategy,":[48],"scheduling":[49,76],"tasks":[50,77],"granularity":[53],"task":[55],"dependency":[56,74,87],"introduces":[57],"artificial":[58,73],"dependencies":[59],"in":[60,204,213],"addition":[61],"those":[63],"arising":[64],"from":[65,142,160,178],"defining":[67],"recurrence":[68],"equations.":[69],"We":[70,100],"removed":[71],"by":[75,95,216,225],"ready":[78],"execution":[80],"as":[81,83,114],"soon":[82],"all":[84],"its":[85],"real":[86],"constraints":[88],"are":[89],"satisfied,":[90],"while":[91],"preserving":[92],"inheriting":[96],"DAC":[98],"strategy.":[99],"applied":[101],"our":[102,126],"approach":[103],"set":[106],"widely":[108],"known":[109],"problems,":[112],"such":[113],"Floyd-Warshall's":[115],"All-Pairs":[116],"Shortest":[117],"Paths,":[118],"Stencil,":[119],"and":[120,169,189,218],"LCS.":[121],"Theoretical":[122],"analyses":[123],"show":[124],"that":[125],"techniques":[127],"improve":[128],"span":[130,215],"2-way":[132],"DAC-based":[133],"Floyd":[134],"Warshall's":[135],"algorithm":[136],"on":[137,148,171],"an":[138],"$n$":[139,176],"node":[140],"graph":[141],"$Thn^2n$":[143],"$Thn$,":[145],"stencil":[146],"computations":[147],"$d$-dimensional":[150],"hypercubic":[151],"grid":[152],"width":[154],"$w$":[155],"$h$":[157],"time":[158],"steps":[159],"$Th(d^2":[161],"h)":[162],"w^":[163],"(d+2)":[164],"-":[165,200,209],"1$":[166],"$Thh$,":[168],"LCS":[170],"two":[172],"sequences":[173],"length":[175],"each":[177,184],"$Thn^_2":[179],"3$":[180],"$Thn$.":[182],"In":[183],"case,":[185],"total":[187],"work":[188],"complexity":[191],"remain":[192],"optimal.":[194],"Experimental":[195],"measurements":[196],"exhibit":[197],"$3$":[199],"$5$":[201],"times":[202,211],"improvement":[203,212],"absolute":[205],"running":[206],"time,":[207],"$10$":[208],"$20$":[210],"burdened":[214],"Cilkview,":[217],"approximately":[219],"L1/L2":[222],"misses":[224],"PAPI.":[226]},"counts_by_year":[{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":4},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}