Checkpointing strategies for efficient reactive intermittent computing systems
Checkpointing strategies for efficient reactive intermittent computing systems
The Internet of Things is a growing field, with 1 trillion devices forecast to be collecting, sending and showing information. These devices exist on a scale from the ultra-power constrained to large, data-rich, mains connected devices. Powering the ultra-constrained devices is challenging, particularly when mass, size and cost must be minimised. Energy harvesting presents a way of increasing the lifetime of battery powered devices. A more sustainable approach is removing any form of energy storage, significantly reducing the mass, size and cost. Unfortunately, energy harvesters have low power density, temporal variation and unpredictability, making running directly from the supply difficult with traditional computing schemes. A new paradigm, intermittent computing, overcomes intermittency by storing information in non-volatile memory ahead of power-failure. Reactive checkpointing is one such approach that monitors the supply voltage, and interrupts execution to store volatile data before the supply voltage drops below the minimum operating voltage of the processor. As intermittent computing matures from proof-of-concept to deploy-able systems, adaptation for system-on-chip implementation is crucial to understand the limitations of existing schemes and application agnostic strategies. By profiling power and memory accesses in RTL and gate-level simulations, as well as analysing memory-usage across benchmarks, design criteria can be established. All intermittent computing schemes suffer performance from the added time and energy overheads of saving state. Two methods for reducing these overheads for any benchmarks and conditions are presented: PowerNapping and Expedit. These give improvements of up to 46.8% and 84.4% in completion time across a range of benchmarks.
University of Southampton
Daulby, Timothy
5ce607f3-828f-4869-99c6-eed20acc2964
October 2022
Daulby, Timothy
5ce607f3-828f-4869-99c6-eed20acc2964
Weddell, Alexander
3d8c4d63-19b1-4072-a779-84d487fd6f03
Daulby, Timothy
(2022)
Checkpointing strategies for efficient reactive intermittent computing systems.
University of Southampton, Doctoral Thesis, 166pp.
Record type:
Thesis
(Doctoral)
Abstract
The Internet of Things is a growing field, with 1 trillion devices forecast to be collecting, sending and showing information. These devices exist on a scale from the ultra-power constrained to large, data-rich, mains connected devices. Powering the ultra-constrained devices is challenging, particularly when mass, size and cost must be minimised. Energy harvesting presents a way of increasing the lifetime of battery powered devices. A more sustainable approach is removing any form of energy storage, significantly reducing the mass, size and cost. Unfortunately, energy harvesters have low power density, temporal variation and unpredictability, making running directly from the supply difficult with traditional computing schemes. A new paradigm, intermittent computing, overcomes intermittency by storing information in non-volatile memory ahead of power-failure. Reactive checkpointing is one such approach that monitors the supply voltage, and interrupts execution to store volatile data before the supply voltage drops below the minimum operating voltage of the processor. As intermittent computing matures from proof-of-concept to deploy-able systems, adaptation for system-on-chip implementation is crucial to understand the limitations of existing schemes and application agnostic strategies. By profiling power and memory accesses in RTL and gate-level simulations, as well as analysing memory-usage across benchmarks, design criteria can be established. All intermittent computing schemes suffer performance from the added time and energy overheads of saving state. Two methods for reducing these overheads for any benchmarks and conditions are presented: PowerNapping and Expedit. These give improvements of up to 46.8% and 84.4% in completion time across a range of benchmarks.
Text
PhD_Thesis_Timothy_Daulby
- Version of Record
Text
PTD Thesis Daulby SIGNED
Restricted to Repository staff only
More information
Published date: October 2022
Identifiers
Local EPrints ID: 473996
URI: http://eprints.soton.ac.uk/id/eprint/473996
PURE UUID: d67dcc0c-bd25-475b-aa2f-4ccc3022a8b7
Catalogue record
Date deposited: 08 Feb 2023 17:36
Last modified: 17 Mar 2024 03:05
Export record
Contributors
Author:
Timothy Daulby
Thesis advisor:
Alexander Weddell
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics