| More compute | Adds headroom quickly. | Does not remove redundant state movement. | It is familiar and available. | When power, heat, cost, or size becomes the limiter. | Targets the state movement that creates wasted work. | Show that state movement, not raw compute, dominates the bottleneck. |
| Bigger batteries | Extends runtime by adding stored energy. | Does not reduce work, heat, or data movement. | It avoids architecture changes. | When weight, volume, charging, or field service is constrained. | Evaluates whether the workload can spend less energy on state churn. | Proxy or measured power improvement tied to the target workload. |
| More cooling | Removes heat after it is created. | Does not reduce the work that creates heat. | Thermal fixes are easier to budget than architecture changes. | When fanless, sealed, dense, or water-constrained deployments hit limits. | Evaluates upstream redundant state work before promising thermal impact. | Measured workload improvement and a responsible thermal test plan. |
| More bandwidth | Moves larger state faster. | Does not reduce transfer volume or intermittent-link risk. | Network upgrades are straightforward when available. | When links are expensive, congested, remote, or unavailable. | Focuses on moving meaningful change instead of full state. | Bytes moved, bytes avoided, and correctness preservation. |
| Compression | Shrinks payloads. | May still move full state and can add CPU cost. | It is a proven component-level optimization. | When unchanged state is still repeatedly encoded and moved. | Changes the unit of movement before compression is considered. | Compare compressed baseline to state-aware movement on the same workload. |
| Caching | Keeps frequently used state closer. | Can add invalidation complexity and stale-state risk. | It is familiar and often effective. | When updates, invalidation, or replay dominate the cost. | Tracks meaningful change boundaries instead of only storing copies. | Show reduced invalidation, replay, or sync work with correctness intact. |
| Deduplication | Avoids repeated identical data. | May not model state transitions or coalesced updates. | It is useful for storage and transfer systems. | When the painful cost is change propagation and reconstruction. | Evaluates transition-aware work, not only duplicate payloads. | Trace-level comparison of duplicates avoided versus operations coalesced. |
| Sync protocols | Coordinates state across nodes. | Can still require scans, conflict handling, or large payloads. | They are standard integration surfaces. | When protocol overhead or full-state reconciliation dominates. | Targets the state path beneath or beside the protocol. | Baseline protocol trace and state-aware alternative map. |
| Specialized accelerators | Speeds a defined compute kernel. | May ignore state movement around the kernel. | They fit known workloads such as AI, DSP, or crypto. | When the expensive work is bookkeeping, sync, or reconstruction. | Focuses on state-aware execution and data movement boundaries. | Show the state path is the bottleneck around the accelerator. |
| Cloud offload | Moves compute and storage to larger infrastructure. | Adds latency, bandwidth dependence, and reliability exposure. | It reduces device complexity. | When local, disconnected, private, or low-latency operation matters. | Evaluates keeping more useful state work local. | Latency, bandwidth, and correctness comparison for local execution. |
| Overbuilt hardware | Buys margin across unknowns. | Raises cost, size, power, and thermal burden. | It reduces near-term engineering risk. | When BOM, enclosure, or deployment economics are already tight. | Looks for architectural waste before adding more hardware. | Workload map showing avoided state work and footprint pressure. |
| Manual optimization or feature cuts | Reduces load by hand or removes functionality. | Can be brittle, slow, or product-limiting. | It is under the team's direct control. | When optimization becomes recurring engineering drag. | Evaluates a reusable state-aware path for the constrained workload. | Measured improvement compared with the current optimized baseline. |