Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Massive Computation”

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 343 records · Page 19

What Questions Would a Systems Engineer Ask to Assess Systems Engineering Models as Credible

Digital Systems Engineering strategies typically call for digital Systems Engineering models to be retained in repositories and certified as an authoritative source of truth (enabling model reuse, qualification, and collaboration). In order for digital Systems Engineering models to be certified as authoritative (credible), they need to be assessed - verified and validated - and with the amount of uncertainty in the model quantified (consider reusing someone else's model without knowing the author). Due to this increasing model complexity, the authors assert that traditional human-based methods for validating, verifying, and uncertainty quantification - such as human-based peer-review sessions - cannot sufficiently establish that a digital Systems Engineering model of a complex system is credible. Digital Systems Engineering models of complex systems can contain millions of nodes and edges. The authors assert that this level of detail is beyond the ability of any group of humans - even working for weeks at a time - to discern and catch every minor model infraction. In contrast, computers are highly effective at discerning infractions with massive amounts of information. The authors suggest that a better approach might be to focus the humans at what model patterns should be assessed and enable the computer to assess the massive details in accordance with those patterns - by running through perhaps 100,000 test loops. In anticipation of future projects to implement and automate the assessment of models at Sandia National Laboratories, a study was initiated to elicit input from a group of 25 Systems Engineering experts. The authors positioning query began with - 'What questions would a Systems Engineer ask to assess Systems Engineering models for credibility?" This report documents the results of that survey.

42 ENGINEERING↗

Graphics Processing Unit Assisted Thermographic Compositing

Objective Develop a software application utilizing high performance computing techniques, including general purpose graphics processing units (GPGPUs), for the analysis and visualization of large thermographic data sets. Over the past several years, an increasing effort among scientists and engineers to utilize graphics processing units (GPUs) in a more general purpose fashion is allowing for previously unobtainable levels of computation by individual workstations. As data sets grow, the methods to work them grow at an equal, and often greater, pace. Certain common computations can take advantage of the massively parallel and optimized hardware constructs of the GPU which yield significant increases in performance. These common computations have high degrees of data parallelism, that is, they are the same computation applied to a large set of data where the result does not depend on other data elements. Image processing is one area were GPUs are being used to greatly increase the performance of certain analysis and visualization techniques.

Ragasa, Scott↗

Massless and massive photons within basis light-front quantization

We compute the structure function, transverse momentum dependent parton distributions (TMDs), and generalized parton distributions (GPDs) for the photon from the light-front quantum electrodynamics (QED) Hamiltonian, determined for its constituent bare photon and electron-positron Fock components within the basis light-front quantization framework. While the structure function and GPDs align well with expectations, some oscillatory behavior in the TMDs emerges as a finite-basis artifact. We also compute the GPD and the corresponding structure function for the longitudinal polarization mode of the massive photon. We further study the photon mass dependence of the calculated observables. After performing nonperturbative renormalization, we obtain a good quality description of the perturbative QED properties of the photon, as well as good agreement with the experimental data for the massless photon’s structure function.

Ab initio calculations↗

Graphics Processing Unit Assisted Thermographic Compositing

Objective: To develop a software application utilizing general purpose graphics processing units (GPUs) for the analysis of large sets of thermographic data. Background: Over the past few years, an increasing effort among scientists and engineers to utilize the GPU in a more general purpose fashion is allowing for supercomputer level results at individual workstations. As data sets grow, the methods to work them grow at an equal, and often greater, pace. Certain common computations can take advantage of the massively parallel and optimized hardware constructs of the GPU to allow for throughput that was previously reserved for compute clusters. These common computations have high degrees of data parallelism, that is, they are the same computation applied to a large set of data where the result does not depend on other data elements. Signal (image) processing is one area were GPUs are being used to greatly increase the performance of certain algorithms and analysis techniques.

Ragasa, Scott↗

The advanced evolution of massive stars

The nuclear rates for reactions involving 12 C and 16 O are key to computing the energy release and nucleosynthesis evolution of massive stars during their advanced burning phases. Ultimately, these burning rates shape the stellar structure and evolution and influence the nature of the compact objects produced at the end of the stellar life. We explore the implications of new nuclear reaction rates from both experimental and theoretical studies for 12 C(α, γ) 16 ​O, 12 C+ 12​ C, 12 C+ 16 ​O, and 16 O+ 16 ​O reactions for massive stars. Our goal is to investigate how the chemical structure and nucleosynthesis evolve from the He-exhaustion stage to the O-burning phase and how these processes influence the ultimate stellar fate. We computed rotating and non-rotating models for stars of different masses at solar metallicity. We used the stellar evolution code GENEC, which includes a large network of nuclear reactions and isotopes involved in advanced phases, as well as updated rates for 12 C(α,γ) 16 O. For the three fusion reactions involving 12 C and 16 O, we considered new rates following a data-driven fusion suppression scenario (hereafter HIN(RES)) and new theoretical rates obtained with time-dependent Hartree-Fock (TDHF) calculations. The updated 12 C(α, γ) 16 ​O rates mainly impact the chemical structure evolution changing the 12 C/ 16 O ratio at He-exhaustion and have little effect on the CO core mass. This variation in the 12 C/ 16 O ratio is in some cases critical for predicting the final fate of the model, which is very sensitive to 12 C abundance, and in particular the 20 M ⊙ remnant may change from a black hole to a neutron star. The He-burning (C-burning) lifetime is also decreased (increased) by about −2% (+15%). The combined new rates for 12 C+ 12 ​C and 16 O+ 16 ​O fusion reactions according to the HIN(RES) model lead to shorter C- and O-burning lifetimes by ≈ − 10%, and −50%, respectively, and shift the ignition conditions to higher temperatures and densities. In contrast, the theoretical TDHF rates primarily affect C-burning, increasing its duration by about 30% and lowering the ignition temperature. These changes modify the chemical structure of the core, the size and duration of C-burning shells, and hence their compactness. They also impact the central and shell nucleosynthesis (by ±1 dex and by factors of ±2–10, respectively), while 12 C+ 16 ​O reaction rates variations remain the least important.

abundances↗

TChem v2.0 - A Software Toolkit for the Analysis of Complex Kinetic Models

TChem is an open source software library for solving complex computational chemistry problems and analyzing detailed chemical kinetic models. The software provides support for: complex kinetic models for gas-phase and surface chemistry; thermodynamic properties based on NASA polynomials; species production/consumption rates; stable time integrator for solving stiff time ordinary differential equations; and, reactor models such as homogenous gas-phase ignition (with analytical Jacobian matrices), continuously stirred tank reactor, plug-flow reactor. This toolkit builds upon earlier versions that were written in C and featured tools for gas-phase chemistry only. The current version of the software was completely refactored in C++, uses an object-oriented programming model, and adopts Kokkos as its portability layer to make it ready for the next generation computing architectures i.e., multi/many core computing platforms with GPU accelerators. We have expanded the range of kinetic models to include surface chemistry and have added examples pertaining to Continuously Stirred Tank Reactors (CSTR) and Plug Flow Reactor (PFR) models to complement the homogenous ignition examples present in the earlier versions. To exploit the massive parallelism available from modern computing platforms, the current software interface is designed to evaluate samples in parallel, which enables large scale parametric studies, e.g. for sensitivity analysis and model calibration.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Modeling Broadband X-Ray Absorption of Massive Star Winds

We present a method for computing the net transition of X-rays emitted by shock-heated plasma distributed throughout a partially optically thick stellar wind from a massive star. We find the transmission by an exact integration of the formal solution, assuming the emitting plasma and absorbing plasma are mixed at a constant mass ratio above some minimum radius, below which there is assumed to be no emission. This model is more realistic than either the slab absorption associated with a corona at the base of the wind or the exospheric approximation that assumes all observed X-rays are emitted without attenuation from above the radius of optical depth unity. Our model is implemented in XSPEC as a pre-calculated table that can be coupled to a user-defined table of the wavelength dependent wind opacity. We provide a default wind opacity model that is more representative of real wind opacities than the commonly used neutral ISM tabulation. Preliminary modeling of Chandra grating data indicates that the X-ray hardness trend of OB stars with spectral subtype cars largely be understood as a wind absorption effect.

Leutenegger, Maurice A.↗

Towards real-time simulation of large space structures: Stabilization of fluid/thermal/structure interactions and implementation on high performance supercomputers

Within the Center for Space Construction, the SIMSTRUC project's objectives center around the development of simulation tools for the realistic analysis of large space structures. The word 'tools' is the broad sense; it designates mathematical models, finite element/finite difference formulations, computational algorithms, implementations on advanced computer architectures, and visualization capabilities. The results of our activities during the first year within the SIMSTRUC project are reported. On the modeling side, an alternative approach to fluid/thermal/structure interaction analysis that is a departure from the 'loosely coupled' and 'unified' approaches that are being currently practiced are described. The advantages of our approach both in terms of accuracy and computational efficiency were demonstrated. On the computational side, a software architecture for parallel/vector and massively parallel supercomputers that speeds up finite element and finite difference computations by several orders of magnitude is presented. As an example, the simulation of the deployment of a space structure that used to require over six hours of a workstation using a conventional finite element software, now runs on a multiprocessor using a parallel computation strategy in less than three seconds. In order to promote the physical understanding of the simulation behavior, a real-time visualization capability on the Connection Machine, which allows the analyst to watch the graphical animation of the results at the same time these are generated, was also developed. It is believed that by combining efficient analytical formulations with the state-of-the-art high performance computer implementations and superfast visualization capabilities, SIMSTRUC is moving fast towards the real-time simulation of large space structures. The designers as well as the researchers will certainly benefit from this technology.

Farhat, C.↗

Implementing Scientific Simulation Codes Highly Tailored for Vector Architectures Using Custom Configurable Computing Machines

The motivation for this work comes from an observation that amidst the push for Massively Parallel (MP) solutions to high-end computing problems such as numerical physical simulations, large amounts of legacy code exist that are highly optimized for vector supercomputers. Because re-hosting legacy code often requires a complete re-write of the original code, which can be a very long and expensive effort, this work examines the potential to exploit reconfigurable computing machines in place of a vector supercomputer to implement an essentially unmodified legacy source code. Custom and reconfigurable computing resources could be used to emulate an original application's target platform to the extent required to achieve high performance. To arrive at an architecture that delivers the desired performance subject to limited resources involves solving a multi-variable optimization problem with constraints. Prior research in the area of reconfigurable computing has demonstrated that designing an optimum hardware implementation of a given application under hardware resource constraints is an NP-complete problem. The premise of the approach is that the general issue of applying reconfigurable computing resources to the implementation of an application, maximizing the performance of the computation subject to physical resource constraints, can be made a tractable problem by assuming a computational paradigm, such as vector processing. This research contributes a formulation of the problem and a methodology to design a reconfigurable vector processing implementation of a given application that satisfies a performance metric. A generic, parametric, architectural framework for vector processing implemented in reconfigurable logic is developed as a target for a scheduling/mapping algorithm that maps an input computation to a given instance of the architecture. This algorithm is integrated with an optimization framework to arrive at a specification of the architecture parameters that attempts to minimize execution time, while staying within resource constraints. The flexibility of using a custom reconfigurable implementation is exploited in a unique manner to leverage the lessons learned in vector supercomputer development. The vector processing framework is tailored to the application, with variable parameters that are fixed in traditional vector processing. Benchmark data that demonstrates the functionality and utility of the approach is presented. The benchmark data includes an identified bottleneck in a real case study example vector code, the NASA Langley Terminal Area Simulation System (TASS) application.

Rutishauser, David↗

Efficient Anomaly Detection Driven By Different Machine Learning Architectures And Models

The rapid growth and ubiquitous adoption of the internet and cyber-physical systems (CPS) have fundamentally transformed modern communication, work, and human-system interactions. While networks now form the backbone of critical digital ecosystems, enabling seamless data transmission across diverse, interconnected systems, this increased connectivity also expands the attack surface, making real-time detection of network intrusions and anomalies a pressing challenge. Detecting unusual activities within network infrastructure requires advanced data traffic analysis to differentiate between legitimate and malicious interactions. Traditional approaches to network anomaly detectionâ??such as rule-based and signature-based systemsâ??often depend on predefined patterns to identify known anomalies, limiting their effectiveness against emerging, stealthy, or previously unseen threats. These conventional methods suffer from high false alarm rates and fail to adapt to the ever-evolving nature of network traffic, particularly in large-scale, decentralized environments where data volume, velocity, and variety are constantly increasing. This dissertation presents artificial intelligence (AI)-driven approaches to anomaly detection that leverage graphics processing unit (GPU)-enabled high-performance computing (HPC) platforms for processing massive network traffic data and monitoring the components of cyber-physical systems (CPS) for potentially hazardous conditions. The research advances several key contributions: (1) Designing efficient machine learning techniques for CPS condition monitoring and anomaly detection; (2) enabling federated learning (FL) frameworks that enable distributed detection while preserving data privacy and system resilience; (3) exploring graph-based methodologies combining graph neural networks (GNN) and graph machine learning (ML) approaches for the Internet of Things (IoT) and automotive network security, and (4) performing distributed edge computing optimizations that integrate FL with scalable technologies for reduced communication overhead. Through extensive experiments, these methodologies demonstrate that complex anomaly detection and condition monitoring tasks can be achieved while balancing computational efficiency and detection accuracy through fine-grained network information processing. The frameworks developed in this research establish a robust foundation for network anomaly detection, providing scalable, adaptive, and privacy-preserving solutions for safeguarding CPS and IoT networks in an increasingly interconnected digital landscape. The practical implications of these research findings are significant, as they can inform the development of next-generation network security systems and contribute to the protection of critical infrastructure against sophisticated cyber attacks.

Marfo, William↗

Synchronization and fault-masking in redundant real-time systems

A real time computer may fail because of massive component failures or not responding quickly enough to satisfy real time requirements. An increase in redundancy - a conventional means of improving reliability - can improve the former but can - in some cases - degrade the latter considerably due to the overhead associated with redundancy management, namely the time delay resulting from synchronization and voting/interactive consistency techniques. The implications of synchronization and voting/interactive consistency algorithms in N-modular clusters on reliability are considered. All these studies were carried out in the context of real time applications. As a demonstrative example, we have analyzed results from experiments conducted at the NASA Airlab on the Software Implemented Fault Tolerance (SIFT) computer. This analysis has indeed indicated that in most real time applications, it is better to employ hardware synchronization instead of software synchronization and not allow reconfiguration.

Krishna, C. M.↗

Aerodynamic simulation on massively parallel systems

This paper briefly addresses the computational requirements for the analysis of complete configurations of aircraft and spacecraft currently under design to be used for advanced transportation in commercial applications as well as in space flight. The discussion clearly shows that massively parallel systems are the only alternative which is both cost effective and on the other hand can provide the necessary TeraFlops, needed to satisfy the narrow design margins of modern vehicles. It is assumed that the solution of the governing physical equations, i.e., the Navier-Stokes equations which may be complemented by chemistry and turbulence models, is done on multiblock grids. This technique is situated between the fully structured approach of classical boundary fitted grids and the fully unstructured tetrahedra grids. A fully structured grid best represents the flow physics, while the unstructured grid gives best geometrical flexibility. The multiblock grid employed is structured within a block, but completely unstructured on the block level. While a completely unstructured grid is not straightforward to parallelize, the above mentioned multiblock grid is inherently parallel, in particular for multiple instruction multiple datastream (MIMD) machines. In this paper guidelines are provided for setting up or modifying an existing sequential code so that a direct parallelization on a massively parallel system is possible. Results are presented for three parallel systems, namely the Intel hypercube, the Ncube hypercube, and the FPS 500 system. Some preliminary results for an 8K CM2 machine will also be mentioned. The code run is the two dimensional grid generation module of Grid, which is a general two dimensional and three dimensional grid generation code for complex geometries. A system of nonlinear Poisson equations is solved. This code is also a good testcase for complex fluid dynamics codes, since the same datastructures are used. All systems provided good speedups, but message passing MIMD systems seem to be best suited for large miltiblock applications.

Haeuser, Jochem↗

Parallel Methods on Large-Scale Structural Analysis and Physics Applications; Symposium, Hampton, VA, Feb. 5, 6, 1991, Selected Papers

Recent advances in parallel methods and algorithms integrated into large-scale codes are presented. Consideration is given to problem decomposition (substructuring), efficient matrix solution algorithms for shared memory architectures, dynamic and transient analysis algorithms for shared memory architectures, and algorithms for distributed and massively parallel architectures. Particular attention is given to partitioning of unstructured problems for parallel processing, parallel-vector computation for linear-structural analysis and nonlinear unconstraint optimization problems, a parallel-vector equation solver for unsymmetric matrices on supercomputers, parallel nonlinear finite element dynamic response, multigrid algorithms for solving structural mechanics problems on supercomputers, structural analysis on massively parallel computers, explicit finite element methods with contact-impact on SIMD computers, and the impact of mapping and sparsity on parallelized finite element method modules.

Storaasli, Olaf O.↗

Galactic evolution. II - Disk galaxies with massive halos

Models of galactic evolution are computed in which matter shed by dying halo stars accumulates in a smaller, more rapidly rotating disk. The models are simpler and more successful than one-zone (pure disk) models in that (1) the observed absence of low-metal-abundance low-mass dwarfs is expected, not anomalous and (2) the relative birthrate function (or IMF) need not be a strongly variable function of time in agreement with recent interpretations of observed stellar populations and neutral hydrogen in our own and other galaxies. Even a simple 'Salpeter' IMF for both disk and halo will produce an acceptable model. The model with a halo 'Salpeter' IMF, roughly one-quarter of the mass in the secondary disk, and approximately half the metals produced in the halo seems most compatible with observations of the metal abundance in low-mass stars, the deuterium abundance, halo planetary nebulae, and light from Population II stars, as well as with arguments on the stability of the disk.

Ostriker, J. P.↗

A PIC Bootstrapping Strategy for Exascale CFD-DEM Simulation

The exascale computing era comes with the release of MFIX-Exa, a new code for studying gas-particle fluidization using CFD-DEM and PIC models on massively parallel, heterogeneous high-performance computing architectures. However, as compute resources continue to grow in scale and complexity, so too does the impetus to use them efficiently. Here, we propose a novel bootstrapping method to minimize neglected simulation time and cast the approach more broadly among a growing field of multi-fidelity methods.

Porcu, Roberto↗

Numerical simulation of transonic flows in diffusers

Numerical simulations were made of two-dimensional transonic flows in diffusers, including flow separation induced by a shock or adverse pressure gradient. The mass-averaged, time-dependent, compressible Navier-Stokes equations, simplified by the thin-layer approximation, were solved using MacCormack's hybrid method. The eddy-viscosity formulation was described by the Wilcox-Rubesin's two-equation, k-omega model. Detailed comparison of the computed results with measurements showed good agreement in all cases, including one with massive separation induced by a strong shock. The computation correctly predicted the details of a distinct lambda shock pattern, closely duplicating the configuration observed experimentally in spark-schlieren photographs.

Liou, M.-S.↗

Precision study of the massive Schwinger model near quantum criticality

We perform a numerical analysis of the massive Schwinger model in the presence of a background electric field. Using the Density Matrix Renormalization Group approach, we efficiently compute the spectrum of the Schwinger model on a staggered lattice with up to 3000 qubits. As a result, we achieve a precise computation of the critical mass of the massive Schwinger model to five digits using four different “criticality criteria,” observing perfect agreement among them Additionally, we discuss the effect of a four-fermion operator deformation of the Schwinger model and compute the critical mass for various values of the deformation parameter.

Critical phenomena↗

Scalar-graviton amplitudes and celestial holography

We compute scattering amplitudes involving one massive scalar and two, three, or four gravitons. We show that when the conformal dimension of the massive scalar is set to zero, the resulting celestial correlators depend only on the coordinates of the gravitons. Such correlators of gravitons are well-defined and do not suffer from divergences associated with the Mellin transform of usual graviton amplitudes. Moreover, they are non-distributional and take the form of standard CFT correlators. We show that they are consistent with the usual OPEs but the statement of the soft theorem is modified.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗