Search NASA⌕ Search

SEARCH · Search NASA

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 289 records · Page 16

Camellia: A Rapid Development Framework for Finite Element Solvers

We report the discontinuous Petrov–Galerkin (DPG) methodology of Demkowicz and Gopalakrishnan guarantees the optimality of the finite element solution in a user-controllable energy norm, and provides several features supporting adaptive schemes. The approach provides stability automatically; there is no need for carefully derived numerical fluxes (as in DG schemes) or for mesh-dependent stabilization terms (as in stabilized methods). In this paper, we focus on features of Camellia that facilitate implementation of new DPG formulations; chief among these is a rich set of features in support of symbolic manipulation, which allow, e.g., bilinear formulations in the code to appear much as they would on paper. Many of these features are general in the sense that they can also be used in the implementation of other finite element formulations. In fact, because DPG’s requirements are essentially a superset of those of other finite element methods, Camellia provides built-in support for most common methods. We believe, however, that the combination of an essentially “hands-free” finite element methodology as found in DPG with the rapid development features of Camellia are particularly winsome, so we focus on use cases in this class. In addition to the symbolic manipulation features mentioned above, Camellia offers support for one-irregular adaptive meshes in 1D, 2D, 3D, and space-time. It provides a geometric multigrid preconditioner particularly suited for DPG problems, and supports distributed parallel execution using MPI. For its load balancing and distributed data structures, Camellia relies on packages from the Trilinos project, which simplifies interfacing with other computational science packages. Camellia also allows loading of standard mesh formats through an interface with the MOAB package. Camellia includes support for static condensation to eliminate element-interior degrees of freedom locally, usually resulting in substantial reduction of the cost of the global problem. Finally, we include a discussion of the variational formulations built into Camellia, with references to those formulations in the literature, as well as an MPI performance study.

97 MATHEMATICS AND COMPUTING↗

Two HSCT Mach 1.7 low sonic boom designs

The objective of this study was to provide low sonic boom concepts, geometry, and analysis to support wind tunnel model designs. Within guidelines provided by NASA, two High Speed Civil Transport (HSCT) configurations were defined with reduced sonic boom that have low drag, high payload, and good performance. To provide information for assessing the feasibility of reduced sonic boom operation, the two designs were analyzed in terms of their sonic boom characteristics, as well as aerodynamics, weight and balance, and performance characteristics. Low drag and high payload were achieved, but both of the blended arrow-wing configurations have deficiencies in high lift capability, fuel volume, wing loading, balance, and takeoff gross weight. Further refinement of the designs is needed to better determine the commercial viability of low boom operation. To help in assessing low boom design technology, the two configurations were defined as wind tunnel models with altered aft-bodies for the wind tunnel sting mounting system.

Haglund, George T.↗

Balancing Particle and Mesh Computation in a Particle-In-Cell Code

The XGC1 plasma microturbulence particle-in-cell simulation code has both particle-based and mesh-based computational kernels that dominate performance. Both of these are subject to load imbalances that can degrade performance and that evolve during a simulation. Each separately can be addressed adequately, but optimizing just for one can introduce significant load imbalances in the other, degrading overall performance. A technique has been developed based on Golden Section Search that minimizes wallclock time given prior information on wallclock time, and on current particle distribution and mesh cost per cell, and also adapts to evolution in load imbalance in both particle and mesh work. In problems of interest this doubled the performance on full system runs on the XK7 at the Oak Ridge Leadership Computing Facility compared to load balancing only one of the kernels.

Worley, Patrick H↗

Chameleon: An Adaptive Wear Balancer for Flash Clusters

NAND flash-based Solid State Devices (SSDs) offer the desirable features of high performance, energy efficiency, and fast growing capacity. Thus, the use of SSDs is increasing in distributed storage systems. A key obstacle in this context is that the natural unbalance in distributed I/O workloads can result in wear imbalance across the SSDs in a distributed setting. This, in turn can have significant impact on the reliability, performance, and lifetime of the storage deployment. Extant load balancers for storage systems do not consider SSD wear imbalance when placing data, as the main design goal of such balancers is to extract higher performance. Consequently, data migration is the only common technique for tackling wear imbalance, where existing data is moved from highly loaded servers to the least loaded ones. In this paper, we explore an innovative holistic approach, Chameleon, that employs data redundancy techniques such as replication and erasure-coding, coupled with endurance-aware write offloading, to mitigate wear level imbalance in distributed SSD-based storage. Chameleon aims to balance the wear among different flash servers while meeting desirable objectives of: extending life of flash servers; improving I/O performance; and avoiding bottlenecks. Evaluation with a 50 node SSD cluster shows that Chameleon reduces the wear distribution deviation by 81% while improving the write performance by up to 33%.

Zhao, Nannan↗

Flexible Spatial Partitions in MPACT Through Module-Based Data Passing

As part of the Consortium for Advanced Simulation of Light Water Reactors (CASL), the Virtual Environment for Reactor Applications (VERA) is being developed to provide high-fidelity multiphysics simulations of nuclear reactor cores. The MPACT code being developed collaboratively by Oak Ridge National Laboratory and the University of Michigan is the primary deterministic neutron transport solver available within VERA. MPACT employs the 2D/1D method to solve 3D problems using 2D method of characteristics (MOC) radial transport solvers with 1D nodal expansion method-based P3 (NEM-P3) axial transport solvers, which are coupled using axial and radial transverse leakages. A 3D coarse mesh finite difference (CMFD) solver is used to provide accelerated convergence and stability. Quarter-core problems in MPACT are typically run on moderately sized clusters ({approx}500-10,000 cores). As such, it relies heavily on spatial decomposition, both radially and axially, using MPI data communication along spatial domain boundaries to pass angular flux boundary condition and neighboring data. The initial spatial decomposition strategy implemented into MPACT overlaid a Cartesian grid over the core to form the domain boundaries. With this approach, a single buffer spanning across the entire boundary between two spatial domains is passed to a domain's neighbor. Additionally, only one neighboring domain index was allowed in each direction. For example, the entire eastern boundary of a domain must be the entire western boundary of the corresponding neighbour's domain. This implementation helped to execute cases on several thousand cores, where substantial radial decomposition was used. The default for several years was to use assembly decomposition, which yielded 73 radial partitions in the Watts Bar Unit 1 (WBN1) models being analyzed. However, as CASL formed stronger connections with industry partners, there was a strong push to allow MPACT to run on fewer cores, preferably in the 500-1,000 core range. Such cases require much less radial decomposition, typically with 8-16 radial domains on each plane. Unfortunately, the previous decomposition strategy is very limited in its ability to yield well-balanced domains, and it does not permit partitions with an arbitrary number of domains, particularly with small numbers of radial domains (3, 5, 7, 11, 13, etc.). With these limitations, a more flexible approach that provided more even-load balancing was needed. The details of this new strategy are outlined here, along with insights to its advantages. The examples provided are for the WBN1 core, which has been the focus of several initial CASL analyses. It is worth noting that spatial decomposition strategies have been employed in many codes with focus on a number of different transport methodologies. The references cited are not exhaustive as this has been very important research topic across many areas.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Performance and flexibility improvements of Staged Pressurized Oxy-Combustion

Staged Pressurized Oxy-Combustion (SPOC) is a low-carbon coal combustion power technology being developed by Washington University in St. Louis (WUSTL). Oxy-combustion plants enable straightforward capture of carbon dioxide (CO 2 ) by removing most of the nitrogen in the combustion air prior to use, thereby burning fuel in near-pure oxygen instead of air, producing a flue gas containing primarily CO 2 and water. CO 2 capture at amounts > 90% is possible, often using cryogenic air separation. Oxy-combustion typically relies on flue gas recycle (FGR) to reduce the peak temperature and radiation that would otherwise occur in a fuel/oxygen only flame. SPOC reduces the peak temperatures of combustion by utilizing two or more pressurized boiler modules connected in series to produce fuel staging; hence, only a portion of the fuel is combusted in any given furnace module. This means that the thermal energy released at each stage can be captured and removed from the gases prior to subsequent stages, when more fuel is introduced. This allows the SPOC process to operate with minimal FGR, avoiding the associated efficiency losses and additional costs. Also, the process operates at an elevated gas-side pressure, reducing boiler size, enhancing heat transfer to achieve a compact boiler configuration as compared to an atmospheric-pressure boiler design, and allowing for recovery of the latent heat of the water from the flue gas at a temperature useful to the steam cycle. The resultant net efficiency of the system is over 3 percentage points greater than traditional atmospheric-pressure oxy-combustion, and 7 percentage points greater than the post combustion variant, representing a step-change improvement over first-generation capture technologies. To further develop the concept, WUSTL and the Electric Power Research Institute, Inc., organized a project with American Air Liquide, Inc., Doosan Babcock Limited, and the U.S. Department of Energy to investigate a practicable and workable boiler design. The team has identified the potential for enhanced process flexibility for controlling power generation over a wider load range than is normally available to conventional coal-fired power plants due to the staged nature of the heat release. With increasing intermittent renewable generator contribution, on-demand generators need to be highly flexible to participate in the future energy market, requiring extensive operation at reduced load. Conventional coal-fired steam generators typically face challenges in maintaining temperature control of the reheat steam and main steam at reduced loads. This results in inefficient operation, both in terms of the boiler efficiency and steam turbine heat rate. The results of this project show the SPOC process is capable of exceptional turndown, both on a stage basis and with the ability to bypass entire stages. Oxygen-supply flexibility was also investigated, as this is also a key consideration for the overall flexibility of the SPOC process given the operating constraints of conventional air separation units. A boiler design concept assessment was conducted and was focused on delivering compact and constructible design. The assessment checked appropriate tube operating metal temperatures at full load and at lower operating loads, balanced against the needs of efficient coal combustion, and the resultant slagging and ash environments. Combustion testing in the 100-kWth pressurized combustion test rig at WUSTL was carried out to validate the combustion, heat flux profiles and burnout at multiple loads. Combustion parameters investigated were flame stability, fuel burnout, ash composition, radiative heat flux, and temperature profiles. The results of these tests formed the basis of a full-scale boiler design that will encompass improvements in both efficiency and flexibility over conventional oxy-combustion processes. The air separation unit flexibility was investigated, and associated cost implications were addressed. Detailed economic assessment results for a 550 MWe net power block are also provided, allowing for a comparison against the baseline NETL oxy-combustion and post combustion capture cases.

20 FOSSIL-FUELED POWER PLANTS↗

A Comparison of Forecast Error Generators for Modeling Wind and Load Uncertainty

This paper presents four algorithms to generate random forecast error time series, including a truncated-normal distribution model, a state-space based Markov model, a seasonal autoregressive moving average (ARMA) model, and a stochastic-optimization based model. The error time series are used to create real-time (RT), hour-ahead (HA), and day-ahead (DA) wind and load forecast time series that statistically match historically observed forecasting data sets, used for variable generation integration studies. A comparison is made using historical DA load forecast and actual load values to generate new sets of DA forecasts with similar stoical forecast error characteristics. This paper discusses and compares the capabilities of each algorithm to preserve the characteristics of the historical forecast data sets.

Lu, Ning↗

QoS aware balancing in data centers

One embodiment of the present invention provides a system for balancing loads between two physical resources. During operation, for each physical resource, the system establishes resource-usage models for a plurality of jobs that share the physical resource, identifies quality-of-service (QoS) levels associated with the jobs, and computes a QoS balance point for the physical resource based on the resource-usage models and the QoS ratings. The QoS balance point indicates a rating of QoS, above which substantial resource provisioning is required. In response to detecting a difference between a first QoS balance point associated with a first physical resource and a second QoS balance point associated with a second physical resource, the system identifies one or more jobs to be moved between the first and second physical resources such that the difference between the first and the second QoS balance points is reduced.

Greene, Daniel H.↗

Assessing the performance of global thermostat adjustment in commercial buildings for load shifting demand response

Abstract Efficiently leveraging new sources of flexibility is critical to mitigating load balancing challenges posed by variable renewable resources. The thermal inertia of commercial buildings allows us to shift their power consumption on minute to hourly timescales to provide demand response to the grid while maintaining occupant comfort. Global thermostat adjustment (GTA) provides a readily available and scalable approach for implementing load shifting demand response using commercial heating, ventilation, and air conditioning (HVAC) systems, since it leverages the inherent sophistication of modern building automation systems. However, there is an incomplete understanding of GTA’s performance for this purpose and its impact on building systems and occupant comfort. In this paper, we explore the performance of GTA by analyzing results from nearly nine hundred experiments on eight university campus buildings in Michigan and North Carolina. Using GTA, we manipulate each building’s thermostat setpoints causing the building to shift its power consumption with respect to its baseline. We quantify the magnitude of HVAC power response, energy use of HVAC subsystems, and impact on occupant comfort. Finally, we connect our experimental results with power system operation using an optimization model that coordinates GTA actions across a large collection of grid-interactive efficient buildings (GEBs) to reduce high ramp rates on the grid and mitigate renewable energy curtailment. Overall, our work finds that the impacts on HVAC subsystems are often complex, and may result in additional energy being consumed by fans and terminal reheat. These effects must be considered when using GTA for load shifting. Additionally, we demonstrate that occupant comfort, as assessed by indoor temperature and humidity, can be maintained during GTA events. From a societal perspective, our modeling work finds that the additional renewable energy that can be integrated through the use of GTA strategies eclipses any additional energy consumed by buildings.

Keskar, Aditya (ORCID:0000000244617980)↗

A Latency-Tolerant Partitioner for Distributed Computing on the Information Power Grid

NASA's Information Power Grid (IPG) is an infrastructure designed to harness the power of graphically distributed computers, databases, and human expertise, in order to solve large-scale realistic computational problems. This type of a meta-computing environment is necessary to present a unified virtual machine to application developers that hides the intricacies of a highly heterogeneous environment and yet maintains adequate security. In this paper, we present a novel partitioning scheme. called MinEX, that dynamically balances processor workloads while minimizing data movement and runtime communication, for applications that are executed in a parallel distributed fashion on the IPG. We also analyze the conditions that are required for the IPG to be an effective tool for such distributed computations. Our results show that MinEX is a viable load balancer provided the nodes of the IPG are connected by a high-speed asynchronous interconnection network.

Das, Sajal K.↗

DCFC + Hydrogen Station Design Optimization [Slides]

Both direct current fast charging (DCFC) and Hydrogen stations are working to create successful long-term business models; however, analyses for DCFC and hydrogen fueling infrastructure are almost always performed separately. This work provides a detailed exploration of the benefit of integrating DCFC and hydrogen stations to lower the total system cost from load balancing and equipment cost sharing. To achieve this we have adapted the REopt optimization framework to simultaneously optimize the design and operation of integrated DCFC and H2 fueling station. Results indicate that 1) combining hydrogen fueling and DCFC stations can significantly reduce lifetime costs compared to separated stations. 2) Co-location with additional site load reduces DCFC costs, however, integration of DCFC with hydrogen provides an even greater cost reduction. 3) Adding PV to combined stations further reduces the lifetime station cost. 4) Capital investments in station combination today can help reduce the cost of operating DCFC tomorrow and 5) product diversification acts as a hedge against variability and enables a more dynamic response to market changes.

08 HYDROGEN↗

Stochastic DC optimal power flow with reserve saturation

We propose an optimization framework for stochastic optimal power flow with uncertain loads and renewable generator capacity. Our model follows previous work in assuming that generator outputs respond to load imbalances according to an affine control policy, but introduces a model of saturation of generator reserves by assuming that when a generator’s target level hits its limit, it abandons the affine policy and produces at that limit. This is a particularly interesting feature in models where wind power plants, which have uncertain upper generation limits, are scheduled to provide reserves to balance load fluctuations. Here, the resulting model is a nonsmooth nonconvex two-stage stochastic program, and we use a stochastic approximation method to find stationary solutions to a smooth approximation. Computational results on 6-bus and 118-bus test instances demonstrate that by considering the effects of saturation, our model can yield solutions with lower expected generation costs (at the same target line violation probability level) than those obtained from a model that enforces the affine policy to stay within generator limits with high probability.

17 WIND ENERGY↗

PC-RPL: Joint Control of Routing Topology and Transmission Power in Real Low-Power and Lossy Networks

We present PC-RPL , a transmission power-controlled IPv6 routing protocol for low-power and lossy wireless networks that significantly improves the end-to-end packet delivery performance under heavy traffic compared to the standard RPL. We show through actual design, implementation, and experiments that a multihop wireless network can achieve better throughput and routing stability when transmission power and routing topology are “jointly and adaptively” controlled. Our experiments show that the predominant “fixed and uniform” transmission power strategy with “link quality and hop distance”–based routing topology construction (i.e., RPL) loses significant bandwidth due to hidden terminal and load imbalance problems. We design an adaptive and distributed control mechanism for transmission power and routing topology, named PC-RPL , on top of the standard RPL routing protocol for hidden terminal mitigation and load balancing. We implement PC-RPL on real embedded devices and evaluate its performance on a 49-node multihop testbed. PC-RPL reduces total end-to-end packet losses by approximately sevenfold without increasing hop distance compared to RPL with the highest transmission power, resulting in 17% improvement in aggregate bandwidth and 64% improvement for the worst-case node by successfully alleviating both hidden terminal and load imbalance problems.

Computer Science↗

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↗

Improving Large-scale Storage System Performance via Topology-aware and Balanced Data Placement

With the advent of big data, the I/O subsystems of large-scale compute clusters are becoming a center of focus, with more applications putting greater demands on end-to-end I/O performance. These subsystems are often complex in design. They comprise of multiple hardware and software layers to cope with the increasing capacity, capability and scalability requirements of data intensive applications. The sharing nature of storage resources and the intrinsic interactions across these layers make it to realize user-level, end-to-end performance gains a great challenge. We propose a topology-aware resource load balancing strategy to improve per-application I/O performance. We demonstrate the effectiveness of our algorithm on an extreme-scale compute cluster, Titan, at the Oak Ridge Leadership Computing Facility (OLCF). Our experiments with both synthetic benchmarks and a real-world application show that, even under congestion, our proposed algorithm can improve large-scale application I/O performance significantly, resulting in both the reduction of application run times and higher resolution simulation runs.

Wang, Feiyi↗

Transonic Unsteady Aerodynamics of the F/A-18E at Conditions Promoting Abrupt Wing Stall

A transonic wind tunnel test of an 8% F/A-18E model was conducted in the NASA Langley Research Center (LaRC) 16-Foot Transonic Tunnel (16-Ft TT) to investigate the Abrupt Wing Stall (AWS) characteristics of this aircraft. During this test, both steady and unsteady measurements of balance loads, wing surface pressures, wing root bending moments, and outer wing accelerations were performed. The test was conducted with a wide range of model configurations and test conditions in an attempt to reproduce behavior indicative of the AWS phenomenon experienced on full-scale aircraft during flight tests. This paper focuses on the analysis of the unsteady data acquired during this test. Though the test apparatus was designed to be effectively rigid. model motions due to sting and balance flexibility were observed during the testing, particularly when the model was operating in the AWS flight regime. Correlation between observed aerodynamic frequencies and model structural frequencies are analyzed and presented. Significant shock motion and separated flow is observed as the aircraft pitches through the AWS region. A shock tracking strategy has been formulated to observe this phenomenon. Using this technique, the range of shock motion is readily determined as the aircraft encounters AWS conditions. Spectral analysis of the shock motion shows the frequencies at which the shock oscillates in the AWS region, and probability density function analysis of the shock location shows the propensity of the shock to take on a bi-stable and even tri-stable character in the AWS flight regime.

Schuster, David M.↗

Parallelization of the Physical-Space Statistical Analysis System (PSAS)

Atmospheric data assimilation is a method of combining observations with model forecasts to produce a more accurate description of the atmosphere than the observations or forecast alone can provide. Data assimilation plays an increasingly important role in the study of climate and atmospheric chemistry. The NASA Data Assimilation Office (DAO) has developed the Goddard Earth Observing System Data Assimilation System (GEOS DAS) to create assimilated datasets. The core computational components of the GEOS DAS include the GEOS General Circulation Model (GCM) and the Physical-space Statistical Analysis System (PSAS). The need for timely validation of scientific enhancements to the data assimilation system poses computational demands that are best met by distributed parallel software. PSAS is implemented in Fortran 90 using object-based design principles. The analysis portions of the code solve two equations. The first of these is the "innovation" equation, which is solved on the unstructured observation grid using a preconditioned conjugate gradient (CG) method. The "analysis" equation is a transformation from the observation grid back to a structured grid, and is solved by a direct matrix-vector multiplication. Use of a factored-operator formulation reduces the computational complexity of both the CG solver and the matrix-vector multiplication, rendering the matrix-vector multiplications as a successive product of operators on a vector. Sparsity is introduced to these operators by partitioning the observations using an icosahedral decomposition scheme. PSAS builds a large (approx. 128MB) run-time database of parameters used in the calculation of these operators. Implementing a message passing parallel computing paradigm into an existing yet developing computational system as complex as PSAS is nontrivial. One of the technical challenges is balancing the requirements for computational reproducibility with the need for high performance. The problem of computational reproducibility is well known in the parallel computing community. It is a requirement that the parallel code perform calculations in a fashion that will yield identical results on different configurations of processing elements on the same platform. In some cases this problem can be solved by sacrificing performance. Meeting this requirement and still achieving high performance is very difficult. Topics to be discussed include: current PSAS design and parallelization strategy; reproducibility issues; load balance vs. database memory demands, possible solutions to these problems.

Larson, J. W.↗

Computational Challenges for Power System Operation

As the power grid technology evolution and information technology revolution converge, power grids are witnessing a revolutionary transition, represented by emerging grid technologies and large scale deployment of new sensors and meters in networks. This transition brings opportunities, as well as computational challenges in the field of power grid analysis and operation. This paper presents some research outcomes in the areas of parallel state estimation using the preconditioned conjugated gradient method, parallel contingency analysis with a dynamic load balancing scheme and distributed system architecture. Based on this research, three types of computational challenges are identified: highly coupled applications, loosely coupled applications, and centralized and distributed applications. Recommendations for future work for power grid applications are also presented.

24 POWER TRANSMISSION AND DISTRIBUTION↗