Search NASA⌕ Search

SEARCH · Search NASA

Results for “parallel implementation”

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
All sourcesNASA NTRSDOE OSTI
DOE OSTI2016

Computing Maximum Cardinality Matchings in Parallel on Bipartite Graphs via Tree-Grafting

It is difficult to obtain high performance when computing matchings on parallel processors because matching algorithms explicitly or implicitly search for paths in the graph, and when these paths become long, there is little concurrency. In spite of this limitation, we present a new algorithm and its shared-memory parallelization that achieves good performance and scalability in computing maximum cardinality matchings in bipartite graphs. This algorithm searches for augmenting paths via specialized breadth-first searches (BFS) from multiple source vertices, hence creating more parallelism than single source algorithms. Algorithms that employ multiple-source searches cannot discard a search tree once no augmenting path is discovered from the tree, unlike algorithms that rely on single-source searches. We describe a novel tree-grafting method that eliminates most of the redundant edge traversals resulting from this property of multiple-source searches. We also employ the recent direction-optimizing BFS algorithm as a subroutine to discover augmenting paths faster. Our algorithm compares favorably with the current best algorithms in terms of the number of edges traversed, the average augmenting path length, and the number of iterations. Here, we provide a proof of correctness for our algorithm. Our NUMA-aware implementation is scalable to 80 threads of an Intel multiprocessor and to 240 threads on an Intel Knights Corner coprocessor. On average, our parallel algorithm runs an order of magnitude faster than the fastest algorithms available. The performance improvement is more significant on graphs with small matching number.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Wide-Bandgap Semiconductor Amplifiers for Fusion Plasma Heating and Control

This paper discusses power electronics developed under the ARPA-E GAMOW program to support nuclear fusion power production. The goal of this project was to develop and assess the potential for wide-bandgap (WBG) semiconductor devices in power electronics to enable high-efficiency and high-voltage solid-state systems for fusion plasma generation, heating, and control. The power electronics use an architecture in which multiple high-power boards can be combined to produce megawatt-level power, where using multiple boards provides high reliability. Two main areas of power electronics boards are developed in this project for fusion plasma heating and control applications: (1) pulse generation and control and (2) radiofrequency generation. The first area is for boards capable of driving high-voltage millisecond pulses at high duty cycles. The envisioned application of these pulses is in plasma control of magnetohydrodynamic instabilities, plasma position, and edge-localized modes. Pulse-width modulation allows for the implementation of a wide variety of linear and nonlinear control systems. The boards developed for this project could actuate control coils based on digital input signals and can be parallelized to provide megawatts of output power. The design of the pulse generator is a low-side load switch. A load switch was designed and constructed that utilized 2-kV-rated field-effect transistor (FET)-based cascodes developed by Qorvo under this project to perform initial testing of these cascodes. The second area is being implemented using class E amplifiers with WBG devices and a reactance steering network to handle inductive or capacitive plasma loads. Applications include ion cyclotron resonance heating (ICRH) and high-harmonic fast-wave (HHFW) heating. A class E reactance steering network is demonstrated in modeling and experiment with a resistive-inductive load that models an inductively-coupled plasma. Power combining of boards with class E reactance steering networks is also simulated and demonstrated experimentally, to enable scaling up to high power. Modeling of high-power-density cooling and remaining useful life is conducted to enable reliable, effectively cooled high-power electronics for fusion applications.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗
DOE OSTI2024

Formal Definitions and Performance Comparison of Consistency Models for Parallel File Systems

The semantics of HPC storage systems are defined by the consistency models to which they abide. Storage consistency models have been less studied than their counterparts in memory systems, with the exception of the POSIX standard and its strict consistency model. The use of POSIX consistency imposes a performance penalty that becomes more significant as the scale of parallel file systems increases and the access time to storage devices, such as node-local solid storage devices, decreases. While some efforts have been made to adopt relaxed storage consistency models, these models are often defined informally and ambiguously as by-products of a particular implementation. Here in this work, we establish a connection between memory consistency models and storage consistency models and revisit the key design choices of storage consistency models from a high-level perspective. Further, we propose a formal and unified framework for defining storage consistency models and a layered implementation that can be used to easily evaluate their relative performance for different I/O workloads. Finally, we conduct a comprehensive performance comparison of two relaxed consistency models on a range of commonly seen parallel I/O workloads, such as checkpoint/restart of scientific applications and random reads of deep learning applications. We demonstrate that for certain I/O scenarios, a weaker consistency model can significantly improve the I/O performance. For instance, in small random reads that are typically found in deep learning applications, session consistency achieved a 5x improvement in I/O bandwidth compared to commit consistency, even at small scales.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Electromechanical memcapacitor model offering biologically plausible spiking.

In this article, we introduce a new nanoscale electromechanical device - a leaky memcapacitor - and show that it may be useful for the hardware implementation of spiking neurons. The leaky memcapacitor is a movableplate capacitor that becomes quite conductive when the plates come close to each other. The equivalent circuit of the leaky memcapacitor involves a memcapacitive and memristive system connected in parallel. In the leaky memcapacitor, resistance and capacitance depend on the same internal state variable, which is the displacement of the movable plate. We have performed a comprehensive analysis showing that several types of spiking observed in biological neurons can be implemented with the leaky memcapacitor. Significant attention is paid to the dynamic properties of the model. As in leaky memcapacitors the capacitive, leaking resistive, and reset functionalities are implemented naturally within the same device structure, their use will simplify the creation of spiking neural networks.

Zhang, Zixi↗
DOE OSTI2015

Tunable beam displacer

We report the implementation of a tunable beam displacer, composed of a polarizing beam splitter (PBS) and two mirrors, that divides an initially polarized beam into two parallel beams whose separation can be continuously tuned. The two output beams are linearly polarized with either vertical or horizontal polarization and no optical path difference is introduced between them. The wavelength dependence of the device as well as the maximum separation between the beams achievable is limited mainly by the PBS characteristics.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗
DOE OSTI2016

A Well-Posed Two Phase Flow Model and its Numerical Solutions for Reactor Thermal-Fluids Analysis

A 7-equation two-phase flow model and its numerical implementation is presented for reactor thermal-fluids applications. The equation system is well-posed and treats both phases as compressible flows. The numerical discretization of the equation system is based on the finite element formalism. The numerical algorithm is implemented in the next generation RELAP-7 code (Idaho National Laboratory (INL)’s thermal-fluids code) built on top of an other INL’s product, the massively parallel multi-implicit multi-physics object oriented code environment (MOOSE). Some preliminary thermal-fluids computations are presented.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗
DOE OSTI2015

Interactions of model biomolecules. Benchmark CC calculations within MOLCAS

We present results using the OVOS approach (Optimized Virtual Orbitals Space) aimed at enhancing the effectiveness of the Coupled Cluster calculations. This approach allows to reduce the total computer time required for large-scale CCSD(T) calculations about ten times when the original full virtual space is reduced to about 50% of its original size without affecting the accuracy. The method is implemented in the MOLCAS computer program. When combined with the Cholesky decomposition of the two-electron integrals and suitable parallelization it allows calculations which were formerly prohibitively too demanding. We focused ourselves to accurate calculations of the hydrogen bonded and the stacking interactions of the model biomolecules. Interaction energies of the formaldehyde, formamide, benzene, and uracil dimers and the three-body contributions in the cytosine – guanine tetramer are presented. Other applications, as the electron affinity of the uracil affected by solvation are also shortly mentioned.

74 ATOMIC AND MOLECULAR PHYSICS↗
DOE OSTI2015

Performance evaluation of OpenFOAM on many-core architectures

In this article application of Open Source Field Operation and Manipulation (OpenFOAM) C++ libraries for solving engineering problems on many-core architectures is presented. Objective of this article is to present scalability of OpenFOAM on parallel platforms solving real engineering problems of fluid dynamics. Scalability test of OpenFOAM is performed using various hardware and different implementation of standard PCG and PBiCG Krylov iterative methods. Speed up of various implementations of linear solvers using GPU and MIC accelerators are presented in this paper. Numerical experiments of 3D lid-driven cavity flow for several cases with various number of cells are presented.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
DOE OSTI2024

A gyrokinetic simulation model for 2D equilibrium potential in the scrape-off layer of a field-reversed configuration

The equilibrium potential structure in the scrape-off layer (SOL) of the field-reversed configuration (FRC) can be affected by the penetration of edge biasing applied at the divertor ends. The primary focus of the paper is to establish a formulation that accurately captures both parallel and radial variations of the two-dimensional (2D) potential in SOL. The formulation mainly describes a quasi-neutral plasma with a logical sheath boundary. A full-f gyrokinetic ion model and a massless electron model are implemented in the GTC-X code to solve for the self-consistent equilibrium potential, given fixed radial potential profiles at the boundaries. The first essential point of this 2D model lies in its ability to couple radial and parallel dynamics stemming from resistive currents and drag force on ions. The model successfully recovers the fluid force balance and continuity equations. These collisional effects on 2D potential mainly appear through the density profile changes, modifying the potential through electron pressure gradient. This means an accurate prescription of electron density and temperature profiles is important in predicting the potential structure in the FRC SOL. The Debye sheath potential and the potential profiles applied at the boundaries can be additional factors contributing to the 2D variations in SOL. This comprehensive full-f scheme holds promise for future investigations into turbulent transport in the presence of the self-consistent 2D potential together with the non-Maxwellian distributions and open boundary conditions in the FRC SOL.

Physics↗
DOE OSTI2025

Semi-implicit continuum kinetic modeling of weakly collisional parallel transport in a magnetic mirror

We present implicit-explicit (IMEX) kinetic simulations of weakly collisional parallel plasma transport in magnetic mirror configurations using the continuum code COGENT. The numerical scheme employs a Jacobian-free Newton–Krylov method with algebraic multigrid preconditioning to overcome the severe time step limitations imposed by strong mirror forces in fully explicit schemes. Applied to parameters relevant to the Wisconsin HTS Axisymmetric Mirror experiment, the IMEX approach enables time steps up to 2.5×10 4 times larger than those permitted by explicit methods, resulting in a 2500× speedup in 1D–2V simulations of parallel transport with kinetic ions and Boltzmann electrons. Additionally, a reduced bounce-averaged model for a square mirror is implemented to support the computationally intensive fully kinetic simulations. The bounce-averaged formulation is used to evaluate the numerical convergence of the velocity-space discretization algorithms and to assess the role of the collision model by comparing simulations employing the nonlinear Fokker–Planck and the simplified Lenard–Bernstein–Dougherty collision operators.

Collision theories↗
DOE OSTI2019

GPU-accelerated dislocation dynamics using subcycling time-integration

Discrete dislocation dynamics (DDD) simulations are being increasingly employed to investigate metal plasticity at the mesoscale. However, in spite of its ability to access beyond the length and time limits of atomistic methods, the DDD model is still limited by its high computational cost, with ranges of achievable strains too low and strain rates too high by several orders of magnitude compared with typical experimental conditions. By combining the efficiency of the recently developed subcycling time-integrator with the highly parallel architecture of graphics processing unit (GPU) devices, we developed a DDD model that provides significant acceleration compared to existing implementations. Our GPU-accelerated implementation enables large-scale DDD simulations that can reach relevant levels of strain using a moderate amount of computational resources.

36 MATERIALS SCIENCE↗
DOE OSTI2017

CRPropa 3.1—a low energy extension based on stochastic differential equations

The propagation of charged cosmic rays through the Galactic environment influences all aspects of the observation at Earth. Energy spectrum, composition and arrival directions are changed due to deflections in magnetic fields and interactions with the interstellar medium. Today the transport is simulated with different simulation methods either based on the solution of a transport equation (multi-particle picture) or a solution of an equation of motion (single-particle picture). We developed a new module for the publicly available propagation software CRPropa 3.1, where we implemented an algorithm to solve the transport equation using stochastic differential equations. This technique allows us to use a diffusion tensor which is anisotropic with respect to an arbitrary magnetic background field. The source code of CRPropa is written in C++ with python steering via SWIG which makes it easy to use and computationally fast. In this paper, we present the new low-energy propagation code together with validation procedures that are developed to proof the accuracy of the new implementation. Furthermore, we show first examples of the cosmic ray density evolution, which depends strongly on the ratio of the parallel κ{sub ∥} and perpendicular κ{sub ⊥} diffusion coefficients. This dependency is systematically examined as well the influence of the particle rigidity on the diffusion process.

79 ASTRONOMY AND ASTROPHYSICS↗
DOE OSTI2020

PLEXUS: A Pattern-Oriented Runtime System Architecture for Resilient Extreme-Scale High-Performance Computing Systems

For high-performance computing (HPC) system designers and users, meeting the myriad challenges of next-generation exascale supercomputing systems requires rethinking their approach to application and system software design. Among these challenges, providing resiliency and stability to the scientific applications in the presence of high fault rates requires new approaches to software architecture and design. As HPC systems become increasingly complex, they require intricate solutions for detection and mitigation for various modes of faults and errors that occur in these large-scale systems, as well as solutions for failure recovery. These resiliency solutions often interact with and affect other system properties, including application scalability, power and energy efficiency. Therefore, resilience solutions for HPC systems must be thoughtfully engineered and deployed.In previous work, we developed the concept of resilience design patterns, which consist of templated solutions based on well-established techniques for detection, mitigation and recovery. In this paper, we use these patterns as the foundation to propose new approaches to designing runtime systems for HPC systems. The instantiation of these patterns within a runtime system enables flexible and adaptable end-to-end resiliency solutions for HPC environments. The paper describes the architecture of the runtime system, named Plexus, and the strategies for dynamically composing and adapting pattern instances under runtime control. This runtime-based approach enables actively balancing the cost-benefit trade-off between performance overhead and protection coverage of the resilience solutions. Based on a prototype implementation of PLEXUS, we demonstrate the resiliency and performance gains achieved by the pattern-based runtime system for a parallel linear solver application.

Hukerikar, Saurabh↗
DOE OSTI2014

Online Monitoring System for Performance Fault Detection

To achieve the exaFLOPS performance within a contained power budget, next generation supercomputers will feature hundreds of millions of components operating at low- and near-threshold voltage. As the probability that at least one of these components fails during the execution of an application approaches certainty, it seems unrealistic to expect that any run of a scientific application will not experience some performance faults. We believe that there is need of a new generation of light-weight performance and debugging tools that can be used online even during production runs of parallel applications and that can identify performance anomalies during the application execution. In this work we propose the design and implementation of such a monitoring system.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2017

Quinoa, Version 0.2

Quinoa is a set of computational tools that enables research and numerical analysis in fluid dynamics. At this time it remains a test-bed to experiment with various algorithms using fully asynchronous runtime systems. Currently, Quinoa consists of the following tools: (1) Walker, a numerical integrator for systems of stochastic differential equations in time. It is a mathematical tool to analyze and design the behavior of stochastic differential equations. It allows the estimation of arbitrary coupled statistics and probability density functions and is currently used for the design of statistical moment approximations for multiple mixing materials in variable-density turbulence. (2) Inciter, an overdecomposition-aware finite element field solver for partial differential equations using 3D unstructured grids. Inciter is used to research asynchronous mesh-based algorithms and to experiment with coupling asynchronous to bulk-synchronous parallel code. Two planned new features of Inciter, compared to the previous release (LA-CC-16-015), to be implemented in 2017, are (a) a simple Navier-Stokes solver for ideal single-material compressible gases, and (b) solution-adaptive mesh refinement (AMR), which enables dynamically concentrating compute resources to regions with interesting physics. Using the NS-AMR problem we plan to explore how to scale such high-load-imbalance simulations, representative of large production multiphysics codes, to very large problems on very large computers using an asynchronous runtime system. (3) RNGTest, a test harness to subject random number generators to stringent statistical tests enabling quantitative ranking with respect to their quality and computational cost. (4) UnitTest, a unit test harness, running hundreds of tests per second, capable of testing serial, synchronous, and asynchronous functions. (5) MeshConv, a mesh file converter that can be used to convert 3D tetrahedron meshes from and to either of the following formats: Gmsh, http://www.geuz.org/gmsh, Netgen, http://sourceforge.net/apps/mediawiki/netgen-mesher, ExodusII, http://sourceforge.net/projects/exodusii, HyperMesh, http://www.altairhyperworks.com/product/HyperMesh.

Bakosi, Jozsef↗
DOE OSTI2021

FasTensor (FT) v0.0.1

The FasTensor implements the native array data programming mode namely SLOPE for modern data analysis tasks. It is designed to work in parallel on supercomputer and can handle terabyte data analysis tasks. It is thousand times faster than other data analysis systems such as Apache Spark and 38% faster than TensorFlow in dealing with large scale scientific data analysis. It has wide applications in image data analysis and mesh data analysis tasks in physical simulations and other fields.

Wu, Kesheng↗