{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:31:57Z","timestamp":1760711517588,"version":"build-2065373602"},"reference-count":91,"publisher":"IEEE","license":[{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T00:00:00Z","timestamp":1757289600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1109\/mlcad65511.2025.11189194","type":"proceedings-article","created":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T17:51:22Z","timestamp":1760032282000},"page":"1-8","source":"Crossref","is-referenced-by-count":2,"title":["Optimizing CUDA Graph Scheduling with Reinforcement Learning - A Case Study in SSTA Propagation"],"prefix":"10.1109","author":[{"given":"Cheng-Hsiang","family":"Chiu","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison,Madison,Wisconsin,USA"}]},{"given":"Chedi","family":"Morchdi","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University,College Station,Texas,USA"}]},{"given":"Chih-Chun","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison,Madison,Wisconsin,USA"}]},{"given":"Cunxi","family":"Yu","sequence":"additional","affiliation":[{"name":"University of Maryland,College Park,Maryland,USA"}]},{"given":"Yi","family":"Zhou","sequence":"additional","affiliation":[{"name":"Texas A&amp;M University,College Station,Texas,USA"}]},{"given":"Tsung-Wei","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison,Madison,Wisconsin,USA"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2007.907047"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2008.10.002"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/775832.776066"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.862751"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/dac63849.2025.11133291"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/ASPDAC.2009.4796490"},{"key":"ref7","article-title":"G-PASTA: GPU Accelerated Partitioning Algorithm for Static Timing Analysis","author":"Lin","year":"2024","journal-title":"ACM\/IEEE DAC"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643504"},{"key":"ref9","doi-asserted-by":"crossref","DOI":"10.1145\/3400302.3415631","article-title":"GPU-accelerated Static Timing Analysis","volume-title":"IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)","author":"Guo"},{"key":"ref10","article-title":"Playing atari with deep reinforcement learning","author":"Mnih","year":"2013","journal-title":"Arxiv.org"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC62836.2024.10938506"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC58780.2024.10473960"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS49936.2021.00090"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-16-6054-2_3"},{"article-title":"Semi-supervised classification with graph convolutional networks","volume-title":"International Conference on Learning Representations (ICLR)","author":"Kipf","key":"ref15"},{"article-title":"Inductive representation leanring on large graphs","year":"2017","author":"Hamilton","key":"ref16"},{"article-title":"Playing atari with deep reinforcement learning","year":"2013","author":"Mnih","key":"ref17"},{"volume-title":"Reinforcement Learning: An Introduction","year":"2018","author":"Sutton","key":"ref18"},{"article-title":"Maxmin q-learning: Controlling the estimation bias of q-learning","volume-title":"The International Conference on Learning Representations (ICLR)","author":"Lan","key":"ref19"},{"article-title":"Continuous control with deep reinforcement learning","volume-title":"International Conference on Learning Representations","author":"Lillicrap","key":"ref20"},{"key":"ref21","article-title":"Huber Loss"},{"article-title":"Adam: A method for stochastic optimization","volume-title":"International Conference on Learning Representations (ICLR)","author":"Kingma","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-85665-6_27"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-99854-6_2"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/DAC63849.2025.11133291"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/DAC63849.2025.11132904"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-99872-0_14"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1145\/3676641.3715984"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/3720555.3721988"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/3658617.3697741"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1145\/3658617.3697738"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1145\/3658617.3697551"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/3673038.3673117"},{"article-title":"HeteroExcept: Heterogeneous Engine for General Timing Path Exception Analysis","volume-title":"IEEE\/ACM International Conference on Computer-aided Design (ICCAD)","author":"Guo","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1145\/3673038.3673073"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI61997.2024.00155"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI61997.2024.00150"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI61997.2024.00149"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-69583-4_11"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3656238"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3655897"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1145\/3649329.3656230"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/3626184.3635278"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.23919\/DATE58400.2024.10546507"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD57390.2023.10323760"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC58863.2023.10363426"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC58863.2023.10363578"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1145\/3605573.3605625"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/DAC56929.2023.10247942"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS54959.2023.00080"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW59300.2023.00150"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.23919\/DATE56975.2023.10137050"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3272274"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3286261"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926348"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC55821.2022.9926380"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1145\/3545008.3545091"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.1145\/3502181.3533714"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1145\/3489517.3530616"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPSW55747.2022.00099"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC52403.2022.9712566"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3138856"},{"key":"ref63","doi-asserted-by":"publisher","DOI":"10.1109\/espm254806.2021.00009"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1109\/ProTools54808.2021.00006"},{"key":"ref65","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643457"},{"key":"ref66","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC49654.2021.9622872"},{"key":"ref67","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-06156-1_37"},{"key":"ref68","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586316"},{"key":"ref69","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586085"},{"key":"ref70","doi-asserted-by":"crossref","DOI":"10.1145\/3394885.3431578","article-title":"ATM: A High Accuracy Extracted Timing Model for Hierarchical Timing Analysis","volume-title":"IEEE\/ACM Asia and South Pacific Design Automation Conference (ASP-DAC)","author":"Lai"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2020.3007319"},{"key":"ref72","doi-asserted-by":"publisher","DOI":"10.1109\/MDAT.2021.3049177"},{"key":"ref73","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2021.3104255"},{"key":"ref74","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2019.00105"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3082507"},{"key":"ref76","doi-asserted-by":"publisher","DOI":"10.1109\/ICPADS51040.2020.00018"},{"key":"ref77","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC43674.2020.9286218"},{"key":"ref78","doi-asserted-by":"publisher","DOI":"10.1109\/tcad.2021.3124758"},{"key":"ref79","doi-asserted-by":"crossref","DOI":"10.1145\/3400302.3415750","article-title":"A General-purpose Parallel and Heterogeneous Task Programming System for VLSI CAD","volume-title":"IEEE\/ACM International Conference on Computer-aided Design (ICCAD)","author":"Huang"},{"key":"ref80","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218750"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1145\/3343031.3350537"},{"key":"ref82","doi-asserted-by":"publisher","DOI":"10.1109\/HPEC.2019.8916447"},{"key":"ref83","doi-asserted-by":"crossref","DOI":"10.1145\/3316781.3317744","article-title":"A General Cache Framework for Efficient Generation of Timing Critical Paths","volume-title":"ACM\/IEEE Design Automation Conference (DAC)","author":"Lai"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3322470"},{"key":"ref85","doi-asserted-by":"crossref","DOI":"10.1145\/3316781.3323477","article-title":"Essential Building Blocks for Creating an Open-source EDA Project","volume-title":"ACM\/IEEE Design Automation Conference (DAC)","author":"Huang"},{"key":"ref86","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2018.2834422"},{"key":"ref87","doi-asserted-by":"publisher","DOI":"10.1145\/3240508.3243654"},{"key":"ref88","doi-asserted-by":"publisher","DOI":"10.1145\/3194554.3194560"},{"key":"ref89","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2017.8203853"},{"key":"ref90","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062274"},{"key":"ref91","doi-asserted-by":"publisher","DOI":"10.1145\/2897937.2897959"}],"event":{"name":"2025 ACM\/IEEE 7th Symposium on Machine Learning for CAD (MLCAD)","start":{"date-parts":[[2025,9,8]]},"location":"Santa Cruz, CA, USA","end":{"date-parts":[[2025,9,10]]}},"container-title":["2025 ACM\/IEEE 7th Symposium on Machine Learning for CAD (MLCAD)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/11189084\/11189054\/11189194.pdf?arnumber=11189194","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T05:13:38Z","timestamp":1760073218000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11189194\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":91,"URL":"https:\/\/doi.org\/10.1109\/mlcad65511.2025.11189194","relation":{},"subject":[],"published":{"date-parts":[[2025,9,8]]}}}