{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T23:43:42Z","timestamp":1783035822111,"version":"3.54.6"},"publisher-location":"New York, NY, USA","reference-count":11,"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":["2235276"],"award-info":[{"award-number":["2235276"]}],"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":["2349144"],"award-info":[{"award-number":["2349144"]}],"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":["2349143"],"award-info":[{"award-number":["2349143"]}],"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":["2349582"],"award-info":[{"award-number":["2349582"]}],"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":["2349141"],"award-info":[{"award-number":["2349141"]}],"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.3656230","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":12,"title":["G-PASTA: GPU-Accelerated Partitioning Algorithm for Static Timing Analysis"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-2008-7915","authenticated-orcid":false,"given":"Boyang","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3075-7437","authenticated-orcid":false,"given":"Dian-Lun","family":"Lin","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-5455-037X","authenticated-orcid":false,"given":"Che","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Wisconsin, Madison, Madison, WI, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0406-885X","authenticated-orcid":false,"given":"Cheng-Hsiang","family":"Chiu","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4676-8360","authenticated-orcid":false,"given":"Bojue","family":"Wang","sequence":"additional","affiliation":[{"name":"Rutgers University, Piscataway, NJ, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-2156-2765","authenticated-orcid":false,"given":"Wan-Luan","family":"Lee","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, --, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-0369-5495","authenticated-orcid":false,"given":"Chih-Chun","family":"Chang","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison, Madison, WI, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8529-0398","authenticated-orcid":false,"given":"Donghao","family":"Fang","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9768-3378","authenticated-orcid":false,"given":"Tsung-Wei","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Wisconsin at Madison, Madison, WI, United States"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,11,7]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"B\u00e9renger Bramas and Alain Ketterlin. 2020. Improving parallel executions by increasing task granularity in task-based runtime systems using acyclic DAG clustering. PeerJ Computer Science.","DOI":"10.7717\/peerj-cs.247"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18074.2021.9586316"},{"key":"e_1_3_2_1_3_1","unstructured":"Zizheng Guo Tsung-Wei Huang and Yibo Lin. 2020. Gpu-accelerated static timing analysis. In ICCAD."},{"key":"e_1_3_2_1_4_1","volume-title":"Wong","author":"Huang Tsung-Wei","year":"2021","unstructured":"Tsung-Wei Huang, Guannan Guo, Chun-Xun Lin, and Martin D. F. Wong. 2021. OpenTimer v2: A New Parallel Incremental Timing Analysis Engine. IEEE TCAD."},{"key":"e_1_3_2_1_5_1","volume-title":"Cpp-Taskflow: Fast Task-Based Parallel Programming Using Modern C++","author":"Huang Tsung-Wei","unstructured":"Tsung-Wei Huang, Chun-Xun Lin, Guannan Guo, and Martin Wong. 2019. Cpp-Taskflow: Fast Task-Based Parallel Programming Using Modern C++. In IEEE IPDPS. 974--983."},{"key":"e_1_3_2_1_6_1","volume-title":"Taskflow: A lightweight parallel and heterogeneous task graph computing system","author":"Huang Tsung-Wei","year":"2021","unstructured":"Tsung-Wei Huang, Dian-Lun Lin, Chun-Xun Lin, and Yibo Lin. 2021. Taskflow: A lightweight parallel and heterogeneous task graph computing system. IEEE TPDS."},{"key":"e_1_3_2_1_7_1","volume-title":"Wong","author":"Huang Tsung-Wei","year":"2015","unstructured":"Tsung-Wei Huang and Martin D. F. Wong. 2015. OpenTimer: A High-Performance Timing Analysis Tool. In IEEE\/ACM ICCAD. 895--902."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"crossref","unstructured":"Tsung-Wei Huang Boyang Zhang Dian-Lun Lin and Cheng-Hsiang Chiu. 2024. Parallel and Heterogeneous Timing Analysis: Partition Algorithm and System. In ACM ISPD. 51--59.","DOI":"10.1145\/3626184.3635278"},{"key":"e_1_3_2_1_9_1","volume-title":"METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices.","author":"Karypis George","year":"1997","unstructured":"George Karypis and Vipin Kumar. 1997. METIS: A software package for partitioning unstructured graphs, partitioning meshes, and computing fill-reducing orderings of sparse matrices."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Vivek Sarkar and John Hennessy. 1986. Partitioning parallel programs for macro-dataflow. In ACM LFP.","DOI":"10.1145\/319838.319863"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Sebastian Schlag Tobias Heuer Lars Gottesb\u00fcren Yaroslav Akhremtsev Christian Schulz and Peter Sanders. 2023. High-quality hypergraph partitioning. ACM Journal of Experimental Algorithmics.","DOI":"10.1145\/3529090"}],"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.3656230","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656230","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3649329.3656230","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:17:55Z","timestamp":1750295875000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3649329.3656230"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,6,23]]},"references-count":11,"alternative-id":["10.1145\/3649329.3656230","10.1145\/3649329"],"URL":"https:\/\/doi.org\/10.1145\/3649329.3656230","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"}}]}}