{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T16:07:46Z","timestamp":1773504466177,"version":"3.50.1"},"reference-count":37,"publisher":"Association for Computing Machinery (ACM)","issue":"2","funder":[{"name":"National Key Research and Development Program of China","award":["2022YFF0902800"],"award-info":[{"award-number":["2022YFF0902800"]}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["62533019"],"award-info":[{"award-number":["62533019"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100004608","name":"Natural Science Foundation of Jiangsu Province","doi-asserted-by":"crossref","award":["BK20242028"],"award-info":[{"award-number":["BK20242028"]}],"id":[{"id":"10.13039\/501100004608","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":[[2026,3,31]]},"abstract":"<jats:p>Heterogeneous Multicore Platforms (HMPs) have been widely adopted to execute tasks across a range of applications. Under limited system resources and diverse application requirements, allocating and executing dependent Approximate Computing (AC) tasks on these platforms to achieve high Quality-of-Service (QoS) is challenging. Dynamic Voltage and Frequency Scaling (DVFS) and task migration have proven effective for improving QoS while balancing time and energy consumption. However, existing approaches often overlook the migration overhead and the resulting dynamic changes in task dependencies, which can adversely affect mapping outcomes. To address these issues, this article presents a novel AC task mapping method that maximizes system QoS under multiple constraints on HMPs, accounting for task migration overhead, DVFS, and changes in Directed Acyclic Graph (DAG) topology. We first formulate this joint design problem as a complex nonlinear programming problem. Next, we linearize the nonlinear terms without performance loss by introducing auxiliary variables and additional constraints. Building on this formulation, we propose an optimal (OPT) and a low-complexity Heuristic Algorithm\u00a0(HEU), derived from problem decomposition and a greedy strategy, which divides the Mixed-Integer Non-Linear Programming (MINLP) problem into two smaller subproblems with fewer variables and constraints, solving them sequentially. The simulation results show that the proposed OPT method achieves higher QoS performance, measured at about 2.389 times on average and up to 4.115 times, while its feasibility is increased to about 3.263 times on average and up to 9.667 times, compared to other state-of-the-art methods. In addition, the average QoS of the proposed HEU method is about 0.577 times that of the proposed method, but its computation time is over a thousand times shorter.<\/jats:p>","DOI":"10.1145\/3797041","type":"journal-article","created":{"date-parts":[[2026,2,9]],"date-time":"2026-02-09T21:33:27Z","timestamp":1770672807000},"page":"1-31","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["QoS-Aware Approximate Task Mapping on Heterogeneous Multicore Platforms with DVFS and Task Migration"],"prefix":"10.1145","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-0533-647X","authenticated-orcid":false,"given":"Hengyan","family":"Song","sequence":"first","affiliation":[{"name":"School of Automation, Southeast University","place":["Nanjing, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1119-7617","authenticated-orcid":false,"given":"Lei","family":"Mo","sequence":"additional","affiliation":[{"name":"School of Automation, Southeast University","place":["Nanjing, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9927-4305","authenticated-orcid":false,"given":"Tamim","family":"Al-Hasan","sequence":"additional","affiliation":[{"name":"School of Computer Science and Electronic Engineering, University of Essex","place":["Colchester, UK"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9293-469X","authenticated-orcid":false,"given":"Angeliki","family":"Kritikakou","sequence":"additional","affiliation":[{"name":"IRISA","place":["Rennes, France"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1030-8311","authenticated-orcid":false,"given":"Xiaojun","family":"Zhai","sequence":"additional","affiliation":[{"name":"School of Computer Science and Electronic Engineering, University of Essex","place":["Colchester, UK"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1505-6766","authenticated-orcid":false,"given":"Shibo","family":"He","sequence":"additional","affiliation":[{"name":"College of Control Science and Engineering, Zhejiang University","place":["Hangzhou, China"]}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4334-6418","authenticated-orcid":false,"given":"Olivier","family":"Sentieys","sequence":"additional","affiliation":[{"name":"University of Rennes, INRIA, IRISA, CNRS","place":["Rennes, France"]}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2026,3,9]]},"reference":[{"key":"e_1_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.3390\/app11125740"},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.23919\/ACC55779.2023.10156102"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2023.3330973"},{"key":"e_1_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1145\/1854153.1854174"},{"key":"e_1_3_1_6_2","volume-title":"Arm DynamIQ Technology Overview","year":"2025","unstructured":"Arm. 2025. Arm DynamIQ Technology Overview. Technical Report. Retrieved from https:\/\/www.arm.com\/technologies\/dynamiq"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.2985701"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/MCSoC.2016.20"},{"key":"e_1_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/3476993"},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1145\/2567935"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/COMPSAC.2018.10264"},{"key":"e_1_3_1_12_2","first-page":"770","volume-title":"Proceedings of the IEEE International Real-Time Scheduling Open Problems Seminar","author":"Chwa Hoon Sung","year":"2013","unstructured":"Hoon Sung Chwa, Jaebaek Seo, Hyuck Yoo, Jinkyu Lee, and Insik Shin. 2013. Energy and feasibility optimal global scheduling framework on big.LITTLE platforms. In Proceedings of the IEEE International Real-Time Scheduling Open Problems Seminar. 770\u2013777."},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS52030.2021.00038"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISVLSI49217.2020.00063"},{"key":"e_1_3_1_15_2","volume-title":"Symmetric Multiprocessing (SMP) with FreeRTOS","year":"2025","unstructured":"FreeRTOS 2025. Symmetric Multiprocessing (SMP) with FreeRTOS. FreeRTOS. Retrieved from https:\/\/freertos.org\/Documentation\/02-Kernel\/02-Kernel-features\/13-Symmetric-multiprocessing-introduction#smp-specific-apis"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.17352\/tcsit.000055"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/TSMC.2018.2865965"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3470451"},{"key":"e_1_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/2024724.2024811"},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD.2008.4681641"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.3390\/en16020890"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2313338"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3222293"},{"key":"e_1_3_1_24_2","volume-title":"MediaTek CorePilot 3.0: Tri-cluster CPU Architecture and Heterogeneous Computing Scheduling","year":"2015","unstructured":"MediaTek. 2015. MediaTek CorePilot 3.0: Tri-cluster CPU Architecture and Heterogeneous Computing Scheduling. Technical Report. Retrieved from https:\/\/www.mediatek.com\/hubfs\/MediaTek%20Assets\/Pdfs\/White_Papers\/MediaTek_CorePilot_3.0.pdf"},{"key":"e_1_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8715077"},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1587\/transinf.2019EDP7101"},{"key":"e_1_3_1_27_2","first-page":"1","volume-title":"Proceedings of the International Conference on Automated Planning and Scheduling","author":"Percassi Francesco","year":"2022","unstructured":"Francesco Percassi and Sangeet Saha. 2022. QoS-aware approximate real-time tasks execution on multiprocessor systems using PDDL+ planning. In Proceedings of the International Conference on Automated Planning and Scheduling. 1\u20136."},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/ESTMED.2007.4375803"},{"key":"e_1_3_1_29_2","first-page":"5:1\u20135:14","volume-title":"Proceedings of the Workshop on Next Generation Real-Time Embedded Systems","author":"Pourmohseni Behnaz","year":"2020","unstructured":"Behnaz Pourmohseni, Fedor Smirnov, Stefan Wildermann, and J\u00fcrgen Teich. 2020. Real-time task migration for dynamic resource management in many-core systems. In Proceedings of the Workshop on Next Generation Real-Time Embedded Systems. 5:1\u20135:14."},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1016\/j.suscom.2020.100474"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2022.3161407"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11227-014-1140-y"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2017.2772896"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.3042663"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1145\/3570503"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.194"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2020.2997242"},{"key":"e_1_3_1_38_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2017.7927212"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3797041","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T12:46:55Z","timestamp":1773492415000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3797041"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,3,9]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,3,31]]}},"alternative-id":["10.1145\/3797041"],"URL":"https:\/\/doi.org\/10.1145\/3797041","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,3,9]]},"assertion":[{"value":"2025-07-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-02-02","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-03-09","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}