{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T17:08:52Z","timestamp":1773248932481,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,10,27]],"date-time":"2024-10-27T00:00:00Z","timestamp":1729987200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"name":"Beijing Natural Science Foundation","award":["Z230002"],"award-info":[{"award-number":["Z230002"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,10,27]]},"DOI":"10.1145\/3676536.3676680","type":"proceedings-article","created":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T13:26:26Z","timestamp":1744205186000},"page":"1-9","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["EasyPart: An Effective and Comprehensive Hypergraph Partitioner for FPGA-based Emulation"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-3568-7888","authenticated-orcid":false,"given":"Shengbo","family":"Tong","sequence":"first","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9135-4346","authenticated-orcid":false,"given":"Haoyuan","family":"Li","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-2366-7557","authenticated-orcid":false,"given":"Jiahao","family":"Xu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-6898-7927","authenticated-orcid":false,"given":"Chunyan","family":"Pei","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4897-7251","authenticated-orcid":false,"given":"Wenjian","family":"Yu","sequence":"additional","affiliation":[{"name":"Tsinghua University, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-6120-2983","authenticated-orcid":false,"given":"Shengjun","family":"Liu","sequence":"additional","affiliation":[{"name":"HyperSilicon, Wuxi, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-2090-5475","authenticated-orcid":false,"given":"Jian","family":"Shen","sequence":"additional","affiliation":[{"name":"HyperSilicon, Wuxi, China"}]}],"member":"320","published-online":{"date-parts":[[2025,4,9]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3549438"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643555"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-9260(95)00008-4"},{"key":"e_1_3_2_1_4_1","volume-title":"An Open-Source Constraints-Driven General Partitioning Multi-Tool for VLSI Physical Design. In 2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD). IEEE, 1--9.","author":"Bustany Ismail","year":"2023","unstructured":"Ismail Bustany, Grigor Gasparyan, Andrew B Kahng, Ioannis Koutis, Bodhisatta Pramanik, and Zhiang Wang. 2023. An Open-Source Constraints-Driven General Partitioning Multi-Tool for VLSI Physical Design. In 2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD). IEEE, 1--9."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3508352.3549390"},{"key":"e_1_3_2_1_6_1","volume-title":"K-SpecPart: Supervised Embedding Algorithms and Cut Overlay for Improved Hypergraph Partitioning","author":"Bustany Ismail","year":"2023","unstructured":"Ismail Bustany, Andrew B Kahng, Ioannis Koutis, Bodhisatta Pramanik, and Zhiang Wang. 2023. K-SpecPart: Supervised Embedding Algorithms and Cut Overlay for Improved Hypergraph Partitioning. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2023)."},{"key":"e_1_3_2_1_7_1","unstructured":"\u00dcmit V \u00c7ataly\u00fcrek and Cevdet Aykanat. 2011. PaToH (Partitioning Tool for Hypergraphs)."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/288548.289079"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2014.12.002"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Charles M Fiduccia and Robert M Mattheyses. 1988. A linear-time heuristic for improving network partitions. In Papers on Twenty-five years of electronic design automation. 241--247.","DOI":"10.1145\/62882.62910"},{"key":"e_1_3_2_1_11_1","volume-title":"Computers and intractability: A guide to the theory of NP-completeness","author":"Johnson David S","unstructured":"David S Johnson and Michael R Garey. 1979. Computers and intractability: A guide to the theory of NP-completeness. WH Freeman."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/305219.305248"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/309847.309954"},{"key":"e_1_3_2_1_15_1","volume-title":"Combinatorial algorithms for integrated circuit layout","author":"Lengauer Thomas","unstructured":"Thomas Lengauer. 2012. Combinatorial algorithms for integrated circuit layout. Springer Science & Business Media."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.vlsi.2021.11.005"},{"key":"e_1_3_2_1_17_1","volume-title":"Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1--6.","author":"Li Benzheng","year":"2024","unstructured":"Benzheng Li, Hailong You, Shunyang Bi, and Yuming Zhang. 2024. An Efficient Hypergraph Partitioner under Inter-Block Interconnection Constraints. In 2024 Design, Automation & Test in Europe Conference & Exhibition (DATE). IEEE, 1--6."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2013.6645503"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/3529090"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2005.854637"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942051"},{"key":"e_1_3_2_1_22_1","volume-title":"International Symposium on Computer and Information Sciences. Springer, 789--800","author":"Trifunovic Aleksandar","year":"2004","unstructured":"Aleksandar Trifunovic and William J Knottenbelt. 2004. Par k way 2.0: A Parallel Multilevel Hypergraph Partitioning Tool. In International Symposium on Computer and Information Sciences. Springer, 789--800."},{"key":"e_1_3_2_1_23_1","volume-title":"Proceedings of the Great Lakes Symposium on VLSI","author":"Zang Xinshi","year":"2023","unstructured":"Xinshi Zang, Evangeline FY Young, and Martin DF Wong. 2023. SPARK: A Scalable Partitioning and Routing Framework for Multi-FPGA Systems. In Proceedings of the Great Lakes Symposium on VLSI 2023. 593--598."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD51958.2021.9643481"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/DAC18072.2020.9218569"}],"event":{"name":"ICCAD '24: 43rd IEEE\/ACM International Conference on Computer-Aided Design","location":"Newark Liberty International Airport Marriott New York NY USA","acronym":"ICCAD '24","sponsor":["SIGDA ACM Special Interest Group on Design Automation","IEEE CAS","IEEE CEDA","IEEE EDS"]},"container-title":["Proceedings of the 43rd IEEE\/ACM International Conference on Computer-Aided Design"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3676536.3676680","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3676536.3676680","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T23:43:57Z","timestamp":1750290237000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3676536.3676680"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,27]]},"references-count":25,"alternative-id":["10.1145\/3676536.3676680","10.1145\/3676536"],"URL":"https:\/\/doi.org\/10.1145\/3676536.3676680","relation":{},"subject":[],"published":{"date-parts":[[2024,10,27]]},"assertion":[{"value":"2025-04-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}