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 343 records · Page 19

Parallel 3D Finite Element Particle-in-Cell Simulations with Pic3P

SLAC's Advanced Computations Department (ACD) has developed the parallel 3D Finite Element electromagnetic Particle-In-Cell code Pic3P. Designed for simulations of beam-cavity interactions dominated by space charge effects, Pic3P solves the complete set of Maxwell-Lorentz equations self-consistently and includes space-charge, retardation and boundary effects from first principles. Higher-order Finite Element methods with adaptive refinement on conformal unstructured meshes lead to highly efficient use of computational resources. Massively parallel processing with dynamic load balancing enables large-scale modeling of photoinjectors with unprecedented accuracy, aiding the design and operation of next-generation accelerator facilities. Applications include the LCLS RF gun and the BNL polarized SRF gun.

43 PARTICLE ACCELERATORS↗

An analysis of various solution strategies and perturbations on inputs of the reactor shielding problem - 25584

Previous work focused on the use of automated variance reduction parameters for use in a fixed source reactor shielding problem to solve for ex-core particle transport results. The current work assesses that strategy in light of a fully-coupled Monte Carlo problem run as a critical system with parallel processing and the use of moderate variance reduction parameters set manually. The results from the two strategies compare well. Also, results are compared between the MCNP, Virtual Environment for Reactor Applications (VERA) and Shift computer codes. Shift and VERA deliver similar results and compare well to MCNP. (authors)

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Mixed augmented variational formulation (MAVF) for lower hybrid full-wave calculations

In the continuation of the works led in cylindrical geometry, a full toroidal description for an arbitrary poloidal cross-section of the plasma has been developed. For simulation purpose a mixed augmented variational formulation (MAVF), which is particularly well suited for solving Maxwell equations, is considered. The discretization of the MAVF is carried out using Taylor-Hood P2-iso-P1 finite elements. This formulation provide a natural implementation for parallel processing, a particularly important aspect when simulations for plasmas of large size must be considered. Details on the specific application of the MAVF to the LH problem are presented, as well as the structure of the corresponding matrices. A first application to a realistic small tokamak configuration is considered.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Optical selectivity calculations of {sup 90}Sr isotope in double optical resonance photoionization schemes

Seven new schemes have been theoretically studied using the density-matrix approach for the ns{sup 2}({sup 1}S{sub 0}){yields}nsnp({sup 3}P{sub 1}{sup 0} or {sup 1}P{sub 1}{sup 0}){yields}nsms({sup 1}S{sub 0}) and the ns{sup 2}({sup 1}S{sub 0}){yields}nsnp({sup 3}P{sub 1}{sup 0} or {sup 1}P{sub 1}{sup 0}){yields}np{sup 2}({sup 1}S{sub 0} or {sup 1}D{sub 2}) double optical resonance photoionization pathways to establish the possibility of selective ionization of the rare strontium {sup 90}Sr isotope for continuous wave laser excitation. The double-resonance excitation is followed by photoionization using a 488 nm photon. Density-matrix equations for the double-resonance ionization have been numerically integrated by incorporating the effects of Doppler broadening, velocity-dependent interaction times, time varying Rabi frequencies, and laser bandwidths. All the optical selectivity calculations were carried out on a high-speed parallel processing machine. Theoretical computations on five previously studied photoionization pathways have also been performed and tabulated for the sake of completeness. The conditions for obtaining optimum optical selectivities have been evaluated. This study results in seven new photoionization pathways. The optical selectivities are a few orders higher compared to the previously studied photoionization schemes for five out of the seven schemes studied. The remaining two schemes are slightly better than the previously studied schemes.

74 ATOMIC AND MOLECULAR PHYSICS↗

Application of Generic Disposal System Models

This report describes specific GDSA activities in fiscal year 2015 (FY2015) toward the development of the enhanced disposal system modeling and analysis capability for geologic disposal of nuclear waste. The GDSA framework employs the PFLOTRAN thermal-hydrologic-chemical multi-physics code (Hammond et al., 2011) and the Dakota uncertainty sampling and propagation code (Adams et al., 2013). Each code is designed for massively-parallel processing in a high-performance computing (HPC) environment. Multi-physics representations in PFLOTRAN are used to simulate various coupled processes including heat flow, fluid flow, waste dissolution, radionuclide release, radionuclide decay and ingrowth, precipitation and dissolution of secondary phases, and radionuclide transport through the engineered barriers and natural geologic barriers to a well location in an overlying or underlying aquifer. Dakota is used to generate sets of representative realizations and to analyze parameter sensitivity.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

SURFACE GEOPHYSICAL EXPLORATION DEVELOPING NONINVASIVE TOOLS TO MONITOR PAST LEAKS AROUND HANFORD TANK FARMS

A characterization program has been developed at Hanford to image past leaks in and around the underground storage tank facilities. The program is based on electrical resistivity, a geophysical technique that maps the distribution of electrical properties of the subsurface. The method was shown to be immediately successful in open areas devoid of underground metallic infrastructure, due to the large contrast in material properties between the highly saline waste and the dry sandy host environment. The results in these areas, confirmed by a limited number of boreholes, demonstrate a tendency for the lateral extent of the underground waste plume to remain within the approximate footprint of the disposal facility. In infrastructure-rich areas, such as tank farms, the conventional application of electrical resistivity using small point-source surface electrodes initially presented a challenge for the resistivity method. The method was then adapted to directly use the buried infrastructure as electrodes for both transmission of electrical current and measurements of voltage. For example, steel-cased wells that surround the tanks were used as long electrodes, which helped to avoid much of the infrastructure problems. Overcoming the drawbacks of the long electrode method has been the focus of our work over the past seven years. The drawbacks include low vertical resolution and limited lateral coverage. The lateral coverage issue has been improved by supplementing the long electrodes with surface electrodes in areas devoid of infrastructure. The vertical resolution has been increased by developing borehole electrode arrays that can fit within the small-diameter drive casing of a direct push rig. The evolution of the program has led to some exceptional advances in the application of geophysical methods, including logistical deployment of the technology in hazardous areas, development of parallel processing resistivity inversion algorithms, and adapting the processing tools to accommodate electrodes of all shapes and locations. The program is accompanied by a full set of quality assurance procedures that cover the layout of sensors, measurement strategies, and software enhancements while insuring the integrity of stored data. The data have been shown to be useful in identifying previously unknown contaminant sources and defining the footprint of precipitation recharge barriers to retard the movement of existing contamination.

99 GENERAL AND MISCELLANEOUS↗

Accelerated Adaptive MGS Phase Retrieval

The Modified Gerchberg-Saxton (MGS) algorithm is an image-based wavefront-sensing method that can turn any science instrument focal plane into a wavefront sensor. MGS characterizes optical systems by estimating the wavefront errors in the exit pupil using only intensity images of a star or other point source of light. This innovative implementation of MGS significantly accelerates the MGS phase retrieval algorithm by using stream-processing hardware on conventional graphics cards. Stream processing is a relatively new, yet powerful, paradigm to allow parallel processing of certain applications that apply single instructions to multiple data (SIMD). These stream processors are designed specifically to support large-scale parallel computing on a single graphics chip. Computationally intensive algorithms, such as the Fast Fourier Transform (FFT), are particularly well suited for this computing environment. This high-speed version of MGS exploits commercially available hardware to accomplish the same objective in a fraction of the original time. The exploit involves performing matrix calculations in nVidia graphic cards. The graphical processor unit (GPU) is hardware that is specialized for computationally intensive, highly parallel computation. From the software perspective, a parallel programming model is used, called CUDA, to transparently scale multicore parallelism in hardware. This technology gives computationally intensive applications access to the processing power of the nVidia GPUs through a C/C++ programming interface. The AAMGS (Accelerated Adaptive MGS) software takes advantage of these advanced technologies, to accelerate the optical phase error characterization. With a single PC that contains four nVidia GTX-280 graphic cards, the new implementation can process four images simultaneously to produce a JWST (James Webb Space Telescope) wavefront measurement 60 times faster than the previous code.

Lam, Raymond K.↗

State of the art in electromagnetic modeling for the Compact Linear Collider

SLAC's Advanced Computations Department (ACD) has developed the parallel 3D electromagnetic time-domain code T3P for simulations of wakefields and transients in complex accelerator structures. T3P is based on state-of-the-art Finite Element methods on unstructured grids and features unconditional stability, quadratic surface approximation and up to 6th-order vector basis functions for unprecedented simulation accuracy. Optimized for large-scale parallel processing on leadership supercomputing facilities, T3P allows simulations of realistic 3D structures with fast turn-around times, aiding the design of the next generation of accelerator facilities. Applications include simulations of the proposed two-beam accelerator structures for the Compact Linear Collider (CLIC) - wakefield damping in the Power Extraction and Transfer Structure (PETS) and power transfer to the main beam accelerating structures are investigated.

43 PARTICLE ACCELERATORS↗

Advances in Geologic Disposal System Modeling and Application to Crystalline Rock

The Used Fuel Disposition Campaign (UFDC) of the U.S. Department of Energy (DOE) Office of Nuclear Energy (NE), Office of Fuel Cycle Technology (OFCT) is conducting research and development (R&D) on geologic disposal of used nuclear fuel (UNF) and high-level nuclear waste (HLW). Two of the high priorities for UFDC disposal R&D are design concept development and disposal system modeling (DOE 2011). These priorities are directly addressed in the UFDC Generic Disposal Systems Analysis (GDSA) work package, which is charged with developing a disposal system modeling and analysis capability for evaluating disposal system performance for nuclear waste in geologic media (e.g., salt, granite, clay, and deep borehole disposal). This report describes specific GDSA activities in fiscal year 2016 (FY 2016) toward the development of the enhanced disposal system modeling and analysis capability for geologic disposal of nuclear waste. The GDSA framework employs the PFLOTRAN thermal-hydrologic-chemical multi-physics code and the Dakota uncertainty sampling and propagation code. Each code is designed for massively-parallel processing in a high-performance computing (HPC) environment. Multi-physics representations in PFLOTRAN are used to simulate various coupled processes including heat flow, fluid flow, waste dissolution, radionuclide release, radionuclide decay and ingrowth, precipitation and dissolution of secondary phases, and radionuclide transport through engineered barriers and natural geologic barriers to the biosphere. Dakota is used to generate sets of representative realizations and to analyze parameter sensitivity.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Developing extensible lattice-Boltzmann simulationsfor general-purpose graphics-programming units

Lattice-Boltzmann methods are versatile numerical modeling techniques capable of reproducing a wide variety of fluid-mechanical behavior. These methods are well suited to parallel implementation, particularly on the single-instruction multiple data (SIMD) parallel processing environments found in computer graphics processing units (GPUs). Although more recent programming tools dramatically improve the ease with which GPU programs can be written, the programming environment still lacks the flexibility available to more traditional CPU programs. In particular, it may be difficult to develop modular and extensible programs that require variable on-device functionality with current GPU architectures. This paper describes a process of automatic code generation that overcomes these difficulties for lattice-Boltzmann simulations. It details the development of GPU-based modules for an extensible lattice-Boltzmann simulation package - LBHydra. The performance of the automatically generated code is compared to equivalent purpose written codes for both single-phase, multiple-phase, and multiple-component flows. The flexibility of the new method is demonstrated by simulating a rising, dissolving droplet in a porous medium with user generated lattice-Boltzmann models and subroutines.

97 MATHEMATICS AND COMPUTING↗

Marine Animal Alert System -- Task 2.1.5.3: Development of Monitoring Technologies -- FY 2011 Progress Report

The Marine Animal Alert System (MAAS) in development by the Pacific Northwest National Laboratory is focused on providing elements of compliance monitoring to support deployment of marine hydrokinetic energy devices. An initial focus is prototype tidal turbines to be deployed in Puget Sound in Washington State. The MAAS will help manage the risk of injury or mortality to marine animals from blade strike or contact with tidal turbines. In particular, development has focused on detection, classification, and localization of listed Southern Resident killer whales within 200 m of prototype turbines using both active and passive acoustic approaches. At the close of FY 2011, a passive acoustic system consisting of a pair of four-element star arrays and parallel processing of eight channels of acoustic receptions has been designed and built. Field tests of the prototype system are scheduled for the fourth quarter of calendar year 2011. Field deployment and testing of the passive acoustic prototype is scheduled for the first quarter of FY 2012. The design of an active acoustic system that could be built using commercially available off-the-shelf components from active acoustic system vendors is also in the final stages of design and specification.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

SALSA3D : a global 3D p-velocity model of the Earth's crust and mantle for improved event location.

To test the hypothesis that high quality 3D Earth models will produce seismic event locations which are more accurate and more precise, we are developing a global 3D P wave velocity model of the Earth's crust and mantle using seismic tomography. In this paper, we present the most recent version of our model, SALSA3D version 1.5, and demonstrate its ability to reduce mislocations for a large set of realizations derived from a carefully chosen set of globally-distributed ground truth events. Our model is derived from the latest version of the Ground Truth (GT) catalog of P and Pn travel time picks assembled by Los Alamos National Laboratory. To prevent over-weighting due to ray path redundancy and to reduce the computational burden, we cluster rays to produce representative rays. Reduction in the total number of ray paths is {approx}50%. The model is represented using the triangular tessellation system described by Ballard et al. (2009), which incorporates variable resolution in both the geographic and radial dimensions. For our starting model, we use a simplified two layer crustal model derived from the Crust 2.0 model over a uniform AK135 mantle. Sufficient damping is used to reduce velocity adjustments so that ray path changes between iterations are small. We obtain proper model smoothness by using progressive grid refinement, refining the grid only around areas with significant velocity changes from the starting model. At each grid refinement level except the last one we limit the number of iterations to prevent convergence thereby preserving aspects of broad features resolved at coarser resolutions. Our approach produces a smooth, multi-resolution model with node density appropriate to both ray coverage and the velocity gradients required by the data. This scheme is computationally expensive, so we use a distributed computing framework based on the Java Parallel Processing Framework, providing us with {approx}400 processors. Resolution of our model is assessed using a variation of the standard checkerboard method. We compare the travel-time prediction and location capabilities of SALSA3D to standard 1D models via location tests on a global event set with GT of 5 km or better. These events generally possess hundreds of Pn and P picks from which we generate different realizations of station distributions, yielding a range of azimuthal coverage and ratios of teleseismic to regional arrivals, with which we test the robustness and quality of relocation. The SALSA3D model reduces mislocation over standard 1D ak135 regardless of Pn to P ratio, with the improvement being most pronounced at higher azimuthal gaps.

99 GENERAL AND MISCELLANEOUS↗

A global 3D P-velocity model of the Earth's crust and mantle for improved event location : SALSA3D.

To test the hypothesis that high quality 3D Earth models will produce seismic event locations which are more accurate and more precise, we are developing a global 3D P wave velocity model of the Earth's crust and mantle using seismic tomography. In this paper, we present the most recent version of our model, SALSA3D version 1.5, and demonstrate its ability to reduce mislocations for a large set of realizations derived from a carefully chosen set of globally-distributed ground truth events. Our model is derived from the latest version of the Ground Truth (GT) catalog of P and Pn travel time picks assembled by Los Alamos National Laboratory. To prevent over-weighting due to ray path redundancy and to reduce the computational burden, we cluster rays to produce representative rays. Reduction in the total number of ray paths is {approx}50%. The model is represented using the triangular tessellation system described by Ballard et al. (2009), which incorporates variable resolution in both the geographic and radial dimensions. For our starting model, we use a simplified two layer crustal model derived from the Crust 2.0 model over a uniform AK135 mantle. Sufficient damping is used to reduce velocity adjustments so that ray path changes between iterations are small. We obtain proper model smoothness by using progressive grid refinement, refining the grid only around areas with significant velocity changes from the starting model. At each grid refinement level except the last one we limit the number of iterations to prevent convergence thereby preserving aspects of broad features resolved at coarser resolutions. Our approach produces a smooth, multi-resolution model with node density appropriate to both ray coverage and the velocity gradients required by the data. This scheme is computationally expensive, so we use a distributed computing framework based on the Java Parallel Processing Framework, providing us with {approx}400 processors. Resolution of our model is assessed using a variation of the standard checkerboard method. We compare the travel-time prediction and location capabilities of SALSA3D to standard 1D models via location tests on a global event set with GT of 5 km or better. These events generally possess hundreds of Pn and P picks from which we generate different realizations of station distributions, yielding a range of azimuthal coverage and ratios of teleseismic to regional arrivals, with which we test the robustness and quality of relocation. The SALSA3D model reduces mislocation over standard 1D ak135 regardless of Pn to P ratio, with the improvement being most pronounced at higher azimuthal gaps.

99 GENERAL AND MISCELLANEOUS↗

Efficiency and Scalability of Barrier Synchronization on NoC Based Many-core Architectures

Interconnects based on Networks-on-Chip are an appealing solution to address future microprocessor designs where, very likely, hundreds of cores will be connected on a single chip. A fundamental role in highly parallelized applications running on many-core architectures will be played by barrier primitives used to synchronize the execution of parallel processes. This paper focuses on the analysis of the efficiency and scalability of different barrier implementations in many-core architectures based on NoCs. Several message passing barrier implementations based on four algorithms (all-to-all, master-slave, butterfly and tree) have been implemented and evaluated for a single-chip target architecture composed of a variable number of cores (from 4 to 128) and different network topologies (mesh, torus, ring, clustered-ring and fat-tree). Using a cycle-accurate simulator, we show the scalability of each barrier for every NoC topology, analyzing and comparing theoretical with real behaviors. We observed that some barrier algorithms, when implemented in hardware or software, show a different scaling behavior with respect to those theoretically expected. We evaluate the efficiency of each combination topology-barrier, demonstrating that, in many cases, simple network topologies can be more efficient than complex and highly connected topologies.

97 MATHEMATICS AND COMPUTING↗

Incentive Compatible Online Scheduling of Malleable Parallel Jobs with Individual Deadlines

We consider the online scheduling of malleable jobs on parallel systems, such as clusters, symmetric multiprocessing computers, and multi-core processor computers. Malleable jobs is a model of parallel processing in which jobs adapt to the number of processors assigned to them. This model permits the scheduler and resource manager to make more efficient use of the available resources. Each malleable job is characterized by arrival time, deadline, and value. If the job completes by its deadline, the user earns the payoff indicated by the value; otherwise, she earns a payoff of zero. The scheduling objective is to maximize the sum of the values of the jobs that complete by their associated deadlines. Complicating the matter is that users in the real world are rational and they will attempt to manipulate the scheduler by misreporting their jobs’ parameters if it benefits them to do so. To mitigate this behavior, we design an incentive compatible online scheduling mechanism. Incentive compatibility assures us that the users will obtain the maximum payoff only if they truthfully report their jobs’ parameters to the scheduler. Finally, we simulate and study the mechanism to show the effects of misreports on the cheaters and on the system.

99 GENERAL AND MISCELLANEOUS↗

Performance Characterization of a Hierarchical MPI Implementations on Large-scale Distributed-memory Platforms

The building blocks of emerging Petascale massively parallel processing (MPP) systems are multi-core processors with four or more cores as a single processing element and a customized network interface. The resulting memory and communication hierarchy of these platforms are now exposed to application developers and end users by creating a hierarchical or multi-core aware message-passing (MPI) programming interface and by providing a handful of runtime, tunable parameters that allows mapping and control of MPI tasks and message handling. We characterize performance of MPI communication patterns and present strategies for optimizing applications performance on Cray XT series systems that are composed of contemporary AMD processors and a proprietary network infrastructure. We highlight dependencies in its memory and network subsystems, which could influence production-level applications performance. We demonstrate that MPI micro-benchmarks could mislead an application developer or end user since these benchmarks often do not expose the interplay between memory allocation and usage in the user space, which depends on the number of tasks or cores and workload characteristics. Our studies show performance improvements compared to the default options for our target scientific benchmarks and production-level applications.

99 GENERAL AND MISCELLANEOUS↗

Optimizing the inner loop of the gravitational force interaction on modern processors

We have achieved superior performance on multiple generations of the fastest supercomputers in the world with our hashed oct-tree N-body code (HOT), spanning almost two decades and garnering multiple Gordon Bell Prizes for significant achievement in parallel processing. Execution time for our N-body code is largely influenced by the force calculation in the inner loop. Improvements to the inner loop using SSE3 instructions has enabled the calculation of over 200 million gravitational interactions per second per processor on a 2.6 GHz Opteron, for a computational rate of over 7 Gflops in single precision (700/0 of peak). We obtain optimal performance some processors (including the Cell) by decomposing the reciprocal square root function required for a gravitational interaction into a table lookup, Chebychev polynomial interpolation, and Newton-Raphson iteration, using the algorithm of Karp. By unrolling the loop by a factor of six, and using SPU intrinsics to compute on vectors, we obtain performance of over 16 Gflops on a single Cell SPE. Aggregated over the 8 SPEs on a Cell processor, the overall performance is roughly 130 Gflops. In comparison, the ordinary C version of our inner loop only obtains 1.6 Gflops per SPE with the spuxlc compiler.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A global 3D P-velocity model of the Earth's crust and mantle for improved event location.

To test the hypothesis that high quality 3D Earth models will produce seismic event locations which are more accurate and more precise, we are developing a global 3D P wave velocity model of the Earth's crust and mantle using seismic tomography. In this paper, we present the most recent version of our model, SALSA3D (SAndia LoS Alamos) version 1.4, and demonstrate its ability to reduce mislocations for a large set of realizations derived from a carefully chosen set of globally-distributed ground truth events. Our model is derived from the latest version of the Ground Truth (GT) catalog of P and Pn travel time picks assembled by Los Alamos National Laboratory. To prevent over-weighting due to ray path redundancy and to reduce the computational burden, we cluster rays to produce representative rays. Reduction in the total number of ray paths is > 55%. The model is represented using the triangular tessellation system described by Ballard et al. (2009), which incorporates variable resolution in both the geographic and radial dimensions. For our starting model, we use a simplified two layer crustal model derived from the Crust 2.0 model over a uniform AK135 mantle. Sufficient damping is used to reduce velocity adjustments so that ray path changes between iterations are small. We obtain proper model smoothness by using progressive grid refinement, refining the grid only around areas with significant velocity changes from the starting model. At each grid refinement level except the last one we limit the number of iterations to prevent convergence thereby preserving aspects of broad features resolved at coarser resolutions. Our approach produces a smooth, multi-resolution model with node density appropriate to both ray coverage and the velocity gradients required by the data. This scheme is computationally expensive, so we use a distributed computing framework based on the Java Parallel Processing Framework, providing us with {approx}400 processors. Resolution of our model is assessed using a variation of the standard checkerboard method, as well as by directly estimating the diagonal of the model resolution matrix based on the technique developed by Bekas, et al. We compare the travel-time prediction and location capabilities of this model over standard 1D models. We perform location tests on a global, geographically-distributed event set with ground truth levels of 5 km or better. These events generally possess hundreds of Pn and P phases from which we can generate different realizations of station distributions, yielding a range of azimuthal coverage and proportions of teleseismic to regional arrivals, with which we test the robustness and quality of relocation. The SALSA3D model reduces mislocation over standard 1D ak135, especially with increasing azimuthal gap. The 3D model appears to perform better for locations based solely or dominantly on regional arrivals, which is not unexpected given that ak135 represents a global average and cannot therefore capture local and regional variations.

99 GENERAL AND MISCELLANEOUS↗