Dynamic Task Merging Scheduling Method for Intermittent Computing System

With the development of the Internet of Things, intermittent systems that rely on energy harvesting devices as power supply equipment have become a research hotspot. Intermittent computing systems face challenges such as frequent power failures and high state-saving overheads due to the instability of energy harvesting. Traditional task-based programming models, while reducing state backup costs compared to checkpointing techniques, still experience significant performance impacts from non-volatile storage operations during task transitions. To address these issues, this paper proposes a dynamic task merging scheduling strategy based on environmental energy prediction. The method utilizes a lightweight Long Short-Term Memory (LSTM) model to forecast environmental energy levels and dynamically adjusts task merging scales based on historical task execution data. Experimental results on the MSP430FR5994 platform demonstrate that, compared to the InK system, the proposed method shortens the execution time of benchmark programs and reduces system power failures. By dynamically optimizing the task merging strategy, the system reduces read and write operations on non-volatile memory, significantly enhancing task completion efficiency under limited energy conditions in intermittent computing devices.

Authors

Institutions

Publication Details

Published
2025-02-28
DOI
https://doi.org/10.1109/iccece65250.2025.10985473
Primary Topic
Distributed and Parallel Computing Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Dynamic Task Merging Scheduling Method for Intermittent Computing System

Bei Sun
Distributed and Parallel Computing Systems
article

Dynamic Task Merging Scheduling Method for Intermittent Computing System

Bei Sun
article en

Abstract

With the development of the Internet of Things, intermittent systems that rely on energy harvesting devices as power supply equipment have become a research hotspot. Intermittent computing systems face challenges such as frequent power failures and high state-saving overheads due to the instability of energy harvesting. Traditional task-based programming models, while reducing state backup costs compared to checkpointing techniques, still experience significant performance impacts from non-volatile storage operations during task transitions. To address these issues, this paper proposes a dynamic task merging scheduling strategy based on environmental energy prediction. The method utilizes a lightweight Long Short-Term Memory (LSTM) model to forecast environmental energy levels and dynamically adjusts task merging scales based on historical task execution data. Experimental results on the MSP430FR5994 platform demonstrate that, compared to the InK system, the proposed method shortens the execution time of benchmark programs and reduces system power failures. By dynamically optimizing the task merging strategy, the system reduces read and write operations on non-volatile memory, significantly enhancing task completion efficiency under limited energy conditions in intermittent computing devices.

Northeastern University (CN)
Openalex Percentile: Top 89%
Distributed and Parallel Computing Systems
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.

Dynamic Task Merging Scheduling Method for Intermittent Computing System — Bei Sun · (2025) | TGRS Research Map | TGRS