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 901 records · Page 50

The Updated DESGW Processing Pipeline for the Third LIGO/VIRGO Observing Run

The DESGW group seeks to identify electromagnetic counterparts of gravitational wave events seen by the LIGO-VIRGO network, such as those expected from binary neutron star mergers or neutron star- black hole mergers. DESGW was active throughout the first two LIGO observing seasons, following up several binary black hole mergers and the first binary neutron star merger, GW170817. We describe the modifications to the observing strategy generation and image processing pipeline between the second (ending in August 2017) and third (beginning in April 2019) LIGO observing seasons. The modifications include a more robust observing strategy generator, further parallelization of the image reduction software and difference imaging processing pipeline, data transfer streamlining, and a public webpage listing identified counterpart candidates that updates in real time. Taken together, the additional parallelization steps enable us to identify potential electromagnetic counterpa rts within fully calibrated search images in less than one hour, compared to the 3-5 hours it would typically take during the first two seasons. These performance improvements are critical to the entire EM followup community, as rapid identification (or rejection) of candidates enables detailed spectroscopic followup by multiple instruments as soon as possible, leading to more information about the environment immediately following such gravitational wave events.

79 ASTRONOMY AND ASTROPHYSICS↗

The OVIS analysis architecture.

This report summarizes the current statistical analysis capability of OVIS and how it works in conjunction with the OVIS data readers and interpolators. It also documents how to extend these capabilities. OVIS is a tool for parallel statistical analysis of sensor data to improve system reliability. Parallelism is achieved using a distributed data model: many sensors on similar components (metaphorically sheep) insert measurements into a series of databases on computers reserved for analyzing the measurements (metaphorically shepherds). Each shepherd node then processes the sheep data stored locally and the results are aggregated across all shepherds. OVIS uses the Visualization Tool Kit (VTK) statistics algorithm class hierarchy to perform analysis of each process's data but avoids VTK's model aggregation stage which uses the Message Passing Interface (MPI); this is because if a single process in an MPI job fails, the entire job will fail. Instead, OVIS uses asynchronous database replication to aggregate statistical models. OVIS has several additional features beyond those present in VTK that, first, accommodate its particular data format and, second, improve the memory and speed of the statistical analyses. First, because many statistical algorithms are multivariate in nature and sensor data is typically univariate, interpolation of data is required to provide simultaneous observations of metrics. Note that in this report, we will refer to a single value obtained from a sensor as a measurement while a collection of multiple sensor values simultaneously present in the system is an observation. A base class for interpolation is provided that abstracts the operation of converting multiple sensor measurements into simultaneous observations. A concrete implementation is provided that performs piecewise constant temporal interpolation of multiple metrics across a single component. Secondly, because calculations may summarize data too large to fit in memory OVIS analyses batches of observations at a time and aggregates these intermediate intra-process models as it goes before storing the final model for inter-process aggregation via database replication. This reduces the memory footprint of the analysis, interpolation, and the database client and server query processing. This also interleaves processing with the disk I/O required to fetch data from the database - also improving speed. This report documents how OVIS performs analyses and how to create additional analysis components that fetch measurements from the database, perform interpolation, or perform operations on streamed observations (such as model updates or assessments). The rest of this section outlines the OVIS analysis algorithm and is followed by sections specific to each subtask. Note that we are limiting our discussion for now to the creation of a model from a set of measurements, and not including the assessment of observations using a model. The same framework can be used for assessment but that use case is not detailed in this report.

97 MATHEMATICS AND COMPUTING↗

Collective I/O Tuning Using Analytical and Machine-Learning Models

The ever larger demand of scientific applications for computation and data is currently driving a continuous increase in scale of parallel computers. The inherent complexity of scaling up a computing systems in terms of both hardware and software stack exposes an increasing number of factors impacting the performance and complicating the process of optimization. In particular, the optimization of parallel I/O has become increasingly challenging due to increasing storage hierarchy and well known performance variability of shared storage systems. This paper focuses on model-based autotuning of the two-phase collective I/O algorithm from a popular MPI distribution on the Blue Gene/Q architecture. We propose a novel hybrid model, constructed as a composition of analytical models for communication and storage operations and black-box models for the performance of the individual operations. We perform an in-depth study of the complexity involved in performance modeling including architecture, software stack and noise. In particular we address this challenges of modeling the performance of shared storage systems by building a benchmark that helps synthesizing factors such as topology, file caching, and noise. The experimental results show that the hybrid approach produces significantly better results than state-of-the-art machine learning approaches and shows a higher robustness to noise, at the cost of a higher modeling complexity

I/O performance modeling↗

Integrated Model, Batch and Domain Parallelism in Training Neural Networks

We propose a new integrated method of exploiting model, batch and domain parallelism for the training of deep neural networks (DNNs) on large distributed-memory computers using minibatch stochastic gradient descent (SGD). Our goal is to find an efficient parallelization strategy for a fixed batch size using $P$ processes. Our method is inspired by the communication-avoiding algorithms in numerical linear algebra. We see $P$ processes as logically divided into a $P_r \times P_c$ grid where the $P_r$ dimension is implicitly responsible for model/domain parallelism and the $P_c$ dimension is implicitly responsible for batch parallelism. In practice, the integrated matrix-based parallel algorithm encapsulates these types of parallelism automatically. We analyze the communication complexity and analytically demonstrate that the lowest communication costs are often achieved neither with pure model nor with pure data parallelism. We also show how the domain parallel approach can help in extending the theoretical scaling limit of the typical batch parallel method.

97 MATHEMATICS AND COMPUTING↗

Performance Assessment of a Generic Nuclear Waste Repository in Shale - 18392

A performance assessment (PA) is an important component of a comprehensive safety analysis for a nuclear waste repository. In a PA, probabilistic simulations of the total repository system are performed, and results are evaluated against performance metrics. Uncertainty and sensitivity analyses help prioritize additional research and model development. The United States Department of Energy (DOE) has been developing a state of the art PA simulation software tool-kit, Geologic Disposal Safety Assessment (GDSA) Framework, that couples increasingly higher fidelity models of subsystem processes into total system PA simulations. Over the past several years, PAs of generic repositories in three geologic media (salt, shale, and crystalline rock) have demonstrated ongoing developments in capability. The current PA of a nuclear waste repository in a generic shale formation showcases GDSA Framework, including capabilities in domain discretization (Cubit), multi-physics simulations (PFLOTRAN), uncertainty and sensitivity analysis (Dakota), and visualization (Paraview). The generic shale reference case considers the disposal of 22,000 metric tons heavy metal of commercial spent nuclear fuel (SNF) in a generic shale formation. PA simulations account for the thermal load and radionuclide inventory of the waste form, components of the engineered barrier system including waste package and buffer, and components of the natural barrier system including the host rock shale and underlying and overlying stratigraphic units. Two repository layouts are considered, one for emplacement of waste packages containing 12 pressurized water reactor (PWR) assemblies, and one for 4-PWR waste package emplacement. Model domains are half-symmetry and contain between 7 and 22 million grid cells. Grid refinement captures the detail of individual waste packages, emplacement drifts, access drifts, and shafts. Simulations are run in a high-performance computing (HPC) environment on 512 or 2048 processes. The governing equations describing coupled heat and fluid flow and reactive transport are solved with PFLOTRAN, an open-source, massively parallel multiphase flow and reactive transport code. Additional simulated processes include waste package degradation; waste form dissolution; radioactive decay and ingrowth in aqueous, solid, and adsorbed phases; and a simple biosphere based on a pumping well. Simulations are run to 106 y; dose and radionuclide concentrations are observed within aquifers at a point approximately 5 km downgradient of the repository. Dakota is used to sample likely ranges of input parameters including waste form and waste package degradation rates and properties of engineered and natural materials to quantify uncertainty in predicted concentrations and sensitivity to input parameters. Given the assumptions of the reference case, results of 12-PWR and 4-PWR simulations are very similar. Dose at the pumping well 5-km downgradient of the repository does not exceed 10-9 Sv/y. I-129 is the largest contributor to dose. The dose due to Cl-36, the next largest contributor, is orders of magnitude smaller. At the pumping well, the concentration of I-129 5-km downgradient does not exceed 10-14 mol/L. Rank correlation coefficients indicate that the maximum concentration of I-129 within the aquifer is sensitive to shale (repository host rock) porosity and aquifer permeability. These results affirm that HPC-capable codes can be used to simulate important multi-physics couplings directly in a total system performance assessment of a geologic repository, and can be used in prioritization of future research and model development. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

High frequency (4th order) sequence stratigraphy of Early Miocene deltaic shorelines, offshore Texas and Louisiana

Well logs and 3D seismic reflection data are integrated to image Lower Miocene depocenters of the upper Texas and westernmost Louisiana coastal and offshore areas. Although previously interpreted at a large scale (3rd order cycles), the detailed stratigraphy and depositional history of the early Miocene succession has not been fully developed. The upper lower Miocene interval from Robulus L (MFS10) to Amphistegina B (MFS9) has been further subdivided into five 4th order cycles (each 200 to 300 m thick) to provide finer scale stratigraphic detail and interpretation of depositional environments. Results of the finer scale correlations are presented in a series of sandstone percent maps. Overall, the maps display a strike-elongate (sub-parallel to the present day coastline) orientation for the sandstone bodies which thin to the southeast (basinward). Net sandstone thickness is relatively low in older cycles and increases in younger cycles suggesting an overall progradation of the deltaic system into the mapped area through time. Continued marine regression and southward movement of the shoreline are also confirmed by seismic amplitude 2 maps. After a major transgression associated with Robulus L deltaic progradation occurred under rising sea level conditions. Deltaic sediments prograded southward and sandstone brought to the upper Texas coast was distributed laterally by longshore currents to form strandplain coast lines. Maximum regression occurred during the interval MFS9_2 to MFS9_3 when a deltaic depocenter formed offshore Texas in east High Island area. However, sandstone thickness progressively decreased laterally to the east (offshore Louisiana) where more shale was present and marine processes reworked deltaic derived sandstones into shore parallel bars. There was a clear retreat of the shoreline during the youngest cycle marking the beginning of transgression associated with Amphistegina B . Detailed stratigraphic interpretation (at a 4th order scale) shows more variability in the dominant shoreline processes during early Miocene than previously thought. Recognition of sedimentary systems variability at a 4th order scale is critical for improved hydrocarbon exploration and in understanding potential future CO 2 storage in the area.

58 GEOSCIENCES↗

Tracking moving radar targets with parallel, velocity-tuned filters

Radar data associated with radar illumination of a movable target is processed to monitor motion of the target. A plurality of filter operations are performed in parallel on the radar data so that each filter operation produces target image information. The filter operations are defined to have respectively corresponding velocity ranges that differ from one another. The target image information produced by one of the filter operations represents the target more accurately than the target image information produced by the remainder of the filter operations when a current velocity of the target is within the velocity range associated with the one filter operation. In response to the current velocity of the target being within the velocity range associated with the one filter operation, motion of the target is tracked based on the target image information produced by the one filter operation.

47 OTHER INSTRUMENTATION↗

Dismantling of the Spent Resins Hot Compaction Unit at Tihange NPP, Belgium - 19139

Design, construction and commissioning of the Spent Ion Exchange Resins Hot Compaction Unit at Tihange Nuclear Power Plant took place from 2005 till 2011. In this conditioning process, batches of radioactive resin beads were first dried to less than 4% moisture by a conical vacuum dryer. Resins were then poured in compactable 200-liter drums and super-compacted. Resulting pellets were emplaced in standard 400-liter drums, the packages qualified for final disposal in Belgium, and eventually grouted. The Belgian Waste Management Agency (ONDRAF/NIRAS) was consulted before initiating the project and issued a statement of no objection. The technology turned out to be used for the first time in the particular case of bead shaped resins (unlike powdered resins) and with a grouting requirement. Finally, commissioning tests ended in a safe and reproducible waste form, compliant with prevailing Waste Acceptance Criteria. Volume Reduction Factors of about 2 were recorded after drying and compaction. New tests were carried out to support the Qualification File of the process, which was submitted to ONDRAF/NIRAS. After performing many trials using inactive resins, the Operator dried two batches of radioactive resins and super-compacted four drums: this was a planned qualification step, aiming at the validation of process parameters. In the meantime, ONDRAF/NIRAS made parallel progress in the design of the future Near Surface Repository, where conditioned resins will be disposed of, and found some incompatibility between encapsulated dried resin beads and water intrusion hazards inside the repository. Based on the risk that dried resin beads will swell if they absorb water, causing mechanical stresses likely to compromise the integrity of the disposal site, ONDRAF/NIRAS informed Tihange NPP that the Hot Compaction Unit would not be qualified as spent resins conditioning process. Further to this irrevocable decision, the Operator undertook three actions: - The first one was the qualification and purchase of waste containers to provide additional temporary storage capacity on site for its operational spent resins; - The second one is the selection of a new spent resins conditioning process and the performance of the related qualification tests to demonstrate it meets the updated Waste Acceptance Criteria; - The last one is the dismantling of the Hot Compaction Unit to clear the space and enable the installation of new equipment. This latter task was carried out in 2018, involving decontamination and free release measurements of all the materials, a very limited fraction of it having to be further processed as radioactive waste. Nevertheless, Tihange NPP wishes to keep the super-compactor and its hydraulic unit for a possible resale or reuse for the treatment of mixed waste. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Component-based workflows for parallel thermomechanical analysis of arrayed geometries

Component-based simulation workflows can increase the agility of the design process by streamlining adaptation of new simulation methods. Here, we present one such workflow for parallel unstructured mesh-based simulations and demonstrate its usefulness in the thermomechanical analysis of an array of solder joints used in microelectronics fabrication. We automate the simulation process from problem specification to the solution of the underlying PDEs, including problem setup, domain definition, and mesh generation. We establish the utility of the proposed approach by demonstrating that qualitatively different stress concentrations are seen in solder joints near the center of such an array and a solder joint seen at the edge of the same array.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Data Acquisition with GPUs: The DAQ for the Muon $g$-$2$ Experiment at Fermilab

Graphical Processing Units (GPUs) have recently become a valuable computing tool for the acquisition of data at high rates and for a relatively low cost. The devices work by parallelizing the code into thousands of threads, each executing a simple process, such as identifying pulses from a waveform digitizer. The CUDA programming library can be used to effectively write code to parallelize such tasks on Nvidia GPUs, providing a significant upgrade in performance over CPU based acquisition systems. The muon $g$-$2$ experiment at Fermilab is heavily relying on GPUs to process its data. The data acquisition system for this experiment must have the ability to create deadtime-free records from 700 $\mu$s muon spills at a raw data rate 18 GB per second. Data will be collected using 1296 channels of $\mu$TCA-based 800 MSPS, 12 bit waveform digitizers and processed in a layered array of networked commodity processors with 24 GPUs working in parallel to perform a fast recording of the muon decays during the spill. The described data acquisition system is currently being constructed, and will be fully operational before the start of the experiment in 2017.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Mini-Ckpts: Surviving OS Failures in Persistent Memory

Concern is growing in the high-performance computing (HPC) community on the reliability of future extreme-scale systems. Current efforts have focused on application fault-tolerance rather than the operating system (OS), despite the fact that recent studies have suggested that failures in OS memory are more likely. The OS is critical to a system's correct and efficient operation of the node and processes it governs -- and in HPC also for any other nodes a parallelized application runs on and communicates with: Any single node failure generally forces all processes of this application to terminate due to tight communication in HPC. Therefore, the OS itself must be capable of tolerating failures. In this work, we introduce mini-ckpts, a framework which enables application survival despite the occurrence of a fatal OS failure or crash. Mini-ckpts achieves this tolerance by ensuring that the critical data describing a process is preserved in persistent memory prior to the failure. Following the failure, the OS is rejuvenated via a warm reboot and the application continues execution effectively making the failure and restart transparent. The mini-ckpts rejuvenation and recovery process is measured to take between three to six seconds and has a failure-free overhead of between 3-5% for a number of key HPC workloads. In contrast to current fault-tolerance methods, this work ensures that the operating and runtime system can continue in the presence of faults. This is a much finer-grained and dynamic method of fault-tolerance than the current, coarse-grained, application-centric methods. Handling faults at this level has the potential to greatly reduce overheads and enables mitigation of additional fault scenarios.

Fiala, David↗

Transparent redundant computing with MPI.

Extreme-scale parallel systems will require alternative methods for applications to maintain current levels of uninterrupted execution. Redundant computation is one approach to consider, if the benefits of increased resiliency outweigh the cost of consuming additional resources. We describe a transparent redundancy approach for MPI applications and detail two different implementations that provide the ability to tolerate a range of failure scenarios, including loss of application processes and connectivity.We compare these two approaches and show performance results from micro-benchmarks that bound worst-case message passing performance degradation.We propose several enhancements that could lower the overhead of providing resiliency through redundancy.

99 GENERAL AND MISCELLANEOUS↗

SU-D-18A-02: Towards Real-Time On-Board Volumetric Image Reconstruction for Intrafraction Target Verification in Radiation Therapy

Purpose: To expedite on-board volumetric image reconstruction from limited-angle kV—MV projections for intrafraction verification. Methods: A limited-angle intrafraction verification (LIVE) system has recently been developed for real-time volumetric verification of moving targets, using limited-angle kV—MV projections. Currently, it is challenged by the intensive computational load of the prior-knowledge-based reconstruction method. To accelerate LIVE, we restructure the software pipeline to make it adaptable to model and algorithm parameter changes, while enabling efficient utilization of rapidly advancing, modern computer architectures. In particular, an innovative two-level parallelization scheme has been designed: At the macroscopic level, data and operations are adaptively partitioned, taking into account algorithmic parameters and the processing capacity or constraints of underlying hardware. The control and data flows of the pipeline are scheduled in such a way as to maximize operation concurrency and minimize total processing time. At the microscopic level, the partitioned functions act as independent modules, operating on data partitions in parallel. Each module is pre-parallelized and optimized for multi-core processors (CPUs) and graphics processing units (GPUs). Results: We present results from a parallel prototype, where most of the controls and module parallelization are carried out via Matlab and its Parallel Computing Toolbox. The reconstruction is 5 times faster on a data-set of twice the size, compared to recently reported results, without compromising on algorithmic optimization control. Conclusion: The prototype implementation and its results have served to assess the efficacy of our system concept. While a production implementation will yield much higher processing rates by approaching full-capacity utilization of CPUs and GPUs, some mutual constraints between algorithmic flow and architecture specifics remain. Based on a careful analysis of the prototype performance, it will be feasible to resolve such issues through appropriate algorithmic modifications or special-purpose hardware, thus enabling target verification in seconds with the LIVE system. This work was partially supported by a research grant from Varian Medical Systems.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Parallel quantum computing simulations via quantum accelerator platform virtualization

Quantum circuit execution is a central task in quantum computation. Due to inherent quantum-mechanical constraints, quantum computing workflows often involve a considerable number of independent measurements over a large set of slightly different quantum circuits. Here we discuss a simple model for parallelizing such quantum circuit executions that is based on introducing a large array of virtual quantum processing units (mapped to HPC nodes in our case) as a parallel quantum computing platform. Implemented within the XACC framework, the model can readily take advantage of its backend-agnostic features, enabling parallel quantum computing/simulation over any target backend supported by XACC. We illustrate the performance of this approach by demonstrating strong scaling in two pertinent domain science problems, namely in computing the gradients for the multi-contracted variational quantum eigensolver and in data-driven quantum circuit learning, where we vary the number of qubits and the number of circuit layers. Here, the latter simulation leverages the cuQuantum library to run efficiently on GPU-accelerated HPC platforms.

97 MATHEMATICS AND COMPUTING↗

CMS multicore scheduling strategy

In the next years, processor architectures based on much larger numbers of cores will be most likely the model to continue 'Moore's Law' style throughput gains. This not only results in many more jobs in parallel running the LHC Run 1 era monolithic applications, but also the memory requirements of these processes push the workernode architectures to the limit. One solution is parallelizing the application itself, through forking and memory sharing or through threaded frameworks. CMS is following all of these approaches and has a comprehensive strategy to schedule multicore jobs on the GRID based on the glideinWMS submission infrastructure. The main component of the scheduling strategy, a pilot-based model with dynamic partitioning of resources that allows the transition to multicore or whole-node scheduling without disallowing the use of single-core jobs, is described. This contribution also presents the experiences made with the proposed multicore scheduling schema and gives an outlook of further developments working towards the restart of the LHC in 2015.

Perez-Calero Yzquierdo, Antonio↗

Chatter Stability of Machining Operations

Here, this paper reviews the dynamics of machining and chatter stability research since the first stability laws were introduced by Tlusty and Tobias in the 1950s. The paper aims to introduce the fundamentals of dynamic machining and chatter stability, as well as the state of the art and research challenges, to readers who are new to the area. First, the unified dynamic models of mode coupling and regenerative chatter are introduced. The chatter stability laws in both the frequency and time domains are presented. The dynamic models of intermittent cutting, such as milling, are presented and their stability solutions are derived by considering the time-periodic behavior. The complexities contributed by highly intermittent cutting, which leads to additional stability pockets, and the contribution of the tool's flank face to process damping are explained. The stability of parallel machining operations is explained. The design of variable pitch and serrated cutting tools to suppress chatter is presented. The paper concludes with current challenges in chatter stability of machining which remains to be the main obstacle in increasing the productivity and quality of manufactured parts.

42 ENGINEERING↗

E4D_RT

Time-lapse ERT imaging for monitoring both natural and engineered subsurface processes has advanced rapidly over the past 15-20 years. However, imaging results generally required a significant amount of manual and computational effort, and therefore were not available while the process was occurring. Although the value of real-time imaging was recognized, several obstacles prevented it's implementation. E4D_RT addresses these obstacles by 1) providing specialized algorithms that negate the need for user intervention, thereby automating the time-lapse data processing steps, 2) linking field data collection systems with parallel supercomputing systems via wireless data transfer link, and 3) addressing the computational burdens by utilizing distributed memory supercomputing resources, thereby enabling rapid data processing and imaging results.

Source record↗

High performance techniques for micro channel plate computations in photo multipliers

Monte Carlo - MC methods, requiring heavy computations of large data volume, can be used to predict the amplitude distribution and variance of outputted electron charge in Micro Channel Plates - MCPs, which are fed with primary emitted electrons in their inputs. The concept of parallel and serial combination of separate stages of such stochastic processes, which can be applied in MCP systems and simulated using MC computations, has recently proposed and shown interesting theorems and results. Separating the electron multiplication procedures, occurring in the channels of MCP systems, into sub-procedures, which are similar in nature and occur either in parallel or in consecutive manners, is equivalent to splitting the relevant stochastic system calculations into smaller ones, which can be performed concurrently and/or sequentially. In this way, calculations similar in nature, can be executed only once, thus, eliminating a great percentage of heavy computations. However, when designing and implementing the calculation inferences of the derived theorems using High Performance Computation - HPC techniques, the overall computation cost can further and significantly be reduced. In this paper, the hardware mappings of the relevant theorem inferences onto parallel computing architectures, resulting in circuits of computing blocks for calculation purposes of MCP system stochastic processes, are investigated. Each of the designed and implemented computing circuits corresponds to a theorem inference or to a combination of inferences. The parallelism of the proposed circuits consists of both the concurrent functioning of all the system blocks and of the simultaneous operation of each block, which is processing pieces of data, for many parts of the whole circuit in which it belongs. All the circuits are designed and tested using Altera Quartus II environment and can be implemented as chips, which can be incorporated in computing devices to assist Monte Carlo computations for the estimation of different MCP electron multiplication system performances.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗