Search NASA⌕ Search

SEARCH · Search NASA

Results for “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 991 records · Page 55

Assessment of the strength of kinetic effects of parallel electron transport in the SOL and divertor of JET high radiative H-mode plasmas using EDGE2D-EIRENE and KIPP codes

The kinetic code for plasma periphery (KIPP) was used here to assess the importance of the kinetic effects of parallel electron transport in the scrape-off layer (SOL) and divertor of JET high radiative H-mode inter-ELM plasma conditions with the ITER-like wall and strong nitrogen (N 2 ) injection. Plasma parameter profiles along a magnetic field from one of the EDGE2D-EIRENE simulation cases were used as an input for KIPP runs. Profiles were maintained by particle and power sources. KIPP generated electron distribution functions, f e , parallel power fluxes, electron–ion thermoforces, Debye sheath potential drops and electron sheath transmission factors at divertor targets. For heat fluxes in the main SOL, KIPP results showed deviations from classical (e.g. Braginskii) fluxes by factors typically of ~1.5, sometimes up to 2, with the flux limiting for more upstream positions and flux enhancement near entrances to the divertor. In the divertor, at the same time, for radial positions closer to the separatrix, very large heat flux enhancement factors of up to ten or even higher, indicative of a strong nonlocal heat transport, were found at the outer target, with heat power flux density exhibiting bump-on-tail features at high energies. Under such extreme conditions, however, contributions of conductive power fluxes to total power fluxes were strongly reduced, with convective power fluxes becoming comparable, or sometimes exceeding, conductive power fluxes. Electron–ion thermoforce, on the other hand, which is known to be determined mostly by thermal and subthermal electrons, was found to be in good agreement with Braginskii formulas, including the Z eff dependence. Overall, KIPP results indicate, at least for the plasma conditions used in this modelling, a sizable, but not dominant, effect of kinetics on parallel electron transport.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A phase-shift-periodic parallel boundary condition for low-magnetic-shear scenarios

Abstract We formulate a generalized periodic boundary condition as a limit of the standard twist-and-shift parallel boundary condition that is suitable for simulations of plasmas with low magnetic shear. This is done by applying a phase shift in the binormal direction when crossing the parallel boundary. While this phase shift can be set to zero without loss of generality in the local flux-tube limit when employing the twist-and-shift boundary condition, we show that this is not the most general case when employing periodic parallel boundaries, and may not even be the most desirable. A non-zero phase shift can be used to avoid the convective cells that plague simulations of the three-dimensional Hasegawa–Wakatani system, and is shown to have measurable effects in periodic low-magnetic-shear gyrokinetic simulations. We propose a numerical program where a sampling of periodic simulations at random pseudo-irrational flux surfaces are used to determine physical observables in a statistical sense. This approach can serve as an alternative to applying the twist-and-shift boundary condition to low-magnetic-shear scenarios, which, while more straightforward, can be computationally demanding.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Parallelized Kalman-Filter-Based Reconstruction of Particle Tracks on Many-Core Architectures

Faced with physical and energy density limitations on clock speed, contemporary microprocessor designers have increasingly turned to on-chip parallelism for performance gains. Algorithms should accordingly be designed with ample amounts of fine-grained parallelism if they are to realize the full performance of the hardware. This requirement can be challenging for algorithms that are naturally expressed as a sequence of small-matrix operations, such as the Kalman filter methods widely in use in high-energy physics experiments. In the High-Luminosity Large Hadron Collider (HL-LHC), for example, one of the dominant computational problems is expected to be finding and fitting charged-particle tracks during event reconstruction; today, the most common track-finding methods are those based on the Kalman filter. Experience at the LHC, both in the trigger and offline, has shown that these methods are robust and provide high physics performance. Previously we reported the significant parallel speedups that resulted from our efforts to adapt Kalman-filter-based tracking to many-core architectures such as Intel Xeon Phi. Here we report on how effectively those techniques can be applied to more realistic detector configurations and event complexity.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Optimizing the hit finding algorithm for liquid argon TPC neutrino detectors using parallel architectures

Neutrinos are particles that interact rarely, so identifying them requires large detectors which produce lots of data. Processing this data with the computing power available is becoming even more difficult as the detectors increase in size to reach their physics goals. Liquid argon time projection chamber (LArTPC) neutrino experiments are expected to grow in the next decade to have 100 times more wires than in currently operating experiments, and modernization of LArTPC reconstruction code, including parallelization both at data- and instruction-level, will help to mitigate this challenge. The LArTPC hit finding algorithm is used across multiple experiments through a common software framework. In this paper we discuss a parallel implementation of this algorithm. Using a standalone setup we find speedup factors of two times from vectorization and 30–100 times from multi-threading on Intel architectures. The new version has been incorporated back into the framework so that it can be used by experiments. On a serial execution, the integrated version is about 10 times faster than the previous one and, once parallelization is enabled, more speedups comparable to the standalone program are achieved.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

GROMACS 4.5: A high-throughput and highly parallel open source molecular simulation toolkit

In this study, molecular simulation has historically been a low-throughput technique, but faster computers and increasing amounts of genomic and structural data are changing this by enabling large-scale automated simulation of, for instance, many conformers or mutants of biomolecules with or without a range of ligands. At the same time, advances in performance and scaling now make it possible to model complex biomolecular interaction and function in a manner directly testable by experiment. These applications share a need for fast and efficient software that can be deployed on massive scale in clusters, web servers, distributed computing or cloud resources. As a result, we present a range of new simulation algorithms and features developed during the past 4 years, leading up to the GROMACS 4.5 software package. The software now automatically handles wide classes of biomolecules, such as proteins, nucleic acids and lipids, and comes with all commonly used force fields for these molecules built-in. GROMACS supports several implicit solvent models, as well as new free-energy algorithms, and the software now uses multithreading for efficient parallelization even on low-end systems, including windows-based workstations. Together with hand-tuned assembly kernels and state-of-the-art parallelization, this provides extremely high performance and cost efficiency for high-throughput as well as massively parallel simulations.

97 MATHEMATICS AND COMPUTING↗

Regional heritability advanced complex trait analysis for GPU and traditional parallel architectures

Motivation: Quantification of the contribution of genetic variation to phenotypic variation for complex traits becomes increasingly computationally demanding with increasing numbers of single-nucleotide polymorphisms and individuals. To meet the challenges in making feasible large-scale studies, we present the REgional heritability advanced complex trait analysis software. Adapted from advanced complex trait analysis (and, in turn, genome-wide complex trait analysis), it is tailored to exploit the parallelism present in modern traditional and graphics processing unit (GPU)-accelerated machines, from workstations to supercomputers. Results: We adapt the genetic relationship matrix estimation algorithm to remove limitations on memory, allowing the analysis of large datasets. Further, we build on this to develop a version of the code able to efficiently exploit GPU-accelerated systems for both the genetic relationship matrix and REstricted maximum likelihood (REML) parts of the analysis, offering substantial speedup over the traditional central processing unit version. We develop the ability to analyze multiple small regions of the genome across multiple compute nodes in parallel, following the ‘regional heritability’ approach. We demonstrate the new software using 1024 GPUs in parallel on one of the world’s fastest supercomputers. Availability: The code is freely available at http://www.epcc.ed.ac.uk/software-products

59 BASIC BIOLOGICAL SCIENCES↗

Drosophila melanogaster pigmentation demonstrates adaptive phenotypic parallelism over multiple spatiotemporal scales

Abstract Populations are capable of responding to environmental change over ecological timescales via adaptive tracking. However, the translation from patterns of allele frequency change to rapid adaptation of complex traits remains unresolved. We used abdominal pigmentation in Drosophila melanogaster as a model phenotype to address the nature, genetic architecture, and repeatability of rapid adaptation in the field. We show that D. melanogaster pigmentation evolves as a highly parallel and deterministic response to shared environmental variation across latitude and season in natural North American populations. We then experimentally evolved replicate, genetically diverse fly populations in field mesocosms to remove any confounding effects of demography and/or cryptic structure that may drive patterns in wild populations; we show that pigmentation rapidly responds, in parallel, in fewer than 15 generations. Thus, pigmentation evolves concordantly in response to spatial and temporal climatic axes. We next examined whether phenotypic differentiation was associated with allele frequency change at loci with established links to genetic variance in pigmentation in natural populations. We found that across all spatial and temporal scales, phenotypic patterns were associated with variation at pigmentation-related loci, and the sets of genes we identified at each scale were largely nonoverlapping. Therefore, our findings suggest that parallel phenotypic evolution is associated with distinct components of the polygenic architecture shifting across each environmental axis to produce redundant adaptive patterns.

Evolutionary Biology↗

The hTERT core promoter forms three parallel G-quadruplexes

The structure of the 68 nt sequence with G-quadruplex forming potential within the hTERT promoter is disputed. One model features a structure with three stacked parallel G-quadruplex units, while another features an unusual duplex hairpin structure adjoined to two stacked parallel and antiparallel quadruplexes. We report here the results of an integrated structural biology study designed to distinguish between these possibilities. As part of our study, we designed a sequence with an optimized hairpin structure and show that its biophysical and biochemical properties are inconsistent with the structure formed by the hTERT wild-type sequence. By using circular dichroism, thermal denaturation, nuclear magnetic resonance spectroscopy, analytical ultracentrifugation, small-angle X-ray scattering, molecular dynamics simulations and a DNase I cleavage assay we found that the wild type hTERT core promoter folds into a stacked, three-parallel G-quadruplex structure. The hairpin structure is inconsistent with all of our experimental data obtained with the wild-type sequence. All-atom models for both structures were constructed using molecular dynamics simulations. These models accurately predicted the experimental hydrodynamic properties measured for each structure. We found with certainty that the wild-type hTERT promoter sequence does not form a hairpin structure in solution, but rather folds into a compact stacked three-G-quadruplex conformation.

59 BASIC BIOLOGICAL SCIENCES↗

Random fields from quenched disorder in an archetype for correlated electrons: The parallel spin stripe phase of La 1.6 – x Nd 0.4 Sr x CuO 4 at the 1/8 anomaly

The parallel stripe phase is remarkable both in its own right, and in relation to the other phases with which it coexists. Its inhomogeneous nature makes such states susceptible to random fields from quenched magnetic vacancies. Here we argue this is the case by introducing low concentrations of nonmagnetic Zn impurities (0%–10%) into La 1.6–x ⁢Nd 0.4⁢ Sr x ⁢CuO 4 (Nd-LSCO) with x=0.125 in single-crystal form, well below the percolation threshold of ~41% for a two-dimensional square lattice. Elastic neutron scattering measurements on these crystals show clear magnetic quasi-Bragg peaks at all Zn dopings. While all the Zn-doped crystals display order parameters that merge into each other and the background at ~68 K, the temperature dependence of the order parameter as a function of Zn concentration is drastically different. This result is consistent with meandering charge stripes within the parallel stripe phase, which are pinned in the presence of quenched magnetic vacancies. In turn it implies vacancies that preferentially occupy sites within the charge stripes, and hence that can be very effective at disrupting superconductivity in Nd-LSCO (x=0.125), and, by extension, in all systems exhibiting parallel stripes.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Parallel hybrid textures of lepton mass matrices

We analyze the parallel hybrid texture structures in the charged lepton and the neutrino sector. These parallel hybrid texture structures have physical implications as they cannot be obtained from arbitrary lepton mass matrices through weak basis transformations. The total 60 parallel hybrid texture structures can be grouped into 12 classes, and all the hybrid textures in the same class have identical physical implications. We examine all 12 classes under the assumption of nonfactorizable phases in the neutrino mass matrix. Five out of the total 12 classes are found to be phenomenologically disallowed. We study the phenomenological implications of the allowed classes for 1-3 mixing angle, Majorana and Dirac-type CP violating phases. Interesting constraints on effective Majorana mass are obtained for all the allowed classes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Analysis of Circulating Harmonic Currents in Paralleled Three Level ANPC Inverters using SVM

In paralleled voltage source inverters (VSI), circulating current has both high frequency and low frequency components, and its spectrum highly depends on the modulation scheme. Previous research has mostly focused on the circulating current suppression for paralleled two-level VSIs. Little literature exists on similar analysis for paralleled three-level VSIs using space vector modulation. A detailed circulating current spectrum on full frequency range has not been well developed. This paper presents an improved analytical model for three-level space vector modulation (SVM), considering the impacts of regularly sampled reference and dead time. Then, circulating harmonic currents are determined across the full frequency range for various interleaving angles of two three-level ANPC inverters. The calculated harmonics are also verified by experimental results.

Niu, Jiahao↗

Parallel variable selection for effective performance prediction

Large data analysis problems often involve a large number of variables, and the corresponding analysis algorithms may examine all variable combinations to find the optimal solution. For example, to model the time required to complete a scientific workflow, we need to consider the impact of dozens of parameters. To reduce the model building time and reduce the likelihood of overfitting, we look to variable selection methods to identify the critical variables for the performance model. In this work, we create a combination of variable selection and performance prediction methods that is as effective as the exhaustive search approach when the exhaustive search could be completed in a reasonable amount of time. To handle the cases where the exhaustive search is too time consuming, we develop the parallelized variable selection algorithm. Additionally, we develop a parallel grouping mechanism that further reduces the variable selection time by 70%.As a case study, we exercise the variable selection technique with the performance measurement data from the Palomar Transient Factory (PTF) workflow. The application scientists have determined that about 50 variables and parameters are important to the performance of the workflows. Our tests show that the Sequential Backward Selection algorithm is able to approximate the optimal subset relatively quickly. By reducing the number of variables used to build the model from 50 to 4, we are able to maintain the prediction quality while reducing the model building time by a factor of 6. Using the parallelization and grouping techniques we developed in this work, the variable selection process was reduced from over 18 hours to 15 minutes while ending up with the same variable subset.

Wang, J↗

Reduced-Order Structure-Preserving Model for Parallel-Connected Three-Phase Grid-Tied Inverters

Next-generation power networks will contain large numbers of grid-connected inverters satisfying a significant fraction of system load. Since each inverter model has a relatively large number of dynamic states, it is impractical to analyze complex system models where the full dynamics of each inverter are retained. To address this challenge, we derive a reduced-order structure-preserving model for parallel-connected grid-tied three-phase inverters. Here, each inverter in the system is assumed to have a full-bridge topology, LCL filter at the point of common coupling, and the control architecture for each inverter includes a current controller, a power controller, and a phase-locked loop for grid synchronization. We outline a structure-preserving reduced-order inverter model with lumped parameters for the setting where the parallel inverters are each designed such that the filter components and controller gains scale linearly with the power rating. By structure preserving, we mean that the reduced-order three-phase inverter model is also composed of an LCL filter, a power controller, current controller, and PLL. We show that the system of parallel inverters can be modeled exactly as one aggregated inverter unit and this equivalent model has the same number of dynamical states as any individual inverter in the system. Numerical simulations validate the reduced-order model.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Unbalanced Parallel I/O: An Often-Neglected Side Effect of Lossy Scientific Data Compression

Lossy compression techniques have demonstrated promising results in significantly reducing the scientific data size while guaranteeing the compression error bounds. However, one important yet often neglected side effect of lossy scientific data compression is its impact on the performance of parallel I/O. Our key observation is that the compressed data size is often highly skewed across processes in lossy scientific compression. To understand this behavior, we conduct extensive experiments where we apply three lossy compressors MGARD, ZFP, and SZ, which are specifically designed and optimized for scientific data, to three real-world scientific applications Gray-Scott simulation, WarpX, and XGC. Our analysis result demonstrates that the size of the compressed data is always skewed even if the original data is evenly decomposed among processes. Such skewness widely exists in different scientific applications using different compressors as long as the information density of the data varies across processes. We then systematically study how this side effect of lossy scientific data compression impacts the performance of parallel I/O. We observe that the skewness in the sizes of the compressed data often leads to I/O imbalance, which can significantly reduce the efficiency of I/O bandwidth utilization if not properly handled. In addition, writing data concurrently to a single shared file through MPI-IO library is more sensitive to the unbalanced I/O loads. Therefore, we believe our research community should pay more attention to the unbalanced parallel I/O caused by lossy scientific data compression.

Wang, Xinying↗

Parallel k-means Clustering of Geospatial Data Sets Using Manycore CPU Architectures

The increasing availability of high-resolution geospatiotemporal data sets from sources such as observatory networks, remote sensing platforms, and computational Earth system models has opened new possibilities for knowledge discovery and mining of weather, climate, ecological, and other geoscientific data sets fused from disparate sources. Many of the standard tools used on individual workstations are impractical for the analysis and synthesis of data sets of this size; however, new algorithmic approaches that can effectively utilize the complex memory hierarchies and the extremely high levels of parallelism available in state-of-the-art high-performance computing platforms can enable such analysis. Here, we describe pKluster, an open-source tool we have developed for accelerated k-means clustering of geospatial and geospatiotemporal data, and discuss algorithmic modifications and code optimizations we have made to enable it to effectively use parallel machines based on novel CPU architectures—such as the Intel “Knights Landing” Xeon Phi and Skylake Xeon processors—with many cores and hardware threads, and employing significant single instruction, multiple data (SIMD) parallelism. We outline some applications of the code in ecology and climate science contexts and present a detailed discussion of the performance of the code for one such application, LiDAR-derived vertical vegetation structure classification.

Mills, Richard T↗

Iso-Energy-Efficiency: An Approach to Power Constrained Parallel Computation

Future large scale high performance supercomputer systems require high energy efficiency to achieve exaflops computational power and beyond. Despite the need to understand energy efficiency in high-performance systems, there are few techniques to evaluate energy efficiency at scale. In this paper, we propose a system level iso-energy-efficiency model to analyze, evaluate and predict energy-performance of data intensive parallel applications with various execution patterns running on large scale power-aware clusters. Our analytical model can help users explore the effects of machine and application dependent characteristics on system energy efficiency and isolate efficient ways to scale system parameters (e.g. processor count, CPU power/frequency, workload size and network bandwidth) to balance energy use and performance. We derive our iso-energy-efficiency model and apply it to the NAS Parallel Benchmarks on two power-aware clusters. Our results indicate that the model accurately predicts total system energy consumption within 5% error on average for parallel applications with various execution and communication patterns. We demonstrate effective use of the model for various application contexts and in scalability decision-making.

Song, Shuaiwen↗

Communication-Avoiding Parallel Sparse-Dense Matrix-Matrix Multiplication

Multiplication of a sparse matrix with a dense matrix is a building block of an increasing number of applications in many areas such as machine learning and graph algorithms. However, most previous work on parallel matrix multiplication considered only both dense or both sparse matrix operands. This paper analyzes the communication lower bounds and compares the communication costs of various classic parallel algorithms in the context of sparse-dense matrix-matrix multiplication. We also present new communication-avoiding algorithms based on a 1D decomposition, called 1.5D, which - while suboptimal in dense-dense and sparse-sparse cases - outperform the 2D and 3D variants both theoretically and in practice for sparse-dense multiplication. Our analysis separates one-time costs from per iteration costs in an iterative machine learning context. Experiments demonstrate speedups up to 100x over a baseline 3D SUMMA implementation and show parallel scaling over 10 thousand cores.

Koanantakool, Penporn↗