Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “COMPUTER GRAPHICS”

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 829 records · Page 46

Methods for multitasking among real-time embedded compute tasks running on the GPU: Methods for Multitasking Real-time Embedded GPU Computing Tasks

Here, we provide an extensive survey on wide spectrum of scheduling methods for multitasking among graphics processing unit (GPU) computing tasks. We then design several schedulers and explain in detail the selected methods we have developed to implement our scheduling strategies. Next, we compare the performance of schedulers on various workloads running on Fermi and Kepler architectures and arrive at the following major conclusions: (1) Small kernels benefit from running kernels concurrently. (2) The combination of small kernels, high-priority kernels with longer runtimes, and lower-priority kernels with shorter runtimes benefits from a CPU scheduler that dynamically changes kernel order on the Fermi architecture. (3) Because of limitations of existing GPU architectures, currently CPU schedulers outperform their GPU counterparts. We also provide results and observations obtained from implementing and evaluating our schedulers on the NVIDIA Jetson TX1 system-on-chip architecture. We observe that although TX1 has the newer Maxwell architecture, the mechanism used for scheduler timings behaves differently on TX1 compared to Kepler leading to incorrect timings. In this paper, we describe our methods that allow us to report correct timings for CPU schedulers running on TX1. Lastly, we propose new research directions involving the investigation of additional scheduling strategies.

97 MATHEMATICS AND COMPUTING↗

A Study of Complex Deep Learning Networks on High-Performance, Neuromorphic, and Quantum Computers

Current deep learning approaches have been very successful using convolutional neural networks trained on large graphical-processing-unit-based computers. Three limitations of this approach are that (1) they are based on a simple layered network topology, i.e., highly connected layers, without intra-layer connections; (2) the networks are manually configured to achieve optimal results, and (3) the implementation of the network model is expensive in both cost and power. In this paper, we evaluate deep learning models using three different computing architectures to address these problems: quantum computing to train complex topologies, high performance computing to automatically determine network topology, and neuromorphic computing for a low-power hardware implementation. We use the MNIST dataset for our experiment, due to input size limitations of current quantum computers. Our results show the feasibility of using the three architectures in tandem to address the above deep learning limitations. Finally, we show that a quantum computer can find high quality values of intra-layer connection weights in a tractable time as the complexity of the network increases, a high performance computer can find optimal layer-based topologies, and a neuromorphic computer can represent the complex topology and weights derived from the other architectures in low power memristive hardware.

97 MATHEMATICS AND COMPUTING↗

A Monte Carlo volumetric-ray-casting estimator for global fluence tallies on GPUs

A Monte Carlo fluence estimator has been designed to take advantage of the computational power of graphical processing units (GPUs). This new estimator, termed the volumetric-ray-casting estimator, is an extension of the expectation estimator. It can be used as a replacement of the track-length estimator for the estimation of global fluence. Calculations for this estimator are performed on the GPU while the Monte Carlo random walk is performed on the central processing unit (CPU). This method lowers the implementation cost for GPU acceleration of existing Monte Carlo particle transport codes as there is little modification of the particle history logic flow. Three test problems have been evaluated to assess the performance of the volumetric-ray-casting estimator for neutron transport on GPU hardware in comparison to the standard track-length estimator on CPU hardware. Evaluation of neutron transport through air in a criticality accident scenario showed that the volumetric-ray-casting estimator achieved 23 times the performance of the track-length estimator using a single core CPU paired with a GPU and 15 times the performance of the track-length estimator using an eight core CPU paired with a GPU. Finally, simulation of a pressurized water reactor fuel assembly showed that the performance improvement was 6 times within the fuel and 7 times within the control rods using an eight core CPU paired with a single GPU.

74 ATOMIC AND MOLECULAR PHYSICS↗

Nonlinear electronic excitations in crystalline solids using meta-generalized gradient approximation and hybrid functional in time-dependent density functional theory

We develop methods to calculate electron dynamics in crystalline solids in real-time time-dependent density functional theory employing exchange-correlation potentials which reproduce band gap energies of dielectrics; a meta-generalized gradient approximation was proposed by Tran and Blaha [Phys. Rev. Lett. 102, 226401 (2009)] (TBm-BJ) and a hybrid functional was proposed by Heyd, Scuseria, and Ernzerhof [J. Chem. Phys. 118, 8207 (2003)] (HSE). In time evolution calculations employing the TB-mBJ potential, we have found it necessary to adopt the predictor-corrector step for a stable time evolution. We have developed a method to evaluate electronic excitation energy without referring to the energy functional which is unknown for the TB-mBJ potential. For the HSE functional, we have developed a method for the operation of the Fock-like term in Fourier space to facilitate efficient use of massive parallel computers equipped with graphic processing units. We compare electronic excitations in silicon and germanium induced by femtosecond laser pulses using the TB-mBJ, HSE, and a simple local density approximation (LDA). At low laser intensities, electronic excitations are found to be sensitive to the band gap energy: they are close to each other using TB-mBJ and HSE and are much smaller in LDA. At high laser intensities close to the damage threshold, electronic excitation energies do not differ much among the three cases.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Geometric GNNs for charged particle tracking at GlueX

Nuclear physics experiments are aimed at uncovering the fundamental building blocks of matter. The experiments involve high-energy collisions that produce complex events with many particle trajectories. Tracking charged particles resulting from collisions in the presence of a strong magnetic field is critical to enable the reconstruction of particle trajectories and precise determination of interactions. It is traditionally achieved through combinatorial approaches that scale worse than linearly as the number of hits grows. Since particle hit data naturally form a point cloud and can be structured as graphs, graph neural networks (GNNs) emerge as an intuitive and effective choice for this task. In this study, we evaluate the GNN model for track finding on the data from the GlueX experiment at Jefferson Lab. We use simulation data to train the model and test on both simulation and real GlueX measurements. We demonstrate that GNN-based track finding outperforms the currently used traditional method at GlueX in terms of segment-based efficiency at a fixed purity while providing faster inferences. We show that the GNN model can achieve significant speedup by processing multiple events in batches, which exploits the parallel computation capability of graphical processing units (GPUs). Finally, we compare the GNN implementation on GPU and field-programmable gate array and describe the trade-off.

batched GNN pipeline↗

Likelihood-based interactive local docking into cryo-EM maps in ChimeraX

The interpretation of cryo-EM maps often includes the docking of known or predicted structures of the components, which is particularly useful when the map resolution is worse than 4 Å. Although it can be effective to search the entire map to find the best placement of a component, the process can be slow when the maps are large. However, frequently there is a well-founded hypothesis about where particular components are located. In such cases, a local search using a map subvolume will be much faster because the search volume is smaller, and more sensitive because optimizing the search volume for the rotation-search step enhances the signal to noise. A Fourier-space likelihood-based local search approach, based on the previously published em_placement software, has been implemented in the new emplace_local program. Tests confirm that the local search approach enhances the speed and sensitivity of the computations. An interactive graphical interface in the ChimeraX molecular-graphics program provides a convenient way to set up and evaluate docking calculations, particularly in defining the part of the map into which the components should be placed.

59 BASIC BIOLOGICAL SCIENCES↗

Model of a Thin Current Sheet in the Earth’s Magnetotail with a Kinetic Description of Magnetized Electrons

Steady-state two-dimensional thin current sheets (TCSs) in collisionless space plasma, similar to the current sheet of the near-Earth magnetotail, are considered. The magnetic field of the sheet is orthogonal to the current and has a nonzero normal component, the electrons are magnetized, and the ions are unmagnetized. To solve the problem of kinetic description of electrons in such current sheets in a general form, they are described by the Vlasov equation in the drift approximation, the general solution to which is found in the form of a function of three independent integrals of the system of drift motion equations. An important case is considered in which the electron guiding centers obey a Maxwell–Boltzmann distribution in a stationary electromagnetic field. The obtained results make it possible to create one- and two-dimensional numerical− analytical models of current sheets in which unmagnetized ions are described by the Vlasov equation, which should be solved numerically, whereas the contribution of magnetized electrons is taken into account analytically. To numerically solve the time-independent Vlasov equation, a new method is proposed that allows one to perform the bulk of computations by using graphic processors. On the basis of the new theory, a one-dimensional numerical−analytical model of a steady-state TCS in the near-Earth magnetotail is presented, TCS configurations are calculated, and the role of electrostatic effects and electron pressure anisotropy is analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Charge order–superfluidity transition in a two-dimensional system of hard-core bosons and emerging domain structures

We have used high-performance parallel computations by NVIDIA graphics cards applying the method of nonlinear conjugate gradients and Monte Carlo method to observe directly the developing ground state configuration of a two-dimensional hard-core boson system with decrease in temperature, and its evolution with deviation from a half-filling. This has allowed us to explore unconventional features of a charge order—superfluidity phase transition, specifically, formation of an irregular domain structure, emergence of a filamentary superfluid structure that condenses within of the charge-ordered phase domain antiphase boundaries, and formation and evolution of various topological structures.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Inference-Engine v0.1.0

Given a pre-trained neural network, Inference-Engine performs maps network inputs to outputs by executing the forward pass through the provided network. Although the predominant programming language for machine-learning is Python, most high-performance computing (HPC) applications are written in Fortran, C, or C++. Inference-Engine aims to support HPC programs and is written in Fortran, a language with a large feature set supporting interoperability with C. This software exposes concurrency in a portable way by using standard language features that some modern Fortran compilers can exploit with various optimizations, including offloading computation to a Graphics Processing Unit (GPU). In particular, this software makes extensive use of Fortran's "do concurrent" parallel loop construct, implicitly parallel array statements, and pure procedures that can be invoked inside "do concurrent" blocks. Inference-Engine also supports dynamic choice of inference methods at runtime. Two current options include one method that uses Fortran's "dot_product" intrinsic function inside "do concurrent" blocks and another method that instead uses Fortran' "matmul" array intrinsic function. We plan to investigate automatic compiler offloading of "do concurrent" calculations to GPUs and compile-time substitution of optimized libraries such as the Basic Linear Algebra Library (BLAS) for "matmul" invocations. We also envision the potential for the choice of which method to use could happen at program launch based on in situ performance measurements on any given platform.

Rouson, Damian↗

SPADES (Scalable Parallel Discrete Events Simulation) [SWR-24-99]

SPADES (Solver for PArallel Discrete Event Simulation) is an open-source parallel discrete event simulation (PDES) package built on the AMReX library. Targeted at solving discrete event systems in parallel, this software package aims to be performance portable and scalable on heterogeneous computing architectures, e.g., graphic processing units (GPU). SPADES implements optimistic synchronization with rollback through an implementation of the Time Warp algorithm. An alternative conservative synchronization approach is also implemented using the Lower Bound on Incoming Time Stamp. In our implementation, logical processes are represented as cells in a grid and event messages are represented as particles. SPADES supports various parallel decomposition strategies, including the use of the Message Passing Interface (MPI) and OpenMP threading. All major GPU architectures (e.g., Intel, AMD, NVIDIA) are supported through the use of performance portability functionalities implemented in AMReX. The SPADES software is released in NREL Software Record SWR-24-99 “SPADES (Scalable Parallel Discrete Events Simulation)”.

Henry de Frahan, Marc [National Renewable Energy L↗

LAROMance Grade 91 Model Integration in NEML2

New reactor designs are targeting higher operating temperatures for increased thermal efficiency when compared to the current fleet of light water reactors. Designing structural components for these high temperature environments with reliable long-term operations requires material models that can accurately capture the deformation mechanisms active in these environments. The LAROMance surrogate material models are based on a database of mechanistic crystal plasticity simulations for high-temperature conditions. Inputs to the LAROMance models reflect the microstructural pedigree of the material, like dislocation densities and precipitate contents. Based on the evolution of these microstructural features, the LAROMance model provides the engineering scale constitutive model response. The LAROMance model was recently parameterized for Grade 91, a high temperature alloy. In the present work, the Grade 91 LAROMance model is implemented in the New Material Model Library, version 2 (NEML2). NEML2 provides a modular way to build material models from smaller blocks and was developed to vectorize the material update to efficiently run on modern computational architectures with graphics processing unit accelerators. NEML2 constitutive models can be used in simulations based on the multiphysics object-oriented simulation environment (MOOSE). This report provides details on the implementation of the Grade 91 LAROMance model in NEML2 and its verification of engineering scale finite element simulations in MOOSE.

42 - ENGINEERING↗

Computer-aided design of large-scale integrated circuits - A concept

Circuit design and mask development sequence are improved by using general purpose computer with interactive graphics capability establishing efficient two way communications link between design engineer and system. Interactive graphics capability places design engineer in direct control of circuit development.

Schansman, T. T.↗

Robot computer problem solving system

A robot computer problem solving system which represents a robot exploration vehicle in a simulated Mars environment is described. The model exhibits changes and improvements made on a previously designed robot in a city environment. The Martian environment is modeled in Cartesian coordinates; objects are scattered about a plane; arbitrary restrictions on the robot's vision have been removed; and the robot's path contains arbitrary curves. New environmental features, particularly the visual occlusion of objects by other objects, were added to the model. Two different algorithms were developed for computing occlusion. Movement and vision capabilities of the robot were established in the Mars environment, using LISP/FORTRAN interface for computational efficiency. The graphical display program was redesigned to reflect the change to the Mars-like environment.

Merriam, E. W.↗

DAM - detection and mapping

Integrated set of manual procedures, computer programs, and graphic devices processes multispectral scanner data from orbiting Landsat into precisely registered and formatted maps of surface water and other resources at variety of scales, sheet formats, and tick intervals.

Source record↗

Interpolation and extrapolation of creep rupture data by the minimum commitment method. I - Focal-point convergence

The minimum commitment method has been applied to the analysis of creep-rupture data. The method is based on a parameter representing the focal point of convergence of all isothermals when extended to the long or short times necessary for such convergence to occur. The technique may be applied by manual-graphic analysis on computer code. It is illustrated for the nickel-base alloy Astroloy.

Manson, S. S.↗