HSHengyan Song

Hengyan Song

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


Hengyan Song has a total of 8 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    QoS-Aware Approximate Task Mapping on Heterogeneous Multicore Platforms with DVFS and Task Migration

    by Hengyan Song, Lei Mo, Tamim Al-Hasan, Angeliki Kritikakou, Xiaojun Zhai, Shibo He, Olivier Sentieys

    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.

  • Open Access

    PKTQ: Per‐Kernel Thresholded Quantization With Size‐Constrained Two‐Stage Optimization for CNNs

    by Hengyan Song, Lei Mo, Tamim M. Al‐Hasan, Minyu Cui, Guiyun Liu, Xiaojun Zhai

    Convolutional neural networks are challenging to deploy on resource‐constrained computing platforms due to their high storage and computational demands. Mixed‐precision quantization can mitigate these issues by assigning different bit‐widths per layer. However, finding an optimal quantization policy is challenging due to the exponential size of the policy search space and the need for extensive policy evaluations. Additionally, existing works often overlook strict model size constraints and apply per‐layer quantization, which ignores intra‐kernel variances. We propose a two‐stage deep deterministic policy gradient (DDPG) framework. In the first stage, it optimizes accuracy; in the second, it jointly optimizes accuracy and model size with a constraint‐aware reward that enforces storage limits during training. On this basis, a per‐kernel clipping threshold is introduced to reduce quantization error by adapting the clipping threshold to individual kernel distributions. We perform extensive simulations based on ImageNet with MobileNet‐V1/V2 and ResNet‐50. The results show that our method outperforms the state‐of‐the‐art baselines under the same compression ratios, achieving minimal accuracy drops with aggressive compression and near‐lossless performance at moderate levels.