{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T13:41:18Z","timestamp":1776087678987,"version":"3.50.1"},"reference-count":44,"publisher":"Association for Computing Machinery (ACM)","issue":"5","funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62404161"],"award-info":[{"award-number":["62404161"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Des. Autom. Electron. Syst."],"published-print":{"date-parts":[[2026,9,30]]},"abstract":"<jats:p>\n                    As the scale and complexity of designs increase, functional verification becomes a critical part of the very-large-scale integration (VLSI) design flow. However, existing processor-based emulation systems suffer from inefficiencies due to the misalignment objective between partitioning and scheduling, which are traditionally treated as separate and independent stages during compilation. To address this issue, we propose\n                    <jats:italic toggle=\"yes\">ParSCo<\/jats:italic>\n                    , a partitioning and scheduling co-optimization framework that explicitly aligns the objectives of both stages by jointly considering cut minimization and topological order balancing (TOB) under multiple constraints. To integrate these objectives and constraints into our framework, we incorporate them into all partitioning and scheduling stages and further develop a set of novel techniques, including\n                    <jats:italic toggle=\"yes\">TOB-aware coarsening with multiple constraints<\/jats:italic>\n                    ,\n                    <jats:italic toggle=\"yes\">global growing initial partitioning with fixed nodes<\/jats:italic>\n                    ,\n                    <jats:italic toggle=\"yes\">TopoRefinement<\/jats:italic>\n                    , and\n                    <jats:italic toggle=\"yes\">partitioning-aware scheduling<\/jats:italic>\n                    , which collectively enhance the co-optimization process in emulation compilation. Furthermore, we establish theorems that reduce the time complexity of gain calculation and update to\n                    <jats:italic toggle=\"yes\">O<\/jats:italic>\n                    (1), significantly improving the computational efficiency of the whole process. Furthermore, we evaluate the proposed method on the public and open-source chip design benchmarks, which have up to nearly 10 million cells.\n                    <jats:italic toggle=\"yes\">ParSCo<\/jats:italic>\n                    significantly extends ideas and algorithms that first appeared in our previous work\n                    <jats:italic toggle=\"yes\">TopoOrderPart<\/jats:italic>\n                    and achieves a 15% improvement. Extensive experimental results demonstrate the effectiveness of\n                    <jats:italic toggle=\"yes\">ParSCo<\/jats:italic>\n                    , achieving an average improvement of 22.5% in time step reduction, 72% enhancement in TOB, and 55% acceleration in CPU time compared to the state-of-the-art (SOTA) two-stage partitioning and scheduling approach.\n                  <\/jats:p>","DOI":"10.1145\/3786351","type":"journal-article","created":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T10:54:19Z","timestamp":1776077659000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["ParSCo: Performance-Driven\n                    <u>Par<\/u>\n                    titioning and\n                    <u>S<\/u>\n                    cheduling\n                    <u>Co<\/u>\n                    -optimization Framework for Processor-based Emulation"],"prefix":"10.1145","volume":"31","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-1341-3977","authenticated-orcid":false,"given":"Shunyang","family":"Bi","sequence":"first","affiliation":[{"name":"school of microelectronics, Xidian University","place":["Xian, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0002-8737-228X","authenticated-orcid":false,"given":"Jing","family":"Tang","sequence":"additional","affiliation":[{"name":"Xidian University School of Microelectronics","place":["Xi'An, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3427-5320","authenticated-orcid":false,"given":"Hailong","family":"You","sequence":"additional","affiliation":[{"name":"Xidian University School of Microelectronics","place":["Xi'an, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-4732-5705","authenticated-orcid":false,"given":"Haonan","family":"Wu","sequence":"additional","affiliation":[{"name":"Microelectronics, Xidian University","place":["Xi'an, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6289-6680","authenticated-orcid":false,"given":"Cong","family":"Li","sequence":"additional","affiliation":[{"name":"School of Microelectronics, Xidian University","place":["Xian, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-3924-2154","authenticated-orcid":false,"given":"Richard","family":"Sun","sequence":"additional","affiliation":[{"name":"S2C Inc.","place":["Guangdong, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,4,13]]},"reference":[{"key":"e_1_3_3_2_2","unstructured":"2025. DAH benchmark generated from the Titan23. Retrieved from https:\/\/drive.google.com\/file\/d\/1J6wE7AwuBvnZZfICbnqa42Kia8yXcF4d\/view?usp=drive_link"},{"key":"e_1_3_3_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/266021.266275"},{"key":"e_1_3_3_4_2","volume-title":"Proceedings of the 43rd IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)","author":"Bi Shunyang","year":"2025","unstructured":"Shunyang Bi, Jing Tang, Hailong You, Haonan Wu, Cong Li, and Richard Sun. 2025. TopoOrderPart: A multi-level scheduling-driven partitioning framework for processor-based emulation. In Proceedings of the 43rd IEEE\/ACM International Conference on Computer-Aided Design (ICCAD). New York, NY, USA, Article 16, 9 pages."},{"key":"e_1_3_3_5_2","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(92)90140-Q"},{"key":"e_1_3_3_6_2","first-page":"1","volume-title":"Proceedings of the 2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD)","author":"Bustany Ismail","year":"2023","unstructured":"Ismail Bustany, Grigor Gasparyan, Andrew B. Kahng, and Ioannis Koutis. 2023. An open-source constraints-driven general partitioning multi-tool for VLSI physical design. In Proceedings of the 2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD). 1\u20139."},{"key":"e_1_3_3_7_2","first-page":"1","volume-title":"Proceedings of the 2022 IEEE\/ACM International Conference On Computer Aided Design (ICCAD)","author":"Bustany Ismail","year":"2022","unstructured":"Ismail Bustany, Andrew B. Kahng, Ioannis Koutis, and Bodhisatta Pramanik. 2022. SpecPart: A supervised spectral framework for hypergraph partitioning solution improvement. In Proceedings of the 2022 IEEE\/ACM International Conference On Computer Aided Design (ICCAD). 1\u20139."},{"key":"e_1_3_3_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2023.3332268"},{"key":"e_1_3_3_9_2","unstructured":"Cadence. 2025. Cadence Palladium. Retrieved March 17 2026 from https:\/\/www.cadence.com\/en_US\/home\/tools\/system-design-and-verification\/emulation-and-prototyping\/palladium.html"},{"key":"e_1_3_3_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/71.780863"},{"key":"e_1_3_3_11_2","volume-title":"PaToH (Partitioning Tool for Hypergraphs)","author":"Catalyurek U. V.","year":"2011","unstructured":"U. V. Catalyurek and C. Aykanat. 2011. PaToH (Partitioning Tool for Hypergraphs). Springer US, Boston, MA, 1479\u20131487."},{"key":"e_1_3_3_12_2","article-title":"GenPart 2.0: Enhanced hypergraph partitioning with vertex weight handling using a generative model","author":"Chen Magi","year":"2026","unstructured":"Magi Chen and Ting-Chi Wang. 2026. GenPart 2.0: Enhanced hypergraph partitioning with vertex weight handling using a generative model. ACM Transactions on Design Automation of Electronic Systems 31, 3 (Feb. 2026).","journal-title":"ACM Transactions on Design Automation of Electronic Systems"},{"key":"e_1_3_3_13_2","doi-asserted-by":"crossref","unstructured":"Magi Chen and Ting-Chi Wang. 2024. A hypergraph partitioner utilizing a novel graph generative model. In 2024 ACM\/IEEE International Conference On Computer Aided Design (ICCAD). 1\u20139.","DOI":"10.1145\/3676536.3676805"},{"key":"e_1_3_3_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2021.3065902"},{"key":"e_1_3_3_15_2","first-page":"1","volume-title":"Proceedings of the 2024 IEEE High Performance Extreme Computing Conference (HPEC)","author":"Chiu Cheng-Hsiang","year":"2024","unstructured":"Cheng-Hsiang Chiu, Chedi Morchdi, Yi Zhou, Boyang Zhang, Che Chang, and Tsung-Wei Huang. 2024. Reinforcement learning-generated topological order for dynamic task graph scheduling. In Proceedings of the 2024 IEEE High Performance Extreme Computing Conference (HPEC). 1\u20137."},{"key":"e_1_3_3_16_2","doi-asserted-by":"crossref","unstructured":"C. M. Fiduccia and R. M. Mattheyses. 1982. A linear-time heuristic for improving network partitions(DAC\u201982). IEEE Press 175\u2013181.","DOI":"10.1145\/800263.809204"},{"key":"e_1_3_3_17_2","unstructured":"Yong Fu. 2022. Processor based logic simulation acceleration and emulation system. US Patent App. 17\/448 216."},{"key":"e_1_3_3_18_2","unstructured":"Mentor Graphics. 2025. Mentor Veloce. Retrieved March 17 2026 from https:\/\/eda.sw.siemens.com\/en-US\/ic\/veloce\/strato-hardware"},{"key":"e_1_3_3_19_2","first-page":"371","volume-title":"Proceedings of the 2017 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID)","author":"Herrmann Julien","year":"2017","unstructured":"Julien Herrmann, Jonathan Kho, Bora U\u00e7ar, and Kamer Kaya. 2017. Acyclic partitioning of large directed acyclic graphs. In Proceedings of the 2017 17th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGRID). 371\u2013380."},{"issue":"4","key":"e_1_3_3_20_2","first-page":"A2117\u2013A2145","article-title":"Multilevel algorithms for acyclic partitioning of directed acyclic graphs","volume":"41","author":"Herrmann Julien","year":"2019","unstructured":"Julien Herrmann, M. Yusuf \u00d6zkaya, Bora U\u00e7ar, and Kamer Kaya. 2019. Multilevel algorithms for acyclic partitioning of directed acyclic graphs. SIAM Journal on Scientific Computing 41, 4 (2019), A2117\u2013A2145.","journal-title":"SIAM Journal on Scientific Computing"},{"key":"e_1_3_3_21_2","doi-asserted-by":"crossref","unstructured":"Tobias Heuer Peter Sanders and Sebastian Schlag. 2019. Network flow-based refinement for multilevel hypergraph partitioning. ACM Journal of Experimental Algorithmics 24 (Sept. 2019).","DOI":"10.1145\/3329872"},{"key":"e_1_3_3_22_2","unstructured":"Ngai Ngai William Hung and Amiya Ranjan Satapathy. 2024. Systems and methods for distributed and parallelized emulation processor configuration. US Patent App. 11\/868 786."},{"key":"e_1_3_3_23_2","unstructured":"KaHyPar. 2025. KaHyPar defalut setting. Retrieved March 17 2026 from https:\/\/github.com\/kahypar\/kahypar\/blob\/master\/config\/km1_kKaHyPar_sea20.ini"},{"key":"e_1_3_3_24_2","volume-title":"Proceedings of the Electronic Theses and Dissertations","author":"Kanaan Marwan","year":"2007","unstructured":"Marwan Kanaan. 2007. A low-cost processor-based logic emulation system using FPGAs. In Proceedings of the Electronic Theses and Dissertations."},{"key":"e_1_3_3_25_2","unstructured":"George Karypis. 2007. hMetis-2.0pre1. Retrieved March 17 2026 from https:\/\/karypis.github.io\/glaros\/software\/metis\/overview.html"},{"key":"e_1_3_3_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"e_1_3_3_27_2","unstructured":"G. Karypis and V. Kumar. 1998. hMETIS a hypergraph partitioning package version 1.5.3. Retrieved March 17 2026 from http:\/\/glaros.dtc.umn.edu\/gkhome\/fetch\/sw\/hMETIS\/manual.pdf"},{"key":"e_1_3_3_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/344588.344618"},{"key":"e_1_3_3_29_2","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/3626184.3633319","volume-title":"Proceedings of the 2024 International Symposium on Physical Design (ISPD\u201924)","author":"Liang Rongjian","year":"2024","unstructured":"Rongjian Liang, Anthony Agnesina, and Haoxing Ren. 2024. MedPart: A multi-level evolutionary differentiable hypergraph partitioner. In Proceedings of the 2024 International Symposium on Physical Design (ISPD\u201924). Association for Computing Machinery, New York, NY, USA, 3\u201311."},{"key":"e_1_3_3_30_2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1145\/3372780.3375558","volume-title":"Proceedings of the 2020 International Symposium on Physical Design (ISPD\u201920)","author":"Liou Sin-Hong","year":"2020","unstructured":"Sin-Hong Liou, Sean Liu, Richard Sun, and Hung-Ming Chen. 2020. Timing driven partition for multi-FPGA systems with TDM awareness. In Proceedings of the 2020 International Symposium on Physical Design (ISPD\u201920). Association for Computing Machinery, New York, NY, USA, 111\u2013118."},{"key":"e_1_3_3_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2013.6645503"},{"key":"e_1_3_3_32_2","unstructured":"Azade Nazi Will Hang Anna Goldie Sujith Ravi and Azalia Mirhoseini. 2019. Gap: Generalizable approximate graph partitioning framework. arXiv preprint arXiv:1903.00614 (2019)."},{"key":"e_1_3_3_33_2","unstructured":"Nvidia. 2018. NVIDIA Deep Learning Accelerator (NVDLA). Retrieved from https:\/\/nvdla.org\/primer.html"},{"key":"e_1_3_3_34_2","first-page":"1","volume-title":"Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX)","author":"Popp Merten","year":"2021","unstructured":"Merten Popp, Sebastian Schlag, Christian Schulz, and Daniel Seemaier. 2021. Multilevel acyclic hypergraph partitioning. In Proceedings of the Symposium on Algorithm Engineering and Experiments (ALENEX). 1\u201315."},{"key":"e_1_3_3_35_2","first-page":"1","volume-title":"Proceedings of the 2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD)","author":"Pu Ruiyao","year":"2023","unstructured":"Ruiyao Pu, Yiwei Sun, Pei-Hsin Ho, Fan Yang, Li Shang, and Xuan Zeng. 2023. Sphinx: A hybrid boolean processor-FPGA hardware emulation system. In Proceedings of the 2023 IEEE\/ACM International Conference on Computer Aided Design (ICCAD). 1\u20139."},{"key":"e_1_3_3_36_2","doi-asserted-by":"publisher","DOI":"10.5555\/1203059"},{"key":"e_1_3_3_37_2","volume-title":"Proceedings of the ALENEX\u201917","author":"Schlag Sebastian","year":"2017","unstructured":"Sebastian Schlag, Yaroslav Akhremtsev, Tobias Heuer, and Peter Sanders. 2017. Engineering a direct k-way hypergraph partitioning algorithm. In Proceedings of the ALENEX\u201917."},{"key":"e_1_3_3_38_2","first-page":"53","volume-title":"Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX)","author":"Schlag Sebastian","year":"2016","unstructured":"Sebastian Schlag, Vitali Henne, Tobias Heuer, and Henning Meyerhenke. 2016. k-way Hypergraph Partitioning via n-Level Recursive Bisection. In Proceedings of the Meeting on Algorithm Engineering and Experiments (ALENEX). 53\u201367."},{"key":"e_1_3_3_39_2","article-title":"High-quality hypergraph partitioning","author":"Schlag Sebastian","year":"2023","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 27 (Feb. 2023).","journal-title":"ACM Journal of Experimental Algorithmics"},{"key":"e_1_3_3_40_2","doi-asserted-by":"publisher","DOI":"10.1145\/3543622.3573187"},{"key":"e_1_3_3_41_2","unstructured":"Synopsys. 2025. Synopsys ZeBu. Retrieved March 17 2026 from https:\/\/www.synopsys.com\/verification\/emulation-prototyping\/emulation\/zebu-200.html"},{"key":"e_1_3_3_42_2","doi-asserted-by":"crossref","unstructured":"Ziyi Wang Wenqian Zhao Yuan Pu Lei Chen Wilson W. K. Thong Weihua Sheng Tsungyi Ho and Bei Yu. 2025. ParSGCN: Bridging the gap between emulation partitioning and scheduling. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 44 (2025) 1180\u20131192.","DOI":"10.1109\/TCAD.2024.3453199"},{"key":"e_1_3_3_43_2","first-page":"1178","volume-title":"Proceedings of the 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO)","author":"Xu Yinan","year":"2022","unstructured":"Yinan Xu, Zihao Yu, Dan Tang, Guokai Chen, Lu Chen, Lingrui Gou, et\u00a0al. 2022. Towards developing high performance RISC-V processors using agile methodology. In Proceedings of the 2022 55th IEEE\/ACM International Symposium on Microarchitecture (MICRO). 1178\u20131199."},{"key":"e_1_3_3_44_2","doi-asserted-by":"crossref","first-page":"1505","DOI":"10.1109\/MWSCAS.2007.4488826","volume-title":"Proceedings of the 2007 50th Midwest Symposium on Circuits and Systems","author":"Yazdanshenas Amir","year":"2007","unstructured":"Amir Yazdanshenas and Mohammed A. S. Khalid. 2007. A new scheduling algorithm for processor-based logic emulation systems. In Proceedings of the 2007 50th Midwest Symposium on Circuits and Systems. 1505\u20131508."},{"key":"e_1_3_3_45_2","volume-title":"Proceedings of the Electronic Theses and Dissertations","author":"Yazdanshenas Amir Ali","year":"2006","unstructured":"Amir Ali Yazdanshenas. 2006. Hardware design and CAD for processor-based logic emulation systems. In Proceedings of the Electronic Theses and Dissertations."}],"container-title":["ACM Transactions on Design Automation of Electronic Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3786351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,13]],"date-time":"2026-04-13T12:41:20Z","timestamp":1776084080000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3786351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4,13]]},"references-count":44,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2026,9,30]]}},"alternative-id":["10.1145\/3786351"],"URL":"https:\/\/doi.org\/10.1145\/3786351","relation":{},"ISSN":["1084-4309","1557-7309"],"issn-type":[{"value":"1084-4309","type":"print"},{"value":"1557-7309","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,4,13]]},"assertion":[{"value":"2025-07-18","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-12-17","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-04-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}