Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallelism”

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,135 records · Page 63
All sourcesNASA NTRSDOE OSTI
DOE OSTI2021

Ion heat and parallel momentum transport by stochastic magnetic fields and turbulence

In this work, the theory of turbulent transport of parallel momentum and ion heat by the interaction of stochastic magnetic fields and turbulence is presented. Attention is focused on determining the kinetic stress and the compressive energy flux. A critical parameter is identified as the ratio of the turbulent scattering rate to the rate of parallel acoustic dispersion. For the parameter large, the kinetic stress takes the form of a viscous stress. For the parameter small, the quasilinear residual stress is recovered. In practice, the viscous stress is the relevant form, and the quasilinear limit is not observable. This is the principal prediction of this paper. A simple physical picture is developed and shown to recover the results of the detailed analysis.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2021

Parallel convection and E × B drifts in the TCV snowflake divertor and their effects on target heat-fluxes

Parallel convection and E × B drifts act together to redistribute heat between the strike-points in the low field side snowflake minus (LFS SF–). The cumulative heat convection from both mechanisms is enhanced near the secondary X-point and is shown to dominate over heat conduction, partly explaining why the LFS SF– distributes power more evenly than the single null (SN) or other snowflake (SF) configurations. Pressure profiles at the entrance of the divertor are strongly affected by the position of the secondary X-point and magnetic field direction indicating the importance of E × B drifts. Pressure drops of up to 50% appear between the outer-midplane (OMP) and the divertor entrance enhancing the role of parallel heat convection. The electron temperature and density profiles and the radial turbulent fluxes measured at the OMP are largely unaffected by the changes in divertor geometry, even on flux surfaces where the connection length is infinite.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2022

New insights on divertor parallel flows,E × B drifts, and fluctuations from in situ, two-dimensional probe measurement in the Tokamak à Configuration Variable

Abstract In situ , two-dimensional (2D) Langmuir probe measurements across a large part of the TCV outer divertor are reported in L-mode discharges with and without divertor baffles. This provides detailed insights into time averaged profiles, particle fluxes, and fluctuation behavior in different divertor regimes. The presence of the baffles is shown to substantially increase the divertor neutral pressure for a given upstream density and to facilitate the access to detachment, an effect that increases with plasma current. The detailed, 2D probe measurements allow for a divertor particle balance, including ion flux contributions from parallel flows and E × B drifts. The poloidal flux contribution from the latter is often comparable or even larger than the former, and the divertor parallel flow direction reverses in some conditions, pointing away from the target. In most conditions, the integrated particle flux at the outer target can be predominantly ascribed to ionization along the outer divertor leg, consistent with a closed-box approximation of the divertor. The exception is a strongly detached divertor, achieved here only with baffles, where the total poloidal ion flux even decreases towards the outer target, indicative of significant plasma recombination. The most striking observation from relative density fluctuation measurements along the outer divertor leg is the transition from poloidally uniform fluctuation levels in attached conditions to fluctuations strongly peaking near the X-point when approaching detachment.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗
DOE OSTI2018

Striped Data Server for Scalable Parallel Data Analysis

A columnar data representation is known to be an efficient way for data storage, specifically in cases when the analysis is often done based only on a small fragment of the available data structures. A data representation like Apache Parquet is a step forward from a columnar representation, which splits data horizontally to allow for easy parallelization of data analysis. Based on the general idea of columnar data storage, working on the [LDRD Project], we have developed a striped data representation, which, we believe, is better suited to the needs of High Energy Physics data analysis. A traditional columnar approach allows for efficient data analysis of complex structures. While keeping all the benefits of columnar data representations, the striped mechanism goes further by enabling easy parallelization of computations without requiring special hardware. We will present an implementation and some performance characteristics of such a data representation mechanism using a distributed no-SQL database or a local file system, unified under the same API and data representation model. The representation is efficient and at the same time simple so that it allows for a common data model and APIs for wide range of underlying storage mechanisms such as distributed no-SQL databases and local file systems. Striped storage adopts Numpy arrays as its basic data representation format, which makes it easy and efficient to use in Python applications. The Striped Data Server is a web service, which allows to hide the server implementation details from the end user, easily exposes data to WAN users, and allows to utilize well known and developed data caching solutions to further increase data access efficiency. We are considering the Striped Data Server as the core of an enterprise scale data analysis platform for High Energy Physics and similar areas of data processing. As a result, we have been testing this architecture with a 2TB dataset from a CMS dark matter search and plan to expand it to multiple 100 TB or even PB scale. We will present the striped format, Striped Data Server architecture and performance test results.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗
DOE OSTI2016

Electromagnetic physics models for parallel computing architectures

The recent emergence of hardware architectures characterized by many-core or accelerated processors has opened new opportunities for concurrent programming models taking advantage of both SIMD and SIMT architectures. GeantV, a next generation detector simulation, has been designed to exploit both the vector capability of mainstream CPUs and multi-threading capabilities of coprocessors including NVidia GPUs and Intel Xeon Phi. The characteristics of these architectures are very different in terms of the vectorization depth and type of parallelization needed to achieve optimal performance. In this paper we describe implementation of electromagnetic physics models developed for parallel computing architectures as a part of the GeantV project. Finally, the results of preliminary performance evaluation and physics validation are presented as well.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2020

Speeding up particle track reconstruction using a parallel Kalman filter algorithm

One of the most computationally difficult problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is determining the trajectory of charged particles during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material effects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filter-based methods for highly parallel, many-core SIMD architectures that are now prevalent in high-performance hardware. In this paper, we discuss the design and performance of the improved tracking algorithm, referred to as mkFit. A key piece of the algorithm is the Matriplex library, containing dedicated code to optimally vectorize operations on small matrices. The physics performance of the mkFit algorithm is comparable to the nominal CMS tracking algorithm when reconstructing tracks from simulated proton-proton collisions within the CMS detector. We study the scaling of the algorithm as a function of the parallel resources utilized and find large speedups both from vectorization and multi-threading. mkFit achieves a speedup of a factor of 6 compared to the nominal algorithm when run in a single-threaded application within the CMS software framework.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2020

Turbulence-level dependence of cosmic ray parallel diffusion

ABSTRACT Understanding the transport of energetic cosmic rays belongs to the most challenging topics in astrophysics. Diffusion due to scattering by electromagnetic fluctuations is a key process in cosmic ray transport. The transition from a ballistic to a diffusive-propagation regime is presented in direct numerical calculations of diffusion coefficients for homogeneous magnetic field lines subject to turbulent perturbations. Simulation results are compared with theoretical derivations of the parallel diffusion coefficient’s dependences on the energy and the fluctuation amplitudes in the limit of weak turbulence. The present study shows that the widely used extrapolation of the energy scaling for the parallel diffusion coefficient to high turbulence levels predicted by quasi-linear theory does not provide a universally accurate description in the resonant-scattering regime. It is highlighted here that the numerically calculated diffusion coefficients can be polluted for low energies due to missing resonant interaction possibilities of the particles with the turbulence. Five reduced-rigidity regimes are established, which are separated by analytical boundaries derived in this work. Consequently, a proper description of cosmic ray propagation can only be achieved by using a turbulence-level-dependent diffusion coefficient and can contribute to solving the Galactic cosmic ray gradient problem.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2022

The first crystal structures of hybrid and parallel four-tetrad intramolecular G-quadruplexes

Abstract G-quadruplexes (GQs) are non-canonical DNA structures composed of stacks of stabilized G-tetrads. GQs play an important role in a variety of biological processes and may form at telomeres and oncogene promoters among other genomic locations. Here, we investigate nine variants of telomeric DNA from Tetrahymena thermophila with the repeat (TTGGGG)n. Biophysical data indicate that the sequences fold into stable four-tetrad GQs which adopt multiple conformations according to native PAGE. Excitingly, we solved the crystal structure of two variants, TET25 and TET26. The two variants differ by the presence of a 3′-T yet adopt different GQ conformations. TET25 forms a hybrid [3 + 1] GQ and exhibits a rare 5′-top snapback feature. Consequently, TET25 contains four loops: three lateral (TT, TT, and GTT) and one propeller (TT). TET26 folds into a parallel GQ with three TT propeller loops. To the best of our knowledge, TET25 and TET26 are the first reported hybrid and parallel four-tetrad unimolecular GQ structures. The results presented here expand the repertoire of available GQ structures and provide insight into the intricacy and plasticity of the 3D architecture adopted by telomeric repeats from T. thermophila and GQs in general.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2025

Optimizing temperature distributions for training neural quantum states using parallel tempering

Parametrized artificial neural networks (ANNs) can be very expressive ansatzes for variational algorithms, reaching state-of-the-art energies on many quantum many-body Hamiltonians. Nevertheless, the training of the ANN can be slow and stymied by the presence of local minima in the parameter landscape. One approach to mitigate this issue is to use parallel tempering methods, and in this work, we focus on the role played by the temperature distribution of the parallel tempering replicas. Using an adaptive method that adjusts the temperatures in order to equate the exchange probability between neighboring replicas, we show that this temperature optimization can significantly increase the success rate of the variational algorithm with negligible computational cost by eliminating bottlenecks in the replicas' random walk. Furthermore, we demonstrate this using two different neural networks, a restricted Boltzmann machine and a feedforward network, which we use to study a toy problem based on a permutation invariant Hamiltonian with a pernicious local minimum and the 𝐽 1 −𝐽 2 model on a rectangular lattice.

Neural network simulations↗
DOE OSTI2016

Optimal Battery Utilization Over Lifetime for Parallel Hybrid Electric Vehicle to Maximize Fuel Economy

This paper presents a control strategy to maximize fuel economy of a parallel hybrid electric vehicle over a target life of the battery. Many approaches to maximizing fuel economy of parallel hybrid electric vehicle do not consider the effect of control strategy on the life of the battery. This leads to an oversized and underutilized battery. There is a trade-off between how aggressively to use and 'consume' the battery versus to use the engine and consume fuel. The proposed approach addresses this trade-off by exploiting the differences in the fast dynamics of vehicle power management and slow dynamics of battery aging. The control strategy is separated into two parts, (1) Predictive Battery Management (PBM), and (2) Predictive Power Management (PPM). PBM is the higher level control with slow update rate, e.g. once per month, responsible for generating optimal set points for PPM. The considered set points in this paper are the battery power limits and State Of Charge (SOC). The problem of finding the optimal set points over the target battery life that minimize engine fuel consumption is solved using dynamic programming. PPM is the lower level control with high update rate, e.g. a second, responsible for generating the optimal HEV energy management controls and is implemented using model predictive control approach. The PPM objective is to find the engine and battery power commands to achieve the best fuel economy given the battery power and SOC constraints imposed by PBM. Simulation results with a medium duty commercial hybrid electric vehicle and the proposed two-level hierarchical control strategy show that the HEV fuel economy is maximized while meeting a specified target battery life. On the other hand, the optimal unconstrained control strategy achieves marginally higher fuel economy, but fails to meet the target battery life.

33 ADVANCED PROPULSION SYSTEMS↗
DOE OSTI2019

LP-BNN: Ultra-low-Latency BNN Inference with Layer Parallelism

High inference latency seriously limits the deployment of DNNs in real-time domains such as autonomous driving, robotic control, and many others. To address this emerging challenge, researchers have proposed approximate DNNs with reduced precision, e.g., Binarized Neural Networks (BNNs). While BNNs can be built to have little loss in accuracy, latency reduction still has much room for improvement. In this paper, we propose a single-FPGA-based BNN accelerator that achieves microsecond-level ultra-low-latency inference of ImageNet, LP- BNN. We obtain this performance via several design optimizations. First, we optimize the network structure by removing Batch Normalization (BN) functions which leads to significant latency in BNNs without any loss on accuracy. Second, we propose a parameterized architecture which is based on layer parallelism and supports nearly perfect load balancing for various types of BNNs. Third, we fuse all the convolution layers and the first fully connected layer. We process them in parallel through fine- grained inter-layer pipelining. With our proposed accelerator, the inference of binarized AlexNet, VGGNet, and ResNet are completed within 21.5µs, 355µs, and 67.8µs respectively, with no loss in accuracy as compared with other BNN implementations.

Geng, Tong↗
DOE OSTI2017

GPU-based parallel algorithm for generating massive scale-free networks using the preferential attachment model

A novel parallel algorithm is presented for generating random scale-free networks using the preferential-attachment model. The algorithm, named cuPPA, is custom-designed for single instruction multiple data (SIMD) style of parallel processing supported by modern processors such as graphical processing units (GPUs). To the best of our knowledge, our algorithm is the first to exploit GPUs, and also the fastest implementation available today, to generate scale-free networks using the preferential attachment model. A detailed performance study is presented to understand the scalability and runtime characteristics of the cuPPA algorithm. In one of the best cases, when executed on an NVidia GeForce 1080 GPU, cuPPA generates a scale-free network of two billion edges in less than 3 seconds.

Alam, Maksudul↗
DOE OSTI2017

Parallel Multivariate Spatio-Temporal Clustering of Large Ecological Datasets on Hybrid Supercomputers

A proliferation of data from vast networks of remote sensing platforms (satellites, unmanned aircraft systems (UAS), airborne etc.), observational facilities (meteorological, eddy covariance etc.), state-of-the-art sensors, and simulation models offer unprecedented opportunities for scientific discovery. Unsupervised classification is a widely applied data mining approach to derive insights from such data. However, classification of very large data sets is a complex computational problem that requires efficient numerical algorithms and implementations on high performance computing (HPC) platforms. Additionally, increasing power, space, cooling and efficiency requirements has led to the deployment of hybrid supercomputing platforms with complex architectures and memory hierarchies like the Titan system at Oak Ridge National Laboratory. The advent of such accelerated computing architectures offers new challenges and opportunities for big data analytics in general and specifically, large scale cluster analysis in our case. Although there is an existing body of work on parallel cluster analysis, those approaches do not fully meet the needs imposed by the nature and size of our large data sets. Moreover, they had scaling limitations and were mostly limited to traditional distributed memory computing platforms. We present a parallel Multivariate Spatio-Temporal Clustering (MSTC) technique based on k-means cluster analysis that can target hybrid supercomputers like Titan. We developed a hybrid MPI, CUDA and OpenACC implementation that can utilize both CPU and GPU resources on computational nodes. We describe performance results on Titan that demonstrate the scalability and efficacy of our approach in processing large ecological data sets.

Sreepathi, Sarat↗
DOE OSTI2017

Decentralized Interleaving of Paralleled Dc-Dc Buck Converters

We present a decentralized control strategy that yields switch interleaving among parallel-connected dc-dc buck converters. The proposed method is based on the digital implementation of the dynamics of a nonlinear oscillator circuit as the controller. Each controller is fully decentralized, i.e., it only requires the locally measured output current to synthesize the pulse width modulation (PWM) carrier waveform and no communication between different controllers is needed. By virtue of the intrinsic electrical coupling between converters, the nonlinear oscillator-based controllers converge to an interleaved state with uniform phase-spacing across PWM carriers. To the knowledge of the authors, this work presents the first fully decentralized strategy for switch interleaving in paralleled dc-dc buck converters.

14 SOLAR ENERGY↗
DOE OSTI2022

A High-Performance Design for Hierarchical Parallelism in the QMCPACK Monte Carlo code

We introduce a new high-performance design for parallelism within the Quantum Monte Carlo code QMCPACK. We demonstrate that the new design is better able to exploit the hierarchical parallelism of heterogeneous architectures compared to the previous GPU implementation. The new version is able to achieve higher GPU occupancy via the new concept of crowds of Monte Carlo walkers, and by enabling more host CPU threads to effectively offload to the GPU. The higher performance is expected to be achieved independent of the underlying hardware, significantly improving developer productivity and reducing code maintenance costs. Scientific productivity is also improved with full support for fallback to CPU execution when GPU implementations are not available or CPU execution is more optimal.

Luo, Ye↗
DOE OSTI2016

Parallel k-means++ for Multiple Shared-Memory Architectures

In recent years k-means++ has become a popular initialization technique for improved k-means clustering. To date, most of the work done to improve its performance has involved parallelizing algorithms that are only approximations of k-means++. In this paper we present a parallelization of the exact k-means++ algorithm, with a proof of its correctness. We develop implementations for three distinct shared-memory architectures: multicore CPU, high performance GPU, and the massively multithreaded Cray XMT platform. We demonstrate the scalability of the algorithm on each platform. In addition we present a visual approach for showing which platform performed k-means++ the fastest for varying data sizes.

data clustering↗
DOE OSTI2016

X: A Comprehensive Analytic Model for Parallel Machines

To continuously comply with Moore’s Law, modern parallel machines become increasingly complex. Effectively tuning application performance for these machines therefore becomes a daunting task. Moreover, identifying performance bottlenecks at application and architecture level, as well as evaluating various optimization strategies, are becoming extremely difficult when the entanglement of numerous correlated factors is being presented. To tackle these challenges, we present a visual analytical model named “X”. It is intuitive and sufficiently flexible to track all the typical features of a parallel machine.

Modeling and Performance Analysis↗
DOE OSTI2018

Efficient, Parallel At-scale Correlation Analysis for Atom Probe Tomography on Hybrid Architectures

Atom probe tomography (APT) is a material probing technique that has undergone dramatic improvements in its capability to map individual atoms within a material sample resulting in data files with hundreds of millions of atoms. Understanding the nano-structural features hidden in these massive amounts of atomic data is a crucial analysis task for materials scientists. However, fast analysis capabilities for large APT workloads remains a critical bottleneck. In this paper, we present the design, implementation and detailed performance evaluations of a parallel software capable of efficiently performing extremely time-consuming correlation analyses of massive high density APT data. Starting with shared memory implementations to motivate our design choices, we extend the implementation to hybrid architectures keeping realistic APT workloads in mind. Detailed performance analyses of three different parallel implementations of the software are supported by empirical results on a Cray XC30 and a Cray XC40 architecture. Its usefulness is demonstrated by reducing the turnaround time of an end-to-end APT correlation analysis on 100 millions atoms by three orders of magnitude using 2048 MPI ranks on 1024 nodes (24 cores per node) of a Cray XC30. The software reported here equips material scientists for the first time with a high-speed scalable capability for efficient and timely analyses of massive APT data.

Lu, Hao↗