{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:14:02Z","timestamp":1750220042975,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":26,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,23]],"date-time":"2023-07-23T00:00:00Z","timestamp":1690070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,23]]},"DOI":"10.1145\/3569951.3593600","type":"proceedings-article","created":{"date-parts":[[2023,9,10]],"date-time":"2023-09-10T15:34:03Z","timestamp":1694360043000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Parallelization of Dynamic Programming for Large Applications"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1495-2796","authenticated-orcid":false,"given":"Matilda","family":"Ferguson","sequence":"first","affiliation":[{"name":"Computer Science, Swarthmore College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-6863-1709","authenticated-orcid":false,"given":"Lila","family":"Fontes","sequence":"additional","affiliation":[{"name":"Computer Science, Swarthmore College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4209-448X","authenticated-orcid":false,"given":"Tia","family":"Newhall","sequence":"additional","affiliation":[{"name":"Computer Science, Swarthmore College, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,9,10]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1109\/JPROC.2022.3218057"},{"key":"e_1_3_2_1_2_1","volume-title":"An Efficient Parallelization Strategy for Dynamic Programming on GPU. In 2013 IEEE International Symposium on Parallel Distributed Processing, Workshops and Phd Forum.","author":"Berger Karl-Eduard","year":"2013","unstructured":"Karl-Eduard Berger and Francois Galea . 2013 . An Efficient Parallelization Strategy for Dynamic Programming on GPU. In 2013 IEEE International Symposium on Parallel Distributed Processing, Workshops and Phd Forum. Karl-Eduard Berger and Francois Galea. 2013. An Efficient Parallelization Strategy for Dynamic Programming on GPU. In 2013 IEEE International Symposium on Parallel Distributed Processing, Workshops and Phd Forum."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/ISSPIT.2010.5711746"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.46298\/dmtcs.3368"},{"key":"e_1_3_2_1_5_1","volume-title":"Effortless and Efficient Distributed Data-Partitioning in Linear Algebra. In 2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC).","author":"de Blas\u00a0Cart\u00f3n Carlos","year":"2010","unstructured":"Carlos de Blas\u00a0Cart\u00f3n , Arturo Gonzalez-Escribano , and Diego\u00a0 R. Llanos . 2010 . Effortless and Efficient Distributed Data-Partitioning in Linear Algebra. In 2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC). Carlos de Blas\u00a0Cart\u00f3n, Arturo Gonzalez-Escribano, and Diego\u00a0R. Llanos. 2010. Effortless and Efficient Distributed Data-Partitioning in Linear Algebra. In 2010 IEEE 12th International Conference on High Performance Computing and Communications (HPCC)."},{"key":"e_1_3_2_1_6_1","volume-title":"Dynamic programming on a shared-memory multiprocessor. Parallel Comput. 19, 1","author":"Edmonds Phil","year":"1993","unstructured":"Phil Edmonds , Eleanor Chu , and Alan George . 1993. Dynamic programming on a shared-memory multiprocessor. Parallel Comput. 19, 1 ( 1993 ). Phil Edmonds, Eleanor Chu, and Alan George. 1993. Dynamic programming on a shared-memory multiprocessor. Parallel Comput. 19, 1 (1993)."},{"key":"e_1_3_2_1_7_1","volume-title":"Data Transfer Matters for GPU Computing. In 2013 International Conference on Parallel and Distributed Systems.","author":"Fujii Yusuke","year":"2013","unstructured":"Yusuke Fujii , Takuya Azumi , Nobuhiko Nishio , Shinpei Kato , and Masato Edahiro . 2013 . Data Transfer Matters for GPU Computing. In 2013 International Conference on Parallel and Distributed Systems. Yusuke Fujii, Takuya Azumi, Nobuhiko Nishio, Shinpei Kato, and Masato Edahiro. 2013. Data Transfer Matters for GPU Computing. In 2013 International Conference on Parallel and Distributed Systems."},{"unstructured":"H. Nicholson A. Raza P. Chrysogelos A. Ailamaki. 2023. HetCache: Synergising NVMe Storage and GPU acceleration for Memory-Efficient Analytics. https:\/\/www.cidrdb.org\/cidr2023\/  H. Nicholson A. Raza P. Chrysogelos A. Ailamaki. 2023. HetCache: Synergising NVMe Storage and GPU acceleration for Memory-Efficient Analytics. https:\/\/www.cidrdb.org\/cidr2023\/","key":"e_1_3_2_1_8_1"},{"key":"e_1_3_2_1_9_1","volume-title":"Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT","author":"Han Bo","year":"2012","unstructured":"Bo Han and Yongquan Lu . 2012 \/09. Research on optimization and parallelization of Optimal Binary Search Tree using Dynamic Programming . In Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012). Atlantis Press, 229\u2013233. Bo Han and Yongquan Lu. 2012\/09. Research on optimization and parallelization of Optimal Binary Search Tree using Dynamic Programming. In Proceedings of the 2nd International Conference on Electronic & Mechanical Engineering and Information Technology (EMEIT 2012). Atlantis Press, 229\u2013233."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1145\/3055399.3055460"},{"volume-title":"Parallel and distributed algorithms for computational biology. Ph.\u00a0D. Dissertation","author":"Liu Weiguo","unstructured":"Weiguo Liu . 2006. Parallel and distributed algorithms for computational biology. Ph.\u00a0D. Dissertation . Nanyang Technological University , Singapore . Weiguo Liu. 2006. Parallel and distributed algorithms for computational biology. Ph.\u00a0D. Dissertation. Nanyang Technological University, Singapore.","key":"e_1_3_2_1_11_1"},{"key":"e_1_3_2_1_12_1","volume-title":"2003 Proceedings IEEE International Conference on Cluster Computing.","author":"Liu Weiguo","year":"2003","unstructured":"Weiguo Liu and Schmidt. 2003 . Parallel design pattern for computational biology and scientific computing applications . In 2003 Proceedings IEEE International Conference on Cluster Computing. Weiguo Liu and Schmidt. 2003. Parallel design pattern for computational biology and scientific computing applications. In 2003 Proceedings IEEE International Conference on Cluster Computing."},{"volume-title":"A Modern Primer on Processing in\u00a0Memory","author":"Mutlu Onur","unstructured":"Onur Mutlu , Saugata Ghose , Juan G\u00f3mez-Luna , and Rachata Ausavarungnirun . 2023. A Modern Primer on Processing in\u00a0Memory . Springer Nature Singapore , Singapore . Onur Mutlu, Saugata Ghose, Juan G\u00f3mez-Luna, and Rachata Ausavarungnirun. 2023. A Modern Primer on Processing in\u00a0Memory. Springer Nature Singapore, Singapore.","key":"e_1_3_2_1_13_1"},{"unstructured":"National Science Foundation. 2022. ACCESS Advanced Cyberinfrastructure Coordination Ecosystem: Services and Support. https:\/\/access-ci.org  National Science Foundation. 2022. ACCESS Advanced Cyberinfrastructure Coordination Ecosystem: Services and Support. https:\/\/access-ci.org","key":"e_1_3_2_1_14_1"},{"volume-title":"Algorithms and Architectures for Parallel Processing, Yang Xiang, Ivan Stojmenovic","author":"Nishida Kazufumi","unstructured":"Kazufumi Nishida , Koji Nakano , and Yasuaki Ito . 2012. Accelerating the Dynamic Programming for the Optimal Polygon Triangulation on the GPU . In Algorithms and Architectures for Parallel Processing, Yang Xiang, Ivan Stojmenovic , Bernady\u00a0O. Apduhan, Guojun Wang, Koji Nakano, and Albert Zomaya (Eds.). Springer Berlin Heidelberg , Berlin, Heidelberg. Kazufumi Nishida, Koji Nakano, and Yasuaki Ito. 2012. Accelerating the Dynamic Programming for the Optimal Polygon Triangulation on the GPU. In Algorithms and Architectures for Parallel Processing, Yang Xiang, Ivan Stojmenovic, Bernady\u00a0O. Apduhan, Guojun Wang, Koji Nakano, and Albert Zomaya (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg.","key":"e_1_3_2_1_15_1"},{"unstructured":"Suely Oliveira Leonardo Borges and M. Holzrichter. 1999. Analysis of Architecture Independent Parallel Gram-Schmidt Algorithms. (01 1999).  Suely Oliveira Leonardo Borges and M. Holzrichter. 1999. Analysis of Architecture Independent Parallel Gram-Schmidt Algorithms. (01 1999).","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","volume-title":"Analysis of different partitioning schemes for parallel Gram-Schmidt algorithms. Parallel Algorithms Appl. 14 (04","author":"Oliveira Suely","year":"2000","unstructured":"Suely Oliveira , Leonardo Borges , M Holzrichter , and T Soma . 2000. Analysis of different partitioning schemes for parallel Gram-Schmidt algorithms. Parallel Algorithms Appl. 14 (04 2000 ). Suely Oliveira, Leonardo Borges, M Holzrichter, and T Soma. 2000. Analysis of different partitioning schemes for parallel Gram-Schmidt algorithms. Parallel Algorithms Appl. 14 (04 2000)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1109\/71.819944"},{"unstructured":"Purdue University. 2021. Anvil Supercomputer. https:\/\/www.rcac.purdue.edu\/knowledge\/anvil  Purdue University. 2021. Anvil Supercomputer. https:\/\/www.rcac.purdue.edu\/knowledge\/anvil","key":"e_1_3_2_1_19_1"},{"unstructured":"Qureshi Mailthody Gelado Min Masood Park Xiong Newburn Vainbrand Chung Garland Dally Hwu. 2022. BaM: A Case for Enabling Fine-grain High Throughput GPU-Orchestrated Access to Storage. arXiv preprint v2. https:\/\/arxiv.org\/pdf\/2203.04910.pdf  Qureshi Mailthody Gelado Min Masood Park Xiong Newburn Vainbrand Chung Garland Dally Hwu. 2022. BaM: A Case for Enabling Fine-grain High Throughput GPU-Orchestrated Access to Storage. arXiv preprint v2. https:\/\/arxiv.org\/pdf\/2203.04910.pdf","key":"e_1_3_2_1_20_1"},{"key":"e_1_3_2_1_22_1","volume-title":"Overcoming the Memory Bottleneck. Scientific Computing World (February\/March","author":"Roe Robert","year":"2019","unstructured":"Robert Roe . 2019. Overcoming the Memory Bottleneck. Scientific Computing World (February\/March 2019 ). https:\/\/www.scientific-computing.com\/feature\/overcoming-memory-bottleneck Robert Roe. 2019. Overcoming the Memory Bottleneck. Scientific Computing World (February\/March 2019). https:\/\/www.scientific-computing.com\/feature\/overcoming-memory-bottleneck"},{"key":"e_1_3_2_1_23_1","volume-title":"On efficient parallel computations for some dynamic programming problems. Theoretical Computer Science 59, 3","author":"Rytter Wojciech","year":"1988","unstructured":"Wojciech Rytter . 1988. On efficient parallel computations for some dynamic programming problems. Theoretical Computer Science 59, 3 ( 1988 ). Wojciech Rytter. 1988. On efficient parallel computations for some dynamic programming problems. Theoretical Computer Science 59, 3 (1988)."},{"unstructured":"Cliff Saran. 2021. Nvidia targest datacentre memory bottleneck. https:\/\/www.computerweekly.com\/news\/252499172\/Nvidia-targets-datacentre-memory-bottleneck  Cliff Saran. 2021. Nvidia targest datacentre memory bottleneck. https:\/\/www.computerweekly.com\/news\/252499172\/Nvidia-targets-datacentre-memory-bottleneck","key":"e_1_3_2_1_24_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1109\/ElConRus51938.2021.9396489"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1016\/S0022-0000(75)80046-8"},{"doi-asserted-by":"crossref","unstructured":"Altaf Wani and Manzoor Ahmad. 2017. A Fast GPU Based Implementation of Optimal Binary Search Tree Using Dynamic Programming.  Altaf Wani and Manzoor Ahmad. 2017. A Fast GPU Based Implementation of Optimal Binary Search Tree Using Dynamic Programming.","key":"e_1_3_2_1_27_1","DOI":"10.1007\/978-981-10-6544-6_26"}],"event":{"sponsor":["SIGAPP ACM Special Interest Group on Applied Computing","SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"],"acronym":"PEARC '23","name":"PEARC '23: Practice and Experience in Advanced Research Computing","location":"Portland OR USA"},"container-title":["Practice and Experience in Advanced Research Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569951.3593600","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3569951.3593600","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:51Z","timestamp":1750183671000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3569951.3593600"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,23]]},"references-count":26,"alternative-id":["10.1145\/3569951.3593600","10.1145\/3569951"],"URL":"https:\/\/doi.org\/10.1145\/3569951.3593600","relation":{},"subject":[],"published":{"date-parts":[[2023,7,23]]},"assertion":[{"value":"2023-09-10","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}