ETRI-Knowledge Sharing Plaform

KOREAN
논문 검색
Type SCI
Year ~ Keyword

Detail

Conference Paper Liveness-Aware Checkpointing of Arrays for Efficient Intermittent Computing
Cited 0 time in scopus Share share facebook twitter linkedin kakaostory
Authors
Youngbin Kim, Yoojin Lim, Chaedeok Lim
Issue Date
2023-04
Citation
Design, Automation & Test in Europe Conference (DATE) 2023, pp.1-6
Language
English
Type
Conference Paper
DOI
https://dx.doi.org/10.23919/DATE56975.2023.10137060
Abstract
Intermittent computing enables computing under environments that may experience frequent and unpredictable power failures, such as energy harvesting systems. It relies on checkpointing to preserve computing progress between power cycles, which often incurs significant overhead due to energy-expensive writes to Non-Volatile Memory (NVM). In this paper, we present LACT (Liveness-Aware CheckpoinTing), as an approach to reducing the size of checkpointed data by exploiting the liveness of memory objects: excluding dead memory objects from checkpointing does not affect the correctness of the program. Especially, LACT can analyze the liveness of arrays, which take up most of the memory space but are not analyzable by existing methods for detecting the liveness of scalar objects. Using the liveness information of arrays, LACT determines the minimized checkpoint range for the arrays at compile time without any runtime addition. Our evaluation shows that LACT achieves an additional reduction of checkpointed data size of 37.8% on average over the existing state-of-the-art technique. Also, our experiments on a real energy harvesting environment show that LACT can reduce the execution time of applications by 27.7% on average.
KSP Keywords
Compile time, Data size, Energy Harvesting(EH), Intermittent computing, Memory space, Non-Volatile Memory(NVM), Power cycles, execution time, existing state, harvesting systems, state-of-The-Art