Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “distributed parallelization”

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 685 records · Page 38
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Direct simulation Monte Carlo analysis on parallel processors

A method is presented for executing a direct simulation Monte Carlo (DSMC) analysis using parallel processing. The method is based on using domain decomposition to distribute the work load among multiple processors, and the DSMC analysis is performed completely in parallel. Message passing is used to transfer molecules between processors and to provide the synchronization necessary for the correct physical simulation. Benchmark problems are described for testing the method and results are presented which demonstrate the performance on two commercially available multicomputers. The results show that reasonable parallel speedup and efficiency can be obtained if the problem is properly sized to the number of processors. It is projected that with a massively parallel system, performance exceeding that of current supercomputers is possible.

Wilmoth, Richard G.↗
DOE OSTI2023

Microgrid energy scheduling under uncertain extreme weather: Adaptation from parallelized reinforcement learning agents

Microgrids are useful solutions for integrating renewable energy resources and providing seamless green electricity to minimize carbon footprint. In recent years, extreme weather events happened often worldwide and caused significant economic and societal losses. Such events bring uncertainties to the microgrid energy scheduling problems and increase the challenges of microgrid operation. Traditional optimization approaches suffer from the inaccuracy of the uncertain microgrid model and the unseen events. Existing reinforcement learning (RL) - based approaches are also hampered by the limited generalization and the increasing computational burden when stochastic formulations are required to accommodate the uncertainties. This paper proposes a new parallelized reinforcement learning (PRL) method based on the probabilistic events to handle the microgrid energy uncertainties. Specifically, several local learning agents are employed to interact with pertinent microgrid environments in a distributed manner and report outcomes to the global agent, which will optimize microgrid energy resources online during extreme events. The stochastic microgrid energy optimization problem is reformulated to include all possible scenarios with probabilities. The advantage estimate functions of learning agents are designed with a backward sweep to transfer the outcomes to the value function updating process. Two simulation studies, stochastic optimization and online testing, are performed to compare with several existing RL approaches. Results substantiate that the proposed PRL method can achieve up to 20% optimization performance improvement with 4 and 28 times less computation cost than Q-learning with experience replay and multi-agent Q-learning approaches, respectively.

24 POWER TRANSMISSION AND DISTRIBUTION↗
NASA NTRS1993

Comparison of hydrodynamic and semi-kinetic treatments for plasma flow along closed field lines

Hydrodynamic and semi-kinetic treatments of plasma flow along closed geomagnetic field lines are compared. The hydrodynamic treatment is based on a simplified 16-moment set of transport equations as the equations for the heat flows are not solved; the heat flows are treated heuristically. The semi-kinetic treatment is based on a particle code. The comparison deals with the distributions of the plasma density, flow velocity, and parallel and perpendicular temperatures as obtained from the two treatments during the various stages of the flow. In the kinetic treatment, the appropriate boundary condition is the prescription of the velocity distribution functions for the particles entering the flux tubes at the ionospheric boundaries; those particles leaving the system are determined by the processes occurring in the flux tube. The prescribed distributions are half-Maxwellian with temperature T(sub 0) and density n(sub 0). In the hydrodynamic model, the prescribed boundary conditions are on density (n(sub 0)), flow velocity (V(sub 0)) and temperature (T(sub 0). It was found that results from the hydrodynamic treatment critically depend on V(sub 0); for early stages of the flow this treatment yields results in good agreement with those from the kinetic treatment, when V(sub 0) = square root of (kT(sub 0)/2 (pi)m), which is the average velocity of particles moving in a given direction for a Maxwellian distribution. During this early stage, the flows developing form the conjugate ionospheres show some distinct transitions. For the first hour or so, the flows are highly supersonic and penetrate deep into the opposite hemispheres, and both hydrodynamics and kinetic treatments yield almost similar features. It is found that during this period heatflow effects are negligibly small. When a flow penetrates deep into the opposite hemisphere, the kinetic treatment predicts reflection and setting up of counterstreaming. In contrast, the hydrodynamic treatment yields a shock in the flow. The reasons for this difference in the two treatments is discussed, showing that in view of the relatively warm ions, the coupling of ion beams and the consequent shock formation in the offequatorial region are not likely due to the enhancements in the beam temperatures. The counterstreaming in the kinetic treatment and the shock in the hydrodynamic treatment first advance upward to the equator and then downward to the ionospheric boundary from where the flow originated. The transit time for this advancement is found to be about 1 hour for the respective models. After 2 hours or so, both models predict that the flows from the ionospheric boundaries are generally subsonic with respect to the local ion-sound speed. At late stages of the flow, when a substantial fraction of ions entering the flux tube begin to return back in the kinetic treatment, the hydrodynamic treatment with the boundary condition V(sub 0) = square root of (kT(sub 0)/2(pi)m) yields an over-refilling, and the choice of V(sub 0) becomes uncertain.

Singh, Nagendra↗
DOE OSTI2026

Explainable machine learning for incipient anomaly detection in compact molten salt heat exchanger with overlapping feature distributions

High-temperature molten salt-cooled reactors (MSCRs) are a promising next-generation nuclear technology option, offering efficient power conversion and inherent safety features. However, the reliability of these systems depends on the robust operation of heat exchangers (HXs), which are susceptible to failure due to temperature gradients and channel plugging caused by fluid freezing. Conventional monitoring methods, relying on inlet and outlet measurements, lack the spatial resolution needed to detect early-stage faults. We propose a novel design of a compact salt-to-salt matrix-type HX design consisting of interleaved arrays of parallel tubes, with integrated synthetic fiber optic distributed temperature sensing (DTS) to enable localized detection of incipient faults. To evaluate performance of this design, we generate high-fidelity synthetic data using heat transfer computational modeling to simulate channel plugging, and introduce sensor noise for realistic modeling of measurements. The dataset comprises of 97% normal operation and 3% anomaly cases, with each anomaly class representing 1% of the data. These early anomalies result in overlapping temperature profiles between normal and faulty channels, producing a non-separable dataset that challenges traditional classification techniques. We benchmark eight supervised machine learning (ML) models and demonstrate that XGBoost achieves the highest performance. To improve transparency, we develop an explainability framework combining Shapley values and partially ordered sets (POSETs) to quantify and structurally analyze feature importance. This approach identifies both dominant predictors and ambiguous feature relationships, enhancing trust and interpretability. Our results highlight the potential of combining DTS and explainable ML with intelligent feature selection to improve predictive maintenance and ensure operational resilience in advanced nuclear systems.

Prantikos, Konstantinos [Argonne National Laborato↗
NASA NTRS1983

Electron velocity distributions near interplantary shocks

Previous work on electron heating mechanisms operating at the supercritical earth's bow shock is extended to the generally lower Mach number interplanetary shocks. This is done by studying electron velocity distributions observed both upstream and downstream of interplanetary shocks observed by ISEE 3 between August 1978 and December 1979. It is found that perpendicular heating accompanied by little or no parallel heating occurs at the weaker shocks but that parallel heating is dominant for the stronger shocks. When perpendicular heating is dominant, downstream velocity distributions are for the most part Gaussian at low energies (core) and Lorentzian at high energies (halo). When parallel heating is dominant, however, these distributions are flat-topped at low energies, having power law extensions to higher energies. At the weaker shocks, the observations are consistent with electron heating resulting from conservation of the magnetic moment, whereas at the stronger shocks the heating is quite similar to that observed at the earth's bow shock.

Feldman, W. C.↗
NASA NTRS1999

Data Structure and Parallel Decomposition Considerations on a Fibonacci Grid

The Fibonacci grid, proposed by Swinbank and Purser (see companion abstract), provides attractive properties for global numerical atmospheric prediction by offering an optimally homogeneous, geometrically regular, and approximately isotropic discretization, with only the polar regions requiring special numerical treatment. It is a mathematical idealization, applied to the sphere, of the multi-spiral patterns often found in botanical structures, such as in pine cones and sunflower heads. Computationally, it is natural to organize the domain, into zones, in each of which the same pair, or triple, of "Fibonacci spirals" dominate. But the further subdivision of such zones into "tiles" of a shape and size suitable for distribution to the processors of a massively parallel computer requires very careful consideration if the subsequent spatial computations along the respective spirals, especially those computations (such as compact differencing schemes) that involve recursion, can be implemented in an efficient "load-balanced "manner without requiring excessive amounts of inter-processor communications. In this paper we show how certain "number theoretic" properties of the Fibonacci sequence (whose numbers prescribe the multiplicity of successive spirals) may be exploited in the decomposition of grid zones into tidy arrangements of triangular grid tiles, each tile possessing one side approximately parallel to the constant-latitude zone boundary. We also describe how the spatially recursive processes may be decomposed across such a tiling, and the directionality of the recursions reversed on alternate grid lines, to ensure a very high degree of load balancing throughout the execution of the computations required for one time step of a global model.

Michalakes, John↗
NASA NTRS1988

Parallel algorithms for interactive manipulation of digital terrain models

Interactive three-dimensional graphics applications, such as terrain data representation and manipulation, require extensive arithmetic processing. Massively parallel machines are attractive for this application since they offer high computational rates, and grid connected architectures provide a natural mapping for grid based terrain models. Presented here are algorithms for data movement on the massive parallel processor (MPP) in support of pan and zoom functions over large data grids. It is an extension of earlier work that demonstrated real-time performance of graphics functions on grids that were equal in size to the physical dimensions of the MPP. When the dimensions of a data grid exceed the processing array size, data is packed in the array memory. Windows of the total data grid are interactively selected for processing. Movement of packed data is needed to distribute items across the array for efficient parallel processing. Execution time for data movement was found to exceed that for arithmetic aspects of graphics functions. Performance figures are given for routines written in MPP Pascal.

Davis, E. W.↗
NASA NTRS2007

Influence of the Convection Electric Field Models on Predicted Plasmapause Positions During Magnetic Storms

In the present work, we determine how three well documented models of the magnetospheric electric field, and two different mechanisms proposed for the formation of the plasmapause influence the radial distance, the shape and the evolution of the plasmapause during the geomagnetic storms of 28 October 2001 and of 17 April 2002. The convection electric field models considered are: Mcllwain's E51) electric field model, Volland-Stern's model and Weimer's statistical model compiled from low-Earth orbit satellite data. The mechanisms for the formation of the plasmapause to be tested are: (i) the MHD theory where the plasmapause should correspond to the last-closed- equipotential (LCE) or last-closed-streamline (LCS), if the E-field distribution is stationary or time-dependent respectively; (ii) the interchange mechanism where the plasmapause corresponds to streamlines tangent to a Zero-Parallel-Force surface where the field-aligned plasma distribution becomes convectively unstable during enhancements of the E-field intensity in the nightside local time sector. The results of the different time dependent simulations are compared with concomitant EUV observations when available. The plasmatails or plumes observed after both selected geomagnetic storms are predicted in all simulations and for all E-field models. However, their shapes are quite different depending on the E-field models and the mechanisms that are used. Despite the partial success of the simulations to reproduce plumes during magnetic storms and substorms, there remains a long way to go before the detailed structures observed in the EUV observations during periods of geomagnetic activity can be accounted for very precisely by the existing E-field models. Furthermore, it cannot be excluded that the mechanisms currently identified to explain the formation of "Carpenter's knee" during substorm events, will', have to be revised or complemented in the cases of geomagnetic storms.

Pierrard, V.↗
NASA NTRS2000

A Tool for Automatic Data Distribution for CFD Applications on Structured Grids

Development of HPF versions of NPB and ARC3D has shown that HPF provides an efficient, concise way to express parallelism and to organize data traffic. The use of HPF, as noted in the papers, requires an intimate knowledge of the applications and a detailed analysis of data affinity, data movement, and data granularity. To simplify and accelerate the task of developing HPF versions of existing CFD applications we have designed and implemented ADAPT (Automatic Data Alignment and Placement Tool). ADAPT analyzes a CFD application working on a single structured grid and generates HPF TEMPLATE, (RE)DISTRIBUTION, ALIGNMENT, and INDEPENDENT directives. The directives can be generated on the nest level, subroutine level, application level, or on the application interface level. ADAPT annotates an existing CFD FORTRAN application, performing computations on single or multiple grids. On each grid the application is considered as a sequence of operators, each applied to a set of variables defined in a particular grid domain. ADAPT automatically detects implicit operators (i.e., having data dependences) and explicit operators (without data dependences). For parallelization of an explicit operator ADAPT creates a template for the operator domain, aligns arrays used in the operator with the template, distributes the template, and declares the loops over the distributed dimensions as INDEPENDENT. For parallelization of an implicit operator, the distribution of the operator's domain should be consistent with the operator's dependences. Any dependence between sections distributed on different processors would preclude parallelization if the compiler does not have an ability to pipeline computations. If a data distribution is "orthogonal" to the dependences of an implicit operator, then the loop which implements the operator can be declared as INDEPENDENT. ADAPT starts with an analysis of array index expressions of the loop nests. For each pair of arrays referenced in an assignment statement, it generates an arc in the alignment graph and annotates it with an affinity relation. The template, alignment, and distribution directives for a particular loop nest are then derived from a transitive closure of the affinity relation. A compromise of data distributions in different nests and subroutines is achieved by merging annotated alignment graphs for adjacent nests/stibroutine calls in the nest/call graph of the application in the process called distribution lifting. ADAPT has been implemented as a C++ program running in conjunction with a parallelization tool called CAPTools. ADAPT uses the parse tree, interprocedural analysis and application database generated by CAPTools. It also uses the Directed Graph class, initially implemented in p2d2 (parallel debugger oi distributed programs), and some other classes supporting symbolic computations. ADAPT uses data distribution techniques described. ADAPT was tested with ARC3D and the FT benchmark and has demonstrated a code performance within a factor of 1.5 of handwritten versions.

Frumkin, Michael↗
NASA NTRS1987

A parallel simulated annealing algorithm for standard cell placement on a hypercube computer

A parallel version of a simulated annealing algorithm is presented which is targeted to run on a hypercube computer. A strategy for mapping the cells in a two dimensional area of a chip onto processors in an n-dimensional hypercube is proposed such that both small and large distance moves can be applied. Two types of moves are allowed: cell exchanges and cell displacements. The computation of the cost function in parallel among all the processors in the hypercube is described along with a distributed data structure that needs to be stored in the hypercube to support parallel cost evaluation. A novel tree broadcasting strategy is used extensively in the algorithm for updating cell locations in the parallel environment. Studies on the performance of the algorithm on example industrial circuits show that it is faster and gives better final placement results than the uniprocessor simulated annealing algorithms. An improved uniprocessor algorithm is proposed which is based on the improved results obtained from parallelization of the simulated annealing algorithm.

Jones, Mark Howard↗
NASA NTRS2002

Collaborative Simulation Grid: Multiscale Quantum-Mechanical/Classical Atomistic Simulations on Distributed PC Clusters in the US and Japan

A multidisciplinary, collaborative simulation has been performed on a Grid of geographically distributed PC clusters. The multiscale simulation approach seamlessly combines i) atomistic simulation backed on the molecular dynamics (MD) method and ii) quantum mechanical (QM) calculation based on the density functional theory (DFT), so that accurate but less scalable computations are performed only where they are needed. The multiscale MD/QM simulation code has been Grid-enabled using i) a modular, additive hybridization scheme, ii) multiple QM clustering, and iii) computation/communication overlapping. The Gridified MD/QM simulation code has been used to study environmental effects of water molecules on fracture in silicon. A preliminary run of the code has achieved a parallel efficiency of 94% on 25 PCs distributed over 3 PC clusters in the US and Japan, and a larger test involving 154 processors on 5 distributed PC clusters is in progress.

Kikuchi, Hideaki↗
DOE OSTI2022

Simulating single-particle dynamics in magnetized plasmas: The RMF code

The RMF (Rotating Magnetic Field) code is designed to calculate the motion of a charged particle in a given electromagnetic field. It integrates Hamilton’s equations in cylindrical coordinates using an adaptive predictor-corrector double-precision variable-coefficient ordinary differential equation solver for speed and accuracy. RMF has multiple capabilities for the field. Particle motion is initialized by specifying the position and velocity vectors. Here, the six-dimensional state vector and derived quantities are saved as functions of time. A post-processing graphics code, XDRAW, is used on the stored output to plot up to 12 windows of any two quantities using different colors to denote successive time intervals. Multiple cases of RMF may be run in parallel and perform data mining on the results. Recent features are a synthetic diagnostic for simulating the observations of charge-exchange-neutral energy distributions and RF grids to explore a Fermi acceleration parallel to static magnetic fields.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
NASA NTRS1992

Advanced techniques in reliability model representation and solution

The current tendency of flight control system designs is towards increased integration of applications and increased distribution of computational elements. The reliability analysis of such systems is difficult because subsystem interactions are increasingly interdependent. Researchers at NASA Langley Research Center have been working for several years to extend the capability of Markov modeling techniques to address these problems. This effort has been focused in the areas of increased model abstraction and increased computational capability. The reliability model generator (RMG) is a software tool that uses as input a graphical object-oriented block diagram of the system. RMG uses a failure-effects algorithm to produce the reliability model from the graphical description. The ASSURE software tool is a parallel processing program that uses the semi-Markov unreliability range evaluator (SURE) solution technique and the abstract semi-Markov specification interface to the SURE tool (ASSIST) modeling language. A failure modes-effects simulation is used by ASSURE. These tools were used to analyze a significant portion of a complex flight control system. The successful combination of the power of graphical representation, automated model generation, and parallel computation leads to the conclusion that distributed fault-tolerant system architectures can now be analyzed.

Palumbo, Daniel L.↗
NASA NTRS1994

Location and characteristics of the reconnection X-line deduced from low-altitude satellite and radar observations

We present an analysis of a cusp ion step observed between two poleward-moving events of enhanced ionospheric electron temperature. From the computed variation of the reconnection rate and the onset times of the associated ionospheric events, the distance between the satellite and the X-line can be estimated, but with a large uncertainty due to that in the determination of the low-energy cut-off of the ion velocity distribution function, f(E). Nevertheless, analysis of the time series f(t) shows the reconnection site to be on the dayside magnetopause, consistent with the pulsating cusp model, and the best estimate of the X-line location is 13 R(E) from the satellite. The ion precipitation is used to reconstruct the field-parallel part of the Cowley-D ion distribution function injected into the open low latitude boundary layer (LLBL) in the vicinity of the X-line. From this the Alfven speed, plasma density, magnetic field, parallel ion temperature, and flow velocity of the magnetosheath near the X-line can be derived.

Lockwood, M.↗
DOE OSTI2023

Distributed approximate minimal Steiner trees with millions of seed vertices on billion-edge graphs

In this report, we present a parallel 2-approximation Steiner minimal tree algorithm and its MPI-based distributed implementation. In place of expensive distance computations between all pairs of seed vertices, the solution we employ exploits a cheaper Voronoi cell computation. Our design leverages asynchronous processing and message prioritization to accelerate convergence of distance computations, and harnesses vertex and edge centric processing to offer fast time-to-solution. We demonstrate scalability and performance using real-world graphs with up to 128 billion edges and 512 compute nodes, and show the ability to find Steiner trees with up to one million seed vertices. Using 12 data instances, we present comparison with the state-of-the-art exact solver, SCIP-Jack, and two sequential 2-approximate algorithms. We empirically show that, on average, the total distance of the Steiner tree identified by our solution is 1.1290 times greater than the Steiner minimal tree – well within the theoretical approximation bound of 2.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1983

Linearized potential solution for an airfoil in nonuniform parallel streams

A small perturbation potential flow theory is applied to the problem of determining the chordwise pressure distribution, lift and pitching moment of a thin airfoil in the middle of five parallel streams. This theory is then extended to the case of an undisturbed stream having a given smooth velocity profile. Two typical examples are considered and the results obtained are compared with available solutions of Euler's equations. The agreement between these two results is not quite satisfactory. Possible reasons for the differences are indicated.

Prabhu, R. K.↗
NASA NTRS1993

Parallel computing for probabilistic fatigue analysis

This paper presents the results of Phase I research to investigate the most effective parallel processing software strategies and hardware configurations for probabilistic structural analysis. We investigate the efficiency of both shared and distributed-memory architectures via a probabilistic fatigue life analysis problem. We also present a parallel programming approach, the virtual shared-memory paradigm, that is applicable across both types of hardware. Using this approach, problems can be solved on a variety of parallel configurations, including networks of single or multiprocessor workstations. We conclude that it is possible to effectively parallelize probabilistic fatigue analysis codes; however, special strategies will be needed to achieve large-scale parallelism to keep large number of processors busy and to treat problems with the large memory requirements encountered in practice. We also conclude that distributed-memory architecture is preferable to shared-memory for achieving large scale parallelism; however, in the future, the currently emerging hybrid-memory architectures will likely be optimal.

Sues, Robert H.↗
NASA NTRS1992

Petri net controllers for distributed robotic systems

Petri nets are a well established modelling technique for analyzing parallel systems. When coupled with an event-driven operating system, Petri nets can provide an effective means for integrating and controlling the functions of distributed robotic applications. Recent work has shown that Petri net graphs can also serve as remarkably intuitive operator interfaces. In this paper, the advantages of using Petri nets as high-level controllers to coordinate robotic functions are outlined, the considerations for designing Petri net controllers are discussed, and simple Petri net structures for implementing an interface for operator supervision are presented. A detailed example is presented which illustrates these concepts for a sensor-based assembly application.

Lefebvre, D. R.↗