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.
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.
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.
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.
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.
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.
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.
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.
Parallel dispatch: a new paradigm of electrical power system dispatch
Modern power systems are evolving into sociotechnical systems with massive complexity, whose real-time operation and dispatch go beyond human capability. Thus, the need for developing and applying new intelligent power system dispatch tools are of great practical significance. In this paper, we introduce the overall business model of power system dispatch, the top level design approach of an intelligent dispatch system, and the parallel intelligent technology with its dispatch applications. We expect that a new dispatch paradigm, namely the parallel dispatch, can be established by incorporating various intelligent technologies, especially the parallel intelligent technology, to enable secure operation of complex power grids, extend system operators U+02BC capabilities, suggest optimal dispatch strategies, and to provide decision-making recommendations according to power system operational goals.
A Parallel Implementation of Electron-Phonon Scattering in Nanoelectronic Devices up to 95k Cores
A quantum transport approach based on the Non-equilibrium Green's Function formalism and the tight-binding method has been developed to investigate the performances of atomistically resolved nanoelectronic devices in the presence of electron-phonon scattering. The model is integrated into a quad-level parallel environment (bias, momentum, energy, and spatial domain decomposition) that scales almost perfectly up to 220k cores in the ballistic limit of electron transport. In this case, the momentum and energy points form a quasi-embarrassingly parallel problem. The novelty in this paper is the inclusion of scattering self-energies that couple all the momenta and several energies together, requiring substantial inter-processor communication. An efficient parallel implementation of electron-phonon scattering is therefore proposed and applied to a realistically extended transistor structure. A good scaling of the simulation walltime up to 95,256 cores and a sustained performance of 142 TFlop/s are reported on the Cray-XT5 Jaguar.
Composing Data Parallel Code for a SPARQL Graph Engine
Big data analytics process large amount of data to extract knowledge from them. Semantic databases are big data applications that adopt the Resource Description Framework (RDF) to structure metadata through a graph-based representation. The graph based representation provides several benefits, such as the possibility to perform in memory processing with large amounts of parallelism. SPARQL is a language used to perform queries on RDF-structured data through graph matching. In this paper we present a tool that automatically translates SPARQL queries to parallel graph crawling and graph matching operations. The tool also supports complex SPARQL constructs, which requires more than basic graph matching for their implementation. The tool generates parallel code annotated with OpenMP pragmas for x86 Shared-memory Multiprocessors (SMPs). With respect to commercial database systems such as Virtuoso, our approach reduces memory occupation due to join operations and provides higher performance. We show the scaling of the automatically generated graph-matching code on a 48-core SMP.
Large Scale Tensor Factorization via Parallel Sketches
Tensor factorization methods have recently gained increased popularity. A key feature that renders tensors attractive is the ability to directly model multi-relational data. In this work, we propose ParaSketch, a parallel tensor factorization algorithm that enables massive parallelism, to deal with large tensors. The idea is to compress the large tensor into multiple small tensors, decompose each small tensor in parallel, and combine the results to reconstruct the desired latent factors. Prior art in this direction entails potentially very high complexity in the (Gaussian) compression and final combining stages. Adopting sketching matrices for compression, the proposed method enjoys a dramatic reduction in compression complexity, and features a much lighter combining step. Moreover, theoretical analysis shows that the compressed tensors inherit latent identifiability under mild conditions, hence establishing correctness of the overall approach. Numerical experiments corroborate the theory and demonstrate the effectiveness of the proposed algorithm.
Parallel elastic elements improve energy efficiency on the STEPPR bipedal walking robot
This study describes how parallel elastic elements can be used to reduce energy consumption in the electric motor driven, fully-actuated, STEPPR bipedal walking robot without compromising or significantly limiting locomotive behaviors. A physically motivated approach is used to illustrate how selectively-engaging springs for hip adduction and ankle flexion predict benefits for three different flat ground walking gaits: human walking, human-like robot walking and crouched robot walking. Based on locomotion data, springs are designed and substantial reductions in power consumption are demonstrated using a bench dynamometer. These lessons are then applied to STEPPR (Sandia Transmission-Efficient Prototype Promoting Research), a fully actuated bipedal robot designed to explore the impact of tailored joint mechanisms on walking efficiency. Featuring high-torque brushless DC motors, efficient low-ratio transmissions, and high fidelity torque control, STEPPR provides the ability to incorporate novel joint-level mechanisms without dramatically altering high level control. Unique parallel elastic designs are incorporated into STEPPR, and walking data shows that hip adduction and ankle flexion springs significantly reduce the required actuator energy at those joints for several gaits. These results suggest that parallel joint springs offer a promising means of supporting quasi-static joint torques due to body mass during walking, relieving motors of the need to support these torques and substantially improving locomotive energy efficiency.
On Parallelizing Single Dynamic Simulation Using HPC Techniques and APIs of Commercial Software
Time-domain simulations are heavily used in today’s planning and operation practices to assess power system transient stability and post-transient voltage/frequency profiles following severe contingencies to comply with industry standards. Because of the increased modeling complexity, it is several times slower than real time for state-of-the-art commercial packages to complete a dynamic simulation for a large-scale model. With the growing stochastic behavior introduced by emerging technologies, power industry has seen a growing need for performing security assessment in real time. This paper presents a parallel implementation framework to speed up a single dynamic simulation by leveraging the existing stability model library in commercial tools through their application programming interfaces (APIs). Several high performance computing (HPC) techniques are explored such as parallelizing the calculation of generator current injection, identifying fast linear solvers for network solution, and parallelizing data outputs when interacting with APIs in the commercial package, TSAT. The proposed method has been tested on a WECC planning base case with detailed synchronous generator models and exhibits outstanding scalable performance with sufficient accuracy.
Numerical Prediction of Cyclic Variability in a Spark Ignition Engine Using a Parallel Large Eddy Simulation Approach
Cycle-to-cycle variability (CCV) is detrimental to IC engine operation and can lead to partial burn, misfire, and knock. Predicting CCV numerically is extremely challenging due to two key reasons. First, high-fidelity methods such as large eddy simulation (LES) are required to accurately resolve the in-cylinder turbulent flow field both spatially and temporally. Second, CCV is experienced over long timescales and hence the simulations need to be performed for hundreds of consecutive cycles. Ameen et al. (2017, "Parallel Methodology to Capture Cyclic Variability in Motored Engines,"Int. J. Engine Res., 18(4), pp. 366-377.) developed a parallel perturbation model (PPM) approach to dissociate this long time-scale problem into several shorter time-scale problems. This strategy was demonstrated for motored engine and it was shown that the mean and variance of the in-cylinder flow field was captured reasonably well by this approach. In the present study, this PPM approach is extended to simulate the CCV in a fired port-fuel injected (PFI) spark ignition (SI) engine. The predictions from this approach are also shown to be similar to the consecutive LES cycles. It is shown that the parallel approach is able to predict the coefficient of variation (COV) of the in-cylinder pressure and burn raterelated parameters with sufficient accuracy, and is also able to predict the qualitative trends in CCV with changing operating conditions. It is shown that this new approach is able to give accurate predictions of the CCV in fired engines in less than one-tenth of the time required for the conventional approach of simulating consecutive engine cycles.
Beam quality conversion factors for parallel-plate ionization chambers in MV photon beams
Purpose: To investigate the behavior of plane-parallel ion chambers in high-energy photon beams through measurements and Monte Carlo simulations. Methods: Ten plane-parallel ion chamber types were obtained from the major ion chamber manufacturers. Absorbed dose-to-water calibration coefficients are measured for these chambers and k{sub Q} factors are determined. In the process, the behaviors of the chambers are characterized through measurements of leakage currents, chamber settling in cobalt-60, polarity and ion recombination behavior, and long-term stability. Monte Carlo calculations of the absorbed dose to the air in the ion chamber and absorbed dose to water are obtained to calculate k{sub Q} factors. Systematic uncertainties in Monte Carlo calculated k{sub Q} factors are investigated by varying material properties and chamber dimensions. Results: Chamber behavior was variable in MV photon beams, especially with regard to chamber leakage and ion recombination. The plane-parallel chambers did not perform as well as cylindrical chambers. Significant differences up to 1.5% were observed in calibration coefficients after a period of eight months although k{sub Q} factors were consistent on average within 0.17%. Chamber-to-chamber variations in k{sub Q} factors for chambers of the same type were at the 0.2% level. Systematic uncertainties in Monte Carlo calculated k{sub Q} factors ranged between 0.34% and 0.50% depending on the chamber type. Average percent differences between measured and calculated k{sub Q} factors were - 0.02%, 0.18%, and - 0.16% for 6, 10, and 25 MV beams, respectively. Conclusions: Excellent agreement is observed on average at the 0.2% level between measured and Monte Carlo calculated k{sub Q} factors. Measurements indicate that the behavior of these chambers is not adequate for their use for reference dosimetry of high-energy photon beams without a more extensive QA program than currently used for cylindrical reference-class ion chambers.
MO-C-17A-10: Comparison of Dose Deformable Accumulation by Using Parallel and Serial Approaches
Purpose: The uncertainty of dose accumulation over multiple CT datasets with deformable fusion may have significant impact on clinical decisions. In this study, we investigate the difference of two dose summation approaches involving deformable fusion. Methods: Five patients, four external beam and one brachytherapy(BT), were chosen for the study. The BT patient was treated with CT-based HDR. The CT image sets acquired in the imageguidance process (8-11 CTs/patient) were used to determine the dose delivered to the four external beam patients. (prostate, pelvis, lung and head and neck). For the HDR patient (cervix), five CT image sets and the corresponding BT plans were used. In total 44 CT datasets and RT dose/plans were imported into the image fusion software MiM (6.0.4) for analysis.For each of the five clinical cases, the dose from each fraction was accumulated into the primary CT dataset by using both Parallel and Serial approaches. The dose-volume histogram (DVH) for CTV and selected organs-at-risks (OAR) were generated. The D95(CTV), OAR(mean) and OAR(max) for the four external beam cases the D90(CTV), and the max dose to bladder and rectum for the BT case were compared. Results: For the four external beam patients, the difference in D95(CTV) were <1.2% PD between the parallel and the serial approaches. The differences of the OAR(mean) and the OAR(max ) range from 0 to 3.7% and <1% PD respectively. For the HDR patient, the dose difference for D90 is 11% PD while that of the max dose to bladder and rectum were 11.5% and 23.3% respectively. Conclusion: For external beam treatments, the parallel and serial approaches have <5% difference probably because tumor volume and OAR have less changes from fraction to fraction. For the brachytherapy case, >10% dose difference between the two approaches was observed as significant volume changes of tumor and OAR were observed among treatment fractions.
Parallelization of heterogeneous reactor calculations on a graphics processing unit
Parallelization is applied to the neutron calculations performed by the heterogeneous method on a graphics processing unit. The parallel algorithm of the modified TREC code is described. The efficiency of the parallel algorithm is evaluated.