Search NASA⌕ Search

SEARCH · Search NASA

Results for “Threading”

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 793 records · Page 44

Accelerating population balance-Monte Carlo simulation for coagulation dynamics from the Markov jump model, stochastic algorithm and GPU parallel computing

This paper proposes a comprehensive framework for accelerating population balance-Monte Carlo (PBMC) simulation of particle coagulation dynamics. By combining Markov jump model, weighted majorant kernel and GPU (graphics processing unit) parallel computing, a significant gain in computational efficiency is achieved. The Markov jump model constructs a coagulation-rule matrix of differentially-weighted simulation particles, so as to capture the time evolution of particle size distribution with low statistical noise over the full size range and as far as possible to reduce the number of time loopings. Here three coagulation rules are highlighted and it is found that constructing appropriate coagulation rule provides a route to attain the compromise between accuracy and cost of PBMC methods. Further, in order to avoid double looping over all simulation particles when considering the two-particle events (typically, particle coagulation), the weighted majorant kernel is introduced to estimate the maximum coagulation rates being used for acceptance–rejection processes by single-looping over all particles, and meanwhile the mean time-step of coagulation event is estimated by summing the coagulation kernels of rejected and accepted particle pairs. The computational load of these fast differentially-weighted PBMC simulations (based on the Markov jump model) is reduced greatly to be proportional to the number of simulation particles in a zero-dimensional system (single cell). Finally, for a spatially inhomogeneous multi-dimensional (multi-cell) simulation, the proposed fast PBMC is performed in each cell, and multiple cells are parallel processed by multi-cores on a GPU that can implement the massively threaded data-parallel tasks to obtain remarkable speedup ratio (comparing with CPU computation, the speedup ratio of GPU parallel computing is as high as 200 in a case of 100 cells with 10 000 simulation particles per cell). These accelerating approaches of PBMC are demonstrated in a physically realistic Brownian coagulation case. The computational accuracy is validated with benchmark solution of discrete-sectional method. The simulation results show that the comprehensive approach can attain very favorable improvement in cost without sacrificing computational accuracy.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Separable projection integrals for higher-order correlators of the cosmic microwave sky: Acceleration by factors exceeding 100

We present a case study describing efforts to optimise and modernise “Modal”, the simulation and analysis pipeline used by the Planck satellite experiment for constraining general non-Gaussian models of the early universe via the bispectrum (or three-point correlator) of the cosmic microwave background radiation. We focus on one particular element of the code: the projection of bispectra from the end of inflation to the spherical shell at decoupling, which defines the CMB we observe today. This code involves a three-dimensional inner product between two functions, one of which requires an integral, on a non-rectangular domain containing a sparse grid. We show that by employing separable methods this calculation can be reduced to a one-dimensional summation plus two integrations, reducing the overall dimensionality from four to three. The introduction of separable functions also solves the issue of the non-rectangular sparse grid. This separable method can become unstable in certain scenarios and so the slower non-separable integral must be calculated instead. We present a discussion of the optimisation of both approaches. We demonstrate significant speed-ups of ≈100×, arising from a combination of algorithmic improvements and architecture-aware optimisations targeted at improving thread and vectorisation behaviour. The resulting MPI/OpenMP hybrid code is capable of executing on clusters containing processors and/or coprocessors, with strong-scaling efficiency of 98.6% on up to 16 nodes. We find that a single coprocessor outperforms two processor sockets by a factor of 1.3× and that running the same code across a combination of both microarchitectures improves performance-per-node by a factor of 3.38×. By making bispectrum calculations competitive with those for the power spectrum (or two-point correlator) we are now able to consider joint analysis for cosmological science exploitation of new data.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Reduced dislocation density in Ga x In 1–x P compositionally graded buffer layers through engineered glide plane switch

In this work we develop control over dislocation glide dynamics in Ga x In 1-x P compositionally graded buffer layers (CGBs) through control of CuPt ordering on the group-III sublattice. The ordered structure is metastable in the bulk, so any glissile dislocation that disrupts the ordered pattern will release stored energy, and experience an increased glide force. Here we show how this connection between atomic ordering and dislocation glide force can be exploited to control the threading dislocation density (TDD) in Ga x In 1-x P CGBs. When ordered Ga x In 1-x P is graded from the GaAs lattice constant to InP, the order parameter ..eta.. decreases as x decreases, and dislocation glide switches from one set of glide planes to the other. This glide plane switch (GPS) is accompanied by the nucleation of dislocations on the new glide plane, which typically leads to increased TDD. We develop control of the GPS position within a Ga x In 1-x P CGB through manipulation of deposition temperature, surfactant concentration, and strain-grading rate. We demonstrate a two-stage Ga x In 1-x P CGB from GaAs to InP with sufficiently low TDD for high performance devices, such as the 4-junction inverted metamorphic multi-junction solar cell, achieved through careful control the GPS position. Here, experimental results are analyzed within the context of a model that considers the force balance on dislocations on the two competing glide planes as a function of the degree of ordering.

14 SOLAR ENERGY↗

Electron channeling contrast imaging investigation of stacking fault pyramids in GaP on Si nucleation layers

Thin gallium phosphide layers were deposited on (0 0 1) Silicon surfaces via organometallic vapor phase epitaxy and characterized by electron channeling contrast imaging (ECCI). Stacking fault pyramids at a density of up to 6 x 10 7 cm -2 were identified in the GaP nucleation layer by varying the diffraction conditions. We show that these defects originate at the GaP/Si interface and propagate on all four {1 1 1} planes. We observed that such stacking fault pyramids interact with the gliding of misfit dislocations during lattice-mismatched growth and enhance the threading dislocation density. The initial pulsing of TEGa and TBP during the nucleation of GaP on Silicon has been found to strongly influence the formation of those pyramidal defects. Changing the number of pulse cycles allowed us to lower their density by two orders of magnitude from 6 x 10 7 cm -2 to 4 x 10 5 cm -2 .

36 MATERIALS SCIENCE↗

Using electron channeling contrast imaging to inform and improve the growth of high-efficiency GaAs solar cells on nanopatterned GaAs substrates

Patterned substrates provide opportunities for reducing the cost of high-efficiency III-V devices by incorporating mechanically weak layers beneficial for substrate reuse (e.g. by spalling). In this work, the functionality of electron channeling contrast imaging (ECCI) as a tool to efficiently understand and mitigate defect formation is exemplified by developing a process in which high-quality III-V material can be grown on nanopatterned GaAs substrates. Reactive ion etching used in the patterning process was found to damage the GaAs substrate surface, leading to the formation of stacking faults in the epitaxial material as observed by ECCI. Etching the patterned substrates in a 1 NH4OH: 1 H2O2: 50 DI H2O solution for 10 s prior to growth removed the substrate surface damage and stacking faults were no longer present. Growth of solar cell device structures initially produced samples with many macroscale flaws creating shunts in the devices, which complicated the assessment of material quality by device measurements. However, ECCI revealed that the epitaxial material surrounding macroscale flaws was free from any crystallographic defects such as stacking faults and threading dislocations. With this knowledge, we focused on refining the patterning process to eliminate the macroscale flaws. Solar cells were then grown on the improved nanopatterned substrates and exhibited device structures with defect densities less than 5 x 105 cm -2 and average conversion efficiency of 24.8%, nearly identical to devices grown on unpatterned epi-ready substrates (25.0%).

14 SOLAR ENERGY↗

Stacking fault analysis for the early-stages of PVT growth of 4H-SiC crystals

Here, four types of stacking fault formation mechanisms are identified and discussed for early stage PVT growth of 4H-SiC crystals: Type 1: Shockley / double Shockley stacking fault formation inside the facet; Type 2: Stacking fault formation via 2D nucleation; Type 3: Frank + Shockley (S) stacking fault formation due to deflection of threading mixed dislocation (TMD) by macrosteps; Type 4: “Carrot” defect formation related to overgrowth of the terrace formed by separation of 3c/4 and c/4 step risers after deflection of a TMD by vicinal steps. The results help further reduction of defect generation in 4H-SiC substrates.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Feedback-directed page placement for ccNUMA via hardware-generated memory traces

Non-uniform memory architectures with cache coherence (ccNUMA) are becoming increasingly common, not just for large-scale high performance platforms but also in the context of multi-core architectures. Under ccNUMA, data placement may influence overall application performance significantly as references resolved locally to a processor/core impose lower latencies than remote ones. This work develops a novel hardware-assisted page placement paradigm based on automated tracing of the memory references made by application threads. Two placement schemes, modeling both singlelevel and multi-level latencies, allocate pages near processors that most frequently access that memory page. These schemes leverage performance monitoring capabilities of contemporary microprocessors to efficiently extract an approximate trace of memory accesses. This information is used to decide page affinity, i.e., the node to which the page is bound. The method operates entirely in user space, is widely automated, and handles not only static but also dynamic memory allocation. Experiments show that this method, although based on lossy tracing, can efficiently and effectively improve page placement, leading to an average wall-clock execution time saving of over 20% for the tested benchmarks on the SGI Altix with a 2x remote access penalty and 12% on AMD Opterons with a 1.3–2.0x access penalty. This is accompanied by a one-time tracing overhead of 2.7% over the overall original program wallclock time.

Computer Science↗

Application configuration selection for energy-efficient execution on multicore systems

Balanced performance and energy consumption are incorporated in the design of modern computer systems. Several runtime factors, such as concurrency levels, thread mapping strategies, and dynamic voltage and frequency scaling (DVFS) should be considered in order to achieve optimal energy efficiency fora workload. Selecting appropriate run-time factors, however, is one of the most challenging tasks because the run-time factors are architecture-specific and workload-specific. And while most existing works concentrate on either static analysis of the workload or run-time prediction results, we present a hybrid two-step method that utilizes concurrency levels and DVFS settings to achieve the energy efficiency configuration for a worldoad. The experimental results based on a Xeon E5620 server with NPB and PARSEC benchmark suites show that the model is able to predict the energy efficient configuration accurately. On average, an additional 10% EDP (Energy Delay Product) saving is obtained by using run-time DVFS for the entire system. An off-line optimal solution is used to compare with the proposed scheme. Finally, the experimental results show that the average extra EDP saved by the optimal solution is within 5% on selective parallel benchmarks.

97 MATHEMATICS AND COMPUTING↗

Fast shared-memory streaming multilevel graph partitioning

In this report we show that a fast parallel graph partitioner can benefit many applications by reducing data transfers. The online methods for partitioning graphs have to be fast and they often rely on simple one-pass streaming algorithms, while the offline methods for partitioning graphs contain more involved algorithms and the most successful methods in this category belong to the multilevel approaches. In this work, we assess the feasibility of using streaming graph partitioning algorithms within the multilevel framework. Our end goal is to come up with a fast parallel offline multilevel partitioner that can produce competitive cutsize quality. We rely on a simple but fast and flexible streaming algorithm throughout the entire multilevel framework. This streaming algorithm serves multiple purposes in the partitioning process: a clustering algorithm in the coarsening, an effective algorithm for the initial partitioning, and a fast refinement algorithm in the uncoarsening. Its simple nature also lends itself easily for parallelization. The experiments on various graphs show that our approach is on the average up to 5.1x faster than the multi-threaded MeTiS, which comes at the expense of only 2x worse cutsize.

97 MATHEMATICS AND COMPUTING↗

Laboratory pull-out tests on fully grouted rock bolts and cable bolts: Results and lessons learned

Laboratory pull-out tests were conducted on the following rock bolts and cable bolts: steel rebars, smooth steel bars, fiberglass reinforced polymer threaded bolts, flexible cable bolts, IR5/IN special cable bolts and Mini-cage cable bolts. The diameter of the tested bolts was between 16 mm and 26 mm. The bolts were grouted in a sandstone sample using resin or cement grouts. The tests were conducted under either constant radial stiffness or constant confining pressure boundary conditions applied on the outer surface of the rock sample. In most tests, the rate of displacement was about 0.02 mm/s. The tests were performed using a pull-out bench that allows testing a wide range of parameters. This paper provides an extensive database of laboratory pull-out test results and confirms the influence of the confining pressure and the embedment length on the pull-out response (rock bolts and cable bolts). Furthermore, it also highlights the sensitivity of the results to the operating conditions and to the behavior of the sample as a whole, which cannot be neglected when the test results are used to assess the bolt-grout or the grout–rock interface.

42 ENGINEERING↗

Quantitative characterization of tomotherapy MVCT dosimetry

Megavoltage computed tomography (MVCT) is used as image guidance for patient setup in almost every tomotherapy treatment. Frequent use of ionizing radiation for image guidance has raised concern of imaging dose. The purpose of this work is to quantify and characterize tomotherapy MVCT dosimetry. Our dose calculation was based on a commissioned dose engine, and the calculation result was compared with film measurement. We studied dose profiles, center dose, maximal dose, surface dose, and mean dose on homogeneous cylindrical water phantoms of various diameters for various scanning parameters, including 3 different jaw openings (of nominal value J4, J1, and J0.1) and couch speeds (fine, normal, and coarse). The comparison between calculation and film measurement showed good agreement. In particular, the thread pattern on the film of the helical delivery matched very well with calculation. For the J1 jaw and coarse imaging mode, the maximum difference between calculation and measurement was about 6% of the center dose. Calculation on various sizes of synthesized phantoms showed that the center dose decreases almost linearly as the phantom diameter increases, and that the fine mode (couch speed of 4 mm/rotation) received twice the dose of the normal mode (couch speed of 8 mm/rotation) and 3 times that of the coarse mode (couch speed of 12 mm/rotation) as expected. The maximal dose ranged from 100% to ∼200% of the center dose, with increasing ratios for larger phantoms, smaller jaws, and faster couch speed. For all jaw settings and couch speeds, the mean dose and average surface dose vary from 95% to 125% of the center dose with increasing ratios for larger phantoms. We present a quantitative dosimetric characterization of the tomotherapy MVCT in terms of scanning parameters, phantom size, center dose, maximal dose, surface dose, and mean dose. The results can provide an overall picture of dose distribution and a reference data set that enables estimation of CT dose index for the tomotherapy MVCT.

61 RADIATION PROTECTION AND DOSIMETRY↗

High-speed friction stir butt welding of 25.4 mm thick 7175-T79 aluminum alloy

This presents the first experimental demonstration of friction stir butt welding of 25.4 mm thick high-strength, precipitate-strengthened 7XXX aluminum alloy at a welding speed above 500 mm/min and penetration depth greater than 10 mm. Tool pin threads that terminate away from the shoulder region, helped mitigate nearby stress concentration during tool traversing, enabling a higher welding speed while avoiding pin fracture near shoulder. Two kinds of welds—one-sided with full penetration of the plate thickness and double-sided with partial penetration of the plate thickness—were conducted. Significant grain refinement (grain size 1.3 ± 0.8 µm) was evident at the junction of double-sided friction stir welding (FSW) compared to other regions of weld-nugget or base material. Cross-weld tensile testing with digital image correlation revealed high local strains at the junction of double-sided FSW before macro-yield. This strain concentration impeded the typical early necking on advancing/retreating sides of FSW joints, improving the yield strength of as-welded double-sided FSW by 20–24% over slow- to medium-speed one-sided FSW. In conclusion, the joint efficiency of as-welded, double-sided high-speed FSW was about 76% with respect to the base material’s ultimate tensile strength.

36 MATERIALS SCIENCE↗

The Structure of Fcp1, an Essential RNA Polymerase II CTD Phosphatase

Kinases and phosphatases regulate mRNA synthesis and processing by phosphorylating and dephosphorylating the C-terminal domain (CTD) of the largest subunit of RNA polymerase II. Fcp1 is an essential CTD phosphatase that preferentially hydrolyzes Ser2-PO{sub 4} of the tandem YSPTSPS CTD heptad array. Fcp1 crystal structures were captured at two stages of the reaction pathway: a Mg-BeF{sub 3} complex that mimics the aspartylphosphate intermediate and a Mg-AlF{sub 4}{sup -} complex that mimics the transition state of the hydrolysis step. Fcp1 is a Y-shaped protein composed of an acylphosphatase domain located at the base of a deep canyon formed by flanking modules that are missing from the small CTD phosphatase (SCP) clade: an Fcp1-specific helical domain and a C-terminal BRCA1 C-terminal (BRCT) domain. The structure and mutational analysis reveals that Fcp1 and Scp1 (a Ser5-selective phosphatase) adopt different CTD-binding modes; we surmise the CTD threads through the Fcp1 canyon to access the active site.

36 MATERIALS SCIENCE↗

Benchmarking the Performance of Neuromorphic and Spiking Neural Network Simulators

Software simulators play a critical role in the development of new algorithms and system architectures in any field of engineering. Neuromorphic computing, which has shown potential in building brain-inspired energy-efficient hardware, suffers a slow-down in the development cycle due to a lack of flexible and easy-to-use simulators of either neuromorphic hardware itself or of spiking neural networks (SNNs), the type of neural network computation executed on most neuromorphic systems. While there are several openly available neuromorphic or SNN simulation packages developed by a variety of research groups, they have mostly targeted computational neuroscience simulations, and only a few have targeted small-scale machine learning tasks with SNNs. Evaluations or comparisons of these simulators have often targeted computational neuroscience-style workloads. In this work, we seek to evaluate the performance of several publicly available SNN simulators with respect to non-computational neuroscience workloads, in terms of speed, flexibility, and scalability. We evaluate the performance of the NEST, Brian2, Brian2GeNN, BindsNET and Nengo packages under a common front-end neuromorphic framework. Our evaluation tasks include a variety of different network architectures and workload types to mimic the computation common in different algorithms, including feed-forward network inference, genetic algorithms, and reservoir computing. We also study the scalability of each of these simulators when running on different computing hardware, from single core CPU workstations to multi-node supercomputers. Our results show that the BindsNET simulator has the best speed and scalability for most of the SNN workloads (sparse, dense, and layered SNN architectures) on a single core CPU. However, when comparing the simulators leveraging the GPU capabilities, Brian2GeNN outperforms the others for these workloads in terms of scalability. NEST performs the best for small sparse networks and is also the most flexible simulator in terms of reconfiguration capability NEST shows a speedup of at least 2x compared to the other packages when running evolutionary algorithms for SNNs. The multi-node and multi-thread capabilities of NEST show at least 2x speedup compared to the rest of the simulators (single core CPU or GPU based simulators) for large and sparse networks. We conclude our work by providing a set of recommendations on the suitability of employing these simulators for different tasks and scales of operations. We also present the characteristics for a future generic ideal SNN simulator for different neuromorphic computing workloads.

97 MATHEMATICS AND COMPUTING↗

CoSyR: A novel beam dynamics code for the modeling of synchrotron radiation effects

The self-consistent nonlinear dynamics of a relativistic charged particle beam interacting with its complete self-fields is a fundamental problem underpinning many of the accelerator design issues in high brightness beam applications, as well as the development of advanced accelerators. Particularly, synchrotron radiation induced effects in a magnetic dispersive beamline element can lead to collective beam instabilities and emittance growth. A novel beam dynamics code is developed based on a Lagrangian method for the calculation of the particles’ radiation near-fields using wavefront/wavelet meshes via the Green’s function of the Maxwell equations. These fields are then interpolated onto a moving mesh for dynamic update of the beam. This method allows radiation co-propagation and self-consistent interaction with the beam in 2D/3D simulations at greatly reduced numerical errors. Multiple levels of parallelisms are inherent in this method and implemented in our code CoSyR to enable at-scale simulations of nonlinear beam dynamics on modern computing platforms using MPI, multi-threading, and GPUs. Here, the current 2D implementation of CoSyR has been used to evaluate the transverse and longitudinal coherent radiation effects on the beam and to investigate beam optics designs proposed for mitigation of beam brightness degradation in a magnetic bunch compressor. In this paper, the design of CoSyR, as well as the benchmark with other coherent synchrotron radiation models, are described and discussed. Extension of the core algorithms to 3D is possible and planned.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Interface tracking simulations of bubbly flows in PWR relevant geometries

[en] Highlights: • Simulations were performed for turbulent bubbly flows in PWR subchannel geometry. • Liquid turbulence is fully resolved by direct numerical simulation approach. • Bubble behavior is captured using level-set interface tracking method. • Time-averaged single- and two-phase turbulent flow statistical quantities are obtained. - Abstract: The advances in high performance computing (HPC) have allowed direct numerical simulation (DNS) approach coupled with interface tracking methods (ITM) to perform high fidelity simulations of turbulent bubbly flows in various complex geometries. In this work, we have chosen the geometry of the pressurized water reactor (PWR) core subchannel to perform a set of interface tracking simulations (ITS) with fully resolved liquid turbulence. The presented research utilizes a massively parallel finite-element based code, PHASTA, for the subchannel geometry simulations of bubbly flow turbulence. The main objective for this research is to demonstrate the ITS capabilities in gaining new insight into bubble/turbulence interactions and assisting the development of improved closure laws for multiphase computational fluid dynamics (M-CFD). Both single- and two-phase turbulent flows were studied within a single PWR subchannel. The analysis of numerical results includes the mean gas and liquid velocity profiles, void fraction distribution and turbulent kinetic energy profiles. Two sets of flow rates and bubble sizes were used in the simulations. The chosen flow rates corresponded to the Reynolds numbers of 29,079 and 80,775 based on channel hydraulic diameter (D_h) and mean velocity. The finite element unstructured grids utilized for these simulations include 53.8 million and 1.11 billion elements, respectively. This has allowed to fully resolve all the turbulence scales and the deformable interfaces of individual bubbles. For the two-phase flow simulations, a 1% bubble volume fraction was used which resulted in 17 bubbles in the smaller case and 262 bubbles in the larger case. In the larger simulation case the size of the resolved bubbles is 0.65 mm in diameter, and the bulk mesh cell size is about 30 microns. Those large-scale simulations provide new level of details previously unavailable and were enabled by the excellent scaling performance of our two-phase flow solver and access to the state-of-the-art supercomputing resources. The presented simulations used up to 256 thousand processing threads on the IBM BG/Q supercomputer “Mira” (Argonne National Laboratory).

Nuclear Science & Technology↗

Distributed temperature sensing inside a 19-rod bundle

The temperature field within a model of a sodium-cooled fast reactor fuel rod bundle was measured using Ø155 μm fiber optic distributed temperature sensors (DTS). The bundle consists of 19 electrically-heated rods Ø6.3 mm and 865 mm long. Working fluids were argon and air at atmospheric pressure and Reynolds numbers up to 300. A 20 m-long DTS was threaded through Ø1 mm capillaries wound around rods as wire-wraps. The sensor generated 173 measurements along each rod at 5 mm resolution for a total of 3300 data locations. A second DTS, 58 m long, was suspended between rods to provide 9300 fluid temperature measurements at 20 mm resolution. Such data density makes it possible to construct 3D maps of the temperature field that are beyond the reach of traditional sensors such as thermocouples. This is illustrated through a series of steady-state and transient tests. As a result, the work demonstrates the feasibility of mapping temperature within the close confines of a rod bundle at resolutions suitable for validation of computational fluid dynamics codes.

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Tuning collective communication for Partitioned Global Address Space programming models

Partitioned Global Address Space (PGAS) languages offer programmers the convenience of a shared memory programming style combined with locality control necessary to run on large-scale distributed memory systems. Even within a PGAS language programmers often need to perform global communication operations such as broadcasts or reductions, which are best performed as collective operations in which a group of threads work together to perform the operation. In this study we consider the problem of implementing collective communication within PGAS languages and explore some of the design trade-offs in both the interface and implementation. In particular, PGAS collectives have semantic issues that are different than in send–receive style message passing programs, and different implementation approaches that take advantage of the one-sided communication style in these languages. We present an implementation framework for PGAS collectives as part of the GASNet communication layer, which supports shared memory, distributed memory and hybrids. The framework supports a broad set of algorithms for each collective, over which the implementation may be automatically tuned. In conclusion, we demonstrate the benefit of optimized GASNet collectives using application benchmarks written in UPC, and demonstrate that the GASNet collectives can deliver scalable performance on a variety of state-of-the-art parallel machines including a Cray XT4, an IBM BlueGene/P, and a Sun Constellation system with InfiniBand interconnect.

97 MATHEMATICS AND COMPUTING↗