{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:28:44Z","timestamp":1760711324050,"version":"3.37.3"},"reference-count":53,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,10,28]],"date-time":"2023-10-28T00:00:00Z","timestamp":1698451200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation (NSF)","doi-asserted-by":"publisher","award":["CCF-2126672,CCF-2144523 (CAREER),OAC-2209957,TI-2229304"],"award-info":[{"award-number":["CCF-2126672,CCF-2144523 (CAREER),OAC-2209957,TI-2229304"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,10,28]]},"DOI":"10.1109\/iccad57390.2023.10323760","type":"proceedings-article","created":{"date-parts":[[2023,11,30]],"date-time":"2023-11-30T18:58:45Z","timestamp":1701370725000},"page":"1-8","source":"Crossref","is-referenced-by-count":9,"title":["Invited Paper: Programming Dynamic Task Parallelism for Heterogeneous EDA Algorithms"],"prefix":"10.1109","author":[{"given":"Cheng-Hsiang","family":"Chiu","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison,Department of ECE,Madison,USA"}]},{"given":"Dian-Lun","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison,Department of ECE,Madison,USA"}]},{"given":"Tsung-Wei","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison,Department of ECE,Madison,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3007319"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2015.7372666"},{"key":"ref3","first-page":"1","article-title":"From rtl to cuda: A gpu acceleration flow for rtl simulation with batch stimulus","volume-title":"Proceedings of the 51st International Conference on Parallel Processing","author":"Lin"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.23919\/DATE56975.2023.10137050"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/3502181.3533714"},{"journal-title":"ACM\/IEEE DAC, 2022","first-page":"1388","article-title":"Efficient Timing Propagation with Simultaneous Structural and Pipeline Parallelisms: Late Breaking Results","key":"ref6"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643504"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643457"},{"journal-title":"ACM\/IEEE DAC, 2021","first-page":"715","article-title":"A Provably Good and Practically Efficient Algorithm for Common Path Pessimism Removal in Large Designs","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC49654.2021.9622872"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218750"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415631"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.2971531"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.23919\/DATE54114.2022.9774606"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW59300.2023.00150"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247942"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926348"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926380"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3082507"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00080"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194560"},{"key":"ref22","first-page":"2274","article-title":"Exploring hidden dimensions in accelerating convolutional neural networks","volume-title":"Proceedings of the 35th International Conference on Machine Learning","author":"Jia"},{"key":"ref23","first-page":"1","article-title":"Beyond data and model parallelism for deep neural networks","volume-title":"Proceedings of Machine Learning and Systems","author":"Jia"},{"key":"ref24","first-page":"103","article-title":"GPipe: Efficient Training of Giant Neural Networks using Pipeline Parallelism","author":"Huang","year":"2019","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/3605573.3605625"},{"issue":"11","key":"ref26","first-page":"3041","article-title":"Accelerating Large Sparse Neural Network Inference Using GPU Task Graph Parallelis","volume":"33","author":"Lin","year":"2022","journal-title":"IEEE TPDS"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85665-6_27"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06156-1_37"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS51040.2020.00018"},{"volume-title":"OpenMP","key":"ref30"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.07.003"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/MCSE.2013.98"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3148226.3148233"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/209937.209958"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3572848.3577509"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/2676870.2676883"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3104255"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00105"},{"journal-title":"IEEE\/ACM ICCAD, 2020","article-title":"A General-Purpose Parallel and Heterogeneous Task Programming System for VLSI CAD","author":"Huang","key":"ref39"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3025075"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3350537"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1002\/9781119332015.ch13"},{"volume-title":"OpenTimer","key":"ref43"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203853"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2834422"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1145\/3240508.3243654"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2897959"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062274"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2014.7001413"},{"key":"ref50","first-page":"758","article-title":"UI-Timer: An Ultra-Fast Clock Network Pessimism Removal Algorithm","year":"2014","journal-title":"IEEE\/ACM ICCAD"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/2717764.2717771"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1109\/SLIP.2015.7171710"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2016.2524566"}],"event":{"name":"2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD)","start":{"date-parts":[[2023,10,28]]},"location":"San Francisco, CA, USA","end":{"date-parts":[[2023,11,2]]}},"container-title":["2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10323590\/10323543\/10323760.pdf?arnumber=10323760","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T05:58:15Z","timestamp":1727503095000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10323760\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,10,28]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/iccad57390.2023.10323760","relation":{},"subject":[],"published":{"date-parts":[[2023,10,28]]}}}