Energy & Power · Study deck
Compute Offloading and Placement
Picture a battery camera that must spot a person before opening a gate.
Battery Bruno is your guide for this deck.

After studying this chapter
Learning objectives
You will be able to:
- Build a local-versus-remote energy ledger for an IoT workload.
- Explain why upload size, result size, radio state, retries, and latency affect offloading decisions.
- Apply MAUI-style runtime profiling without treating cloud execution as automatically cheaper.
- Decide when edge offload, cloud offload, local acceleration, partial offload, or deferral is the best placement.
Major section
Start With a Choice: Compute Here or Transmit
The first useful comparison measures the same decision both ways.
- DSP means digital signal processing, or math that changes or extracts meaning from sampled signals.
- A gateway means a device or service that joins two system paths.
- Latency means the time from an input event to the result that matters.
Major section
Start With a Choice: Compute Here or Transmit (continued)
Weaken the link, repeat the request, restart the gateway, and keep a safe local response when the remote answer is missing or stale.
- This runway does not prove that local or remote work is always cheaper.
- The deeper sections compare processor fit, radio states, transfer size, privacy, waiting cost, and the break-even evidence for each placement.
- A device can process data locally, send features to an edge node, or push raw samples to the cloud.
- None of those choices is automatically cheaper; the winner depends on radio energy, data size, latency, privacy, and accelerator fit.
Major section
The Offloading Ledger
An offloading decision starts by comparing two ledgers at the same workload boundary.
- The ledger should use measured values from the device, firmware, network, and deployment environment.
- Vendor datasheet currents are useful for early sizing, but promotion decisions need current traces or power-monitor logs.
Major section
Worked Example: Feature Extraction
Scenario: A wearable collects a 150 kB motion window and runs a feature-extraction model.
- Local CPU execution takes 5 seconds at 180 mW.
- Wi-Fi offload path: upload the 150 kB window, receive a small result, and wait for remote processing.
- Cellular offload path: the same transfer uses a higher-power radio and includes state-transition overhead.
Major section
Heterogeneous Local Computing
For heterogeneous local computing, a result at checks workload type, deadline, is incomplete without: CPU baseline.
- Tooling and fixed-point constraints can make integration harder.
- Setup power can dominate small tasks; speedup is not the same as energy savings.
- Unsupported layers, memory pressure, or model conversion can force fallback.
Major section
Reading the Keyword-Spotting Benchmarks
An optimized local GPU path was about 6.5 times faster than the cloud comparison in one measurement and about 21.3 times faster than a sequential CPU implementation in another.
- and always name $A$, $B$, the batch size, model, precision, data-transfer boundary, and whether setup time is included.
Major section
Reading the Keyword-Spotting Benchmarks (continued)
Cloud energy also changes with bandwidth and batching.
- $$ E_{cloud}=E_{attach}+P_{tx}\frac{D_{up}}{R_{up}}+P_{wait}t_{remote} +P_{rx}\frac{D_{down}}{R_{down}}+E_{tail}, $$.
- Increasing batch size $b$ amortizes the fixed local wake and setup costs, but it also delays the oldest sample by roughly the batch-formation time.
- The There is no universal winner panel directs the review toward the crossover among batch size, link rate, wake cost, and transfer energy.
- Higher link throughput reduces the payload-time terms in $E_{cloud}$, yet it does not erase attach, wait, retry, or tail energy.
Deck summary
Key takeaways
The first useful comparison measures the same decision both ways.
- Weaken the link, repeat the request, restart the gateway, and keep a safe local response when the remote answer is missing or stale.
- An offloading decision starts by comparing two ledgers at the same workload boundary.
- Scenario: A wearable collects a 150 kB motion window and runs a feature-extraction model.
- For heterogeneous local computing, a result at checks workload type, deadline, is incomplete without: CPU baseline.
Retrieval practice
Recall check 1 of 6

Battery Bruno says: answer from memory, then check your reasoning.
Q1A device spends 900 mJ running a feature-extraction task locally. The Wi-Fi remote path costs 240 mJ upload, 9 mJ download, and 12 mJ wait energy. If latency and privacy are acceptable, what should the policy choose?
Show answer
Answer: B The offloading ledger compares total local energy with total remote-path energy, then applies latency, privacy, availability, and reliability gates.
Retrieval practice
Recall check 2 of 6

Battery Bruno says: answer from memory, then check your reasoning.
Q2A wake-word detector runs every second and can execute on either the CPU or an always-on DSP. Which evidence most strongly supports moving it to the DSP?
Show answer
Answer: B Heterogeneous computing is useful only when the selected processor lowers total energy while preserving timing, accuracy, and integration requirements.
Retrieval practice
Recall check 3 of 6

Battery Bruno says: answer from memory, then check your reasoning.
Q3Place each offloading record where it lives so you can compare local and remote execution and make a bounded placement decision.
Show answer
Answer: A The three regions separate workload and local cost, remote transfer and policy gates, and the governed outcome so you can decide placement from complete evidence rather than one energy number.
Retrieval practice
Recall check 4 of 6

Battery Bruno says: answer from memory, then check your reasoning.
Q4Which workload is the best candidate to offload from a battery node for energy reasons?
Show answer
Answer: A Offloading wins when you avoid a lot of computation while moving only a little data.
Retrieval practice
Recall check 5 of 6

Battery Bruno says: answer from memory, then check your reasoning.
Q5A 2 s inference costs 30 mA-s locally. The radio costs 0.00096 mA-s per byte. The node must decide placement for an 80 KB raw input. What is the energy-correct choice?
Show answer
Answer: D
Retrieval practice
Recall check 6 of 6

Battery Bruno says: answer from memory, then check your reasoning.
Q6An offload decision computed from active transmit time alone shows offloading a small payload over cellular is cheaper than local compute, but the measured battery drain says the opposite. What is the most likely missing cost?
Show answer
Answer: A Cellular attach and the post-transmission tail draw significant current that a payload-only estimate ignores.
Print reference
Answers 1 of 2
Answer key.
- B · The offloading ledger compares total local energy with total remote-path energy, then applies latency, privacy, availability, and reliability gates.
- B · Heterogeneous computing is useful only when the selected processor lowers total energy while preserving timing, accuracy, and integration requirements.
- A · The three regions separate workload and local cost, remote transfer and policy gates, and the governed outcome so you can decide placement from complete evidence rather than one energy number.
Print reference
Answers 2 of 2
Answer key.
- A · Offloading wins when you avoid a lot of computation while moving only a little data.
- D
- A · Cellular attach and the post-transmission tail draw significant current that a payload-only estimate ignores.