Search NASA⌕ Search

SEARCH · Search NASA

Results for “dynamical balances”

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

Dynamic balance of pro- and anti-inflammatory signals controls disease and limits pathology

Immune responses to pathogens are complex and not well understood in many diseases, and this is especially true for infections by persistent pathogens. One mechanism that allows for long-term control of infection while also preventing an over-zealous inflammatory response from causing extensive tissue damage is for the immune system to balance pro- and anti-inflammatory cells and signals. This balance is dynamic and the immune system responds to cues from both host and pathogen, maintaining a steady state across multiple scales through continuous feedback. Identifying the signals, cells, cytokines, and other immune response factors that mediate this balance over time has been difficult using traditional research strategies. Computational modeling studies based on data from traditional systems can identify how this balance contributes to immunity. Here we provide evidence from both experimental and mathematical/computational studies to support the concept of a dynamic balance operating during persistent and other infection scenarios. We focus mainly on tuberculosis, currently the leading cause of death due to infectious disease in the world, and also provide evidence for other infections. A better understanding of the dynamically balanced immune response can help shape treatment strategies that utilize both drugs and host-directed therapies.

60 APPLIED LIFE SCIENCES↗

Electrical Power Grid Delivery Dynamic Analysis: Using Prime Mover Engines to Balance Dynamic Wind Turbine Output

This paper presents an investigation into integrated wind + combustion engine high penetration electrical generation systems. Renewable generation systems are now a reality of electrical transmission. Unfortunately, many of these renewable energy supplies are stochastic and highly dynamic. Conversely, the existing national grid has been designed for steady state operation. The research team has developed an algorithm to investigate the feasibility and relative capability of a reciprocating internal combustion engine to directly integrate with wind generation in a tightly coupled Hybrid Energy System. Utilizing the Idaho National Laboratory developed Phoenix Model Integration Platform, the research team has coupled demand data with wind turbine generation data and the Aspen Custom Modeler reciprocating engine electrical generator model to investigate the capability of reciprocating engine electrical generation to balance stochastic renewable energy.

17 WIND ENERGY↗

Active Modes and Dynamical Balances in MRI Turbulence of Keplerian Disks with a Net Vertical Magnetic Field

Her,e we studied dynamical balances in magnetorotational instability (MRI) turbulence with a net vertical field in the shearing box model of disks. Analyzing the turbulence dynamics in Fourier ($\boldsymbol{k}$-)space, we identified three types of active modes that define the turbulence characteristics. These modes have lengths similar to the box size, i.e., lie in the small wavenumber region in Fourier space labeled "the vital area" and are (i) the channel mode, uniform in the disk plane with the smallest vertical wavenumber; (ii) the zonal flow mode, azimuthally and vertically uniform with the smallest radial wavenumber; and (iii) the rest (parasitic) modes. The rest modes comprise those harmonics in the vital area whose energies reach more than 50% of the maximum spectral energy. The rest modes individually are not so significant compared to the channel and zonal flow modes; however, the combined action of their multitude is dominant over these two modes. These three mode types are governed by the interplay of the linear and nonlinear processes, leading to their interdependent dynamics. The linear processes consist of disk flow nonmodality modified classical MRI with a net vertical field. The main nonlinear process is the transfer of modes over wavevector angles in Fourier space—the transverse cascade. The channel mode exhibits episodic bursts supplied by linear MRI growth, while the nonlinear processes mostly oppose this, draining the channel energy and redistributing it to the rest modes. As for the zonal flow, it does not have a linear source and is fed by nonlinear interactions of the rest modes.

79 ASTRONOMY AND ASTROPHYSICS↗

Dynamic Analysis of Electrical Power Grid Delivery: Using Prime Mover Engines to Balance Dynamic Wind Turbine Output

This paper presents an investigation into integrated wind + combustion engine high penetration electrical generation systems. Renewable generation systems are now a reality of electrical transmission. Unfortunately, many of these renewable energy supplies are stochastic and highly dynamic. Conversely, the existing national grid has been designed for steady state operation. The research team has developed an algorithm to investigate the feasibility and relative capability of a reciprocating internal combustion engine to directly integrate with wind generation in a tightly coupled Hybrid Energy System. Utilizing the Idaho National Laboratory developed Phoenix Model Integration Platform, the research team has coupled demand data with wind turbine generation data and the Aspen Custom Modeler reciprocating engine electrical generator model to investigate the capability of reciprocating engine electrical generation to balance stochastic renewable energy.

17 WIND ENERGY↗

A moment projection method for population balance dynamics with a shrinkage term

A new method of moments for solving the population balance equation is developed and presented. The moment projection method (MPM) is numerically simple and easy to implement and attempts to address the challenge of particle shrinkage due to processes such as oxidation, evaporation or dissolution. It directly solves the moment transport equation for the moments and tracks the number of the smallest particles using the algorithm by Blumstein and Wheeler (1973) . The performance of the new method is measured against the method of moments (MOM) and the hybrid method of moments (HMOM). The results suggest that MPM performs much better than MOM and HMOM where shrinkage is dominant. The new method predicts mean quantities which are almost as accurate as a high-precision stochastic method calculated using the established direct simulation algorithm (DSA).

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Deciphering the Dynamic Balance Between Solvation Strength and Polysulfides Reaction Heterogeneity in Practical Lithium‐Sulfur Batteries

Achieving stable interfacial chemistry in lithium–sulfur batteries under practical conditions remains a key barrier to commercialization. Here, we demonstrate that interfacial dynamics can be effectively regulated by coupling solvation-power control with intrinsic heterogeneity of sulfur redox chemistry through the introduction of a weakly solvating fluorinated cosolvent, LIB 1200ET (1200ET). Compared with conventional fluorinated ethers, 1200ET efficiently shifts Li + solvation environment toward a more non-coordinated configuration at low volume fractions, enabling substantial solvation modulation without significantly impairing sulfur redox kinetics. This solvation transition weakens Li + –solvent interactions while strengthening Li + –anion and Li + –lithium polysulfide (LPS) coordination, suppressing LPS solubility and promoting reconstruction of solid–electrolyte interphase (SEI). Regulated LPS chemistry, together with 1200ET, leads to formation of a S 4+ -rich, LiF-reinforced SEI with enhanced ionic conductivity and mechanical robustness. Spatially resolved sulfur K-edge X-ray absorption spectroscopy on pouch cells reveals pronounced current-density-dependent chemical heterogeneity, distinguishing kinetically dominated and solvation-controlled regions. Under practical conditions (3.7 mg cm −2 sulfur loading, E/S = 6 µL mg −1 ), a single-layer pouch cell delivers 527 mAh g −1 over 200 cycles at C/3, while an Ah-level multilayer pouch cell achieves an energy density of 358 Wh kg −1 . These results establish non-coordinating cosolvent-driven solvation engineering as a scalable strategy for practical Li–S batteries.

36 MATERIALS SCIENCE↗

Dynamic Balancing of Isoprene Carbon Sources Reflects Photosynthetic and Photorespiratory Responses to Temperature Stress

The volatile gas isoprene is emitted in teragrams per annum quantities from the terrestrial biosphere and exerts a large effect on atmospheric chemistry. Isoprene is made primarily from recently fixed photosynthate; however, alternate carbon sources play an important role, particularly when photosynthate is limiting. We examined the relative contribution of these alternate carbon sources under changes in light and temperature, the two environmental conditions that have the strongest influence over isoprene emission. Using a novel real-time analytical approach that allowed us to examine dynamic changes in carbon sources, we observed that relative contributions do not change as a function of light intensity. We found that the classical uncoupling of isoprene emission from net photosynthesis at elevated leaf temperatures is associated with an increased contribution of alternate carbon. We also observed a rapid compensatory response where alternate carbon sources compensated for transient decreases in recently fixed carbon during thermal ramping, thereby maintaining overall increases in isoprene production rates at high temperatures. Photorespiration is known to contribute to the decline in net photosynthesis at high leaf temperatures. A reduction in the temperature at which the contribution of alternate carbon sources increased was observed under photorespiratory conditions, while photosynthetic conditions increased this temperature. Feeding [2- 13 C]glycine (a photorespiratory intermediate) stimulated emissions of [ 13 C 1–5 ]isoprene and 13 CO 2 , supporting the possibility that photorespiration can provide an alternate source of carbon for isoprene synthesis. Our observations have important implications for establishing improved mechanistic predictions of isoprene emissions and primary carbon metabolism, particularly under the predicted increases in future global temperatures.

59 BASIC BIOLOGICAL SCIENCES↗

A method to dynamically balance intensity modulated radiotherapy dose between organs-at-risk

The IMRT treatment planning process typically follows a path that is based on the manner in which the planner interactively adjusts the target and organ-at-risk (OAR) constraints and priorities. The time-intensive nature of this process restricts the planner from fully understanding the dose trade-off between structures, making it unlikely that the resulting plan fully exploits the extent to which dose can be redistributed between anatomical structures. Multiobjective Pareto optimization has been used in the past to enable the planner to more thoroughly explore alternatives in dose trade-off by combining pre-generated Pareto optimal solutions in real time, thereby potentially tailoring a plan more exactly to requirements. However, generating the Pareto optimal solutions can be nonintuitive and computationally time intensive. The author presents an intuitive and fast non-Pareto approach for generating optimization sequences (prior to planning), which can then be rapidly combined by the planner in real time to yield a satisfactory plan. Each optimization sequence incrementally reduces dose to one OAR at a time, starting from the optimization solution where dose to all OARs are reduced with equal priority, until user-specified target coverage limits are violated. The sequences are computationally efficient to generate, since the optimization at each position along a sequence is initiated from the end result of the previous position in the sequence. The pre-generated optimization sequences require no user interaction. In real time, a planner can more or less instantaneously visualize a treatment plan by combining the dose distributions corresponding to user-selected positions along each of the optimization sequences (target coverage is intrinsically maintained in the combination). Interactively varying the selected positions along each of the sequences enables the planner to rapidly understand the nature of dose trade-off between structures and, thereby, arrive at a suitable plan in a short time. This methodology is demonstrated on a prostate cancer case and olfactory neuroblastoma case.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

Dynamic load balancing algorithm for molecular dynamics based on Voronoi cells domain decompositions

We present a new algorithm for automatic parallel load balancing in classical molecular dynamics. It assumes a spatial domain decomposition of particles into Voronoi cells. It is a gradient method which attempts to minimize a cost function by displacing Voronoi sites associated with each processor/sub-domain along steepest descent directions. Excellent load balance has been obtained for quasi-2D and 3D practical applications, with up to 440·10 6 particles on 65,536 MPI tasks.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Dynamic Load Balancing Based on Constrained K-D Tree Decomposition for Parallel Particle Tracing

Particle tracing is a fundamental technique in flow field data visualization. In this work, we present a novel dynamic load balancing method for parallel particle tracing. Specifically, we employ a constrained k-d tree decomposition approach to dynamically redistribute tasks among processes. Each process is initially assigned a regularly partitioned block along with duplicated ghost layer under the memory limit. During particle tracing, the k-d tree decomposition is dynamically performed by constraining the cutting planes in the overlap range of duplicated data. This ensures that each process is reassigned particles as even as possible, and on the other hand the new assigned particles for a process always locate in its block. Result shows good load balance and high efficiency of our method.

Zhang, Jiang↗

Applying Graph Partitioning Methods in Measurement-Based Dynamic Load Balancing

Load imbalance can lead to wasted CPU hours especially when running on a large number of processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing frame work. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, for measurement based dynamic load balancing of parallel applications. In particular, we present repartitioning methods developed in a graph partitioning toolbox called Scotch that consider the previous mapping to minimize migration costs. We also discuss a new imbalance reduction algorithm for graphs with irregular load distributions. We compare several load balancing algorithms using a micro-benchmark and the NAS BT multi-zone bench mark. New algorithms developed in Scotch lead to better performance compared to other existing partitioners, both in terms of the application execution time and fewer number of objects migrated.

97 MATHEMATICS AND COMPUTING↗

Performance Evaluation of Counter-Based Dynamic Load Balancing Schemes for Massive Contingency Analysis with Different Computing Environments

Contingency analysis is a key function in the Energy Management System (EMS) to assess the impact of various combinations of power system component failures based on state estimation. Contingency analysis is also extensively used in power market operation for feasibility test of market solutions. High performance computing holds the promise of faster analysis of more contingency cases for the purpose of safe and reliable operation of today’s power grids with less operating margin and more intermittent renewable energy sources. This paper evaluates the performance of counter-based dynamic load balancing schemes for massive contingency analysis under different computing environments. Insights from the performance evaluation can be used as guidance for users to select suitable schemes in the application of massive contingency analysis. Case studies, as well as MATLAB simulations, of massive contingency cases using the Western Electricity Coordinating Council power grid model are presented to illustrate the application of high performance computing with counter-based dynamic load balancing schemes.

24 POWER TRANSMISSION AND DISTRIBUTION↗

A parallel p ‐adaptive discontinuous Galerkin method for the Euler equations with dynamic load‐balancing on tetrahedral grids

Abstract A novel p ‐adaptive discontinuous Galerkin (DG) method has been developed to solve the Euler equations on three‐dimensional tetrahedral grids. Hierarchical orthogonal basis functions are adopted for the DG spatial discretization while a third order TVD Runge‐Kutta method is used for the time integration. A vertex‐based limiter is applied to the numerical solution in order to eliminate oscillations in the high order method. An error indicator constructed from the solution of order and is used to adapt degrees of freedom in each computational element, which remarkably reduces the computational cost while still maintaining an accurate solution. The developed method is implemented with under the Charm++ parallel computing framework. Charm++ is a parallel computing framework that includes various load‐balancing strategies. Implementing the numerical solver under Charm++ system provides us with access to a suite of dynamic load balancing strategies. This can be efficiently used to alleviate the load imbalances created by p ‐adaptation. A number of numerical experiments are performed to demonstrate both the numerical accuracy and parallel performance of the developed p ‐adaptive DG method. It is observed that the unbalanced load distribution caused by the parallel p ‐adaptive DG method can be alleviated by the dynamic load balancing from Charm++ system. Due to this, high performance gain can be achieved. For the testcases studied in the current work, the parallel performance gain ranged from 1.5× to 3.7×. Therefore, the developed p ‐adaptive DG method can significantly reduce the total simulation time in comparison to the standard DG method without p ‐adaptation.

97 MATHEMATICS AND COMPUTING↗

Dynamic load balancing with enhanced shared-memory parallelism for particle-in-cell codes

Furthering our understanding of many of today’s interesting problems in plasma physics – including plasma based acceleration and magnetic reconnection with pair production due to quantum electrodynamic effects – requires large-scale kinetic simulations using particle-in-cell (PIC) codes. However, these simulations are extremely demanding, requiring that contemporary PIC codes be designed to efficiently use a new fleet of exascale computing architectures. To this end, the key issue of parallel load balance across computational nodes must be addressed. We discuss the implementation of dynamic load balancing by dividing the simulation space into many small, self-contained regions or ‘‘tiles,’’ along with shared-memory (e.g., OpenMP) parallelism both over many tiles and within single tiles. The load balancing algorithm can be used with three different topologies, including two space-filling curves. Here, we tested this implementation in the code Osiris and show low overhead and improved scalability with OpenMP thread number on simulations with both uniform load and severe load imbalance. Compared to other load-balancing techniques, our algorithm gives order-of-magnitude improvement in parallel scalability for simulations with severe load imbalance issues.

97 MATHEMATICS AND COMPUTING↗

Applying graph partitioning methods in measurement-based dynamic load balancing

Load imbalance leads to an increasing waste of resources as an application is scaled to more and more processors. Achieving the best parallel efficiency for a program requires optimal load balancing which is a NP-hard problem. However, finding near-optimal solutions to this problem for complex computational science and engineering applications is becoming increasingly important. Charm++, a migratable objects based programming model, provides a measurement-based dynamic load balancing framework. This framework instruments and then migrates over-decomposed objects to balance computational load and communication at runtime. This paper explores the use of graph partitioning algorithms, traditionally used for partitioning physical domains/meshes, for measurement-based dynamic load balancing of parallel applications. In particular, we present repartitioning methods developed in a graph partitioning toolbox called SCOTCH that consider the previous mapping to minimize migration costs. We also discuss a new imbalance reduction algorithm for graphs with irregular load distributions. We compare several load balancing algorithms using microbenchmarks on Intrepid and Ranger and evaluate the effect of communication, number of cores and number of objects on the benefit achieved from load balancing. New algorithms developed in SCOTCH lead to better performance compared to the METIS partitioners for several cases, both in terms of the application execution time and fewer number of objects migrated.

97 MATHEMATICS AND COMPUTING↗

Transport enhancement and suppression in turbulent magnetic reconnection: A self-consistent turbulence model

Through the enhancement of transport, turbulence is expected to contribute to the fast reconnection. However, the effects of turbulence are not so straightforward. In addition to the enhancement of transport, turbulence under some environment shows effects that suppress the transport. In the presence of turbulent cross helicity, such dynamic balance between the transport enhancement and suppression occurs. As this result of dynamic balance, the region of effective enhanced magnetic diffusivity is confined to a narrow region, leading to the fast reconnection. In order to confirm this idea, a self-consistent turbulence model for the magnetic reconnection is proposed. With the aid of numerical simulations where turbulence effects are incorporated in a consistent manner through the turbulence model, the dynamic balance in the turbulence magnetic reconnection is confirmed.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Dynamic load balancing for petascale quantum Monte Carlo applications: The Alias method

Diffusion Monte Carlo is the most accurate widely used Quantum Monte Carlo method for the electronic structure of materials, but it requires frequent load balancing or population redistribution steps to maintain efficiency and avoid accumulation of systematic errors on parallel machines. The load balancing step can be a significant factor affecting performance, and will become more important as the number of processing elements increases. We propose a new dynamic load balancing algorithm, the Alias Method, and evaluate it theoretically and empirically. An important feature of the new algorithm is that the load can be perfectly balanced with each process receiving at most one message. It is also optimal in the maximum size of messages received by any process. We also optimize its implementation to reduce network contention, a process facilitated by the low messaging requirement of the algorithm. Empirical results on the petaflop Cray XT Jaguar supercomputer at ORNL showing up to 30% improvement in performance on 120,000 cores. The load balancing algorithm may be straightforwardly implemented in existing codes. The algorithm may also be employed by any method with many near identical computational tasks that requires load balancing.

97 MATHEMATICS AND COMPUTING↗