Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel processing”

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,567 records · Page 87

Multiple arm coordination using concurrent processing

The use of concurrent processing for robot arm coordination is considered, and a hierarchically structured set of routines for the completion of coordinated tasks is discussed. Concurrent programming controls interacting concurrent processes by providing techniques to handle the problems of mutual exclusion, synchronization, and communication. The process is demonstrated for the example of the producer-consumer problem. Software supporting a concurrent environment to control a robotic system is being developed in which parallel rather than sequential thought processes are used.

Basta, Robert A.↗

Parallel Wavefront Analysis for a 4D Interferometer

This software provides a programming interface for automating data collection with a PhaseCam interferometer from 4D Technology, and distributing the image-processing algorithm across a cluster of general-purpose computers. Multiple instances of 4Sight (4D Technology s proprietary software) run on a networked cluster of computers. Each connects to a single server (the controller) and waits for instructions. The controller directs the interferometer to several images, then assigns each image to a different computer for processing. When the image processing is finished, the server directs one of the computers to collate and combine the processed images, saving the resulting measurement in a file on a disk. The available software captures approximately 100 images and analyzes them immediately. This software separates the capture and analysis processes, so that analysis can be done at a different time and faster by running the algorithm in parallel across several processors. The PhaseCam family of interferometers can measure an optical system in milliseconds, but it takes many seconds to process the data so that it is usable. In characterizing an adaptive optics system, like the next generation of astronomical observatories, thousands of measurements are required, and the processing time quickly becomes excessive. A programming interface distributes data processing for a PhaseCam interferometer across a Windows computing cluster. A scriptable controller program coordinates data acquisition from the interferometer, storage on networked hard disks, and parallel processing. Idle time of the interferometer is minimized. This architecture is implemented in Python and JavaScript, and may be altered to fit a customer s needs.

Rao, Shanti R.↗

Parallelizing the QUDA Library for Multi-GPU Calculations in Lattice Quantum Chromodynamics

Graphics Processing Units (GPUs) are having a transformational effect on numerical lattice quantum chromodynamics (LQCD) calculations of importance in nuclear and particle physics. The QUDA library provides a package of mixed precision sparse matrix linear solvers for LQCD applications, supporting single GPUs based on NVIDIA's Compute Unified Device Architecture (CUDA). This library, interfaced to the QDP++/Chroma framework for LQCD calculations, is currently in production use on the "9g" cluster at the Jefferson Laboratory, enabling unprecedented price/performance for a range of problems in LQCD. Nevertheless, memory constraints on current GPU devices limit the problem sizes that can be tackled. In this contribution we describe the parallelization of the QUDA library onto multiple GPUs using MPI, including strategies for the overlapping of communication and computation. We report on both weak and strong scaling for up to 32 GPUs interconnected by InfiniBand, on which we sustain in excess of 4 Tflops.

43 PARTICLE ACCELERATORS↗

Report for the ASC CSSE L2 Milestone (4873) - Demonstration of Local Failure Local Recovery Resilient Programming Model.

Recovery from process loss during the execution of a distributed memory parallel application is presently achieved by restarting the program, typically from a checkpoint file. Future computer system trends indicate that the size of data to checkpoint, the lack of improvement in parallel file system performance and the increase in process failure rates will lead to situations where checkpoint restart becomes infeasible. In this report we describe and prototype the use of a new application level resilient computing model that manages persistent storage of local state for each process such that, if a process fails, recovery can be performed locally without requiring access to a global checkpoint file. LFLR provides application developers with an ability to recover locally and continue application execution when a process is lost. This report discusses what features are required from the hardware, OS and runtime layers, and what approaches application developers might use in the design of future codes, including a demonstration of LFLR-enabled MiniFE code from the Matenvo mini-application suite.

Heroux, Michael Allen↗

PRATHAM: Parallel Thermal Hydraulics Simulations using Advanced Mesoscopic Methods

At the Oak Ridge National Laboratory, efforts are under way to develop a 3D, parallel LBM code called PRATHAM (PaRAllel Thermal Hydraulic simulations using Advanced Mesoscopic Methods) to demonstrate the accuracy and scalability of LBM for turbulent flow simulations in nuclear applications. The code has been developed using FORTRAN-90, and parallelized using the message passing interface MPI library. Silo library is used to compact and write the data files, and VisIt visualization software is used to post-process the simulation data in parallel. Both the single relaxation time (SRT) and multi relaxation time (MRT) LBM schemes have been implemented in PRATHAM. To capture turbulence without prohibitively increasing the grid resolution requirements, an LES approach [5] is adopted allowing large scale eddies to be numerically resolved while modeling the smaller (subgrid) eddies. In this work, a Smagorinsky model has been used, which modifies the fluid viscosity by an additional eddy viscosity depending on the magnitude of the rate-of-strain tensor. In LBM, this is achieved by locally varying the relaxation time of the fluid.

LBM↗

Extreme-scale scripting : opportunities for large task-parallel applications on petascale computers.

Parallel scripting is a loosely-coupled programming model in which applications are composed of highly parallel scripts of program invocations that process and exchange data via files. We characterize here the applications that can benefit from parallel scripting on petascale-class machines, describe the mechanisms that make this feasible on such systems, and present results achieved with parallel scripts on currently available petascale computers.

97 MATHEMATICS AND COMPUTING↗

Safety software release options to support plant start-up and commissioning activities - 285

The schedule demands on new nuclear power plant site testing and commissioning programs challenge the plant's Instrumentation and Control (I and C) supplier's ability to provide certified safety software releases to meet the needs of these programs. This paper outlines the typical certified safety software development and certification process which follows a Waterfall software life-cycle model. The conflicts that result between supporting the site program and the safety software supplier's internal certification program are identified. An adapted 'functional' safety release process is presented that supports the site program's needs for software changes and in parallel enables the safety software certification process to proceed. Comparisons between the two safety software release processes are examined and the benefits realized through the use of the adapted 'functional' safety software release process are discussed. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Data Access Performance Through Parallelization and Vectored Access: Some Results

High Energy Physics data processing and analysis applications typically deal with the problem of accessing and processing data at high speed. Recent studies, development and test work have shown that the latencies due to data access can often be hidden by parallelizing them with the data processing, thus giving the ability to have applications which process remote data with a high level of efficiency. Techniques and algorithms able to reach this result have been implemented in the client side of the Scalla/xrootd system, and in this contribution we describe the results of some tests done in order to compare their performance and characteristics. These techniques, if used together with multiple streams data access, can also be effective in allowing to efficiently and transparently deal with data repositories accessible via a Wide Area Network.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MASSIVELY PARALLEL FULLY COUPLED IMPLICIT MODELING OF COUPLED THERMAL-HYDROLOGICAL-MECHANICAL PROCESSES FOR ENHANCED GEOTHERMAL SYSTEM RESERVOIRS

Development of enhanced geothermal systems (EGS) will require creation of a reservoir of sufficient volume to enable commercial-scale heat transfer from the reservoir rocks to the working fluid. A key assumption associated with reservoir creation/stimulation is that sufficient rock volumes can be hydraulically fractured via both tensile and shear failure, and more importantly by reactivation of naturally existing fractures (by shearing) to create the reservoir. The advancement of EGS greatly depends on our understanding of the dynamics of the intimately coupled rock-fracture-fluid system and our ability to reliably predict how reservoirs behave under stimulation and production. In order to increase our understanding of how reservoirs behave under these conditions, we have developed a physics-based rock deformation and fracture propagation simulator by coupling a discrete element model (DEM) for fracturing with a continuum multiphase flow and heat transport model. In DEM simulations, solid rock is represented by a network of discrete elements (often referred as particles) connected by various types of mechanical bonds such as springs, elastic beams or bonds that have more complex properties (such as stress-dependent elastic constants). Fracturing is represented explicitly as broken bonds (microcracks), which form and coalesce into macroscopic fractures when external load is applied. DEM models have been applied to a very wide range of fracturing processes from the molecular scale (where thermal fluctuations play an important role) to scales on the order of 1 km or greater. In this approach, the continuum flow and heat transport equations are solved on an underlying fixed finite element grid with evolving porosity and permeability for each grid cell that depends on the local structure of the discrete element network (such as DEM particle density). The fluid pressure gradient exerts forces on individual elements of the DEM network, which therefore deforms and fractures. Such deformation/fracturing in turn changes the permeability, which again changes the evolution of fluid pressure, coupling the two phenomena. The intimate coupling between fracturing and fluid flow makes the meso-scale DEM simulations necessary, as these methods have substantial advantages over conventional continuum mechanical models of elastic rock deformation. The challenges that must be overcome to simulate EGS reservoir stimulation, preliminary results, progress to date and near future research directions and opportunities will be discussed.

15 GEOTHERMAL ENERGY↗

A Novel Algorithm for Solving the Multidimensional Neutron Transport Equation on Massively Parallel Architectures

We employ the Integral Transport Matrix Method (ITMM) as the kernel of new parallel solution methods for the discrete ordinates approximation of the within-group neutron transport equation. The ITMM abandons the repetitive mesh sweeps of the traditional source iterations (SI) scheme in favor of constructing stored operators that account for the direct coupling factors among all the cells' fluxes and between the cells' and boundary surfaces' fluxes. The main goals of this work are to develop the algorithms that construct these operators and employ them in the solution process, determine the most suitable way to parallelize the entire procedure, and evaluate the behavior and parallel performance of the developed methods with increasing number of processes, P. The fastest observed parallel solution method, Parallel Gauss-Seidel (PGS), was used in a weak scaling comparison with the PARTISN transport code, which uses the source iteration (SI) scheme parallelized with the Koch-baker-Alcouffe (KBA) method. Compared to the state-of-the-art SI-KBA with diffusion synthetic acceleration (DSA), this new method- even without acceleration/preconditioning-is completitive for optically thick problems as P is increased to the tens of thousands range. For the most optically thick cells tested, PGS reduced execution time by an approximate factor of three for problems with more than 130 million computational cells on P = 32,768. Moreover, the SI-DSA execution times's trend rises generally more steeply with increasing P than the PGS trend. Furthermore, the PGS method outperforms SI for the periodic heterogeneous layers (PHL) configuration problems. The PGS method outperforms SI and SI-DSA on as few as P = 16 for PHL problems and reduces execution time by a factor of ten or more for all problems considered with more than 2 million computational cells on P = 4.096.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

The BioMole Facility: Advancement of In Situ Microbiome Analysis for the International Space Station

Characterization of the International Space Station (ISS) microbiome has been enabled by sample return and Earth-based analysis. As human exploration pushes beyond low-Earth orbit, microbial-related crew health, planetary protection, and space research requires in situ capabilities. Steps toward reducing Earth-dependence for complex sample analysis began in 2016 with the amplification of DNA within the miniPCR thermal cycler and DNA sequencing with the MinION sequencer onboard the ISS; for both, samples were prepared on Earth. In 2017, these platforms synergistically enabled the in-situ identification of unknown bacteria collected and cultured from ISS surfaces, thereby shifting the paradigm that microbial cultures had to be returned to Earth. The following year, a culture-independent, swab-to-sequencer method further advanced spaceflight microbiology, demonstrating that culturing could be excluded and provided enhanced insight into the bacterial profile of ISS surfaces. Based on the success of these payloads in confirming the ability to meet crew health identification requirements and the benefits accompanying a culture-independent method, the BioMole Facility was established by the medical operations Crew Health Care Systems team. BioMole is the set of hardware, consumables, and procedures required to support sample preparation and nanopore sequencing onboard the ISS. BioMole goals include expanding sample sources, comparing data to previous methods, demonstrating onboard data analytics, and validating new hardware. To date, comparative surface analysis, molecular- and culture-based, has been completed. Additionally, the demonstration of a sample-to-answer process was achieved when BioMole data was processed onboard using the IBM Open Data and AI Edge software platform installed on the ISS-residing Spaceborne Computer-2. The taxonomic profiles generated from the edge analysis were as expected and paralleled that of the downlinked processed data. Future BioMole efforts involve microbial profiling of the ISS water system, ISS validation of the MinION Mk1C, and an expansion to a research facility available to investigators.

Sarah L. Castro-Wallace↗

Evaluating Variable Switching and Flash Methods in Modeling Carbon Sequestration in Deep Geologic Formations using PFLOTRAN

PFLOTRAN a massively parallel computer code for modeling coupled hydro-thermal-chemical processes in variably saturated, non-isothermal porous media is applied to sequestration of supercritical CO{sub 2} in deep geologic formations. Two different methods of solution to the governing partial differential equations are implemented referred to as variable switching and the flash approach. Variable switching entails choosing the independent variables according to the set of phases present in a control volume, whereas in the flash approach a persistent set of variables are used through the calculation. The features and performance of the two approaches are described and contrasted in regard to stability and convergence, flexibility of choice of solver, and scaling behavior.

58 GEOSCIENCES↗

Parallel diffusion operator for magnetized plasmas with improved spectral fidelity

Diffusive transport processes in magnetized plasmas are highly anisotropic, with fast parallel transport along the magnetic field lines sometimes faster than perpendicular transport by orders of magnitude. This constitutes a major challenge for describing non-grid-aligned magnetic structures in Eulerian (grid-based) simulations. Here, the present paper describes and validates a new method for parallel diffusion in magnetized plasmas based on the anti-symmetry representation [Halpern and Waltz, Phys. Plasmas 25, 060703 (2018)]. In the anti-symmetry formalism, diffusion manifests as a flow operator involving the logarithmic derivative of the transported quantity. Qualitative plane wave analysis shows that the new operator naturally yields better discrete spectral resolution compared to its conventional counterpart. Numerical simulations comparing the new method against existing finite difference methods are carried out, showing significant improvement. In particular, we find that combining anti-symmetry with finite differences in diagonally staggered grids essentially eliminates the so-called “artificial numerical diffusion” that affects conventional finite difference and finite volume methods.

Anisotropic diffusion↗

The Massively Parallel Processor and its applications

A long-term experimental development program conducted at Goddard Space Flight Center to implement an ultrahigh-speed data processing system known as the Massively Parallel Processor (MPP) is described. The MPP is a single instruction multiple data stream computer designed to perform logical, integer, and floating point arithmetic operations on variable word length data. Information is presented on system architecture, the system configuration, the array unit architecture, individual processing units, and expected operating rates for several image processing applications (including the processing of Landsat data).

Strong, J. P.↗

Microstructure, Texture, and Mechanical Properties of Ni-W Alloy After Accumulative Roll Bonding

In this study, the microstructure, texture, and mechanical properties evolution of Ni-14W (wt.%) alloy processed up to four cycles of accumulative roll-bonding (ARB) were investigated using electron backscatter diffraction, microhardness measurements, and tensile tests. The initial equiaxed grains, with an average size of 10 μm, underwent a strong refinement after ARB processing. The elongated ultrafine grains were parallel to the rolling direction, with a grain thickness of 0.2 µm. The texture after ARB processing was characterized by the typical rolling components (Copper, S and Brass), which showed a tendency toward stabilization after four cycles. The microhardness increased substantially (+ 86%) and seemed to saturate after three cycles. The tensile tests demonstrated that Ni-14W samples subjected to ARB processing exhibited high strength (> 1200 MPa after three ARB cycles) and very poor ductility.

36 MATERIALS SCIENCE↗

Architecture and data processing alternatives for the TSE computer. Volume 3: Execution of a parallel counting algorithm using array logic (Tse) devices

A parallel algorithm for counting the number of logic-l elements in a binary array or image developed during preliminary investigation of the Tse concept is described. The counting algorithm is implemented using a basic combinational structure. Modifications which improve the efficiency of the basic structure are also presented. A programmable Tse computer structure is proposed, along with a hardware control unit, Tse instruction set, and software program for execution of the counting algorithm. Finally, a comparison is made between the different structures in terms of their more important characteristics.

Metcalfe, A. G.↗

Parallel accelerated Custom Correlation Coefficient calculations for genomics applications

The massive quantities of genomic data being made available through gene sequencing techniques are enabling breakthroughs in genomic science in many areas such as medical advances in the diagnosis and treatment of diseases. Analyzing this data, however, is a computational challenge insofar as the computational costs of the relevant algorithms can grow with quadratic, cubic or higher complexity—leading to the need for leadership scale computing. In this paper we describe a new approach to calculations of the Custom Correlation Coefficient (CCC) between Single Nucleotide Polymorphisms (SNPs) across a population, suitable for parallel systems equipped with graphics processing units (GPUs) or Intel Xeon Phi processors. We describe the mapping of the algorithms to accelerated processors, techniques used for eliminating redundant calculations due to symmetries, and strategies for efficient mapping of the calculations to many-node parallel systems. Results are presented demonstrating high per-node performance and near-ideal parallel scalability with rates of more than nine quadrillion (9 × 10 15 ) elementwise comparisons achieved per second with the latest optimized code on the ORNL Titan system, this being orders of magnitude faster than rates achieved using other codes and platforms as reported in the literature. Also it is estimated that as many as 90 quadrillion (90 × 10 15 ) comparisons per second may be achievable on the upcoming ORNL Summit system, an additional 10X performance increase. Finally, in a companion paper we describe corresponding techniques applied to calculations of the Proportional Similarity metric for comparative genomics applications.

97 MATHEMATICS AND COMPUTING↗