Journal of Systems Engineering and Electronics ›› 2026, Vol. 37 ›› Issue (3): 897-903.doi: 10.23919/JSEE.2026.000042

• SYSTEMS ENGINEERING • Previous Articles     Next Articles

Heterogeneous multi-core task scheduling based on adaptive simulated annealing

Guoliang ZHU1(), Jinjian ZHANG2(), Xuan LIU2(), Guojun WANG2(), Xiaodong ZHANG2(), Kaiyu CHEN3(), Yu WANG3,*()   

  1. 1School of Information and Electronics, Beijing Institute of Technology, Beijing 100081, China
    2Beijing Research Institute of Telemetry, Beijing 100076, China
    3School of Microelectronics, Northwestern Polytechnical University, Xi’an 710072, China
  • Received:2025-10-23 Online:2026-06-18 Published:2026-06-29
  • Contact: Yu WANG E-mail:zhujunren@126.com;zhangjinjian1221@163.com;1298604075@qq.com;2111979554@qq.com;zxd0352@qq.com;kaiyu_chen@mail.nwpu.edu.cn;wyyyyy@mail.nwpu.edu.cn

Abstract:

To address the energy consumption issues caused by task lengths in task scheduling on heterogeneous multi-core systems, this paper proposes an adaptive parameterized improved simulated annealing algorithm based on the directed acyclic graph task model. The algorithm employs feedback from acceptance rates to dynamically adjust the temperature and neighborhood size of the simulated annealing process. Additionally, it introduces a security mechanism to enhance convergence speed and global search capabilities. Compared against classical simulated annealing and standard heuristic algorithms, the proposed algorithm achieves reductions exceeding 54% in convergence generations, 50% in task slots, and 10% in scheduling time, providing a direction for low-power task scheduling.

Key words: heterogeneous multi-core, task scheduling, schedule length, simulated annealing