{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T18:32:24Z","timestamp":1775068344029,"version":"3.50.1"},"reference-count":29,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T00:00:00Z","timestamp":1638748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["CCF-2110419 and IIS-1956339"],"award-info":[{"award-number":["CCF-2110419 and IIS-1956339"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Archit. Code Optim."],"published-print":{"date-parts":[[2022,3,31]]},"abstract":"<jats:p>\n            SMART NoCs achieve ultra-low latency by enabling single-cycle multiple-hop transmission via bypass channels. However, contention along bypass channels can seriously degrade the performance of SMART NoCs by breaking the bypass paths. Therefore, contention-free task mapping and scheduling are essential for optimal system performance. In this article, we propose an SMT (Satisfiability Modulo Theories)-based framework to find optimal contention-free task mappings with minimum application schedule lengths on 2D\/3D SMART NoCs with mixed dimension-order routing. On top of SMT\u2019s fast reasoning capability for conditional constraints, we develop efficient search-space reduction techniques to achieve practical scalability. Experiments demonstrate that our SMT framework achieves 10\u00d7 higher scalability than\n            <jats:bold>ILP (Integer Linear Programming)<\/jats:bold>\n            with 931.1\u00d7 (ranges from 2.2\u00d7 to 1532.1\u00d7) and 1237.1\u00d7 (ranges from 4\u00d7 to 4373.8\u00d7) faster average runtimes for finding optimum solutions on 2D and 3D SMART NoCs and our 2D and 3D extensions of the SMT framework with mixed dimension-order routing also maintain the improved scalability with the extended and diversified routing paths, resulting in reduced application schedule lengths throughout various application benchmarks.\n          <\/jats:p>","DOI":"10.1145\/3487018","type":"journal-article","created":{"date-parts":[[2021,12,6]],"date-time":"2021-12-06T21:29:34Z","timestamp":1638826174000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["SMT-Based Contention-Free Task Mapping and Scheduling on 2D\/3D SMART NoC with Mixed Dimension-Order Routing"],"prefix":"10.1145","volume":"19","author":[{"given":"Daeyeal","family":"Lee","sequence":"first","affiliation":[{"name":"University of California San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bill","family":"Lin","sequence":"additional","affiliation":[{"name":"University of California San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chung-Kuan","family":"Cheng","sequence":"additional","affiliation":[{"name":"University of California San Diego, La Jolla, CA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,12,6]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/3356235"},{"key":"e_1_3_2_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-46681-0_14"},{"key":"e_1_3_2_4_2","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485371"},{"key":"e_1_3_2_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1391469.1391628"},{"key":"e_1_3_2_6_2","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2016.2538284"},{"key":"e_1_3_2_7_2","doi-asserted-by":"publisher","DOI":"10.5555\/995703"},{"key":"e_1_3_2_8_2","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_9_2","doi-asserted-by":"publisher","DOI":"10.5555\/278241.278309"},{"key":"e_1_3_2_10_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2008.142"},{"key":"e_1_3_2_11_2","unstructured":"LLC Gurobi Optimization. 2021. Gurobi Optimizer Reference Manual. Retrieved 2021 from http:\/\/www.gurobi.com."},{"key":"e_1_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/1119772.1119818"},{"key":"e_1_3_2_13_2","doi-asserted-by":"publisher","DOI":"10.5555\/968878.969037"},{"key":"e_1_3_2_14_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2018.8342223"},{"key":"e_1_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA.2013.6522334"},{"key":"e_1_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1109\/MM.2014.48"},{"issue":"1","key":"e_1_3_2_17_2","first-page":"1","article-title":"SMT-based contention-free task mapping and scheduling on SMART NoC","volume":"1","author":"Lee Daeyeal","year":"2021","unstructured":"Daeyeal Lee, Bill Lin, and Chung-Kuan Cheng. 2021. SMT-based contention-free task mapping and scheduling on SMART NoC. Embedded Systems Letters 1, 1 (2021), 1\u20134. https:\/\/doi.org\/10.1109\/LES.2021.3049774","journal-title":"Embedded Systems Letters"},{"key":"e_1_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3223046"},{"key":"e_1_3_2_19_2","doi-asserted-by":"publisher","DOI":"10.5555\/3522802.3522814"},{"key":"e_1_3_2_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/PROC.1987.13876"},{"key":"e_1_3_2_21_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI.2011.49"},{"key":"e_1_3_2_22_2","first-page":"1","volume-title":"TutORials in Operations Research","author":"Lodi Andrea","year":"2014","unstructured":"Andrea Lodi and Andrea Tramontani. 2014. Performance variability in mixed-integer programming. In TutORials in Operations Research. 1\u201312. https:\/\/doi.org\/10.1287\/educ.2013.0112"},{"key":"e_1_3_2_23_2","doi-asserted-by":"publisher","DOI":"10.5555\/968879.969207"},{"key":"e_1_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/1080695.1070006"},{"key":"e_1_3_2_25_2","doi-asserted-by":"publisher","DOI":"10.1002\/jos.116"},{"key":"e_1_3_2_26_2","unstructured":"IEEE Journal of Solid-State Circuits 2010 46 1 Design issues and considerations for low-cost 3-D TSV IC technology"},{"key":"e_1_3_2_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/TASE.2019.000-5"},{"key":"e_1_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062323"},{"key":"e_1_3_2_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2864749"},{"key":"e_1_3_2_30_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAS.2010.5537920"}],"container-title":["ACM Transactions on Architecture and Code Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487018","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487018","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3487018","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:47Z","timestamp":1750191527000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3487018"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,12,6]]},"references-count":29,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2022,3,31]]}},"alternative-id":["10.1145\/3487018"],"URL":"https:\/\/doi.org\/10.1145\/3487018","relation":{},"ISSN":["1544-3566","1544-3973"],"issn-type":[{"value":"1544-3566","type":"print"},{"value":"1544-3973","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,12,6]]},"assertion":[{"value":"2021-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-12-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}