Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithm timings”

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 1,621 records · Page 90

Plasma boundary shape control and real-time equilibrium reconstruction on NSTX-U

Here, the upgrade to the National Spherical Torus eXperiment (NSTX-U) included two main improvements: a larger center-stack, enabling higher toroidal field and longer pulse duration, and the addition of three new tangentially aimed neutral beam sources, which increase available heating and current drive, and allow for flexibility in shaping power, torque, current, and particle deposition profiles. To best use these new capabilities and meet the high-performance operational goals of NSTX-U, major upgrades to the NSTX-U control system (NCS) hardware and software have been made. Several control algorithms, including those used for real-time equilibrium reconstruction and shape control, have been upgraded to improve and extend plasma control capabilities. As part of the commissioning phase of first plasma operations, the shape control system was tuned to control the boundary in both inner-wall limited and diverted discharges. It has been used to accurately track the requested evolution of the boundary (including the size of the inner gap between the plasma and central solenoid, which is a challenge for the ST configuration), X-point locations, and strike point locations, enabling repeatable discharge evolutions for scenario development and diagnostic commissioning.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A Metascalable Computing Framework for Large Spatiotemporal-Scale Atomistic Simulations

A metascalable (or 'design once, scale on new architectures') parallel computing framework has been developed for large spatiotemporal-scale atomistic simulations of materials based on spatiotemporal data locality principles, which is expected to scale on emerging multipetaflops architectures. The framework consists of: (1) an embedded divide-and-conquer (EDC) algorithmic framework based on spatial locality to design linear-scaling algorithms for high complexity problems; (2) a space-time-ensemble parallel (STEP) approach based on temporal locality to predict long-time dynamics, while introducing multiple parallelization axes; and (3) a tunable hierarchical cellular decomposition (HCD) parallelization framework to map these O(N) algorithms onto a multicore cluster based on hybrid implementation combining message passing and critical section-free multithreading. The EDC-STEP-HCD framework exposes maximal concurrency and data locality, thereby achieving: (1) inter-node parallel efficiency well over 0.95 for 218 billion-atom molecular-dynamics and 1.68 trillion electronic-degrees-of-freedom quantum-mechanical simulations on 212,992 IBM BlueGene/L processors (superscalability); (2) high intra-node, multithreading parallel efficiency (nanoscalability); and (3) nearly perfect time/ensemble parallel efficiency (eon-scalability). The spatiotemporal scale covered by MD simulation on a sustained petaflops computer per day (i.e. petaflops {center_dot} day of computing) is estimated as NT = 2.14 (e.g. N = 2.14 million atoms for T = 1 microseconds).

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Level-1 Trigger of the GlueX experiment at Jefferson Lab

The GlueX is a new experiment at Jefferson Lab designed to search for mesons with exotic-quantum-numbers using high-intensity beam of polarized photons incident on a liquid hydrogen target. The goal of the Level-1 trigger of the GlueX experiment is to reduce the background rate induced by electromagnetic and hadronic interactions (to 200 kHz total rate) while keeping efficiency for accepting exotic mesons of interest close to unity. The trigger algorithm is based on measurement of the energy depositions in two electromagnetic calorimeters and hit counts in the tagger hodoscopes, the time-of-flight detector, and the Start Counter. The algorithm will be implemented on electronics boards developed at Jefferson Lab, which will perform online data processing at a 250 MHz clock. We will describe the Level-1 trigger algorithm and overview the trigger electronics.

Somov, Alexander↗

Monte Carlo simulations of time-of-flight PET with double-ended readout: calibration, coincidence resolving times and statistical lower bounds

Here, this paper demonstrates through Monte Carlo simulations that a practical positron emission tomograph with (1) deep scintillators for efficient detection, (2) double-ended readout for depth-of-interaction information, (3) fixed-level analog triggering, and (4) accurate calibration and timing data corrections can achieve a coincidence resolving time (CRT) that is not far above the statistical lower bound. One Monte Carlo algorithm simulates a calibration procedure that uses data from a positron point source. Annihilation events with an interaction near the entrance surface of one scintillator are selected, and data from the two photodetectors on the other scintillator provide depth-dependent timing corrections. Another Monte Carlo algorithm simulates normal operation using these corrections and determines the CRT. A third Monte Carlo algorithm determines the CRT statistical lower bound by generating a series of random interaction depths, and for each interaction a set of random photoelectron times for each of the two photodetectors. The most likely interaction times are determined by shifting the depth-dependent probability density function to maximize the joint likelihood for all the photoelectron times in each set. Example calculations are tabulated for different numbers of photoelectrons and photodetector time jitters for three 3 × 3 × 30 mm 3 scintillators: Lu 2 SiO 5 :Ce,Ca (LSO), LaBr 3 :Ce, and a hypothetical ultra-fast scintillator. To isolate the factors that depend on the scintillator length and the ability to estimate the DOI, CRT values are tabulated for perfect scintillator-photodetectors. For LSO with 4000 photoelectrons and single photoelectron time jitter of the photodetector J = 0.2 ns (FWHM), the CRT value using the statistically weighted average of corrected trigger times is 0.098 ns FWHM and the statistical lower bound is 0.091 ns FWHM. For LaBr 3 :Ce with 8000 photoelectrons and J = 0.2 ns FWHM, the CRT values are 0.070 and 0.063 ns FWHM, respectively. For the ultra-fast scintillator with 1 ns decay time, 4000 photoelectrons, and J = 0.2 ns FWHM, the CRT values are 0.021 and 0.017 ns FWHM, respectively. Lastly, the examples also show that calibration and correction for depth-dependent variations in pulse height and in annihilation and optical photon transit times are necessary to achieve these CRT values.

60 APPLIED LIFE SCIENCES↗

Multilevel Convergence Analysis of Multigrid-Reduction-in-Time

This study presents a multilevel convergence framework for multigrid-reduction-in-time (MGRIT) as a generalization of previous two-grid estimates. The framework provides a priori upper bounds on the convergence of MGRIT V- and F-cycles, with different relaxation schemes, by deriving the respective residual and error propagation operators. The residual and error operators are functions of the time-stepping operator, analyzed directly and bounded in the norm, both numerically and analytically. We present various upper bounds of different computational cost and varying sharpness. These upper bounds are complemented by proposing analytic formulae for the approximate convergence factor of V-cycle algorithms that take the number of fine grid time points, the temporal coarsening factors, and the eigenvalues of the time-stepping operator as parameters. The paper concludes with supporting numerical investigations of parabolic (anisotropic diffusion) and hyperbolic (wave equation) model problems. We assess the sharpness of the bounds and the quality of the approximate convergence factors. Observations from these numerical investigations demonstrate the value of the proposed multilevel convergence framework for estimating MGRIT convergence a priori and for the design of a convergent algorithm. We further highlight that observations in the literature are captured by the theory, including that two-level Parareal and multilevel MGRIT with F-relaxation do not yield scalable algorithms and the benefit of a stronger relaxation scheme. An important observation is that with increasing numbers of levels MGRIT convergence deteriorates for the hyperbolic model problem, while constant convergence factors can be achieved for the diffusion equation. The theory also indicates that L-stable Runge--Kutta schemes are more amendable to multilevel parallel-in-time integration with MGRIT than A-stable Runge--Kutta schemes.

97 MATHEMATICS AND COMPUTING↗

Predicting image blur in proton radiography: comparisons between measurements and Monte Carlo simulations

Given the cost and lead-times involved in high-energy proton radiography, it is prudent to model proposed radiographic experiments to see if the images predicted would return useful information. We recently modified our raytracing transmission radiography modeling code HADES to perform simplified Monte Carlo simulations of the transport of protons in a proton radiography beamline. Beamline objects include the initial diffuser, vacuum magnetic fields, windows, angle-selecting collimators, and objects described as distorted 2D (planar or cylindrical) meshes or as distorted 3D hexahedral meshes. We present an overview of the algorithms used for the modeling and code timings for simulations through typical 2D and 3D meshes. We next calculate expected changes in image blur as scattering materials are placed upstream and downstream of a resolution test object (a 3 mm thick sheet of tantalum, into which 0.4 mm wide slits have been cut), and as the current supplied to the focusing magnets is varied. We compare and contrast the resulting simulations with the results of measurements obtained at the 800 MeV Los Alamos LANSCE Line-C proton radiography facility.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Scalable Proximity-Based Methods for Large-Scale Analysis of Atom Probe Data

Powered by recent advances in data acquisition technologies, today's state-of-the-art atom probe microscopes yield data sets with sizes ranging from a few million atoms to billions of atoms. Analysis of these atomic data sets within rea-sonable turnaround times is a pressing data analysis challenge for material scientists currently equipped with software systems that do not scale to these massive data sets. Here, we present the shared memory component of a larger ongoing effort to develop a multi-feature data analysis framework capable of analyzing atom probe data of all sizes and scales from desktop multicore machines to large-scale high-performance computing platforms with hybrid (shared and distributed memory) architectures. Our focus here is on a broad class of popular atom probe data analysis methods that rely on core time-consuming k-NN queries. We present a scalable, heuristic algorithm for k-NN queries using three-dimensional range trees. To demonstrate its efficacy, the k-NN algorithm is integrated with two use cases of atom probe data analysis methods and the resulting analysis times are shown to speedup by over 20X on a 32-core Cray XC40 node using workloads up to 8 million atoms, which is already beyond the at-scale capabilities of existing atom probe software. Using this k-NN algorithm, we also introduce a novel parameter estimation method for a class of cluster finding methods, called friends-of-friends (FoF) methods, to completely bypass their expensive pre-processing steps. In each case, we validate the results on a variety of control data sets.

Lu, Hao↗

Genetic algorithm optimization of nuclear criticality experiment for reduction of intermediate-energy 239 Pu nuclear data uncertainties

Nuclear criticality experiments are conducted to investigate specific nuclear data important for safe handling and storage of fissile materials, reactor design and operation, and the validation of radiation transport codes. Incorrect or uncertain nuclear data can prohibitively impact operational safety limits, reactor licensing, and predictive simulation capability; therefore, integral measurements from criticality experiments are necessary and should be performed frequently. To maximize the impact of the integral measurements, it is important to consider experiment geometry, material selection, and component dimensions. When taking these considerations into account, the experiment design process becomes iterative and very time intensive. This work utilizes a genetic algorithm to efficiently explore potential nuclear criticality experiment designs for the Laboratory Directed Research & Development project PARADIGM (PARallel Approach of Differential and InteGral Measurements) at Los Alamos National Laboratory. In this paper, the building blocks of the genetic algorithm are discussed in detail, the genetic algorithm methodology is verified, and the genetic algorithm is used to produce three candidate experiment models for the final PARADIGM design. The three candidate models produced by the genetic algorithm consist of copper-reflected assemblies containing 14 repeating units of alumina, graphite, boron, and plutonium plates. Furthermore, in addition to the optimization results, final design considerations are also discussed for designs with a height and/or weight very close to or slightly above assembly machine operational limits.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Enhancing operational safety: The NSTX-U Shorted Turn Protection (STP) system

The NSTX-U Shorted Turn Protection (STP) system is a vital safety feature designed to protect the tokamak’s coils during operations. It employs a Kalman filter-based algorithm to monitor coil currents and detect faults in real-time. If an anomaly is detected, the system swiftly terminates the tokamak pulse to prevent damage. Developed with Matlab and Simulink, the STP system has been validated through real-time simulations, ensuring its effectiveness for the upcoming upgrades of the NSTX-U facility. In conclusion, this article presents the theory for implementation of the STP algorithm and the results from simulation and real-time implementation.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Network Offoaded Hierarchical Collectives Using ConnectX-2's CORE-Direct Capabilities

As the scale of High Performance Computing (HPC) systems continues to increase, demanding that we extract even more parallelism from applications, the need to move communication management away from the Central Processing Unit (CPU) becomes even greater. Moving this management to the network, frees up CPU cycles for computation, making it possible to overlap computation and communication. In this paper we continue to investigate how to best use the new CORE-Direct support added in the ConnectX-2 Host Channel Adapter (HCA) for creating high performance, asynchronous collective operations that are managed by the HCA. Specifically we consider the network topology, creating a two-level communication hierarchy, reducing the MPI Barrier completion time by 45%, from 26.59 microseconds, when not considering network topology, to 14.72 microseconds, with the CPU based collective barrier operation completing in 19.04 microseconds. The nonblocking barrier algorithm has similar performance, with about 50% of that time available for computation.

99 GENERAL AND MISCELLANEOUS↗

Full wave modeling of radio-frequency beams in tokamaks in the electron cyclotron frequency range

Simulation of full wave, without paraxial approximation, high-resolution solution of wave equations in frequency domain in the electron cyclotron resonance (ECR) frequency range for realistic Tokamak plasma parameters became possible by using recently formulated hybrid iterative algorithm [Svidzinski et al., Phys. Plasmas 25, 082509 (2018)] for numerically solving discretized wave equations. This approach combines time evolution and iterative relaxation techniques into iteration cycles. This algorithm is implemented in 2D code FullWave, solving wave equations in Tokamaks in cold and hot plasma models, and it has been tested in 3D full wave iterative RF beams simulation tool, which is presently being developed to model 3D ECRH RF beams in fusion devices using dynamic grid adaptation. The results of 2D full wave modeling, assuming specified toroidal mode number, of ECRH RF beams in DIII-D plasma, performed in the cold and hot plasma models for outboard and top launch scenarios using FullWave are presented. Nonlocal hot plasma response model, based on accurate numerical solution of linearized Vlasov equation, is used to model beam propagation and absorption in the 2nd electron cyclotron harmonic region. Demonstration of capability of the hybrid iterative algorithm to model ECRH RF beams in 3D is made by simulating a substantial part of realistic beam in DIII-D, launched from outboard side of the machine. All relevant physics of RF beam propagation, most of which is not captured in paraxial approximation, such as beam's divergence, interference between the X and O modes in the beam, X-O mode conversion, beam splitting into the X and O mode beams, transformation of beam's cross section, and absorption at the 2nd electron cyclotron harmonic, is captured in the simulations. A numerical technique to find an optimal beam polarization at the launcher to launch a nearly pure X or O mode beam in plasma is developed and tested.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DESPIKING OF SPACECRAFT ENERGETIC PROTON FLUX TO STUDY GALACTIC COSMIC-RAY MODULATION

Galactic cosmic ray (GCR) is usually assumed as a stable 'background', with solar influence considered as a modulation. The violent solar energetic particle (SEP) events associated with solar activities change particle fluxes by several orders of magnitude in a few minutes. Thus, the flux observation of GCR provided by satellites may be heavily contaminated by spurious spikes due to SEPs, and that provided by ground-based neutron monitors (NMs) may be contaminated by the system error spikes and the ground level enhancement effect. To obtain the 'pure' background GCR flux for modulation research, the removal of multifarious spikes is necessary. In this article, we use a robust automatic despiking algorithm based on the Poincare map thresholding method provided by Goring and Nikora for 'purification' of the time-series GCR flux observations. We can show that the algorithm is good at cleaning up the heavily contaminated GCR intensity rates measured by both spacecraft and NMs without artificial parameters. In addition, using the algorithm to despike the spacecraft observations of relatively lower energetic proton flux, we get both 11 year and 27 day period cycles comparable to the much higher energy GCR flux data measured by the ground-based NMs.

79 ASTRONOMY AND ASTROPHYSICS↗

Coincidence anomaly detection for unsupervised locating of edge localized modes in the DIII-D tokamak dataset

Using supervised learning to train a machine learning model to predict an on-coming edge localized mode (ELM) requires a large number of labeled samples. Creating an appropriate data set from the very large database of discharges at a long-running tokamak, such as DIII-D, would be a very time-consuming process for a human. Considering this need and difficulty, we use coincidence anomaly detection, an unsupervised learning technique, to train an ELM-identifier to identify and label ELMs in the DIII-D discharge database. This ELM-identifier shows, simultaneously, a precision of 0.68 and a recall of 0.63 (AUC is 0.73) on identifying ELMs in example time series pulled from thousands of discharges spanning five years. In a test set of 50 discharges, the algorithm finds over 26 thousand ELM candidates, more than 5 times the existing catalog of ELMs labeled by humans.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Nanoscale Cluster Detection in Massive Atom Probe Tomography Data

Recent technological advances in atom probe tomography (APT) have led to unprecedented data acquisition capabilities that routinely generate data sets containing hundreds of millions of atoms. Detecting nanoscale clusters of different atom types present in these enormous amounts of data and analyzing their spatial correlations with one another are fundamental to understanding the structural properties of the material from which the data is derived. Extant algorithms for nanoscale cluster detection do not scale to large data sets. Here, a scalable, CUDA-based implementation of an autocorrelation algorithm is presented. It isolates spatial correlations amongst atomic clusters present in massive APT data sets in linear time using a linear amount of storage. Correctness of the algorithm is demonstrated using large synthetically generated data with known spatial distributions. Benefits and limitations of using GPU-acceleration for autocorrelation-based APT data analyses are presented with supporting performance results on data sets with up to billions of atoms. To our knowledge, this is the first nanoscale cluster detection algorithm that scales to massive APT data sets and executes on commodity hardware.

Seal, Sudip K↗

Automated tracking of prefabricated components for areal-time evaluator to optimize and automateinstallation

Trade associations for prefabricated construction estimate that about 50% of prefabricated wall projects have alignment problems that lead to defects and rework. Additionally, component installation times average between 30 and 60 minutes per component. To address these issues, a real-time evaluator (RTE) system was introduced to decrease cost and automate prefabricated component installation by reducing the installation time, decreasing rework, and enhancing energy performance through higher installation quality. The RTE uses commonly available hardware and software to perform autonomous tracking to measure the real-time location and orientation of components as they are crane-lifted and installed. The hardware, software, and algorithms that allow the autonomous tracking of components are detailed. An algorithm to automate the initial search for a component with three attached retroreflectors is proposed. Algorithms to automate the measurement of component position and orientation are also proposed. Simple lab-scale proof-of-concept experiments were conducted to assess the algorithms for automation of component searching, measurement of real-time movement, and measurement of component orientation. With additional development, the system can be used as a tool to generate the commands for autonomous crane operation or single-task construction robots.

Hayes, Nolan↗

Incremental k-core decomposition: Algorithms and evaluation

A k-core of a graph is a maximal connected subgraph in which every vertex is connected to at least k vertices in the subgraph. k-core decomposition is often used in large-scale network analysis, such as community detection, protein function prediction, visualization, and solving NP-hard problems on real networks efficiently, like maximal clique finding. In many real-world applications, networks change over time. As a result, it is essential to develop efficient incremental algorithms for dynamic graph data. In this paper, we propose a suite of incremental k-core decomposition algorithms for dynamic graph data. These algorithms locate a small subgraph that is guaranteed to contain the list of vertices whose maximum k-core values have changed and efficiently process this subgraph to update the k-core decomposition. We present incremental algorithms for both insertion and deletion operations, and propose auxiliary vertex state maintenance techniques that can further accelerate these operations. Our results show a significant reduction in runtime compared to non-incremental alternatives. We illustrate the efficiency of our algorithms on different types of real and synthetic graphs, at varying scales. Furthermore, for a graph of 16 million vertices, we observe relative throughputs reaching a million times, relative to the non-incremental algorithms.

97 MATHEMATICS AND COMPUTING↗

Real-Time Simulation of Modular Multilevel Converters

Modular multilevel converters (MMCs) are one of the most popular configurations of voltage-source converters (VSCs) used in applications like high-voltage direct current (HVdc) transmission systems and flexible alternate current transmission systems (FACTS). They have a large number of modules with thousands of capacitors and semiconductor devices, which make it hard to simulate in real-time. In this paper, a low-cost high-performance computing (HPC) configuration to simulate MMCs in real-time is proposed. The configuration uses a HPC digital signal processor (DSP) with 8 cores. An advanced MMC simulation algorithm is implemented using HPC techniques to optimize the real-time performance in the DSP. A comparison is performed with existing solutions to show the superiority of the proposed configuration and algorithms.

Debnath, Suman↗

Formal methods approach to the charging facility location problem for battery electric vehicles

Battery electric vehicles (BEVs) are becoming more prevalent as improvements in battery technology and energy management continue to be made. As the number of electric vehicles grows, the demand for fast-charging stations is expected to increase dramatically. Thus, building new charging station infrastructure efficiently will be key to reducing upfront costs while meeting consumer demands. In this work, we propose a method for choosing a set of charging station locations that are optimized based on a set of given common vehicle demand points. As part of this solution, we also offer a novel abstraction of the road network on which energy-efficient paths that account for charge-time delays may be found. The current algorithm chooses the optimal charging locations for a single agent which has a route objective specified using temporal logic. To demonstrate the proposed method, the running example shows how a charging station could be chosen for an electric delivery vehicle. Simulations were run on sample road networks with a given set of demand points to service and potential charging station locations to compare. The method is shown to successfully rank potential charging stations in terms of their expected average charging time cost.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗