{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,3]],"date-time":"2026-06-03T16:00:26Z","timestamp":1780502426306,"version":"3.54.1"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","license":[{"start":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T00:00:00Z","timestamp":1631836800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001459","name":"Ministry of Education, Singapore","doi-asserted-by":"crossref","award":["Tier 2 (MoE2019-T2-1-071) and Tier 1 (MoE2019-T1-001-072)"],"award-info":[{"award-number":["Tier 2 (MoE2019-T2-1-071) and Tier 1 (MoE2019-T1-001-072)"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100001475","name":"Nanyang Technological University, Singapore","doi-asserted-by":"crossref","award":["NAP (M4082282) and SUG (M4082087)"],"award-info":[{"award-number":["NAP (M4082282) and SUG (M4082087)"]}],"id":[{"id":"10.13039\/501100001475","id-type":"DOI","asserted-by":"crossref"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2021,10,31]]},"abstract":"<jats:p>\n            Heterogeneous computing systems (HCSs), which consist of various processing elements (PEs) that vary in their processing ability, are usually facilitated by the network-on-chip (NoC) to interconnect its components. The emerging point-to-point NoCs which support single-cycle-multi-hop transmission, reduce or eliminate the latency dependence on distance, addressing the scalability concern raised by high latency for long-distance transmission and enlarging the design space of the routing algorithm to search the non-shortest paths. For such point-to-point NoC-based HCSs, resource management strategies which are managed by compilers, scheduler, or controllers, e.g., mapping and routing, are complicated for the following reasons: (i) Due to the heterogeneity, mapping and routing need to optimize computation and communication concurrently (for homogeneous computing systems, only communication). (ii) Conducting mapping and routing consecutively cannot minimize the schedule length in most cases since the PEs with high processing ability may locate in the crowded area and suffer from high resource contention overhead. (iii) Since changing the mapping selection of one task will reconstruct the whole routing design space, the exploration of mapping and routing design space is challenging. Therefore, in this work, we propose MARCO, the\n            <jats:underline>m<\/jats:underline>\n            apping\n            <jats:underline>a<\/jats:underline>\n            nd\n            <jats:underline>r<\/jats:underline>\n            outing\n            <jats:underline>co<\/jats:underline>\n            -optimization framework, to decrease the schedule length of applications on point-to-point NoC-based HCSs. Specifically, we revise the tabu search to explore the design space and evaluate the quality of mapping and routing. The advanced reinforcement learning (RL)algorithm, i.e., advantage actor-critic, is adopted to efficiently compute paths. We perform extensive experiments on various real applications, which demonstrates that the MARCO achieves a remarkable performance improvement in terms of schedule length (+44.94% \u223c +50.18%) when compared with the state-of-the-art mapping and routing co-optimization algorithm for homogeneous computing systems. We also compare MARCO with different combinations of state-of-the-art mapping and routing approaches.\n          <\/jats:p>","DOI":"10.1145\/3476985","type":"journal-article","created":{"date-parts":[[2021,9,17]],"date-time":"2021-09-17T18:36:51Z","timestamp":1631903811000},"page":"1-21","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["MARCO: A High-performance Task\n            <u>M<\/u>\n            apping\n            <u>a<\/u>\n            nd\n            <u>R<\/u>\n            outing\n            <u>Co<\/u>\n            -optimization Framework for Point-to-Point NoC-based Heterogeneous Computing Systems"],"prefix":"10.1145","volume":"20","author":[{"given":"Hui","family":"Chen","sequence":"first","affiliation":[{"name":"Nanyang Technological University Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Zihao","family":"Zhang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Peng","family":"Chen","sequence":"additional","affiliation":[{"name":"Nanyang Technological University and National University of Singapore Singapore, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiangzhong","family":"Luo","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shiqing","family":"Li","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Weichen","family":"Liu","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2021,9,17]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.5555\/795691.797919"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/925705"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3356235"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.1983.6313077"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485371"},{"key":"e_1_2_1_6_1","volume-title":"ArSMART: An improved SMART NoC design supporting arbitrary-turn transmission. arXiv preprint arXiv:2011.09261","author":"Chen Hui","year":"2020","unstructured":"Hui Chen , Peng Chen , Jun Zhou , Duong H. K. Luan , and Weichen Liu . 2020. ArSMART: An improved SMART NoC design supporting arbitrary-turn transmission. arXiv preprint arXiv:2011.09261 ( 2020 ). Hui Chen, Peng Chen, Jun Zhou, Duong H. K. Luan, and Weichen Liu. 2020. ArSMART: An improved SMART NoC design supporting arbitrary-turn transmission. arXiv preprint arXiv:2011.09261 (2020)."},{"key":"#cr-split#-e_1_2_1_7_1.1","doi-asserted-by":"crossref","unstructured":"P. Chen W. Liu H. Chen S. Li M. Li L. Yang and N. Guan. 2020. Reduced worst-case communication latency using single-cycle multi-hop traversal network-on-chip. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2020) 1-1. https:\/\/doi.org\/10.1109\/TCAD.2020.3015440 10.1109\/TCAD.2020.3015440","DOI":"10.1109\/TCAD.2020.3015440"},{"key":"#cr-split#-e_1_2_1_7_1.2","doi-asserted-by":"crossref","unstructured":"P. Chen W. Liu H. Chen S. Li M. Li L. Yang and N. Guan. 2020. Reduced worst-case communication latency using single-cycle multi-hop traversal network-on-chip. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (2020) 1-1. https:\/\/doi.org\/10.1109\/TCAD.2020.3015440","DOI":"10.1109\/TCAD.2020.3015440"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASP-DAC47756.2020.9045103"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1080\/00207543.2018.1535205"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2016.2538284"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2018.2876279"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.877831"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1403375.1403675"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1921249.1921254"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2018.2875476"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/MCSoC.2013.10"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10766-009-0120-y"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/996566.996638"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/PAAP.2011.32"},{"key":"e_1_2_1_20_1","volume-title":"Runtime task scheduling using imitation learning for heterogeneous many-core systems. arXiv preprint arXiv:2007.09361","author":"Krishnakumar Anish","year":"2020","unstructured":"Anish Krishnakumar , Samet E. Arda , A. Alper Goksoy , Sumit K. Mandal , Umit Y. Ogras , Anderson L. Sartor , and Radu Marculescu . 2020. Runtime task scheduling using imitation learning for heterogeneous many-core systems. arXiv preprint arXiv:2007.09361 ( 2020 ). Anish Krishnakumar, Samet E. Arda, A. Alper Goksoy, Sumit K. Mandal, Umit Y. Ogras, Anderson L. Sartor, and Radu Marculescu. 2020. Runtime task scheduling using imitation learning for heterogeneous many-core systems. arXiv preprint arXiv:2007.09361 (2020)."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/HPCA47549.2020.00018"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2020876.2020920"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176254.1176289"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2228360.2228431"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2680542"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/3316781.3317849"},{"key":"e_1_2_1_27_1","volume-title":"A comparative study of meta-heuristic algorithms for solving quadratic assignment problem. arXiv preprint arXiv:1407.4863","author":"Said Gamal Abd","year":"2014","unstructured":"Gamal Abd El-Nasser A. Said , Abeer M. Mahmoud , and El-Sayed M. El-Horbaty . 2014. A comparative study of meta-heuristic algorithms for solving quadratic assignment problem. arXiv preprint arXiv:1407.4863 ( 2014 ). Gamal Abd El-Nasser A. Said, Abeer M. Mahmoud, and El-Sayed M. El-Horbaty. 2014. A comparative study of meta-heuristic algorithms for solving quadratic assignment problem. arXiv preprint arXiv:1407.4863 (2014)."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2010.04.007"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/RSP.2009.18"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/3312046"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-8191(05)80147-4"},{"key":"e_1_2_1_32_1","volume-title":"Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2820\u20132828","author":"Tan Mingxing","unstructured":"Mingxing Tan , Bo Chen , Ruoming Pang , Vijay Vasudevan , Mark Sandler , Andrew Howard , and Quoc V. Le . 2019. Mnasnet: Platform-aware neural architecture search for mobile . In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2820\u20132828 . Mingxing Tan, Bo Chen, Ruoming Pang, Vijay Vasudevan, Mark Sandler, Andrew Howard, and Quoc V. Le. 2019. Mnasnet: Platform-aware neural architecture search for mobile. In Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition. 2820\u20132828."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1854273.1854319"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0019-9958(77)90354-0"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3061639.3062323"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476985","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3476985","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:46Z","timestamp":1750188646000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3476985"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,9,17]]},"references-count":36,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2021,10,31]]}},"alternative-id":["10.1145\/3476985"],"URL":"https:\/\/doi.org\/10.1145\/3476985","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,9,17]]},"assertion":[{"value":"2021-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2021-09-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}