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 559 records · Page 31

Enforcing global constraints for the dispersion closure problem: τ 2 -SIMPLE algorithm

Permeability and effective dispersion tensors are critical parameters to characterize flow and transport in porous media at the continuum scale. Homogenization theory defines a framework in which such effective properties are first computed from solving a closure problem in a repeating unit cell of the periodic microstructure and then used in a macroscopic formulation for efficient computation. The closure problem is formulated as a local boundary value problem subjected to global constraints, which guarantee the uniqueness of the solution and can be difficult to satisfy for complex geometries and at high flow conditions. These constraints also ensure that pore-scale pressure, velocity, and concentration fields can be accurately reconstructed from the closure variable. Building on a previous work, here we present a framework that allows to satisfy global constraints associated to both the permeability and the dispersion closure problems by introducing two artificial time scales. The algorithm, called τ 2 -SIMPLE, computes both permeability and effective dispersion given an arbitrarily complex geometry and flow condition. Furthermore, this algorithm is demonstrated to be accurate for both 2D and 3D geometries across varying flow conditions, and thus it can be used to quickly characterize effective properties from porous media images in many applications.

97 MATHEMATICS AND COMPUTING↗

Optimal checkpointing for adjoint multistage time-stepping schemes

Here, we consider checkpointing strategies that minimize the number of recomputations needed when performing discrete adjoint computations using multistage time-stepping schemes that require computing several substeps within one complete time step. Specifically, we propose two algorithms that can generate optimal checkpoint-ing schedules under weak assumptions. The first is an extension of the seminal Revolve algorithm adapted to multistage schemes. The second algorithm, named CAMS, is developed based on dynamic programming, and it requires the least number of recomputations when compared with other algorithms. The CAMS algorithm is made publicly available in a library with bindings to C and Python. Numerical results show that the proposed algorithms can deliver up to two times the speedup compared with that of classical Revolve. Moreover, we discuss the utilization of the CAMS library in mature scientific computing libraries and demonstrate the ease of using it in an adjoint workflow. The proposed algorithms have been adopted by the PETSc TSAdjoint library. Their performance has been demonstrated with a large-scale PDE-constrained optimization problem on a leadership-class supercomputer. This work is a significant extension of the authors' conference paper.

97 MATHEMATICS AND COMPUTING↗

A fast exact simulation method for a class of Markov jump processes

A new method of the stochastic simulation algorithm (SSA), named the Hashing-Leaping method (HLM), for exact simulations of a class of Markov jump processes, is presented in this paper. The HLM has a conditional constant computational cost per event, which is independent of the number of exponential clocks in the Markov process. The main idea of the HLM is to repeatedly implement a hash-table-like bucket sort algorithm for all times of occurrence covered by a time step with length τ. This paper serves as an introduction to this new SSA method. We introduce the method, demonstrate its implementation, analyze its properties, and compare its performance with three other commonly used SSA methods in four examples. Our performance tests and CPU operation statistics show certain advantages of the HLM for large scale problems.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Towards real-time monitoring: data assimilated time-lapse full waveform inversion for seismic velocity and uncertainty estimation

SUMMARY Rapid development of time-lapse seismic monitoring instrumentations has made it possible to collect dense time-lapse data for tomographically retrieving time-lapse (even continuous) images of subsurface changes. While traditional time-lapse full waveform inversion (TLFWI) algorithms are designed for sparse time-lapse surveys, they lack of effective temporal constraint on time-lapse data, and, more importantly, lack of the uncertainty estimation of the TLFWI results that is critical for further interpretation. Here, we propose a new data assimilation TLFWI method, using hierarchical matrix powered extended Kalman filter (HiEKF) to quantify the image uncertainty. Compared to existing Kalman filter algorithms, HiEKF allows to store and update a data-sparse representation of the cross-covariance matrices and propagate model errors without expensive operations involving covariance matrices. Hence, HiEKF is computationally efficient and applicable to 3-D TLFWI problems. Then, we reformulate TLFWI in the framework of HiEKF (termed hereafter as TLFWI-HiEKF) to predict time-lapse images of subsurface spatiotemporal velocity changes and simultaneously quantify the uncertainty of the inverted velocity changes over time. We demonstrate the validity and applicability of TLFWI–HiEKF with two realistic CO2 monitoring models derived from Frio-II and Cranfield CO2 injection sites, respectively. In both 2-D and 3-D examples, the inverted high-resolution time-lapse velocity results clearly reveal a continuous velocity reduction due to the injection of CO2. Moreover, the accuracy of the model is increasing over time by assimilating more time-lapse data while the standard deviation is decreasing over lapsed time. We expect TLFWI-HiEKF to be equipped with real-time seismic monitoring systems for continuously imaging the distribution of subsurface gas and fluids in the future large-scale CO2 sequestration experiments and reservoir management.

58 GEOSCIENCES↗

SU-C-BRC-07: Parametrized GPU Accelerated Electron Monte Carlo Second Check

Purpose: I am presenting a parameterized 3D GPU accelerated electron Monte Carlo second check program. Method: I wrote the 3D grid dose calculation algorithm in CUDA and utilized an NVIDIA GeForce GTX 780 Ti to run all of the calculations. The electron path beyond the distal end of the cone is governed by four parameters: the amplitude of scattering (AMP), the mean and width of a Gaussian energy distribution (E and α), and the percentage of photons. In my code, I adjusted all parameters until the calculated PDD and profile fit the measured 10×10 open beam data within 1%/1mm. I then wrote a user interface for reading the DICOM treatment plan and images in Python. In order to verify the algorithm, I calculated 3D dose distributions on a variety of phantoms and geometries, and compared them with the Eclipse eMC calculations. I also calculated several patient specific dose distributions, including a nose and an ear. Finally, I compared my algorithm’s computation times to Eclipse’s. Results: The calculated MU for all of the investigated geometries agree with the TPS within the TG-114 action level of 5%. The MU for the nose was < 0.5 % different while the MU for the ear at 105 SSD was ∼2 %. Calculation times for a 12MeV 10×10 open beam ranged from 1 second for a 2.5 mm grid resolution with ∼15 million particles to 33 seconds on a 1 mm grid with ∼460 million particles. Eclipse calculation runtimes distributed over 10 FAS workers were 9 seconds to 15 minutes respectively. Conclusion: The GPU accelerated second check allows quick MU verification while accounting for patient specific geometry and heterogeneity.

60 APPLIED LIFE SCIENCES↗

Deploying a Model Predictive Traffic Signal Control Algorithm - A Field Deployment Experiment Case Study: Preprint

This paper presents a field deployment experiment of a real-time traffic signal control algorithm. We implemented the Model Predictive Control (MPC) algorithm based on Virtual Phase-Link (VPL) model. We selected the deployment locations and times based on an energy saving potential concept. We developed a set of experiment systems to enable the deployment including sensing, processing, and actuating components. We tested the systems rigorously before the experiment days. We reported the key procedures on the experiment days including the steps took, real-time control procedure, and the monitoring of the experiment. We evaluated the impact of the deployment with the changes in delay and energy consumption.

deployment↗

Decoherence-protected quantum gates for a hybrid solid-state spin register

Protecting the dynamics of coupled quantum systems from decoherence by the environment is a key challenge for solid-state quantum information processing. An idle quantum bit (qubit) can be efficiently insulated from the outside world by dynamical decoupling, as has recently been demonstrated for individual solid-state qubits. However, protecting qubit coherence during a multi-qubit gate is a non-trivial problem in general, the decoupling disrupts the interqubit dynamics and hence conflicts with gate operation. This problem is particularly salient for hybrid systems, in which different types of qubit evolve and decohere at very different rates. Here we present the integration of dynamical decoupling into quantum gates for a standard hybrid system, the electron-nuclear spin register. Our design harnesses the internal resonance in the coupled-spin system to resolve the conflict between gate operation and decoupling. We experimentally demonstrate these gates using a two-qubit register in diamond operating at room temperature. Quantum tomography reveals that the qubits involved in the gate operation are protected as accurately as idle qubits. We also perform Grover's quantum search algorithm, and achieve fidelities of more than 90% even though the algorithm run-time exceeds the electron spin dephasing time by two orders of magnitude. Our results directly allow decoherence-protected interface gates between different types of solid-state qubit. Ultimately, quantum gates with integrated decoupling may reach the accuracy threshold for fault-tolerant quantum information processing with solid-state devices.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Efficient Screening of Climate Model Sensitivity to a Large Number of Perturbed Input Parameters [plus supporting information]

Modern climate models contain numerous input parameters, each with a range of possible values. Since the volume of parameter space increases exponentially with the number of parameters N, it is generally impossible to directly evaluate a model throughout this space even if just 2-3 values are chosen for each parameter. Sensitivity screening algorithms, however, can identify input parameters having relatively little effect on a variety of output fields, either individually or in nonlinear combination.This can aid both model development and the uncertainty quantification (UQ) process. Here we report results from a parameter sensitivity screening algorithm hitherto untested in climate modeling, the Morris one-at-a-time (MOAT) method. This algorithm drastically reduces the computational cost of estimating sensitivities in a high dimensional parameter space because the sample size grows linearly rather than exponentially with N. It nevertheless samples over much of the N-dimensional volume and allows assessment of parameter interactions, unlike traditional elementary one-at-a-time (EOAT) parameter variation. We applied both EOAT and MOAT to the Community Atmosphere Model (CAM), assessing CAM’s behavior as a function of 27 uncertain input parameters related to the boundary layer, clouds, and other subgrid scale processes. For radiation balance at the top of the atmosphere, EOAT and MOAT rank most input parameters similarly, but MOAT identifies a sensitivity that EOAT underplays for two convection parameters that operate nonlinearly in the model. MOAT’s ranking of input parameters is robust to modest algorithmic variations, and it is qualitatively consistent with model development experience. Supporting information is also provided at the end of the full text of the article.

54 ENVIRONMENTAL SCIENCES↗

Adiabatic condition and the quantum hitting time of Markov chains

We present an adiabatic quantum algorithm for the abstract problem of searching marked vertices in a graph, or spatial search. Given a random walk (or Markov chain) P on a graph with a set of unknown marked vertices, one can define a related absorbing walk P{sup '} where outgoing transitions from marked vertices are replaced by self-loops. We build a Hamiltonian H(s) from the interpolated Markov chain P(s)=(1-s)P+sP{sup '} and use it in an adiabatic quantum algorithm to drive an initial superposition over all vertices to a superposition over marked vertices. The adiabatic condition implies that, for any reversible Markov chain and any set of marked vertices, the running time of the adiabatic algorithm is given by the square root of the classical hitting time. This algorithm therefore demonstrates a novel connection between the adiabatic condition and the classical notion of hitting time of a random walk. It also significantly extends the scope of previous quantum algorithms for this problem, which could only obtain a full quadratic speedup for state-transitive reversible Markov chains with a unique marked vertex.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

An experimental comparison of various methods of nearfield acoustic holography

An experimental comparison of four different methods of nearfield acoustic holography (NAH) is presented in this study for planar acoustic sources. The four NAH methods considered in this study are based on: (1) spatial Fourier transform, (2) equivalent sources model, (3) boundary element methods and (4) statistically optimized NAH. Two dimensional measurements were obtained at different distances in front of a tonal sound source and the NAH methods were used to reconstruct the sound field at the source surface. Reconstructed particle velocity and acoustic pressure fields presented in this study showed that the equivalent sources model based algorithm along with Tikhonov regularization provided the best localization of the sources. Reconstruction errors were found to be smaller for the equivalent sources model based algorithm and the statistically optimized NAH algorithm. Effect of hologram distance on the performance of various algorithms is discussed in detail. The study also compares the computational time required by each algorithm to complete the comparison. Four different regularization parameter choice methods were compared. The L-curve method provided more accurate reconstructions than the generalized cross validation and the Morozov discrepancy principle. Finally, the performance of fixed parameter regularization was comparable to that of the L-curve method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

PMU Placement for Dynamic State Tracking of Power Systems

Accurately tracking the state variables (rotor angle and speed) is a necessity for monitoring system stability conditions and assessing the risks of large-scale system collapse. This paper explores how the number and locations of PMUs installed in the system are determined to ensure satisfactory state tracking performance. A search algorithm is presented for determining PMU placement (location and quantity). The algorithm determines a placement that gives small tracking error in polynomial time. A modified, scalable algorithm is also presented. Observability in the presence of faults is considered. Simulation results for a 16-machine and a 50-machine system are provided.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel Breadth-First Search on Distributed Memory Systems

Data-intensive, graph-based computations are pervasive in several scientific applications, and are known to be quite challenging to implement on distributed memory systems. In this work, we explore the design space of parallel algorithms for Breadth-First Search (BFS), a key subroutine in several graph algorithms. We present two highly-tuned parallel approaches for BFS on large parallel systems: a level-synchronous strategy that relies on a simple vertex-based partitioning of the graph, and a two-dimensional sparse matrix-partitioning-based approach that mitigates parallel communication overhead. For both approaches, we also present hybrid versions with intra-node multithreading. Our novel hybrid two-dimensional algorithm reduces communication times by up to a factor of 3.5, relative to a common vertex based approach. Our experimental study identifies execution regimes in which these approaches will be competitive, and we demonstrate extremely high performance on leading distributed-memory parallel systems. For instance, for a 40,000-core parallel execution on Hopper, an AMD Magny-Cours based system, we achieve a BFS performance rate of 17.8 billion edge visits per second on an undirected graph of 4.3 billion vertices and 68.7 billion edges with skewed degree distribution.

97 MATHEMATICS AND COMPUTING↗

Reliability Value of Fast State Estimation on Power Systems

Monitoring the state of a power system under stress is key to achieving reliable operation. State estimation and timely measurements become more important when applying and designing corrective control actions (manual and automatic) to arrest or mitigate cascading blackouts. The execution time of each process, including state estimation, should be as short as possible to allow for timely action. In this paper, we provide a methodology for estimating one of the components of value of faster and more frequent state estimation: the reliability value of state estimation to assist corrective control actions for arresting or mitigating cascading blackouts. We present a new algorithm for estimating the time between successive line trips in a cascading failure. The algorithm combines power flow calculations with characteristics of the protection system to estimate the time between successive equipment trips. Using this algorithm, we illustrate the value of fast state estimation by calculating the time remaining for automatic or manual corrective actions after state estimation is finalized.

Power system state estimation, cascading failures,↗

Comparing Algorithms for Graph Isomorphism Using Discrete- and Continuous-Time Quantum Random Walks

Berry and Wang [Phys. Rev. A 83, 042317 (2011)] show numerically that a discrete-time quan- tum random walk of two noninteracting particles is able to distinguish some non-isomorphic strongly regular graphs from the same family. Here we analytically demonstrate how it is possible for these walks to distinguish such graphs, while continuous-time quantum walks of two noninteracting parti- cles cannot. We show analytically and numerically that even single-particle discrete-time quantum random walks can distinguish some strongly regular graphs, though not as many as two-particle noninteracting discrete-time walks. Additionally, we demonstrate how, given the same quantum random walk, subtle di erences in the graph certi cate construction algorithm can nontrivially im- pact the walk's distinguishing power. We also show that no continuous-time walk of a xed number of particles can distinguish all strongly regular graphs when used in conjunction with any of the graph certi cates we consider. We extend this constraint to discrete-time walks of xed numbers of noninteracting particles for one kind of graph certi cate; it remains an open question as to whether or not this constraint applies to the other graph certi cates we consider.

97 MATHEMATICS AND COMPUTING↗

SSD-optimized workload placement with adaptive learning and classification in HPC environments

In recent years, non-volatile memory devices such as SSD drives have emerged as a viable storage solution due to their increasing capacity and decreasing cost. Due to the unique capability and capacity requirements in large scale HPC (High Performance Computing) storage environment, a hybrid configuration (SSD and HDD) may represent one of the most available and balanced solutions considering the cost and performance. Under this setting, effective data placement as well as movement with controlled overhead become a pressing challenge. In this paper, we propose an integrated object placement and movement framework and adaptive learning algorithms to address these issues. Specifically, we present a method that shuffle data objects across storage tiers to optimize the data access performance. The method also integrates an adaptive learning algorithm where realtime classification is employed to predict the popularity of data object accesses, so that they can be placed on, or migrate between SSD or HDD drives in the most efficient manner. We discuss preliminary results based on this approach using a simulator we developed to show that the proposed methods can dynamically adapt storage placements and access pattern as workloads evolve to achieve the best system level performance such as throughput.

Wan, Lipeng↗

Megahertz-compatible angular streaking with few-femtosecond resolution at x-ray free-electron lasers

Highly brilliant, coherent, femtosecond x-ray pulses delivered by free-electron lasers (FELs) constitute one of the pillars of modern ultrafast science. Next generation FEL facilities provide up to megahertz repetition rates and pulse durations down to the attosecond regime utilizing self-amplification of spontaneous emission. However, the stochastic nature of this generation mechanism demands single-shot pulse characterization to perform meaningful experiments. Here we demonstrate a fast yet robust online analysis technique capable of megahertz-rate mapping of the temporal intensity structure and arrival time of x-ray FEL pulses with few-femtosecond resolution. We performed angular streaking measurements of both neon photo- and Auger electrons and show their applicability for a direct time-domain feedback system during ongoing experiments. Here, the fidelity of the real-time pulse characterization algorithm is corroborated by resolving isolated x-ray pulses and double pulse trains with few-femtosecond substructure, thus paving the way for x-ray-pump–x-ray-probe FEL science at repetition rates compatible with the demands of LCLS-II and European XFEL.

74 ATOMIC AND MOLECULAR PHYSICS↗

THE INITIAL-FINAL MASS RELATION AMONG WHITE DWARFS IN WIDE BINARIES

We present the initial-final mass relation derived from 10 white dwarfs in wide binaries that consist of a main-sequence star and a white dwarf. The temperature and gravity of each white dwarf were measured by fitting theoretical model atmospheres to the observed spectrum using a {chi}{sup 2} fitting algorithm. The cooling time and mass were obtained using theoretical cooling tracks. The total age of each binary was estimated from the chromospheric activity of its main-sequence component to an uncertainty of about 0.17 dex in log t. The difference between the total age and white dwarf cooling time is taken as the main-sequence lifetime of each white dwarf. The initial mass of each white dwarf was then determined using stellar evolution tracks with a corresponding metallicity derived from spectra of their main-sequence companions, thus yielding the initial-final mass relation. Most of the initial masses of the white dwarf components are between 1 and 2 M{sub Sun }. Our results suggest a correlation between the metallicity of a white dwarf's progenitor and the amount of post-main-sequence mass loss it experiences-at least among progenitors with masses in the range of 1-2 M{sub Sun }. A comparison of our observations to theoretical models suggests that low-mass stars preferentially lose mass on the red giant branch.

79 ASTRONOMY AND ASTROPHYSICS↗