Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Load balancing”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 19 records
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

New Results on Communication- and Memory-Aware Load Balancing Model and Algorithms

While load balancing in distributed-memory computing has been well-studied, we present an innovative approach to this problem: a unified, reduced-order model that combines three key components to describe “work” in a distributed system: computation, communication, and memory. Our model enables an optimizer to explore complex tradeoffs in task placement, such as augmented parallelism, at the expense of data replication increasing memory usage. We propose a fully distributed, heuristic-based load balancing optimization algorithm, and demonstrate that it quickly finds close-to-optimal solutions. We formalize the complex optimization problem as a mixed-integer linear program, and compare it to our strategy. Finally, we show that when applied to an electromagnetics code, our approach obtains up to 2.3x speedups for the imbalanced execution.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Low-Power, Load-Balancing Whole Home Electrification Solution: Cooperative Research and Development (Final Report)

Testing was conducted at the Systems Performance Laboratory in NREL’s Energy Systems Integration Facility to test the performance of 120V wall-mounted heat pumps, 120V heat pump water heaters (HPWH), Electric Vehicle Supply Equipment (EVSE), and other plug-in loads, using NeoCharge Smart Splitters and whole home energy software as appropriate. Four different simulated occupancy scenarios were used to evaluate the package of technology and controls.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2025

DISTRI: Distributed Multi-Facility HPC Simulator (DISTRI) v2.1

DISTRI is an advanced network simulator designed for multi-facility computational infrastructures with agentic behavior. It simulates HPC facilities where computational resources act as autonomous agents, making intelligent decisions about job scheduling, load balancing, and resource allocation. The simulator focuses on developing and testing decentralized algorithms that promote resilience and efficiency in multi-facility environments. Key Features: - Agentic Resource Behavior: Processors and DTNs act as autonomous agents with decision-making capabilities - Pheromone-Based Load Balancing: Decentralized load balancing inspired by ant colony optimization - Dual Topology Support: Mesh (normal operations) and Dumbell (network testing) topologies - Comprehensive TCP Simulation: Realistic TCP implementations with multiple congestion control algorithms - Failure Resilience Testing: Processor failure simulation with automatic job reassignment - Extensive Visualization: Detailed performance analysis and metrics collection - Research-Ready: Designed for algorithm development and benchmarking

Bez, Jean Luca [Lawrence Berkeley National Laborat↗
DOE OSTI2025

Scalability and Effectiveness of Smart Charge Management

The rise in electric vehicle (EV) adoption presents growing challenges for power grids, particularly from simultaneous residential charging, which can cause voltage fluctuations and increase feeder peak loads. Baltimore Gas and Electric (BGE), with support from the U.S. Department of Energy, initiated a pilot program to evaluate managed residential EV charging through Smart Charge Management (SCM). This study analyzes real-world charging behavior data from the pilot and feeder-level base loads from BGE to simulate residential charging scenarios through 2035 across the Washington, DC–Baltimore region. Grid impacts under unmanaged charging are compared to three SCM strategies: TOU-immediate, TOU-distributed, and Load Balancing. Results show that the magnitude of peak reduction is highly feeder-dependent. Some feeders achieve reductions of more than 40% at high enrollment levels, while others show improvements closer to 10–15%. This heterogeneity reflects differences in baseline feeder load shapes, EV penetration, and plug-in behavior across customers. Results also highlight trade-offs between shifting load away from peak periods and minimizing secondary demand peaks, offering practical insights for future utility program design.

Electric vehicle↗
DOE OSTI2025

Toucan: A performance portable, scalable implementation of the DECA algorithm

In the field of additive manufacturing (AM), cellular automata (CA) is extensively used to simulate microstructural evolution during solidification. However, while traditional CA approaches are relatively fast, they still require a substantial number of time steps, are limited to moderate volumes, and are relatively difficult to improve through parallelism due to the highly localized nature of the solidification front. Here, to address these issues of time to solution and load balancing, we introduce Toucan, a parallel, performance-portable, and scalable code written in C++ with the Kokkos library that leverages the discrete event inspired cellular automata (DECA) algorithm to perform parallel-in-time (PinT) grain growth simulations. Toucan effectively mitigates load balancing issues by distributing the computational workload more evenly across processors, enhancing scalability and efficiency. We conduct both strong and weak scaling studies on up to 64 GPUs on the Frontier supercomputer, demonstrating that Toucan significantly outperforms the current state-of-the-art, time-stepped CA code, ExaCA, on both single and multi-GPU simulations. Even in AM-specific weak scaling scenarios, Toucan maintains near-ideal scaling, in contrast to the linear increase observed with ExaCA due to the moving laser raster pattern. This study highlights Toucan’s potential to transform microstructural simulations in AM by radically improving both efficiency and scalability over existing methods.

36 MATERIALS SCIENCE↗
DOE OSTI2026

T-FSM: A Scalable Distributed Task-Based System for Frequent Subgraph Pattern Mining from a Big Graph

Finding frequent subgraph patterns in a big graph is an important problem with many applications such as classifying chemical compounds and building indexes to speed up graph queries. Since this problem is NP-hard, some recent parallel and distributed systems have been developed to accelerate the mining. However, they often have a huge memory cost, very long running time, suboptimal load balancing, poor scale-out capability, and possibly inaccurate results. In this article, we propose an efficient system called T-FSM for parallel mining of frequent subgraph patterns in a big graph. T-FSM supports a new anti-monotonic frequentness measure called Fraction-Score, which is more accurate than the widely used MNI measure. The execution engine of T-FSM supports both intra-machine parallelism and inter-machine parallelism. For intra-machine parallelism, T-FSM adopts a novel task-based execution model to ensure high multithreading concurrency, bounded memory consumption, and effective load balancing. For inter-machine parallelism, T-FSM ensures good scale-out performance with a lightweight pattern rebalancing approach that reduces workload skewness of pattern evaluations among machines. To avoid recomputing the contexts for migrated patterns, we design a novel context cache table to support concurrent and asynchronous requesting and caching of remote context data, which can timely evict and garbage collect used pattern contexts that are no longer needed to keep memory consumption bounded. Extensive experiments show that T-FSM is orders of magnitude faster than existing state-of-the-art parallel systems (more than 10×, 51×, 131×, 55× speedup over ScaleMine, DistGraph, Pangolin and Peregrine, respectively) and distributed systems (more than 42× and 88× over ScaleMine and DistGraph, respectively) for frequent subgraph pattern mining, and it scales out satisfactorily to 512 CPU cores on the Polaris supercomputer at Argonne National Laboratory.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

Scaling Demand Flexibility: Building on 30 Years of Energy Efficiency Success

With electricity consumption across the United States (US) and Canada anticipated to grow, energy efficiency program administrators have a key role to play in helping to ensure energy affordability and reliability in support of the broader economic systems utilities and grid support. Connected, demand side load balancing solutions, such as load shifting heating, ventilation and air conditioning (HVAC) systems and managed charging for electric vehicles (EVs), can dynamically manage energy, allowing for more volumetric electricity consumption without incurring the expense of upgraded transmission and distribution capabilities. When combined, or aggregated, many small loads can be managed to have meaningful impact on energy demand on the grid. Utilities and their partners have an opportunity to leverage decades of experience and the infrastructure needed to assess, design, implement, and measure programs to scale up the adoption of equipment with built-in load flexibility capabilities. Current efforts among a wide variety of electricity system service providers, utilities, standards agencies, regulators, national labs and private industry stakeholders aim to identify common standards, metrics, and methodologies for valuing grid services offered by demand side equipment. By combining those efforts with decades of proven energy efficiency resources, utilities are poised to effectuate a scaling up of equipment with energy management capabilities installed in homes and businesses across the US and Canada. This paper will provide an overview of how utilities are approaching this era of load growth and new peak demands across the United States and Canada. It will highlight the specific strategies that program administrators are employing to advance market transformation for grid-enabled products and devices that have the greatest potential to reduce energy use and increase load flexibility.

Grant, Peter↗
DOE OSTI2025

Advancing Grid Resilience through Smart Charge Management: Findings from Maryland’s Pilot

This report presents research findings from a four-year Smart Charge Management (SCM) pilot program conducted by Maryland’s largest electric utilities—Baltimore Gas and Electric (BGE), Potomac Electric Power Company (Pepco), and Delmarva Power & Light (DPL)—to evaluate strategies for optimizing electric vehicle (EV) charging loads and enhancing grid stability. Supported by the U.S. Department of Energy (DOE), Argonne National Laboratory collaborated with all project partners and examined the effectiveness of Time-of-Use (TOU) and Load Balancing (LB) strategies in managing peak demand, deferring costly infrastructure upgrades, and reducing grid constraints at the feeder level. Using charging data from over 4,600 EV drivers, the study analyzed SCM’s impact on the distribution systems of BGE and Pepco, which consists of over 2000 feeders. Unlike prior research that focused on system-wide trends or synthetic feeders, this analysis offers granular, feeder-level insights based on real-world operational data. It highlights how transformer density, load profiles, and infrastructure constraints influence smart charging performance. Results show feeder-level conditions play a crucial role in SCM effectiveness, with most feeders benefiting more from LB, while TOU-based SCM may be sufficient for others. By 2035, LB reduced peak charging loads by 27% on average, compared to 23% under TOU-based SCM, though some feeders saw reductions exceeding 35%, while others experienced minimal impact. Feeders with higher transformer utilization and limited capacity benefited more from LB, which more effectively distributed charging demand during off-peak hours. Beyond reducing grid constraints, SCM offers long-term operational and financial benefits. By shifting EV charging demand strategically, utilities can optimize asset utilization, delay infrastructure investments, and enhance grid performance. In terms of infrastructure upgrade deferrals, at the feeder level, LB consistently reduced peak charging loads and resulting infrastructure upgrade costs, particularly in high EV enrollment areas, decreasing the number of overloaded transformers by up to 35%, while TOU-based SCM achieved 20-30% reductions depending on feeder characteristics. At the system level, LB has the potential to defer total upgrade costs by $\$$186 million for BGE, compared to $\$$159 million under TOU-based SCM. For Pepco, TOU-based SCM performed slightly better, deferring upgrade costs by $\$$30 million, compared to $\$$29 million under LB. Section 4.5 reviews some of the system differences between BGE and Pepco. However, as EV adoption scales, TOU-based SCM will introduce secondary peak charging loads, reinforcing the need for more advanced, adaptive SCM approaches to prevent new grid challenges. As EV adoption continues to grow, feeder-level managed charging strategies will be essential for mitigating grid stress, improving infrastructure efficiency, and maintaining energy affordability for consumers. This report provides critical insights for utilities, Public Utility Commissions (PUCs), and state agencies on the role of feeder-specific smart charging in infrastructure planning, policy development, and grid modernization. The findings underscore the importance of tailored, data-driven SCM solutions that align with local grid conditions, ensuring a resilient, cost-effective transition to increasing EV adoption while safeguarding distribution system performance.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2026

A GPU-based compressible combustion solver for applications exhibiting disparate space and time scales

High-speed chemically active flows pose significant computational challenges due to their disparate space and time scales, with stiff chemistry often dominating simulation time. While modern scientific computing programs achieve exascale performance by leveraging graphics processing units (GPUs), existing GPU-based compressible combustion solvers face critical limitations in memory management, load balancing, and handling the highly localized nature of chemical reactions. To this end, we present a high-performance compressible reacting flow solver built on the AMReX framework and optimized for multi-GPU settings. Here, our approach addresses three GPU performance bottlenecks: memory access patterns through column-major storage optimization, computational workload variability via a bulk-sparse integration strategy for chemical kinetics, and multi-GPU load distribution for adaptive mesh refinement applications. The solver adapts existing matrix-based chemical kinetics formulations to multi-grid contexts. Using representative combustion applications, including 2D and 3D detonations and a 3D jet-in-crossflow configuration, we demonstrate 1.4–5× performance improvements over initial implementations on an in-house cluster of NVIDIA H100 GPUs, and near-ideal weak scaling on the Frontier supercomputer (Oak Ridge Leadership Computing Facility) with up to 1024 AMD Instinct MI250X GPUs. Roofline analysis reveals substantial improvements in arithmetic intensity for both convection (∼ 10 ×) and chemistry (∼ 4 ×) routines, confirming efficient utilization of GPU memory bandwidth and computational resources.

42 ENGINEERING↗
DOE OSTI2026

A cell-centered AMR-ALE framework for 3D multi-material hydrodynamics. Part I: Lagrangian and indirect Euler AMR algorithms

Many applications of physics and engineering involve wide ranges of time and spatial scales. The numerical simulation of localized small scales such as shock waves and material interfaces requires a large number of computational cells in these regions. For these applications, Lagrangian and Arbitrary-Lagrangian-Eulerian (ALE) related methods are engaging since the moving mesh feature naturally brings mesh cells on shock discontinuities and material interfaces are carefully captured. In addition, Adaptive-Mesh-Refinement (AMR) strategies aim to optimize computational resources by concentrating finer mesh cells only in areas of interest while using coarser cells elsewhere. A key but challenging AMR requirement consists in efficiently distributing the computational effort to achieve high accuracy without the prohibitive computational costs associated with uniformly fine grids. Here, in this document, the coupling of the p4est AMR library with a cell-centered Lagrangian scheme is presented with the goal to perform reliable 3D Lagrangian-AMR and indirect Euler-AMR multi-material simulations. In particular, it is shown that starting from a 3D indirect ALE code, the memory management and load balancing requirements can be delegated to an external library (here the p4est library) to unlock ALE-AMR capabilities. First, we present a strategy to transcribe the octant-based connectivity of the 3D AMR framework with that of an unstructured mesh of polygonal cells used in Lagrangian hydrodynamics. Then, we show how refinement and coarsening operations must be adapted to the particular Lagrangian framework to ensure the conservation of volume during those steps. Finally, several numerical test cases are presented that demonstrate the capabilities of the Lagrangian-AMR and indirect Euler-AMR algorithms.

3D cell-centered Lagrangian numerical scheme↗
DOE OSTI2025

Acceleration of the particle-in-cell code Osiris with graphics processing units

Fully relativistic particle-in-cell (PIC) simulations are crucial for advancing our knowledge of plasma physics. Modern supercomputers based on graphics processing units (GPUs) offer the potential to perform PIC simulations of unprecedented scale, but require robust and feature-rich codes that can fully leverage their computational resources. In this work, this demand is addressed by adding GPU acceleration to the PIC code Osiris. An overview of the algorithm, which features a CUDA extension to the underlying Fortran architecture, is given. Detailed performance benchmarks for thermal plasmas are presented, which demonstrate excellent weak scaling on NERSC's Perlmutter supercomputer and high levels of absolute performance. The robustness of the code to model a variety of physical systems is demonstrated via simulations of Weibel filamentation and laser-wakefield acceleration run with dynamic load balancing. Finally, measurements and analysis of energy consumption are provided that indicate that the GPU algorithm is up to ~14 times faster and ~7 times more energy efficient than the optimized CPU algorithm on a node-to-node basis. The described development addresses the PIC simulation community's computational demands both by contributing a robust and performant GPU-accelerated PIC code and by providing insight into efficient use of GPU hardware.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2026

From Cell to System: Accelerated hpc Simulations of BESS Aging under Frequency Regulation and Arbitrage use cases

Lithium-ion battery energy storage systems (BESS) packs have emerged as a leading solution for grid-scale energy storage, enhancing resiliency and balancing load fluctuations. Yet, experimental characterization of large-format LIB packs-particularly to assess performance and degradation over hundreds of cycles - demands substantial hardware investment and multi-year testing campaigns. In this work, we couple a hierarchical, physics-based modeling framework agnostic to electrode chemistries with high-performance computing to accelerate systems level evaluation by upto two orders of magnitude. Building on the open-source liionpack platform, we implement cell, module, and pack-scale electrochemical models enriched with mechanistic aging mechanisms and deploy them on an HPC cluster to simulate 150−200kWh systems over 500 - 1,000 cycles with in days. We subject these virtual B ESS to both constant-current cycling and realistic grid service profiles spanning frequency regulation, ramp-rate support, and energy arbitrage-and quantify the resulting degradation patterns. Our results reveal that localized cell aging can induce substantial nonuniformity at module and pack levels, with service-specific cycling protocols driving distinct aging modes. This rapid, multiscale modeling approach provides a powerful design-space exploration tool for optimizing electrical architecture, control strategies, and operational schedules to prolong pack lifetime and lower total cost of ownership.

Ayalasomayajula, Surya [ORNL] (ORCID:0009000860788↗
DOE OSTI2025

RingX: Scalable Parallel Attention for Long-Context Learning on HPC

The attention mechanism has become foundational for remarkable AI breakthroughs since the introduction of the Transformer, driving the demand for increasingly longer context to power frontier models such as large-scale reasoning language models and high-resolution image/video generators. However, its quadratic computational and memory complexities present substantial challenges. Current state-of-the-art parallel attention methods, such as ring attention, are widely adopted for long-context training but utilize a point-to-point communication strategy that fails to fully exploit the capabilities of modern HPC network architectures. In this work, we propose ringX, a scalable family of parallel attention methods optimized explicitly for HPC systems. By enhancing workload partitioning, refining communication patterns, and improving load balancing, ringX achieves up to 3.4 × speedup compared to conventional ring attention on the Frontier supercomputer. Optimized for both bi-directional and causal attention mechanisms, ringX demonstrates its effectiveness through training benchmarks of a Vision Transformer (ViT) on a climate dataset and a Generative Pre-Trained Transformer (GPT) model, Llama3 8B. Our method attains an end-to-end training speedup of approximately 1.5 × in both scenarios. To our knowledge, the achieved 38% model FLOPs utilization (MFU) for training Llama3 8B with a 1M-token sequence length on 4,096 GPUs represents one of the highest training efficiencies reported for long-context learning on HPC systems. Our code implementation is available at https://github.com/jqyin/ringX-attention.

Yin, Junqi [ORNL] (ORCID:0000000338435520)↗
DOE OSTI2024

UMap: An application-oriented user level memory mapping library

Exploiting the prominent role of complex memories in exascale node architecture, the UMap page fault handler offers new capabilities to access large memory-mapped data sets directly. UMap provides flexible configuration options to customize page handling to each application, including analysis of massive observational and simulation data sets. The high-performance design features I/O decoupling, dynamic load balancing, and application-level controls. Page faults triggered by application threads and processes accessing data mapped to a UMapp’ed region are handled via the Linux userfaultfd protocol, an asynchronous message-oriented kernel-user communication mechanism that avoids the context switch penalty of traditional signal fault handlers. UMap is fully open source. In this paper, we give an overview of the UMap library architecture, its extensible plugin architecture, and the use/performance of UMap in emerging heterogeneous memory hierarchies such as near-node Non-volatile Memory (NVM) and network attached memories. We highlight new capabilities in two pagefault management plugins, the NetworkStore and SparseStore. We demonstrate the integration between UMap and multiple ECP products including Caliper, Metall, ZFP, Mochi, and Ripples.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

An Efficient Storage-Driven Machine Learning Model for Performance in the Era of Multimodal Scientific Data

Scientific workflows are increasingly relying on machine learning (ML), simulation, and hybrid techniques to predict, understand, and optimize the behavior of complex experiments. High-performance computing has greatly improved researchers’ ability to acquire diverse data modalities in these workflows. Recent studies suggest that the performance of machine learning models can be improved by integrating data from various sources. Unfortunately, these workloads pose unprecedent pressure on the network storage to meet the demands associated with accessing these multimodal data. To mitigate the impact of intensive IO, we propose a solution that utilizes a multi-tier High-Performance Computing (HPC) distributed storage and data processing framework, placing computation where the data resides for better performance. By adopting this project, the scientific community will gain new opportunities to explore multimodal storage-driven possibilities, integrating multiple scientific data sources with advanced streaming frameworks. Additionally, our framework effectively utilizes computing resources and bridges the gaps identified by HPC experts. Our proposed approach tackles scalability and persistence challenges by leveraging native persistency, which has posed difficulties in traditional approaches. Furthermore, we seek to enhance fault-tolerance and load-balance of computations by leveraging real-time streaming in diverse scientific computing environments, thereby propelling advanced scientific computing research into the next generation.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Advancing Grid Resilience through Smart Charge Management: Findings from Maryland’s Pilot

This report presents research findings from a four-year Smart Charge Management (SCM) pilot program conducted by Maryland’s largest electric utilities—Baltimore Gas and Electric (BGE), Potomac Electric Power Company (Pepco), and Delmarva Power & Light (DPL)—to evaluate strategies for optimizing electric vehicle (EV) charging loads and enhancing grid stability. Supported by the U.S. Department of Energy (DOE), Argonne National Laboratory collaborated with all project partners and examined the effectiveness of Time-of-Use (TOU) and Load Balancing (LB) strategies in managing peak demand, deferring costly infrastructure upgrades, and reducing grid constraints at the feeder level.

24 POWER TRANSMISSION AND DISTRIBUTION↗