Engineering Papers⌕ Search

SEARCH · Engineering Papers

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 1,423 records · Page 79

Isotropic parallel antiferromagnetism in the magnetic field induced charge-ordered state of $\mathrm{Sm Ru_4 P_{12}}$ caused by $p - f$ hybridization

Nature of the field-induced charge-ordered phase (phase II) of SmRu 4 P 12 has been investigated by resonant x-ray diffraction (RXD) and polarized neutron diffraction (PND), focusing on the relationship between the atomic displacements and the antiferromagnetic (AFM) moments of Sm. From the analysis of the interference between the nonresonant Thomson scattering and the resonant magnetic scattering, combined with the spectral function obtained from x-ray magnetic circular dichroism, it is shown that the AFM moment of Sm prefers to be parallel to the field (m AF ∥ H), giving rise to large and small moment sites around which the P 12 and Ru cage contract and expand, respectively. This is associated with the formation of the staggered ordering of the Γ 7 -like and Γ 8 -like crystal-field states, providing a strong piece of evidence for the charge order. PND was also performed to obtain complementary and unambiguous conclusion. In addition, isotropic and continuous nature of phase II is demonstrated by the field-direction invariance of the interference spectrum in RXD. Finally, crucial role of the p-f hybridization is shown by resonant soft x-ray diffraction at the P K edge (1s↔3p), where we detected a resonance due to the spin polarized 3p orbitals reflecting the AFM order of Sm.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Effects of scattering on the field-induced T c enhancement in thin superconducting films in a parallel magnetic field

The problem of the normal-superconducting phase boundary for films in a parallel magnetic field, discussed in the classical paper by Ginzburg and Landau for temperatures close to the critical, is revisited with the help of the microscopic BCS theory for arbitrary temperatures taking pair-breaking and transport scattering into account. Although confirming experimental findings of the T c enhancement by the magnetic field, we find that the transport scattering pushes the phase transition curve to higher fields and higher temperatures for nearly all practical scattering rates. Still, the T c enhancement disappears in the dirty limit. Here, we also consider intriguing changes, such as reentrant superconductivity, caused to the phase boundary by pair-breaking magnetic ions spread on one of the film faces. These features await experimental verification.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Nature of quantum spin liquids of the S = 1 2 Heisenberg antiferromagnet on the triangular lattice: A parallel DMRG study

Here we study the ground-state properties of the quantum spin liquid (QSL) phases of the spin-1/2 antiferromagnetic Heisenberg model on the triangular lattice with nearest- (J 1 ), next-nearest- (J 2 ), and third-neighbor (J 3 ) interactions by using density-matrix renormalization group (DMRG) method. By combining parallel DMRG with SU(2) spin rotational symmetry, we are able to obtain accurate results on large cylinders with length up to L x =48 and circumference L y =6–12. Our results suggest that the QSL phase of the J 1 -J 2 Heisenberg model is gapped which is characterized by the absence of gapless mode, short-range spin-spin and dimer-dimer correlations. In the presence of J 3 interaction, we find that a new critical QSL with a single gapless mode emerges. While both spin-spin and scalar chiral-chiral correlations are short-ranged, dimer-dimer correlations are quasi-long-ranged which decays as a power-law at long distances.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Automated and highly parallelized Bayesian optimization scheme for direct drive fusion experiments on OMEGA

Finding the optimal implosion design on existing experimental facilities for inertial confinement fusion requires an exhaustive search of the vast design parameter space. This is infeasible both with experiments and with simulations. Consequently, a large fraction of the experimentally realizable design space remains unexplored, and new design schemes are challenging to optimize in a reasonable time frame. On the OMEGA laser facility, predictive machine learning models have been developed to accurately forecast the result of an experiment using only inexpensive simulations and the large dataset of prior experimental data. However, the full design space remains vast enough to be unassailable with simple optimization techniques. Here we develop an automated and optimally parallel Bayesian optimization algorithm that can entirely optimize the target and pulse shape of a direct-drive ICF implosion under a given design paradigm. We use this algorithm to find a markedly improved design for the performance implosions on OMEGA that is predicted to hydroequivalently scale to ignition at 2.15 MJ.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Parallel-in-time quantum simulation via Page and Wootters quantum time

In the past few decades, researchers have created a veritable zoo of quantum algorithms by drawing inspiration from classical computing, information theory, and even from physical phenomena. Here, we present quantum algorithms for parallel-in-time simulations that are inspired by the Page and Wootters formalism. In this framework, and thus in our algorithms, the classical time variable of quantum mechanics is promoted to the quantum realm by introducing a Hilbert space of “clock” qubits that are then entangled with the “system” qubits. We show that our algorithms can compute temporal properties over 𝑁 different times of many-body systems by only using log⁡(𝑁) clock qubits. As such, we achieve an exponential trade-off between time and spatial complexities. In addition, we rigorously prove that the entanglement created between the system qubits and the clock qubits has operational meaning, as it encodes valuable information about the system’s dynamics. We also provide a circuit depth estimation of all the protocols, showing a running time advantage in computation times over traditional sequential-in-time algorithms. In particular, for the case when the dynamics are determined by the Aubry-Andre model, we present a hybrid method for which our algorithms have a depth that only scales as 𝒪⁡(log⁡(𝑁)⁢𝑛). As a by-product, we can relate the previous schemes to the problem of equilibration of an isolated quantum system, thus indicating that our framework enables a new dimension for studying dynamical properties of many-body systems.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A high-temperature sample changer for parallelized in situ X-ray studies to efficiently explore reaction space

A sample environment for high-throughput X-ray scattering studies in transmission geometry to probe the mechanism and kinetics of moderate-temperature reactions in solution, molten fluxes and solids is described. This high-temperature sample changer enables efficient studies of reactions that are slow relative to the timescale of the X-ray scattering measurements by allowing up to 18 samples to be probed at the same temperature in parallel. This significantly enhances the throughput ofin situX-ray scattering studies as the sample changer effectively facilitates systematic studies that compare different reaction parameters (e.g.concentration, precursor, composition, additives), reference samples (e.g.background, pure precursors) and replicates (to demonstrate reproducibility) with enhanced consistency afforded by the quasi-simultaneous nature of the measurements. The large sample volumes, compared with those typically used for X-ray scattering measurements, are on a similar scale to those in the laboratory, making the results more directly comparable.

Chemistry↗

BeeSwarm: Enabling Parallel Scaling Performance Measurement in Continuous Integration for HPC Applications

Testing is one of the most important steps in software development–it ensures the quality of software. Continuous Integration (CI) is a widely used testing standard that can report software quality to the developer in a timely manner during development progress. Performance, especially scalability, is another key factor for High Performance Computing (HPC) applications. There are many existing profiling and performance tools for HPC applications, but none of these are integrated into CI tools. In this work, we propose BeeSwarm, an HPC container based parallel scaling performance system that can be easily applied to the current CI test environments. BeeSwarm is mainly designed for HPC application developers who need to monitor how their applications can scale on different compute resources. We demonstrate BeeSwarm using a multi-physics HPC application with Travis CI, GitLab CI and GitHub Actions while using ChameleonCloud and Google Compute Engine as the compute backends. Finally, our results show that BeeSwarm can be used for scalability and performance testing of HPC applications.

97 MATHEMATICS AND COMPUTING↗

CCM vs. CRM Design Optimization of a Boost-derived Parallel Active Power Decoupler for Microinverter Applications

Single-phase inverter or rectifier systems often make use of an auxiliary active power decoupler (APD) to balance the mismatch between steady DC power and fluctuating AC power. This paper deals with efficiency and size optimization of a parallel boost-type APD circuit for PV microinverter applications. Specifically, design of an eGaNFET-based, 400 W APD circuit, employing planar inductor and operating in either continuous conduction mode (CCM) or critical conduction mode (CRM) is considered. Available design variables including inductance value, inductor core geometry, capacitor voltage, switching frequency, and modulation scheme (CCM vs. CRM) are explored to identify Pareto-optimal configurations, which can achieve low California Energy Commission (CEC) efficiency drop while also reducing the footprint area of the inductor. The theoretical study predicts that the optimal CRM design can achieve 37% reduced inductor size, while operating with similar efficiency drop, compared to the optimal CCM design. Experimental results, obtained using two separate 40 V, 400 W hardware prototypes for CCM and CRM, are presented to verify the analyses.

14 SOLAR ENERGY↗

Multiterminal High-Voltage dc Systems with Series-Parallel Valve Group-Based High-Voltage dc Substations

To transfer large amount of power over long distances, multiterminal direct current (MTdc) system based on bipole high-voltage direct current (HVdc) technology is a viable option. However, such system results in large dc transmission loss. The same can be reduced by increasing the dc voltage level. This paper introduces a new MTdc system architecture comprising of series (for increasing dc voltage level) and parallel (for increasing dc current capability) connected HVdc converters. The new architecture is compared with the bipole MTdc architecture in terms of equipment needed and dc transmission loss. The control modifications needed for the MTdc system are identified and the performance of the developed control is verified through electromagnetic transient (EMT) simulations.

Jaldanki, Sreenivasa↗

Fast Parallel Tensor Times Same Vector for Hypergraphs

Hypergraphs are a popular paradigm to rep- resent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hyper- graphs via symmetric adjacency tensors has only recently become computationally feasible for large and complex datasets. To enable scalable computation of these and related hypergraph analytics, here we focus on the Sparse Symmetric Tensor Times Same Vector (S3TTVC) oper- ation. We introduce the Compound Compressed Sparse Symmetric (CCSS) format, an extension of the compact CSS format for hypergraphs of varying hyperedge sizes and present a shared-memory parallel algorithm to compute S3TTVC. We experimentally show S3TTVC computation using the CCSS format achieves better performance than the naive baseline, and is subsequently more performant for hypergraph H-eigenvector centrality.

Shivakumar, Shruti↗

DeepThermo: Deep Learning Accelerated Parallel Monte Carlo Sampling for Thermodynamics Evaluation of High Entropy Alloys

Since the introduction of Metropolis Monte Carlo (MC) sampling, it and its variants have become standard tools used for thermodynamics evaluations of physical systems. However, a long-standing problem that hinders the effectiveness and efficiency of MC sampling is the lack of a generic method (a.k.a. MC proposal) to update the system configurations. Consequently, current practices are not scalable. Here we propose a parallel MC sampling framework for thermodynamics evaluation—DeepThermo. By using deep learning–based MC proposals that can globally update the system configurations, we show that DeepThermo can effectively evaluate the phase transition behaviors of high entropy alloys, which have an astronomical configuration space. For the first time, we directly evaluate a density of states expanding over a range of ~e 10,000 for a real material. We also demonstrate DeepThermo’s performance and scalability up to 3,000 GPUs on both NVIDIA V100 and AMD MI250X-based supercomputers.

Yin, Junqi↗

Toward Automated Detection of Portability Bugs in Kokkos Parallel Programs

Performance-portable programming frameworks provide abstractions for parallel execution to allow easily porting an application to multiple backend programming models, such as CUDA, HIP, and OpenMP. However, programs may still have portability bugs that manifest only on specific backends. Traditional testing is ineffective in discovering these bugs, as it would require concrete execution on all supported hardware configurations for a potentially infinite set of inputs. To mitigate this issue, we focused on a specific programming framework, Kokkos, and identified several categories of common portability bugs. We then developed Klokkos, a static analysis approach based on symbolic execution that can run on commodity hardware, before execution on supercomputers. As a proof-of-concept, we ran Klokkos on examples encoding the identified bugs. Our results show that Klokkos is effective, efficient, and precise: it detected all the considered bugs, quickly, and without any false positives. Although preliminary, our results motivate further research and development in this direction.

Kale, Vivek↗

Decentralized Carrier Phase Shifting for Optimal Harmonic Minimization in Asymmetric Parallel-Connected Inverters

This paper presents a carrier phase shifting technique for minimizing the aggregate harmonics in networks of asymmetric parallel-connected inverters for distributed power generation system applications. The proposed technique is: 1) implemented in a decentralized manner, relying only on local voltage and current measurements, and 2) optimal in the sense that it minimizes a cost function representing the carrier-frequency current harmonics. The analysis indicates that the proposed optimal carrier phase shifting technique can enable order-of-magnitude reductions in harmonic power, and also universal improvements compared to symmetric carrier interleaving for asymmetric inverter networks. Moreover, compared to existing methods that require either centralized communication or information exchange between inverters to coordinate carriers, the proposed technique is completely decentralized, which provides important practical benefits for implementation, including improved robustness and reduced cost. The technique is experimentally validated on a network of three single-phase 2-kW inverters and demonstrates a 36.5% reduction in the weighted total harmonic distortion factor of the aggregate inverter current, and the ability to converge to the optimal carrier phase spacing dynamically in less than one line frequency cycle (16.7 ms) in steady state and transient operating conditions.

42 ENGINEERING↗

Comparison of CCM- and CRM-Based Boost Parallel Active Power Decoupler for PV Microinverter

Single-phase inverter or rectifier systems often make use of an active power decoupler (APD) to balance the mismatch between constant dc power and fluctuating ac power. This article deals with the comparison of continuous conduction mode (CCM) and critical conduction mode (CRM) operation-based design of a parallel boost-type APD for photovoltaic microinverter applications. From a design perspective, multiobjective analysis of efficiency, volume, and cost is explored within a decision space including planar inductors, gallium nitride based devices, film capacitors, switching frequency, and modulation (CCM vs. CRM). The theoretical study analyzes all possible design configurations within CCM and CRM and identifies Pareto-optimal designs, from which the selected CRM design can achieve reduced system volume and lower cost with the use of smaller inductor core, while operating with similar California Energy Commission efficiency drop as the selected CCM design. From a control perspective, a pulsewidth modulation based control strategy is proposed to implement closed-loop CRM modulation that does not rely on zero-crossing detection. Furthermore, closed-loop systems are designed for the optimal CCM and CRM realizations, and the final system characteristics are compared. Experimental results, obtained using two separate 40-V, 400-W hardware prototypes for CCM and CRM, are presented to verify the analyses.

42 ENGINEERING↗

Memory-Aware External Facelist Calculation: A Data-Parallel Atomic Hash Counting Approach

Unstructured volumetric meshes serve as fundamental data representations in various scientific simulations and analyses. They play a crucial role in representing complex computational domains and are essential for important numerical techniques, such as finite element analysis. Whenever such a mesh is read from a file, streamed in-situ, or generated by algorithms, scientific visualization libraries rely on calculating the external surface of a geometry, named “external facelist”, to produce a polygonal mesh for rendering. Consequently, external facelist calculation has become one of the most widely used algorithms in the scientific visualization domain, necessitating optimal performance. In this paper, we explore relevant work on external facelist calculation algorithms in two common visualization libraries, VTK and Viskores, assess their performance and memory constraints, and introduce a novel memory-aware external facelist calculation algorithm employing an atomic hash counting approach. This algorithm fully leverages Viskores' data-parallel primitive operations, facilitating its execution across diverse many-core architectures. Our algorithm features the lowest memory footprint on the GPU and the second-lowest on the CPU among all evaluated methods, and it also delivers the fastest performance on both CPU and GPU. It has been made available under an open-source license in the VTK and Viskores visualization systems.

Tsalikis, Spiros [Kitware] (ORCID:0000000151137195↗

Biochemical parallels between catabolic pathways for lignin-associated aromatic dimers

Lignin is one of the most common biopolymers on Earth. In nature, lignin is primarily deconstructed by fungi into mixtures of aromatic compounds that are then assimilated by bacteria and fungi. Industrially, lignin is primarily generated as a byproduct of pulp and paper production and burned for process heat. However, if the appropriate assimilatory pathways were identified, deconstructed lignin could be funneled into value-added products using engineered bacteria. Foundational work has described pathways for assimilation of diverse monomeric aromatic compounds such as protocatechuate, ferulate, and syringate, as well as select dimers including those with β-O-4 and 5-5 interunit linkages. Recent advances have elucidated additional pathways for dimer assimilation, including pathways for new substrates as well as parallel pathways for previously characterized substrates. Comparing these dimer assimilation pathways can illuminate the underlying biochemical logic of assimilation for lignin-associated aromatic dimers and provide opportunities for metabolic engineering to enhance lignin valorization.

Sphingomonas↗

Efficient Parallel Sparse Symmetric Tucker Decomposition for High-Order Tensors

Tensor based methods are receiving renewed attention in recent years due to their prevalence in diverse real-world applications. There is considerable literature on tensor representations and algorithms for tensor decompositions, both for dense and sparse tensors. Many applications in hypergraph analytics, machine learning, psychometry, and signal processing result in tensors that are both sparse and symmetric, making it an important class for further study. Similar to the critical Tensor Times Matrix chain operation (TTMc) in general sparse tensors, the Sparse Symmetric Tensor Times Same Matrix chain (S3TTMc) operation is compute and memory intensive due to high tensor order and the associated factorial explosion in the number of non-zeros. In this work, we present a novel compressed storage format CSS for sparse symmetric tensors, along with an efficient parallel algorithm for the S3TTMc operation. We theoretically establish that S3TTMc on CSS achieves a better memory versus run-time trade-off compared to state-of-the-art implementations. We demonstrate experimental findings that confirm these results and achieve up to 2.9× speedup on synthetic and real datasets.

Shivakumar, Shruti↗

A massively parallel and scalable multi-CPU material point method

Harnessing the power of modern multi-GPU architectures, we present a massively parallel simulation system based on the Material Point Method (MPM) for simulating physical behaviors of materials undergoing complex topological changes, self-collision, and large deformations. Our system makes three critical contributions. First, we introduce a new particle data structure that promotes coalesced memory access patterns on the GPU and eliminates the need for complex atomic operations on the memory hierarchy when writing particle data to the grid. Second, we propose a kernel fusion approach using a new Grid-to-Particles-to-Grid (G2P2G) scheme, which efficiently reduces GPU kernel launches, improves latency, and significantly reduces the amount of global memory needed to store particle data. Finally, we introduce optimized algorithmic designs that allow for efficient sparse grids in a shared memory context, enabling us to best utilize modern multi-GPU computational platforms for hybrid Lagrangian-Eulerian computational patterns. We demonstrate the effectiveness of our method with extensive benchmarks, evaluations, and dynamic simulations with elastoplasticity, granular media, and fluid dynamics. In comparisons against an open-source and heavily optimized CPU-based MPM codebase [Fang et al. 2019] on an elastic sphere colliding scene with particle counts ranging from 5 to 40 million, our GPU MPM achieves over 100x per-time-step speedup on a workstation with an Intel 8086K CPU and a single Quadro P6000 GPU, exposing exciting possibilities for future MPM simulations in computer graphics and computational science. Moreover, compared to the state-of-the-art GPU MPM method [Hu et al. 2019a], we not only achieve 2x acceleration on a single GPU but our kernel fusion strategy and Array-of-Structs-of-Array (AoSoA) data structure design also generalizes to multi-GPU systems. Our multi-GPU MPM exhibits near-perfect weak and strong scaling with 4 GPUs, enabling performant and large-scale simulations on a 10243 grid with close to 100 million particles with less than 4 minutes per frame on a single 4-GPU workstation and 134 million particles with less than 1 minute per frame on an 8-GPU workstation.

Wang, Xinlei↗