{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,24]],"date-time":"2025-09-24T10:02:31Z","timestamp":1758708151440,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":53,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,7,24]],"date-time":"2017-07-24T00:00:00Z","timestamp":1500854400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CNS-1553510, CCF-1439084"],"award-info":[{"award-number":["CNS-1553510, CCF-1439084"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,7,24]]},"DOI":"10.1145\/3087556.3087586","type":"proceedings-article","created":{"date-parts":[[2017,7,20]],"date-time":"2017-07-20T17:51:38Z","timestamp":1500573098000},"page":"339-350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Provably Efficient Scheduling of Cache-oblivious Wavefront Algorithms"],"prefix":"10.1145","author":[{"given":"Rezaul","family":"Chowdhury","sequence":"first","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pramod","family":"Ganapathi","sequence":"additional","affiliation":[{"name":"Stony Brook University, Stony Brook, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yuan","family":"Tang","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jesmin Jahan","family":"Tithi","sequence":"additional","affiliation":[{"name":"Intel Corporation, Santa Clara, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Comet Supercomputing Cluster. http:\/\/www.sdsc.edu\/support\/user_guides\/comet.html. (2016).  Comet Supercomputing Cluster. http:\/\/www.sdsc.edu\/support\/user_guides\/comet.html. (2016)."},{"key":"e_1_3_2_1_2_1","unstructured":"PAPI-5.3. http:\/\/icl.cs.utk.edu\/papi\/index.html. (2016).  PAPI-5.3. http:\/\/icl.cs.utk.edu\/papi\/index.html. (2016)."},{"key":"e_1_3_2_1_3_1","unstructured":"Stampede Supercomputing Cluster. https:\/\/www.tacc.utexas.edu\/stampede\/. (2016).  Stampede Supercomputing Cluster. https:\/\/www.tacc.utexas.edu\/stampede\/. (2016)."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2807591.2807597"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"Kunal Agrawal Charles E Leiserson and Jim Sukha. 2010. Executing task graphs using work-stealing. In IPDPS. 1--12.  Kunal Agrawal Charles E Leiserson and Jim Sukha. 2010. Executing task graphs using work-stealing. In IPDPS. 1--12.","DOI":"10.1109\/IPDPS.2010.5470403"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/640075.640077"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"crossref","unstructured":"Michael A Bender Roozbeh Ebrahimi Jeremy T Fineman Golnaz Ghasemiesfeh Rob Johnson and Samuel McCauley. 2014. Cache-adaptive algorithms. In SODA. 958--971.  Michael A Bender Roozbeh Ebrahimi Jeremy T Fineman Golnaz Ghasemiesfeh Rob Johnson and Samuel McCauley. 2014. Cache-adaptive algorithms. In SODA. 958--971.","DOI":"10.1137\/1.9781611973402.71"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Guy E Blelloch Jeremy T Fineman Phillip B Gibbons and Harsha Vardhan Simhadri. 2011. Scheduling irregular parallel computations on hierarchical caches. In SPAA. 355--366.  Guy E Blelloch Jeremy T Fineman Phillip B Gibbons and Harsha Vardhan Simhadri. 2011. Scheduling irregular parallel computations on hierarchical caches. In SPAA. 355--366.","DOI":"10.1145\/1989493.1989553"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324234"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1379022.1375595"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/321812.321815"},{"key":"e_1_3_2_1_12_1","first-page":"58","article-title":"Cache efficient simple dynamic programming","volume":"49","author":"Cherng Cary","year":"2005","journal-title":"AofA DMTCS."},{"key":"e_1_3_2_1_13_1","unstructured":"Rezaul Chowdhury. 2007. Cache-efficient Algorithms and Data Structures: Theory and Experimental Evaluation. Ph.D. Dissertation. Department of Computer Sciences The University of Texas at Austin.  Rezaul Chowdhury. 2007. Cache-efficient Algorithms and Data Structures: Theory and Experimental Evaluation. Ph.D. Dissertation. Department of Computer Sciences The University of Texas at Austin."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/2851141.2851167"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1109557.1109622"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1378533.1378574"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-010-9273-8"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2013.04.008"},{"key":"e_1_3_2_1_19_1","unstructured":"Thomas Cormen Charles Leiserson Ronald Rivest and Clifford Stein. 2009. Introduction to Algorithms. MIT press.  Thomas Cormen Charles Leiserson Ronald Rivest and Clifford Stein. 2009. Introduction to Algorithms. MIT press."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626497000383"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW.2013.93"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511790492"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"crossref","unstructured":"Robert W Floyd. 1962. Algorithm 97: shortest path. CACM (1962) 5(6):345.  Robert W Floyd. 1962. Algorithm 97: shortest path. CACM (1962) 5(6):345.","DOI":"10.1145\/367766.368168"},{"volume-title":"40th FOCS. 285--297.","author":"Frigo Matteo","key":"e_1_3_2_1_24_1"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90101-1"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.1994.1053"},{"key":"e_1_3_2_1_27_1","unstructured":"Pramod Ganapathi. 2016. Automatic Discovery of Efficient Divide-&-Conquer Algorithms for Dynamic Programming Problems. Ph.D. Dissertation. Department of Computer Science Stony Brook University.  Pramod Ganapathi. 2016. Automatic Discovery of Efficient Divide-&-Conquer Algorithms for Dynamic Programming Problems. Ph.D. Dissertation. Department of Computer Science Stony Brook University."},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1988783.1988790"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2001.924976"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Tobias Grosser Armin Groesslinger and Christian Lengauer. 2012. Polly-performing polyhedral optimizations on a low-level intermediate representation. PPL 22(04) (2012).  Tobias Grosser Armin Groesslinger and Christian Lengauer. 2012. Polly-performing polyhedral optimizations on a low-level intermediate representation. PPL 22(04) (2012).","DOI":"10.1142\/S0129626412500107"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/360825.360861"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2983993"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460833.1460872"},{"key":"e_1_3_2_1_35_1","unstructured":"Anany V Levitin. 2009. Introduction to Design & Analysis of Algorithms: For Anna University 2\/e. Pearson Education India.  Anany V Levitin. 2009. Introduction to Design & Analysis of Algorithms: For Anna University 2\/e. Pearson Education India."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-27866-5_133"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Preeti Ranjan Panda Hiroshi Nakamura Nikil D Dutt and Alexandru Nicolau. 1999. Augmenting loop tiling with data alignment for improved cache performance. Computers IEEE Transactions on (1999) 48(2):142--149.  Preeti Ranjan Panda Hiroshi Nakamura Nikil D Dutt and Alexandru Nicolau. 1999. Augmenting loop tiling with data alignment for improved cache performance. Computers IEEE Transactions on (1999) 48(2):142--149.","DOI":"10.1109\/12.752655"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"crossref","unstructured":"Louis-No\u00ebl Pouchet Uday Bondhugula C\u00e9dric Bastoul Albert Cohen J Ramanujam and P Sadayappan. 2010. Combined iterative and model-driven optimization in an automatic parallelization framework. In SC. 1--11.  Louis-No\u00ebl Pouchet Uday Bondhugula C\u00e9dric Bastoul Albert Cohen J Ramanujam and P Sadayappan. 2010. Combined iterative and model-driven optimization in an automatic parallelization framework. In SC. 1--11.","DOI":"10.1109\/SC.2010.14"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2076021.2048076"},{"key":"e_1_3_2_1_40_1","unstructured":"Raphael Reitzig. 2012. Automated Parallelisation of Dynamic Programming Recursions. Master's thesis. University of Kaiserslautern.  Raphael Reitzig. 2012. Automated Parallelisation of Dynamic Programming Recursions. Master's thesis. University of Kaiserslautern."},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2160910.2160912"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TASSP.1978.1163055"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPASS.2000.842294"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"crossref","unstructured":"Shanjiang Tang Ce Yu Jizhou Sun Bu-Sung Lee Tao Zhang Zhen Xu and Huabei Wu. 2012. EasyPDP: an efficient parallel dynamic programming runtime system for computational biology. TPDS (2012) 23(5):862--872.  Shanjiang Tang Ce Yu Jizhou Sun Bu-Sung Lee Tao Zhang Zhen Xu and Huabei Wu. 2012. EasyPDP: an efficient parallel dynamic programming runtime system for computational biology. TPDS (2012) 23(5):862--872.","DOI":"10.1109\/TPDS.2011.218"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"crossref","unstructured":"Yuan Tang Rezaul Chowdhury Bradley C Kuszmaul Chi-Keung Luk and Charles E Leiserson. 2011. The pochoir stencil compiler. In SPAA. 117--128.  Yuan Tang Rezaul Chowdhury Bradley C Kuszmaul Chi-Keung Luk and Charles E Leiserson. 2011. The pochoir stencil compiler. In SPAA. 117--128.","DOI":"10.1145\/1989493.1989508"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"crossref","unstructured":"Yuan Tang Ronghui You Haibin Kan Jesmin Jahan Tithi Pramod Ganapathi and Rezaul Chowdhury. 2014. Improving parallelism of recursive stencil computations without sacrificing cache performance. In 2nd WOSC. 1--7.  Yuan Tang Ronghui You Haibin Kan Jesmin Jahan Tithi Pramod Ganapathi and Rezaul Chowdhury. 2014. Improving parallelism of recursive stencil computations without sacrificing cache performance. In 2nd WOSC. 1--7.","DOI":"10.1145\/2686745.2686752"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2688500.2688514"},{"key":"e_1_3_2_1_48_1","unstructured":"Jesmin Jahan Tithi. 2015. Engineering High-performance Parallel Algorithms with Applications to Bioinformatics. Ph.D. Dissertation. State University of New York at Stony Brook ProQuest Dissertations Publishing.  Jesmin Jahan Tithi. 2015. Engineering High-performance Parallel Algorithms with Applications to Bioinformatics. Ph.D. Dissertation. State University of New York at Stony Brook ProQuest Dissertations Publishing."},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.107"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"crossref","unstructured":"George Tzenakis Angelos Papatriantafyllou Hans Vandierendonck Polyvios Pratikakis and Dimitrios S Nikolopoulos. 2013. BDDT: block-level dynamic dependence analysis for task-based parallelism. In APPT. 17--31.  George Tzenakis Angelos Papatriantafyllou Hans Vandierendonck Polyvios Pratikakis and Dimitrios S Nikolopoulos. 2013. BDDT: block-level dynamic dependence analysis for task-based parallelism. In APPT. 17--31.","DOI":"10.1007\/978-3-642-45293-2_2"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1145\/321105.321107"},{"volume-title":"Computational Biology: Maps, Sequences and Genomes","year":"1995","author":"Waterman Michael S","key":"e_1_3_2_1_52_1"},{"key":"e_1_3_2_1_53_1","unstructured":"Michael Edward Wolf. 1992. Improving Locality and Parallelism in Nested Loops. Ph.D. Dissertation. Stanford University.  Michael Edward Wolf. 1992. Improving Locality and Parallelism in Nested Loops. Ph.D. Dissertation. Stanford University."}],"event":{"name":"SPAA '17: 29th ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Washington DC USA","acronym":"SPAA '17"},"container-title":["Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087586","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087586","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3087556.3087586","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:14Z","timestamp":1750217414000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3087556.3087586"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,7,24]]},"references-count":53,"alternative-id":["10.1145\/3087556.3087586","10.1145\/3087556"],"URL":"https:\/\/doi.org\/10.1145\/3087556.3087586","relation":{},"subject":[],"published":{"date-parts":[[2017,7,24]]},"assertion":[{"value":"2017-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}