Energy-Saving Scheduling Strategy for Real-Time Applications on big.LITTLE Architectures

In recent years, with the increasing demand for computing power from various intelligent applications on mobile devices, heterogeneous multi-core architectures have received more attention. The big.LITTLE architecture, as a new type of energy-saving architecture, consists of high-performance cores and low energy consumption cores, which can better meet the real-time task requirements of various mobile devices. One of the challenges faced by these scheduling algorithms is how to fully utilize the advantages of big.LITTLE architectures to achieve a balance between system energy consumption and performance. To address this issue, we designed an initial task allocation strategy based on the characteristics of big.LITTLE architecture, introduced reinforcement learning algorithms for decision-making, and assigned different types of tasks to their appropriate processors. In order to balance task load and reduce total scheduling time, we proposed a dynamic migration algorithm, which dynamically adjusts task load by migrating them in the case of imbalanced utilization. Experimental results demonstrate that the proposed algorithm effectively balances energy consumption and performance, improves resource utilization, and reduces both scheduling time and energy consumption.

Authors

Institutions

Publication Details

Journal
IEEE Internet of Things Journal
Published
2025-05-09
DOI
https://doi.org/10.1109/jiot.2025.3568691
Citations
2
Primary Topic
Real-Time Systems Scheduling
Type
article
Field-Weighted Citation Impact
4.54

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Energy-Saving Scheduling Strategy for Real-Time Applications on big.LITTLE Architectures

Sai Jin Xiao, Xiaochuan Guo, Wufei Wu, Jiafeng Wang et al.
2 citations
IEEE Internet of Things Journal
Real-Time Systems Scheduling
4.54
article

Energy-Saving Scheduling Strategy for Real-Time Applications on big.LITTLE Architectures

Sai Jin Xiao, Xiaochuan Guo, Wufei Wu, Jiafeng Wang, Dongfeng Jia
article en
2 citations

Abstract

In recent years, with the increasing demand for computing power from various intelligent applications on mobile devices, heterogeneous multi-core architectures have received more attention. The big.LITTLE architecture, as a new type of energy-saving architecture, consists of high-performance cores and low energy consumption cores, which can better meet the real-time task requirements of various mobile devices. One of the challenges faced by these scheduling algorithms is how to fully utilize the advantages of big.LITTLE architectures to achieve a balance between system energy consumption and performance. To address this issue, we designed an initial task allocation strategy based on the characteristics of big.LITTLE architecture, introduced reinforcement learning algorithms for decision-making, and assigned different types of tasks to their appropriate processors. In order to balance task load and reduce total scheduling time, we proposed a dynamic migration algorithm, which dynamically adjusts task load by migrating them in the case of imbalanced utilization. Experimental results demonstrate that the proposed algorithm effectively balances energy consumption and performance, improves resource utilization, and reduces both scheduling time and energy consumption.

IEEE Internet of Things JournalVol. 12(15)
Nanchang University (CN)
National Natural Science Foundation of China, China Postdoctoral Science Foundation
Affordable and clean energy
Openalex Percentile: Top 7%
Real-Time Systems Scheduling
4.54
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.