TY - GEN
T1 - Data-Dependent WAR Analysis for Efficient Task-Based Intermittent Computing
AU - Niu, Juxin
AU - Yu, Yunlong
AU - Zhang, Wei
AU - Guan, Nan
N1 - Full text of this publication does not contain sufficient affiliation information. With consent from the author(s) concerned, the Research Unit(s) information for this record is based on the existing academic department affiliation of the author(s).
PY - 2024
Y1 - 2024
N2 - Energy harvesting systems provide power solutions for Internet-of-Things (IoT) devices, liberating them from battery life constraints. However, unstable power supplies can cause frequent power failures. This leads to the non-progress problem, where the system loses its state and, upon power restoration, is unable to resume unfinished programs, forcing it to start from the beginning. To tackle this issue, task-based Intermittent Computing (ImC) has been proposed. This approach breaks the program into multiple tasks and uses non-volatile memory (NVM) to store the results of completed tasks. When power is restored, the system can resume from the last unfinished task, avoiding the need to restart the entire program. However, a specific type of data, known as write-after-read (WAR) data, can introduce consistency errors during execution. Current approaches prevent these errors by backing up WAR data before task execution, but identifying such data precisely remains a challenge. Runtime detection methods can accurately find WAR data but introduce significant performance overhead. Meanwhile, static analysis techniques tend to be overly conservative, resulting in excessive and unnecessary backups. In this paper, we first examine the limitations of existing methods, then propose a hybrid WAR analysis method. This approach combines static analysis and leverages information during run-time to more accurately identify WAR data, with nearly no increase in run-time overhead. Experimental results indicate that compared to existing methods, our approach can significantly reduce system backup overhead and achieve up to a 9.20× performance improvement. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
AB - Energy harvesting systems provide power solutions for Internet-of-Things (IoT) devices, liberating them from battery life constraints. However, unstable power supplies can cause frequent power failures. This leads to the non-progress problem, where the system loses its state and, upon power restoration, is unable to resume unfinished programs, forcing it to start from the beginning. To tackle this issue, task-based Intermittent Computing (ImC) has been proposed. This approach breaks the program into multiple tasks and uses non-volatile memory (NVM) to store the results of completed tasks. When power is restored, the system can resume from the last unfinished task, avoiding the need to restart the entire program. However, a specific type of data, known as write-after-read (WAR) data, can introduce consistency errors during execution. Current approaches prevent these errors by backing up WAR data before task execution, but identifying such data precisely remains a challenge. Runtime detection methods can accurately find WAR data but introduce significant performance overhead. Meanwhile, static analysis techniques tend to be overly conservative, resulting in excessive and unnecessary backups. In this paper, we first examine the limitations of existing methods, then propose a hybrid WAR analysis method. This approach combines static analysis and leverages information during run-time to more accurately identify WAR data, with nearly no increase in run-time overhead. Experimental results indicate that compared to existing methods, our approach can significantly reduce system backup overhead and achieve up to a 9.20× performance improvement. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.
KW - Data Consistency
KW - Intermittent Computing
KW - Static Analysis
KW - WAR Data
UR - http://www.scopus.com/inward/record.url?scp=85210824918&partnerID=8YFLogxK
UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85210824918&origin=recordpage
U2 - 10.1007/978-981-96-0602-3_5
DO - 10.1007/978-981-96-0602-3_5
M3 - RGC 32 - Refereed conference paper (with host publication)
SN - 978-981-96-0601-6
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 85
EP - 101
BT - Dependable Software Engineering. Theories, Tools, and Applications
A2 - Bourke, Timothy
A2 - Chen, Liqian
A2 - Goharshady, Amir
PB - Springer Singapore
T2 - 10th International Symposium on Dependable Software Engineering: Theories, Tools and Applications, SETTA 2024
Y2 - 26 November 2024 through 28 November 2024
ER -