Energy Flow Graph: Modeling Software Energy Consumption

• URL: http://arxiv.org/abs/2603.17162v1
• Date: Tue, 17 Mar 2026 21:47:10 GMT
• Title: Energy Flow Graph: Modeling Software Energy Consumption
• Abstract summary: Energy Flow Graph (EFG) is a formal model that represents computational processes as state-transition systems with energy costs for both states and transitions.<n>EFG enables various applications in software engineering, including static analysis of energy-optimal execution paths.<n>In AI pipelines, the cascade model predicts optimization combinations within 5.1% error, enabling selection from 4.2 million possibilities using only 22 measurements.
• Score: 2.3228733137875524
• License: http://creativecommons.org/licenses/by-nc-sa/4.0/
• Abstract: The growing energy demands of computational systems necessitate a fundamental shift from performance-centric design to one that treats energy consumption as one of the primary design considerations. Current approaches treat energy consumption as an aggregate, deterministic property, overlooking the path-dependent nature of computation, where different execution paths through the same software consume dramatically different energy. We introduce the Energy Flow Graph (EFG), a formal model that represents computational processes as state-transition systems with energy costs for both states and transitions. EFG enables various applications in software engineering, including static analysis of energy-optimal execution paths and a multiplicative cascade model that predicts combined optimization effects without exhaustive testing. Our early experiments demonstrate EFG's versatility across domains: in software programs validated through 3.5 million executions, 15.6% of solutions exhibit high path-dependent variance (CV $>$ 0.1), while structural optimization reveals up to 705$\times$ energy reduction. In AI pipelines, the cascade model predicts optimization combinations within 5.1% error, enabling selection from 4.2 million possibilities using only 22 measurements. The EFG transforms energy optimization from trial-and-error to systematic analysis, providing a foundation for green software engineering across computational domains.

Related papers

• Beyond the Need for Speed: Energy-Aware Code Generation via Simulation-Guided Reinforcement Learning [2.3228733137875524]
  Green Tea is a corpus of $3.5$ million evaluations across $1,474$ C++ problems.<n>We train an energy-aware code model via supervised fine-tuning on energy-contrastive pairs, followed by closed-loop reinforcement learning.<n>On $143$ held-out problems, our simulation-in-the-loop pipeline achieves $12.63%$ CARET, nearly tripling the gain of fine-tuning alone.
  arXiv  Detail & Related papers  (2026-07-06T01:04:40Z)
• EnergyLens: Predictive Energy-Aware Exploration for Multi-GPU LLM Inference Optimization [5.093812479614167]
  EnergyLens is an end-to-end framework for energy-aware large language model (LLM) inference optimization.<n>It captures LLM specifications including fusion, parallelism, and compute-communication overlap, combined with load-imbalance-aware MoE modeling.<n>We validate EnergyLens on Llama3 and Qwen3-MoE across tensor-parallel and expert-parallel configurations.<n>Our energy-driven exploration reveals up to 1.47x and 52.9x energy variation across configurations in prefill and decode efficiency and motivates distributed serving.
  arXiv  Detail & Related papers  (2026-05-14T01:37:26Z)
• Towards Green AI: Decoding the Energy of LLM Inference in Software Development [46.879983975894135]
  AI-assisted tools are increasingly integrated into software development, but their reliance on large language models (LLMs) introduces substantial computational and energy costs.<n>We conduct a phase-level analysis of LLM inference energy consumption, distinguishing between the (1) prefill, where the model processes the input and builds internal representations, and (2) decoding, where output tokens are generated using the stored state.
  arXiv  Detail & Related papers  (2026-02-05T14:38:19Z)
• The Energy Impact of Domain Model Design in Classical Planning [1.745999685643649]
  We investigate how domain model characteristics affect the energy consumption of classical planners.<n>We introduce a domain model configuration framework that enables controlled variation of features, such as element ordering, action arity, and dead-end states.<n>Results demonstrate that domain-level modifications produce measurable energy differences across planners, with energy consumption not always correlating with runtime.
  arXiv  Detail & Related papers  (2026-01-29T16:46:43Z)
• Energy Scaling Laws for Diffusion Models: Quantifying Compute and Carbon Emissions in Image Generation [50.21021246855702]
  We propose an adaptation of Kaplan scaling laws to predict GPU energy consumption for diffusion models based on computational complexity (FLOPs)<n>Our approach decomposes diffusion model inference into text encoding, iterative denoising, and decoding components, with the hypothesis that denoising operations dominate energy consumption due to their repeated execution across multiple inference steps.<n>Our results validate the compute-bound nature of diffusion inference and provide a foundation for sustainable AI deployment planning and carbon footprint estimation.
  arXiv  Detail & Related papers  (2025-11-21T08:12:47Z)
• EconProver: Towards More Economical Test-Time Scaling for Automated Theorem Proving [64.15371139980802]
  Large Language Models (LLMs) have recently advanced the field of Automated Theorem Proving (ATP)<n>We show that different test-time scaling strategies for ATP models introduce significant computational overhead for inference.<n>We propose two complementary methods that can be integrated into a unified EconRL pipeline for amplified benefits.
  arXiv  Detail & Related papers  (2025-09-16T03:00:13Z)
• Tu(r)ning AI Green: Exploring Energy Efficiency Cascading with Orthogonal Optimizations [2.829284162137884]
  This paper emphasizes on treating energy efficiency as the first-class citizen and as a fundamental design consideration for a compute-intensive pipeline.<n>We show that strategic selection across five AI pipeline phases (data, model, training, system, inference) creates cascading efficiency.<n>Combinations reduce energy consumption by up to $94.6$% while preserving $95.95$% of the original F1 score of non-optimized pipelines.
  arXiv  Detail & Related papers  (2025-06-23T04:52:08Z)
• The ML.ENERGY Benchmark: Toward Automated Inference Energy Measurement and Optimization [24.32172951691564]
  Energy remains a metric that is often overlooked, under-explored, or poorly understood in the context of building ML systems.<n>We present the ML$.$ENERGY Benchmark, a benchmark suite and tool for measuring inference energy consumption under realistic service environments.
  arXiv  Detail & Related papers  (2025-05-09T18:27:32Z)
• Energy Considerations of Large Language Model Inference and Efficiency Optimizations [28.55549828393871]
  As large language models (LLMs) scale in size and adoption, their computational and environmental costs continue to rise.<n>We systematically analyze the energy implications of common inference efficiency optimizations across diverse NLP and AI workloads.<n>Our findings reveal that the proper application of relevant inference efficiency optimizations can reduce total energy use by up to 73% from unoptimized baselines.
  arXiv  Detail & Related papers  (2025-04-24T15:45:05Z)
• Movement Penalized Bayesian Optimization with Application to Wind Energy Systems [84.7485307269572]
  Contextual Bayesian optimization (CBO) is a powerful framework for sequential decision-making given side information. In this setting, the learner receives context (e.g., weather conditions) at each round, and has to choose an action (e.g., turbine parameters) Standard algorithms assume no cost for switching their decisions at every round, but in many practical applications, there is a cost associated with such changes, which should be minimized.
  arXiv  Detail & Related papers  (2022-10-14T20:19:32Z)
• Learning Implicit Priors for Motion Optimization [105.11889448885226]
  Energy-based Models (EBM) represent expressive probability density distributions. We present a set of required modeling and algorithmic choices to adapt EBMs into motion optimization.
  arXiv  Detail & Related papers  (2022-04-11T19:14:54Z)
• Adaptive pruning-based optimization of parameterized quantum circuits [62.997667081978825]
  Variisy hybrid quantum-classical algorithms are powerful tools to maximize the use of Noisy Intermediate Scale Quantum devices. We propose a strategy for such ansatze used in variational quantum algorithms, which we call "Efficient Circuit Training" (PECT) Instead of optimizing all of the ansatz parameters at once, PECT launches a sequence of variational algorithms.
  arXiv  Detail & Related papers  (2020-10-01T18:14:11Z)

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.