{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T17:15:02Z","timestamp":1769015702003,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,6,23]],"date-time":"2024-06-23T00:00:00Z","timestamp":1719100800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2319399"],"award-info":[{"award-number":["2319399"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2408925"],"award-info":[{"award-number":["2408925"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["2404036"],"award-info":[{"award-number":["2404036"]}],"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":[[2024,6,23]]},"DOI":"10.1145\/3649329.3657348","type":"proceedings-article","created":{"date-parts":[[2024,11,7]],"date-time":"2024-11-07T19:27:22Z","timestamp":1731007642000},"page":"1-6","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Execution Sequence Optimization for Processing In-Memory using Parallel Data Preparation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0450-695X","authenticated-orcid":false,"given":"Muhammad Rashedul Haq","family":"Rashed","sequence":"first","affiliation":[{"name":"University of Central Florida, Orlando, FL, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8522-4617","authenticated-orcid":false,"given":"Sven","family":"Thijssen","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-9122-1526","authenticated-orcid":false,"given":"Dominic","family":"Simon","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0354-2940","authenticated-orcid":false,"given":"Sumit","family":"Jha","sequence":"additional","affiliation":[{"name":"Florida International University, Miami, FL, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4183-6926","authenticated-orcid":false,"given":"Rickard","family":"Ewetz","sequence":"additional","affiliation":[{"name":"University of Central Florida, Orlando, FL, United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.2020.0085"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3085572"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature08940"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1038\/d41586-022-00997-5"},{"key":"e_1_3_2_1_5_1","volume-title":"The university of florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS), 38(1):1--25","author":"Davis T. A.","year":"2011","unstructured":"T. A. Davis and Y. Hu. The university of florida sparse matrix collection. ACM Transactions on Mathematical Software (TOMS), 38(1):1--25, 2011."},{"key":"e_1_3_2_1_6_1","first-page":"1","volume-title":"2018 IEEE ISCAS","author":"A.","year":"2018","unstructured":"A. Haj-Ali et al. Efficient algorithms for in-memory fixed point multiplication using magic. In 2018 IEEE ISCAS, pages 1--5. IEEE, 2018."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1090\/psapm\/006\/0084178"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.pecs.2022.101010"},{"key":"e_1_3_2_1_9_1","first-page":"802","volume-title":"Proceedings of the 46th ISCA","author":"Imani M.","year":"2019","unstructured":"M. Imani et al. Floatpim: In-memory acceleration of deep neural network training with high precision. In Proceedings of the 46th ISCA, pages 802--815, 2019."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCSII.2014.2357292"},{"key":"e_1_3_2_1_11_1","first-page":"1","volume-title":"DAC","author":"Li S.","year":"2016","unstructured":"S. Li et al. Pinatubo: A processing-in-memory architecture for bulk bitwise operations in emerging non-volatile memories. In DAC, pages 1--6. IEEE, 2016."},{"key":"e_1_3_2_1_12_1","unstructured":"A. Mishchenko et al. Abc: A system for sequential synthesis and verification. \"http:\/\/www.eecs.berkeley.edu\/alanmi\/abc\"."},{"key":"e_1_3_2_1_13_1","volume-title":"Quantum computing: progress and prospects","author":"E. National Academies of Sciences, Medicine, et al.","year":"2019","unstructured":"E. National Academies of Sciences, Medicine, et al. Quantum computing: progress and prospects. 2019."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1038\/s42256-022-00463-x"},{"key":"e_1_3_2_1_15_1","first-page":"1","volume-title":"Proceedings of the 41st IEEE\/ACM ICCAD","author":"M. R.","year":"2022","unstructured":"M. R. H. Rashed et al. Logic synthesis for digital in-memory computing. In Proceedings of the 41st IEEE\/ACM ICCAD, pages 1--9, 2022."},{"key":"e_1_3_2_1_16_1","volume-title":"IEEE TCAD","author":"M. R.","year":"2023","unstructured":"M. R. H. Rashed et al. Stream: Towards read-based in-memory computing for streaming based processing for data-intensive applications. IEEE TCAD, 2023."},{"key":"e_1_3_2_1_17_1","series-title":"SIAM Journal on scientific and statistical computing, 7(3):856--869","volume-title":"Gmres: A generalized minimal residual algorithm for solving nonsymmetric linear systems","author":"Saad Y.","year":"1986","unstructured":"Y. Saad and M. H. Schultz. Gmres: A generalized minimal residual algorithm for solving nonsymmetric linear systems. SIAM Journal on scientific and statistical computing, 7(3):856--869, 1986."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41565-020-0655-z"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISCA.2016.12"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41566-020-00754-y"},{"issue":"4","key":"e_1_3_2_1_21_1","first-page":"635","article-title":"Logic design within memristive memories using memristor-aided logic (magic)","volume":"15","author":"Talati N.","year":"2016","unstructured":"N. Talati et al. Logic design within memristive memories using memristor-aided logic (magic). IEEE TNANO, 15(4):635--650, 2016.","journal-title":"IEEE TNANO"},{"key":"e_1_3_2_1_22_1","first-page":"1129","volume-title":"Proceedings of the 59th ACM\/IEEE DAC","author":"Thijssen S.","year":"2022","unstructured":"S. Thijssen et al. Path: Evaluation of boolean logic using path-based in-memory computing. In Proceedings of the 59th ACM\/IEEE DAC, pages 1129--1134, 2022."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2015.7056056"}],"event":{"name":"DAC '24: 61st ACM\/IEEE Design Automation Conference","location":"San Francisco CA USA","acronym":"DAC '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE-CEDA","SIGBED ACM Special Interest Group on Embedded Systems"]},"container-title":["Proceedings of the 61st ACM\/IEEE Design Automation Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3657348","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3657348","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3657348","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:00Z","timestamp":1750295880000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3657348"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":23,"alternative-id":["10.1145\/3649329.3657348","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3657348","relation":{},"subject":[],"published":{"date-parts":[[2024,6,23]]},"assertion":[{"value":"2024-11-07","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}