← 研踪 PaperTrailarXiv:2611.15681 · v1
Energy Aware Optimization of Non-Deterministic Task-Based Intermittent Computing Nodes with Thimble
首次提交 2026-11-12 00:24
版本更新 2026-11-12 00:24
雷达观测 2026-11-13 14:16
摘要
Intermittent computing nodes run on harvested energy, which they store in capacitors and spend in short bursts of computation. Choosing those capacitors is a trade-off: large capacitors can power large tasks but leak more current, wasting harvested energy, while small capacitors leak less but cannot power large tasks. Recent work, LEACS, showed that selecting capacitors and mapping tasks to them at compile time improves inference throughput. However, LEACS optimizes the mapping for a predetermined workload, whereas sensor nodes often run data-dependent workloads in which the next task depends on the outcome of earlier ones. We present Thimble, an energy storage system that maps a node's tasks to capacitors at runtime. Thimble models the workload as a Markov chain over tasks and assigns each task to a capacitor by weighing capacitor leakage, the task's energy demand and, when it replans, the likelihood of each future task. We compare Thimble against a reimplementation of LEACS, which ranks every static plan by simulation. When the training trace resembles deployment, Thimble's single design-time solve comes within 0.3--4% of LEACS's throughput. When the deployment conditions drift from the characteristics of the training set, LEACS's throughput-focused static plans can fail sharply. On the lowest-power source we consider, LEACS's plan stalls on deployment traces that harvest less than its training trace, and on some never wakes; Thimble avoids this, with 22--29% higher throughput at the reference workload. A sensitivity sweep over 25 workload profiles on that source shows that Thimble with depth replanning leads LEACS by 22--42% throughout, and what run-time remapping adds: replanning at a fixed interval matches or improves on the static map at 21 of 25 points, by up to 7%.
观测到的版本
相邻记录可能跳过中间版本；首次发现 v2 及以上也会标为版本更新。
v1 · 2026-11-12 00:24 · 最新观测版本
Energy Aware Optimization of Non-Deterministic Task-Based Intermittent Computing Nodes with Thimble
Intermittent computing nodes run on harvested energy, which they store in capacitors and spend in short bursts of computation. Choosing those capacitors is a trade-off: large capacitors can power large tasks but leak more current, wasting harvested energy, while small capacitors leak less but cannot power large tasks. Recent work, LEACS, showed that selecting capacitors and mapping tasks to them at compile time improves inference throughput. However, LEACS optimizes the mapping for a predetermined workload, whereas sensor nodes often run data-dependent workloads in which the next task depends on the outcome of earlier ones. We present Thimble, an energy storage system that maps a node's tasks to capacitors at runtime. Thimble models the workload as a Markov chain over tasks and assigns each task to a capacitor by weighing capacitor leakage, the task's energy demand and, when it replans, the likelihood of each future task. We compare Thimble against a reimplementation of LEACS, which ranks every static plan by simulation. When the training trace resembles deployment, Thimble's single design-time solve comes within 0.3--4% of LEACS's throughput. When the deployment conditions drift from the characteristics of the training set, LEACS's throughput-focused static plans can fail sharply. On the lowest-power source we consider, LEACS's plan stalls on deployment traces that harvest less than its training trace, and on some never wakes; Thimble avoids this, with 22--29% higher throughput at the reference workload. A sensitivity sweep over 25 workload profiles on that source shows that Thimble with depth replanning leads LEACS by 22--42% throughout, and what run-time remapping adds: replanning at a fixed interval matches or improves on the static map at 21 of 25 points, by up to 7%.
查看此版本解读 →查看此版本原文 ↗