QoS-Aware Approximate Task Mapping on Heterogeneous Multicore Platforms with DVFS and Task Migration
Open Access
- 9 March 2026
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Embedded Computing Systems
- Vol. 25 (2) , 1-31
Abstract
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 (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.Keywords
Funding Information
- National Key Research and Development Program of China (2022YFF0902800)
- National Natural Science Foundation of China (62533019)
- Natural Science Foundation of Jiangsu Province (BK20242028)
This publication has 31 references indexed in Scilit:
- Overhead Based Cluster Scheduling of Mixed Criticality Systems on Multicore PlatformIEEE Access, 2023
- Approximation-Aware Task Deployment on Heterogeneous Multicore Platforms With DVFSIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022
- ACCURATE: Accuracy Maximization for Real-Time Multicore Systems With Energy-Efficient Way-Sharing CachesIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2022
- Energy-aware primary/backup scheduling of periodic real-time tasks on heterogeneous multicore systemsSustainable Computing: Informatics and Systems, 2021
- Performance Optimization of Many-Core Systems by Exploiting Task Migration and Dark Core AllocationIEEE Transactions on Computers, 2020
- DVFS-Based Quality Maximization for Adaptive Applications With Diminishing ReturnIEEE Transactions on Computers, 2020
- Energy-Efficient Parallel Real-Time Scheduling on Clustered Multi-CoreIEEE Transactions on Parallel and Distributed Systems, 2020
- Cost-Constrained QoS Optimization for Approximate Computation Real-Time Tasks in Heterogeneous MPSoCsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2017
- Minimizing Energy Consumption for Frame-Based Tasks on Heterogeneous Multiprocessor PlatformsIEEE Transactions on Parallel and Distributed Systems, 2015
- Proactive task migration with a self-adjusting migration threshold for dynamic thermal management of multi-core processorsThe Journal of Supercomputing, 2014