Hardware Mechanisms to Dynamically Throttle AI Performance

• URL: http://arxiv.org/abs/2607.18069v1
• Date: Mon, 20 Jul 2026 15:36:03 GMT
• Title: Hardware Mechanisms to Dynamically Throttle AI Performance
• Abstract summary: We introduce a set of microarchitecture knobs which dynamically control the available hardware resources to limit AI performance at runtime.<n>To minimize new logic and extra design cost, we build all four mechanisms from well-established microarchitectural primitives.<n>We show that these knobs achieve high performance sensitivity (up to 80% performance cut at 1/8 resource availability), negligible implementation cost (10K flip flops), fast stabilization after dynamic throttling (5-80K cycles), and minimal collateral impact on the rest of the chip.
• Score: 3.359978138010107
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: As more capable AI models are increasingly integrated into critical computer systems, the lack of control over AI intent motivates safety mechanisms. Existing software safeguards impose only behavioral constraints that can potentially be bypassed by sufficiently intelligent models. While hardware-level safety enforcement has been recognized as an essential last line of defense, few mechanisms have been proposed beyond policy regulations on unauthorized accesses or coarse full-chip shutdown. What is missing is a fine-grained, dynamic intervention mechanism at the architecture level. In this paper, we introduce a set of microarchitecture knobs which dynamically control the available hardware resources to limit AI performance at runtime. We evaluate candidate knobs spanning the GPU memory subsystem, across capacity, bandwidth, latency and frequency dimensions, and narrow down to four strong candidates: L2 size, L2 latency, L2 bandwidth, and shared memory port access rate. To minimize new logic and extra design cost, we build all four mechanisms from well-established microarchitectural primitives: cache way masking, credit-based rate limiting, latency insertion, and bank arbitration. We show that these knobs achieve high performance sensitivity (up to 80% performance cut at 1/8 resource availability), negligible implementation cost (<~10K flip flops), fast stabilization after dynamic throttling (5-80K cycles), and minimal collateral impact on the rest of the chip. Further, multi-knob analysis reveals combinations of knobs that amplify the performance degradation beyond the effect of each knob individually, which enables a broader range of performance targets.

Related papers

• ARTA: Adaptive Reinforcement-Learning-Based Throttling Agent for RowHammer Vulnerabilities [0.0]
  ARTA is a lightweight reinforcement-learning-based throttling mechanism that detects and suppresses RowHammer activity.<n> ARTA requires no DRAM-side hardware modification or offline training, using small structures in the memory controller.<n>Our evaluation shows that ARTA eliminates all bitflips at N_BO values down to 64, reduces bitflips up to 22K times at N_BO of 20, and improves performance up to 73.6% over state-of-the-art mitigation mechanisms.
  arXiv  Detail & Related papers  (2026-06-06T15:36:41Z)
• Device-Conditioned Neural Architecture Search for Efficient Robotic Manipulation [16.017058636822025]
  We propose a unified framework named textbfDevice-textbfConditioned textbfQuantization-textbfFor-textbfAll (DC-QFA)<n>DC-QFA amortizes deployment effort with the device-conditioned quantization-aware training and hardware-constrained architecture search.
  arXiv  Detail & Related papers  (2026-04-11T11:36:16Z)
• AdaFuse: Accelerating Dynamic Adapter Inference via Token-Level Pre-Gating and Fused Kernel Optimization [84.25316984309725]
  Integration of dynamic, sparse structures with parameter-efficient adapters (e.g., LoRA) is a powerful technique for enhancing Large Language Models (LLMs)<n>Despite minimal increases in computational load, the computation latency often skyrockets, leading to decoding speeds slowing by over 2.5 times.<n>AdaFuse is a framework built on a tight co-design between the algorithm and the underlying hardware system to enable efficient dynamic adapter execution.
  arXiv  Detail & Related papers  (2026-03-12T12:46:42Z)
• StreamVLA: Breaking the Reason-Act Cycle via Completion-State Gating [8.031311182554981]
  Long-horizon robotic manipulation requires bridging the gap between high-level planning and low-level control.<n>Current Vision-Language-Action models often entangle these processes, performing redundant multimodal reasoning at every timestep.<n>We present StreamVLA, a dual-system architecture that unifies textual task decomposition, visual goal imagination, and continuous action generation within a single parameter-efficient backbone.
  arXiv  Detail & Related papers  (2026-02-01T08:51:17Z)
• NanoCockpit: Performance-optimized Application Framework for AI-based Autonomous Nanorobotics [50.594459728605734]
  Small form factor, i.e., a few 10s grams, severely limits onboard computational resources to sub-SI100milliwatt microcontroller units (MCUs)<n>Our framework achieves ideal end-to-end latency, i.e. zero overhead due to serialized tasks, delivering quantifiable improvements in closed-loop control performance.
  arXiv  Detail & Related papers  (2026-01-12T12:29:38Z)
• Cyber Threat Detection Enabled by Quantum Computing [7.119884090052995]
  Threat detection models in cybersecurity must keep up with shifting traffic, strict feature budgets, and noisy hardware.<n>Small, near-term quantum processors are now available, but existing work rarely shows whether quantum components can improve end-to-end detection.<n>We address this gap with a hybrid architecture that uses a compact multilayer perceptron to compress security data and then routes a few features to 2-4 qubit quantum heads.
  arXiv  Detail & Related papers  (2025-12-20T20:10:36Z)
• Towards Efficient Agents: A Co-Design of Inference Architecture and System [66.59916327634639]
  This paper presents AgentInfer, a unified framework for end-to-end agent acceleration.<n>We decompose the problem into four synergistic components: AgentCollab, AgentSched, AgentSAM, and AgentCompress.<n>Experiments on the BrowseComp-zh and DeepDiver benchmarks demonstrate that through the synergistic collaboration of these methods, AgentInfer reduces ineffective token consumption by over 50%.
  arXiv  Detail & Related papers  (2025-12-20T12:06:13Z)
• InfLLM-V2: Dense-Sparse Switchable Attention for Seamless Short-to-Long Adaptation [56.694702609077495]
  Long-sequence processing is a critical capability for modern large language models.<n>InfLLM-V2 is a trainable sparse attention framework that seamlessly adapts models from short to long sequences.<n>In experiments, InfLLM-V2 is 4$times$ faster than dense attention while retaining 98.1% and 99.7% of the performance.
  arXiv  Detail & Related papers  (2025-09-29T12:08:33Z)
• Quantum Gate Optimization for Rydberg Architectures in the Weak-Coupling Limit [55.05109484230879]
  We demonstrate machine learning assisted design of a two-qubit gate in a Rydberg tweezer system. We generate optimal pulse sequences that implement a CNOT gate with high fidelity. We show that local control of single qubit operations is sufficient for performing quantum computation on a large array of atoms.
  arXiv  Detail & Related papers  (2023-06-14T18:24:51Z)
• Adaptable Butterfly Accelerator for Attention-based NNs via Hardware and Algorithm Co-design [66.39546326221176]
  Attention-based neural networks have become pervasive in many AI tasks. The use of the attention mechanism and feed-forward network (FFN) demands excessive computational and memory resources. This paper proposes a hardware-friendly variant that adopts a unified butterfly sparsity pattern to approximate both the attention mechanism and the FFNs.
  arXiv  Detail & Related papers  (2022-09-20T09:28:26Z)
• SCOPE: Safe Exploration for Dynamic Computer Systems Optimization [18.498208917123414]
  We present SCOPE, a resource manager that dynamically allocates hardware resources from the execution space. We evaluate SCOPE's ability to deliver improved latency while minimizing power constraint violations.
  arXiv  Detail & Related papers  (2022-04-22T00:58:52Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.