Search NASA⌕ Search

SEARCH · Search NASA

Results for “Time parallelization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10
All sourcesNASA NTRSDOE OSTI
DOE OSTI2017

Information criteria for quantifying loss of reversibility in parallelized KMC

Parallel Kinetic Monte Carlo (KMC) is a potent tool to simulate stochastic particle systems efficiently. However, despite literature on quantifying domain decomposition errors of the particle system for this class of algorithms in the short and in the long time regime, no study yet explores and quantifies the loss of time-reversibility in Parallel KMC. Inspired by concepts from non-equilibrium statistical mechanics, we propose the entropy production per unit time, or entropy production rate, given in terms of an observable and a corresponding estimator, as a metric that quantifies the loss of reversibility. Typically, this is a quantity that cannot be computed explicitly for Parallel KMC, which is why we develop a posteriori estimators that have good scaling properties with respect to the size of the system. Through these estimators, we can connect the different parameters of the scheme, such as the communication time step of the parallelization, the choice of the domain decomposition, and the computational schedule, with its performance in controlling the loss of reversibility. From this point of view, the entropy production rate can be seen both as an information criterion to compare the reversibility of different parallel schemes and as a tool to diagnose reversibility issues with a particular scheme. As a demonstration, we use Sandia Lab's SPPARKS software to compare different parallelization schemes and different domain (lattice) decompositions.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Multigrid methods with space–time concurrency

Here, we consider the comparison of multigrid methods for parabolic partial differential equations that allow space–time concurrency. With current trends in computer architectures leading towards systems with more, but not faster, processors, space–time concurrency is crucial for speeding up time-integration simulations. In contrast, traditional time-integration techniques impose serious limitations on parallel performance due to the sequential nature of the time-stepping approach, allowing spatial concurrency only. This paper considers the three basic options of multigrid algorithms on space–time grids that allow parallelism in space and time: coarsening in space and time, semicoarsening in the spatial dimensions, and semicoarsening in the temporal dimension. We develop parallel software and performance models to study the three methods at scales of up to 16K cores and introduce an extension of one of them for handling multistep time integration. We then discuss advantages and disadvantages of the different approaches and their benefit compared to traditional space-parallel algorithms with sequential time stepping on modern architectures.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Simulation Exploration through Immersive Parallel Planes

We present a visualization-driven simulation system that tightly couples systems dynamics simulations with an immersive virtual environment to allow analysts to rapidly develop and test hypotheses in a high-dimensional parameter space. To accomplish this, we generalize the two-dimensional parallel-coordinates statistical graphic as an immersive 'parallel-planes' visualization for multivariate time series emitted by simulations running in parallel with the visualization. In contrast to traditional parallel coordinate's mapping the multivariate dimensions onto coordinate axes represented by a series of parallel lines, we map pairs of the multivariate dimensions onto a series of parallel rectangles. As in the case of parallel coordinates, each individual observation in the dataset is mapped to a polyline whose vertices coincide with its coordinate values. Regions of the rectangles can be 'brushed' to highlight and select observations of interest: a 'slider' control allows the user to filter the observations by their time coordinate. In an immersive virtual environment, users interact with the parallel planes using a joystick that can select regions on the planes, manipulate selection, and filter time. The brushing and selection actions are used to both explore existing data as well as to launch additional simulations corresponding to the visually selected portions of the input parameter space. As soon as the new simulations complete, their resulting observations are displayed in the virtual environment. This tight feedback loop between simulation and immersive analytics accelerates users' realization of insights about the simulation and its output.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Time-resolved RIXS experiment with pulse-by-pulse parallel readout data collection using X-ray free electron laser

Abstract Time-resolved resonant inelastic X-ray scattering (RIXS) is one of the developing techniques enabled by the advent of X-ray free electron laser (FEL). It is important to evaluate how the FEL jitter, which is inherent in the self-amplified spontaneous emission process, influences the RIXS measurement. Here, we use a microchannel plate (MCP) based Timepix soft X-ray detector to conduct a time-resolved RIXS measurement at the Ti L 3 -edge on a charge-density-wave material TiSe 2 . The fast parallel Timepix readout and single photon sensitivity enable pulse-by-pulse data acquisition and analysis. Due to the FEL jitter, low detection efficiency of spectrometer, and low quantum yield of RIXS process, we find that less than 2% of the X-ray FEL pulses produce signals, preventing acquiring sufficient data statistics while maintaining temporal and energy resolution in this measurement. These limitations can be mitigated by using future X-ray FELs with high repetition rates, approaching MHz such as the European XFEL in Germany and LCLS-II in the USA, as well as by utilizing advanced detectors, such as the prototype used in this study.

36 MATERIALS SCIENCE↗
DOE OSTI2017

A derivation and scalable implementation of the synchronous parallel kinetic Monte Carlo method for simulating long-time dynamics

Kinetic Monte Carlo (KMC) simulations are used to study long-time dynamics of a wide variety of systems. Unfortunately, the conventional KMC algorithm is not scalable to larger systems, since its time scale is inversely proportional to the simulated system size. A promising approach to resolving this issue is the synchronous parallel KMC (SPKMC) algorithm, which makes the time scale size-independent. This paper introduces a formal derivation of the SPKMC algorithm based on local transition-state and time-dependent Hartree approximations, as well as its scalable parallel implementation based on a dual linked-list cell method. The resulting algorithm has achieved a weak-scaling parallel efficiency of 0.935 on 1024 Intel Xeon processors for simulating biological electron transfer dynamics in a 4.2 billion-heme system, as well as decent strong-scaling parallel efficiency. The parallel code has been used to simulate a lattice of cytochrome complexes on a bacterial-membrane nanowire, and it is broadly applicable to other problems such as computational synthesis of new materials.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Summer Proceedings 2016: The Center for Computing Research at Sandia National Laboratories

Solving sparse linear systems from the discretization of elliptic partial differential equations (PDEs) is an important building block in many engineering applications. Sparse direct solvers can solve general linear systems, but are usually slower and use much more memory than effective iterative solvers. To overcome these two disadvantages, a hierarchical solver (LoRaSp) based on H2-matrices was introduced in [22]. Here, we have developed a parallel version of the algorithm in LoRaSp to solve large sparse matrices on distributed memory machines. On a single processor, the factorization time of our parallel solver scales almost linearly with the problem size for three-dimensional problems, as opposed to the quadratic scalability of many existing sparse direct solvers. Moreover, our solver leads to almost constant numbers of iterations, when used as a preconditioner for Poisson problems. On more than one processor, our algorithm has significant speedups compared to sequential runs. With this parallel algorithm, we are able to solve large problems much faster than many existing packages as demonstrated by the numerical experiments.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Multigrid Reduction in Time for Chaotic Dynamical Systems

As CPU clock speeds have stagnated and high performance computers continue to have ever higher core counts, increased parallelism is needed to take advantage of these new architectures. Traditional serial time-marching schemes can be a significant bottleneck, as many types of simulations require large numbers of time-steps which must be computed sequentially. Parallel-in-time schemes, such as the Multigrid Reduction in Time (MGRIT) method, remedy this by parallelizing across time-steps and have shown promising results for parabolic problems. However, chaotic problems have proved more difficult, since chaotic initial value problems (IVPs) are inherently ill-conditioned. MGRIT relies on a hierarchy of successively coarser time-grids to iteratively correct the solution on the finest time-grid, but due to the nature of chaotic systems, small inaccuracies on the coarser levels can be greatly magnified and lead to poor coarse-grid corrections. Here we introduce a modified MGRIT algorithm based on an existing quadratically converging nonlinear extension to the multigrid Full Approximation Scheme (FAS), as well as a novel time-coarsening scheme. Together, these approaches better capture long-term chaotic behavior on coarse-grids and greatly improve convergence of MGRIT for chaotic IVPs. Further, we introduce a novel low-memory variant of the algorithm for solving chaotic PDEs with MGRIT which not only solves the IVP, but also provides estimates for the unstable Lyapunov vectors of the system. Finally, we provide supporting numerical results for the Lorenz system and demonstrate parallel speedup for the chaotic Kuramoto–Sivashinsky PDE over a significantly longer time-domain than in previous works.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

An Analytical Time–Domain Expression for the Net Ripple Produced by Parallel Interleaved Converters

We apply modular arithmetic and Fourier series to analyze the superposition of N interleaved triangular waveforms with identical amplitudes and duty-ratios. Here, interleaving refers to the condition when a collection of periodic waveforms with identical periods are each uniformly phase-shifted across one period. The main result is a time-domain expression which provides an exact representation of the summed and interleaved triangular waveforms, where the peak amplitude and parameters of the time-periodic component are all specified in closed-form. Analysis is general and can be used to study various applications in multi-converter systems. This model is unique not only in that it reveals a simple and intuitive expression for the net ripple, but its derivation via modular arithmetic and Fourier series is distinct from prior approaches. The analytical framework is experimentally validated with a system of three parallel converters under time-varying operating conditions.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2015

Analytic energy gradient of excited electronic state within TDDFT/MMpol framework: Benchmark tests and parallel implementation

The time-dependent density functional theory (TDDFT) has become the most popular method to calculate the electronic excitation energies, describe the excited-state properties, and perform the excited-state geometric optimization of medium and large-size molecules due to the implementation of analytic excited-state energy gradient and Hessian in many electronic structure software packages. To describe the molecules in condensed phase, one usually adopts the computationally efficient hybrid Quantum Mechanics/Molecular Mechanics (QM/MM) models. Here, we extend our previous work on the energy gradient of TDDFT/MM excited state to account for the mutual polarization effects between QM and MM regions, which is believed to hold a crucial position in the potential energy surface of molecular systems when the photoexcitation-induced charge rearrangement in the QM region is drastic. The implementation of a simple polarizable TDDFT/MM (TDDFT/MMpol) model in Q-Chem/CHARMM interface with both the linear response and the state-specific features has been realized. Several benchmark tests and preliminary applications are exhibited to confirm our implementation and assess the effects of different treatment of environmental polarization on the excited-state properties, and the efficiency of parallel implementation is demonstrated as well.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2025

Electro-optic sampling of classical and quantum light

Full characterization of electric-field waveforms in amplitude and phase is achieved across the terahertz to visible spectral range through interaction with an optical pulse shorter than a half-cycle period via the Pockels (linear electro-optic) effect. This technique of electro-optic sampling has become an indispensable tool in various areas, including ultrafast pump-probe, time-domain and frequency-comb spectroscopies, quantum optics, high-harmonic generation, and attosecond science, and holds great promise for further advances. Not only does it enable spectroscopic measurements with record dynamic range and temporal resolution, along with massively parallel real-time spectral data acquisition, but its remarkable sensitivity also allows the detection of vacuum fluctuations, i.e., “zero-point motion” of electric fields, profoundly impacting our understanding of the fundamental laws of nature.

Benea-Chelmus, Ileana-Cristina (ORCID:000000024814↗
DOE OSTI2018

Theory of critical balance in plasma turbulence

Critical balance, a statement of the approximate equality of a timescale of motion parallel to the magnetic field with a timescale of turbulent motion perpendicular to the field, is analyzed from a statistical description of the relative motion of two particles consistent with two-point correlation in a nonlinear gyrokinetic system with collisions. Critical balance is understood from a premise that the fastest time to any spatial scale that encounters decorrelated motions sets an overall correlation time for both perpendicular and parallel scales. For a regime of weak collisionality, this leads to the approximate equality of the parallel streaming time and the perpendicular turbulent correlation time, which is a standard statement of critical balance. These two timescales are only approximately equal because of effects in parallel streaming dynamics and collisions, the former producing deviations tied to variations of perpendicular and parallel wavenumbers. Finally, analysis of a collisional regime shows that critical balance also applies in that limit with a modified relation between parallel and perpendicular spatial scales.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2024

Parallel hybrid quantum-classical machine learning for kernelized time-series classification

Supervised time-series classification garners widespread interest because of its applicability throughout a broad application domain including finance, astronomy, biosensors, and many others. Here, in this work, we tackle this problem with hybrid quantum-classical machine learning, deducing pairwise temporal relationships between time-series instances using a timeseries Hamiltonian kernel (TSHK). A TSHK is constructed with a sum of inner products generated by quantum states evolved using a parameterized time evolution operator. This sum is then optimally weighted using techniques derived from multiple kernel learning. Because we treat the kernel weighting step as a differentiable convex optimization problem, our method can be regarded as an end-to-end learnable hybrid quantum-classical-convex neural network, or QCC-net, whose output is a data set-generalized kernel function suitable for use in any kernelized machine learning technique such as the support vector machine (SVM). Using our TSHK as input to a SVM, we classify univariate and multivariate time-series using quantum circuit simulators and demonstrate the efficient parallel deployment of the algorithm to 127-qubit superconducting quantum processors using quantum multi-programming.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Performance and Accuracy Implications of Parallel Split Physics-Dynamics Coupling in the Energy Exascale Earth System Atmosphere Model

Simultaneous calculation of atmospheric processes is faster than calculating processes one at a time. This type of parallelism is beneficial or perhaps even necessary to provide good performance on modern supercomputers, which achieve faster performance through increased processor count rather than improved clock speed. The scalability of the Energy Exascale Earth System Model (E3SM) Atmosphere Model (EAM) is limited by the fluid dynamics which scales up to the number of mesh cells in the global mesh. In contrast, the suite of physics parameterizations in EAM is scalable up to the total number of physics columns, which is an order of magnitude greater than the number of mesh cells. A proposed solution to unlocking the greater potential performance from the physics suite is to solve the physics and dynamics in parallel. This work represents a first attempt at parallel splitting of the grid-scale fluid dynamics model and the subgrid-scale physics parameterizations in a global atmosphere model. We will demonstrate that switching to parallel physics-dynamics coupling extends the scalability of the EAM to up to 3 times the previous peak scalability limit and is up to 20% faster than the sequentially split coupling at the highest core counts and the same time step. Decadal simulations of both coupling approaches show very little impact to the model climate. This improved performance does not come without drawbacks, however. Parallel splitting requires a shorter time step and other modifications which largely offset performance gains. A mass fixer is required for conservation. Techniques for mitigating these issues are also discussed.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

The sweeper spectrometer for neutron invariant-mass spectroscopy at FRIB

Neutron invariant-mass spectroscopy (NIMS) is a key technique for studying unbound and weakly bound nuclei at the limits of stability. At the Facility for Rare Isotope Beams (FRIB), such measurements are performed using the Sweeper spectrometer, a large-gap, high-rigidity dipole system coupled to the MoNA-LISA neutron detector arrays. To meet the demands imposed by higher beam energies (>130 MeV/u) and the broad cocktail-beam selection available at FRIB, the spectrometer has recently been upgraded to improve particle-identification and detection performance. Upstream of the reaction target, a plastic scintillator with Silicon photomultiplier (SiPM) readout provides the global trigger and time reference, two parallel plate avalanche counters (PPACs) track the trajectories of incoming beam particles, and a silicon PIN detector measures the energy loss, ΔE, for charge (Z) identification. After the Sweeper magnet, the trajectories of the reaction products are tracked by two micro-pattern drift chambers (MPDCs), their charge (Z) is identified by a Frisch-grid ionization chamber (FG-IC), and their mass-to-charge ratio (A/Q) is deduced by time-of-flight measurement using a fast plastic scintillator read out by an array of photomultiplier tubes (PMTs). The detection system also incorporates the Modular Neutron Array (MoNA) for neutron detection and the CAESium-iodide scintillator ARray (CAESAR) for high-efficiency γ-ray measurements to enable full kinematic reconstruction. Performance was evaluated using a cocktail beam around 37 Al accelerated at E ≈ 130 MeV/u during the first FRIB campaign, demonstrating the readiness of the upgraded system for future studies of nuclei at and beyond the neutron drip line.

Particle identification methods↗
DOE OSTI2018

Concurrent implicit spectral deferred correction scheme for low-Mach number combustion with detailed chemistry

We present a parallel multi-implicit time integration scheme for the advection-diffusion-reaction systems arising from the equations governing low-Mach number combustion with complex chemistry. Here, our strategy employs parallelisation across the method to accelerate the serial Multi-Implicit Spectral Deferred Correction (MISDC) scheme used to couple the advection, diffusion, and reaction processes. In our approach, the diffusion solves and the reaction solves are performed concurrently by different processors. Our analysis shows that the proposed parallel scheme is stable for stiff problems and that the sweeps converge to the fixed-point solution at a faster rate than with serial MISDC. We present numerical examples to demonstrate that the new algorithm is high-order accurate in time, and achieves a parallel speedup compared to serial MISDC.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Localized Exponential Time Differencing Method for Shallow Water Equations: Algorithms and Numerical Study

Here, we explore the performance of the exponential time differencing (ETD) method applied to the rotating shallow water equations. Comparing with explicit time stepping of the same order accuracy in time, the ETD algorithms could reduce the computational time in many cases by allowing the use of large time step sizes while still maintaining numerical stability. To accelerate the ETD simulations, we propose a localized approach that synthesizes the ETD method and overlapping domain decomposition. By dividing the original problem into many subdomain problems of smaller sizes and solving them locally, the proposed approach could speed up the calculation of matrix exponential vector products. Several standard test cases for shallow water equations of one or multiple layers are considered. The results show great potential of the localized ETD method for high-performance computing because each subdomain problem can be naturally solved in parallel at every time step.

58 GEOSCIENCES↗