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 487 records · Page 27

Applied Parallel Metadata Indexing

The GPFS Archive is parallel archive is a parallel archive used by hundreds of users in the Turquoise collaboration network. It houses 4+ petabytes of data in more than 170 million files. Currently, users must navigate the file system to retrieve their data, requiring them to remember file paths and names. A better solution might allow users to tag data with meaningful labels and searach the archive using standard and user-defined metadata, while maintaining security. last summer, I developed the backend to a tool that adheres to these design goals. The backend works by importing GPFS metadata into a MongoDB cluster, which is then indexed on each attribute. This summer, the author implemented security and developed the user interfae for the search tool. To meet security requirements, each database table is associated with a single user, which only stores records that the user may read, and requires a set of credentials to access. The interface to the search tool is implemented using FUSE (Filesystem in USErspace). FUSE is an intermediate layer that intercepts file system calls and allows the developer to redefine how those calls behave. In the case of this tool, FUSE interfaces with MongoDB to issue queries and populate output. A FUSE implementation is desirable because it allows users to interact with the search tool using commands they are already familiar with. These security and interface additions are essential for a usable product.

97 MATHEMATICS AND COMPUTING↗

OpenSHMEM: Towards a Unified RMA Model

For many problem domains, one-sided communication paradigms, such as RMA (remote memory access), dominate the solution space on massively parallel systems through their ability to preserve problem tractability, high scalability, and overall performance. How- ever, unlike the MPI standard for two-sided communication, there is no single, successful standard RMA model or interface for one-sided communication, though the SHMEM family of APIs have a long history of success spanning many years and multiple platforms. While the various SHMEM implementations have remained similar across numerous implementations, the subtle differences have hindered acceptance, portability, and in some cases, program cor- rectness. In this paper, we will discuss the differences between SHMEM implementations and contrast SHMEM with other extant libraries supporting RMA semantics to provide motivation for a standards-based OpenSHMEM with the requisite breadth of functionality.

99 GENERAL AND MISCELLANEOUS↗

Tuning HDF5 for Lustre File Systems

HDF5 is a cross-platform parallel I/O library that is used by a wide variety of HPC applications for the flexibility of its hierarchical object-database representation of scientific data. We describe our recent work to optimize the performance of the HDF5 and MPI-IO libraries for the Lustre parallel file system. We selected three different HPC applications to represent the diverse range of I/O requirements, and measured their performance on three different systems to demonstrate the robustness of our optimizations across different file system configurations and to validate our optimization strategy. We demonstrate that the combined optimizations improve HDF5 parallel I/O performance by up to 33 times in some cases running close to the achievable peak performance of the underlying file system and demonstrate scalable performance up to 40,960-way concurrency.

97 MATHEMATICS AND COMPUTING↗

A Transport-Friendly NIC for Multicore-Multiprocessor Systems

Receive side scaling (RSS) is a network interface card (NIC) technology. It provides the benefits of parallel receive processing in multiprocessing environments. However, existing RSS-enabled NICs lack a critical data steering mechanism that would automatically steer incoming network data to the same core on which its application process resides. This absence causes inefficient cache usage if an application is not running on the core on which RSS has scheduled the received traffic to be processed. In Linux systems, it cannot even ensure that packets in a TCP flow are processed by a single core, even if the interrupts for the flow are pinned to a specific core. This results in degraded performance. In this paper, we develop such a data steering mechanism in the NIC for multicore or multiprocessor systems. This data steering mechanism is mainly targeted at TCP, but it can be extended to other transport layer protocols. We term a NIC with such a data steering mechanism 'A Transport Friendly NIC' (A-TFN). Experimental results have proven the effectiveness of A-TFN in accelerating TCP/IP performance.

Wu, Wenji↗

Is Monte Carlo embarrassingly parallel?

Monte Carlo is often stated as being embarrassingly parallel. However, running a Monte Carlo calculation, especially a reactor criticality calculation, in parallel using tens of processors shows a serious limitation in speedup and the execution time may even increase beyond a certain number of processors. In this paper the main causes of the loss of efficiency when using many processors are analyzed using a simple Monte Carlo program for criticality. The basic mechanism for parallel execution is MPI. One of the bottlenecks turn out to be the rendez-vous points in the parallel calculation used for synchronization and exchange of data between processors. This happens at least at the end of each cycle for fission source generation in order to collect the full fission source distribution for the next cycle and to estimate the effective multiplication factor, which is not only part of the requested results, but also input to the next cycle for population control. Basic improvements to overcome this limitation are suggested and tested. Also other time losses in the parallel calculation are identified. Moreover, the threading mechanism, which allows the parallel execution of tasks based on shared memory using OpenMP, is analyzed in detail. Recommendations are given to get the maximum efficiency out of a parallel Monte Carlo calculation. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Parallel 3-D method of characteristics in MPACT

A new parallel 3-D MOC kernel has been developed and implemented in MPACT which makes use of the modular ray tracing technique to reduce computational requirements and to facilitate parallel decomposition. The parallel model makes use of both distributed and shared memory parallelism which are implemented with the MPI and OpenMP standards, respectively. The kernel is capable of parallel decomposition of problems in space, angle, and by characteristic rays up to 0(104) processors. Initial verification of the parallel 3-D MOC kernel was performed using the Takeda 3-D transport benchmark problems. The eigenvalues computed by MPACT are within the statistical uncertainty of the benchmark reference and agree well with the averages of other participants. The MPACT k{sub eff} differs from the benchmark results for rodded and un-rodded cases by 11 and -40 pcm, respectively. The calculations were performed for various numbers of processors and parallel decompositions up to 15625 processors; all producing the same result at convergence. The parallel efficiency of the worst case was 60%, while very good efficiency (>95%) was observed for cases using 500 processors. The overall run time for the 500 processor case was 231 seconds and 19 seconds for the case with 15625 processors. Ongoing work is focused on developing theoretical performance models and the implementation of acceleration techniques to minimize the number of iterations to converge. (authors)

97 MATHEMATICS AND COMPUTING↗

Scalable load balancing for massively parallel distributed Monte Carlo particle transport

In order to run computer simulations efficiently on massively parallel computers with hundreds of thousands or millions of processors, care must be taken that the calculation is load balanced across the processors. Examining the workload of every processor leads to an unscalable algorithm, with run time at least as large as O(N), where N is the number of processors. We present a scalable load balancing algorithm, with run time 0(log(N)), that involves iterated processor-pair-wise balancing steps, ultimately leading to a globally balanced workload. We demonstrate scalability of the algorithm up to 2 million processors on the Sequoia supercomputer at Lawrence Livermore National Laboratory. (authors)

97 MATHEMATICS AND COMPUTING↗

Recent developments in DYNSUB: New models, code optimization and parallelization

DYNSUB is a high-fidelity coupled code system consisting of the reactor simulator DYN3D and the sub-channel code SUBCHANFLOW. It describes nuclear reactor core behavior with pin-by-pin resolution for both steady-state and transient scenarios. In the course of the coupled code system's active development, super-homogenization (SPH) and generalized equivalence theory (GET) discontinuity factors may be computed with and employed in DYNSUB to compensate pin level homogenization errors. Because of the largely increased numerical problem size for pin-by-pin simulations, DYNSUB has bene fitted from HPC techniques to improve its numerical performance. DYNSUB's coupling scheme has been structurally revised. Computational bottlenecks have been identified and parallelized for shared memory systems using OpenMP. Comparing the elapsed time for simulating a PWR core with one-eighth symmetry under hot zero power conditions applying the original and the optimized DYNSUB using 8 cores, overall speed up factors greater than 10 have been observed. The corresponding reduction in execution time enables a routine application of DYNSUB to study pin level safety parameters for engineering sized cases in a scientific environment. (authors)

97 MATHEMATICS AND COMPUTING↗

A spectral analysis of the domain decomposed Monte Carlo method for linear systems

The domain decomposed behavior of the adjoint Neumann-Ulam Monte Carlo method for solving linear systems is analyzed using the spectral properties of the linear operator. Relationships for the average length of the adjoint random walks, a measure of convergence speed and serial performance, are made with respect to the eigenvalues of the linear operator. In addition, relationships for the effective optical thickness of a domain in the decomposition are presented based on the spectral analysis and diffusion theory. Using the effective optical thickness, the Wigner rational approximation and the mean chord approximation are applied to estimate the leakage fraction of stochastic histories from a domain in the decomposition as a measure of parallel performance and potential communication costs. The one-speed, two-dimensional neutron diffusion equation is used as a model problem to test the models for symmetric operators. In general, the derived approximations show good agreement with measured computational results. (authors)

97 MATHEMATICS AND COMPUTING↗

Impact of Pretreatment and Aging on the Iodine Capture Performance of Silver-Exchanged Mordenite - 12314

Volatile gas emissions from a nuclear fuel recycle facility in the United States are governed by several key regulations, including 10 CFR 20, 40 CFR 61, and 40 CFR 190. Under 40 CFR 190, the total quantity of iodine that may be released to the environment from the entire fuel cycle is limited to 5 millicuries of I-129 per gigawatt-year of electrical energy produced by the fuel cycle. With a reasonable engineering margin, an iodine decontamination factor (DF) of approximately 1000 will be required for the complete fuel cycle. Off-gas treatment in a fuel reprocessing plant must address several gas streams containing iodine, among a number of volatile radionuclides. Past research and developmental activities identified silver-exchanged mordenite (AgZ) as a very promising sorbent based on its acid resistance, relatively high iodine and methyl iodide capacity, and high achievable DF. Recent studies at ORNL have focused on the impacts of long-term exposure to simulated off-gas streams (aging) and pretreatment on the iodine adsorption performance of hydrogen-reduced silver-exchanged mordenite (Ag{sup 0}Z). Experiments were conducted to determine the effects of long-term exposure to both dry and moist air on the iodine sorption capacity of Ag{sup 0}Z. The data indicates that aging reduces the capacity of Ag{sup 0}Z, which must be accounted for to prevent degradation of DF. Because of its high acid resistance, a AgZ sorbent has been selected specifically for application in treating off-gas streams containing iodine. While extensive tests have been conducted in the United States on a form of this sorbent, the specific material previously tested is no longer commercially available and similar materials are currently being evaluated. As part of this evaluation, tests were conducted to determine the iodine sorption properties of this replacement media and the effects of long-term (up to 6 months) exposure to simulated off-gas streams. The ultimate goal is to develop an understanding of the fundamental phenomena that controls aging for this material and other zeolites that could be considered for use in off-gas treatment in the future. The trends in the study results indicate that the amount of elemental silver observed by XRD increases from 0.3 wt% in vendor-supplied AgZ to approximately 5 wt% by reducing the material with hydrogen. The study also concluded that aging decreases the quantity of elemental silver in the material. After 2 months of aging, the Ag{sup 0} content of an experimental sample was reduced from 5 wt% to about 1.3 wt%. The form into which the elemental silver is converted during aging was not determined. Experimental tests have been initiated to study how aging of Ag{sup 0}Z impacts iodine loading on the zeolite. Loading tests with un-aged Ag{sup 0}Z resulted in an 81% silver utilization. The loading capacity of iodine on Ag{sup 0}Z was reduced with aging in dry air. Material aged for 6 months in dry air had a 40% reduction in iodine loading capacity. Under moist-air aging conditions, a significant decrease in the rate and total loading (∼45% of theoretical) of iodine uptake can be observed beginning with the shortest aging period (i.e., after 1 month) when compared with the loading curve using Ag{sup 0}Z with no aging. Increasing exposure time to the humid air used to age the Ag{sup 0}Z beyond 1 month resulted in a slight additional reduction in capacity to about 35% of theoretical at 2 months. Virtually identical capacity was observed with 4 months of aging. Compared to the non-aged material, the 1 month dry-air aged Ag{sup 0}Z shows about a 35% reduction (approximate) in iodine loading capacity and the 6 month dry-air aged Ag{sup 0}Z shows about a 50% reduction. These studies generated several questions that will be addressed in future tests. They include the following: Is there indeed degradation over time (in storage) in the iodine adsorption performance of Ag{sup 0}Z? Once reduced, how should the Ag{sup 0}Z be stored- under a hydrogen atmosphere, an inert atmosphere, a desiccant, or some other method or combination of methods? Does Ag{sup 0}Z have a 'shelf life' that must be considered after receipt from a vendor and before use in a plant? Also, how should a column of Ag{sup 0}Z be stored offline in a processing plant (parallel column) arrangement? Future tests will also include increasingly challenging aging environments such as acid vapor conditions. (authors)

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

CASL COBRA-TF improvements for PWR DNB analysis

COBRA-TF (CTF) is a thermal hydraulic (T/H) subchannel code using either three-dimensional (3D) Cartesian or subchannel coordinate formulations for two-phase fluid flow and heat transfer solutions. CTF has been improved under the Consortium for Advanced Simulation of Light Water Reactors (CASL) program for Pressurized Water Reactor (PWR) applications, including software optimization, new closure models, pre- and post-processing and parallelization for modeling full reactor core T/H responses under normal operating and accident conditions. As a result of collaboration among CASL partners including the Westinghouse Electric Company, the Oak Ridge National Laboratory (ORNL), and the Sandia National Laboratories, additional modeling improvements were made to CTF specifically for PWR Departure from Nucleate Boiling (DNB) analysis, including a code option to evaluate fuel thermal margin in terms of DNB Ratio (DNBR) and an axial shape factor to account for effect of non-uniform axial power distribution on DNB. Multiple DNB correlations are now linked with CTF for different applications, including the Westinghouse proprietary WRB-1 correlation for fuel designs containing mixing vane grid spacers. The improved CTF code with the WRB-1 correlation (CTF/WRB-1) was validated using the DNB data from the PWR Subchannel Bundle Tests (PSBT). In addition to the comparison with the test data, the CTF/WRB-1 DNBR results and the associated local fluid conditions were compared to the results of the Westinghouse T/H design code, VIPRE-W, which is an enhanced version of the VIPRE-01 code originally developed by the Electric Power Research Institute (EPRI). The comparisons showed that CTF/WRB-1 DNBR predictions are in good agreement with the VIPRE-W results within the applicable range of the DNB correlation. A model sensitivity study was performed to confirm that the CTF void drift model had an insignificant effect on DNBR under the steam line break (SLB) low pressure condition. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Evaluation of Low Power ARM Processors for Monte Carlo Particle Transport: MCNP6 on the ARM Cortex-A8 - Paper 83

In the push towards exascale computing, the limiting factors are power requirements and heat dissipation. Using current technology, the power required to drive an exascale supercomputer would near 400-MW. Clearly, future computing hardware will have to be more energy efficient in order to achieve exascale performance. Most of the current research in advanced computing architectures is in the use of standard CPUs with accelerators. However, these accelerators are not generally supported by the traditional scientific programming languages (C, C++, and Fortran) and the scientific software must be tailored specifically to take advantage of the accelerators. Large scale scientific software (hundreds-of-thousand to millions of lines of code) can not be easily ported to the computing platform du jour. The widespread use of low power ARM based processors in the mobile computing market offer a low power alternative to accelerators that are also supported by the traditional scientific programming languages and programming paradigms such as MPI and OpenMP. Computing architectures for scientific computing are often assessed using standard benchmarks such as LINPACK benchmark or using suites of mini-applications that are greatly simplified stand-ins for scientific software. Often the real applications that will deployed on the scientific supercomputers are not ported or tested until delivery of the machines. In order to evaluate the use of ARM processors for scientific computing the Monte Carlo particle transport code, MCNP version 6 was compiled on the ARM Cortex-A8 and a set of benchmark problems were used to assess performance in comparison to an Intel Xeon E5-2670 and the low power Intel Atom N270. MCNP is a continuous energy Monte Carlo particle transport code in development at Los Alamos National Laboratory since 1977. MCNP is used to transport neutrons, photon, electrons, and charged particles using continuous energy interaction data. It is commonly used in fields of nuclear power, nuclear medicine, radiation protection, and high-energy physics through-out the world. MCNP version 6 is approximately 450 thousand lines of code, written primary in Fortran90, with some C and C++. MCNP supports distributed multiprocessing using MPI and threading with OpenMP. The ARM Cortex-A8 executes MCNP6 using about twice as much power as the Intel Xeon E5-2670 and about the same amount of power as the Intel Atom N270. However, these results are encouraging for the use of low-power ARM chips in future supercomputers. The ARM Cortex-A8 is a 32-bit CPU and it's NEON general-purpose SIMD (single-instruction multiple data) engine does not support double-precision floating-point arithmetic. More recent ARM processors (ARM Cortex-A53 and Cortex-A57) support 64-bit addressing and have NEON co-processors that support double-precision floating-point arithmetic. ARM claims that the A50 series delivers a performance increase of 15 times the Cortex-A8 performance for similar power usage. (authors)

61 RADIATION PROTECTION AND DOSIMETRY↗

Performance enhancement of planar MOC calculation in hexagonal geometries by assembly-wise domain decomposition

The parallelization of planar Method of Characteristics (MOC) calculation with the higher order scattering in the hexagonal version of the nTRACER direct whole core calculation code is enhanced by adopting assembly-wise domain decomposition and other techniques. In order to augment the hexagonal domain decomposition, the three-color scheme, the angular decomposition, and the angular flux storage scheme are examined. The parallel performance assessed for the VVER benchmark problems demonstrates that the hexagonal assembly-wise domain decomposition significantly reduces the computing time in ray tracing by up to 64 %. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Parallel transport sweeps on two-dimensional cartesian and hexagonal grids

This paper aims to provide a proof of concept for parallel transport sweeps on two-dimensional hexagonal grids for the discrete ordinates transport equation. While the method is an extension of the popular and well-established Koch-Baker-Alcoulffe (KBA) algorithm, there are significant differences between the cartesian and hexagonal grid and thereafter sweep. The most important is the three-way connectivity of hexagons within the grid which creates greater dependencies between the elements. The KBA method in structured orthogonal grids was first implemented in the DRAGON5 code and the method is first described here. The differences in implementation for the hexagonal grid are also described. Benchmark results are also presented, showing roughly 10 times speedup in computational times with roughly 100 processors, in both cases. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗