Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel optimization”

Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,333 records · Page 74

Controlled Dielectric Breakdown to Form Pinhole Passivated Contacts

This contribution explores a low-temperature route to forming dielectric pinholes to form poly-Si/dielectric/c-Si passivated contacts. The method utilizes controlled dielectric breakdown to form nanoscale pinholes in a thick (non-tunnelling) dielectric which, when annealed, allows dopant atoms to pass from doped poly-Si through the dielectric and into the c-Si wafer forming conductive pathways. We show that the pinholes can be repassivated with dopants and H diffusion which results in increased PL signals after processing. The method can be expanded to optimized dielectric passivation stacks (not just a single layer) and can be formed in parallel over the faces of the wafer in selected areas (only under the grid).

controlled dielectric breakdown↗

Runtime Thread-Block Optimization for Custom Multistream CUDA Kernels for the Glenn Research Center Communication Analysis Suite

In preparation of the return of humans to the Moon with the coming Artemis missions, NASA scientists must evaluate proposed landing site locations for terrain and communications viability. The Glenn Research Center Communication Analysis Suite (GCAS) combines sophisticated communication network models with accurate lunar terrain to access sites across the Moon’s south pole. Given the importance of proper site selection to crew safety and mission success, many locations need to be analyzed resulting in a large computational load needing to be performed. To meet the growing project demands, development has begun to improve the runtime efficiency of GCAS with GPU parallelization by way of multi-stream CUDA kernels. One of the most prominent factors in kernel optimization is the proper selection of thread-block dimensions in order to maximize the concurrent operation on the device. Typically, thread-block dimensions are optimized by hand requiring many stages of benchmarking and iteration. Additionally, given the main conditions to optimization are the physical GPU architecture and problem size, these optimal dimensions are non-portable and fragile in their scope. As such, a novel optimization routine was developed to generate the optimal thread-block dimensions during runtime with considerations to hardware specifications and problem size resolving the issues of portability and enabling the function of more dynamic routines.

Aden Bergstresser↗

Quantum Monte Carlo Endstation for Petascale Computing

The major achievements enabled by QMC Endstation grant include * Performance improvement on clusters of x86 multi-core systems, especially on Cray XT systems * New and improved methods for the wavefunction optimizations * New forms of trial wavefunctions * Implementation of the full application on NVIDIA GPUs using CUDA The scaling studies of QMCPACK on large-scale systems show excellent parallel efficiency up to 216K cores on Jaguarpf (Cray XT5). The GPU implementation shows speedups of 10-15x over the CPU implementation on older generation of x86. We have implemented hybrid OpenMP/MPI scheme in QMC to take advantage of multi-core shared memory processors of petascale systems. Our hybrid scheme has several advantages over the standard MPI-only scheme. * Memory optimized: large read-only data to store one-body orbitals and other shared properties to represent the trial wave function and many-body Hamiltonian can be shared among threads, which reduces the memory footprint of a large-scale problem. * Cache optimized: the data associated with an active Walker are in cache during the compute-intensive drift-diffusion process and the operations on an Walker are optimized for cache reuse. Thread-local objects are used to ensure the data affinity to a thread. * Load balanced: Walkers in an ensemble are evenly distributed among threads and MPI tasks. The two-level parallelism reduces the population imbalance among MPI tasks and reduces the number of point-to-point communications of large messages (serialized objects) for the Walker exchange. * Communication optimized: the communication overhead, especially for the collective operations necessary to determine ET and measure the properties of an ensemble, is significantly lowered by using less MPI tasks. The multiple forms of parallelism afforded by QMC algorithms make them ideal candidates for acceleration in the many-core paradigm. We presented the results of our effort to port the QMCPACK simulation code to the NVIDIA CUDA GPU platform. We restructured the CPU algorithms to express additional parallelism, minimize GPU-CPU communication, and efficiently utilize the GPU memory hierarchy. Using mixed precision on GT200 GPUs and MPI for intercommunication and load balancing, we observe typical full-application speedups of approximately 10x to 15x relative to quad-core Xeon CPUs alone, while reproducing the double-precision CPU results within statistical error. We developed an all-electron quantum Monte Carlo (QMC) method for solids that does not rely on pseudopotentials, and used it to construct a primary ultra-high-pressure calibration based on the equation of state of cubic boron nitride. We computed the static contribution to the free energy with the QMC method and obtained the phonon contribution from density functional theory, yielding a high-accuracy calibration up to 900 GPa usable directly in experiment. We computed the anharmonic Raman frequency shift with QMC simulations as a function of pressure and temperature, allowing optical pressure calibration. In contrast to present experimental approaches, small systematic errors in the theoretical EOS do not increase with pressure, and no extrapolation is needed. This all-electron method is applicable to first-row solids, providing a new reference for ab initio calculations of solids and benchmarks for pseudopotential accuracy. We compared experimental and theoretical results on the momentum distribution and the quasiparticle renormalization factor in sodium. From an x-ray Compton-profile measurement of the valence-electron momentum density, we derived its discontinuity at the Fermi wavevector finding an accurate measure of the renormalization factor that we compared with quantum-Monte-Carlo and G0W0 calculations performed both on crystalline sodium and on the homogeneous electron gas. Our calculated results are in good agreement with the experiment. We have been studying the heat of formation for various Kubas complexes of molecular hydrogen on Ti(1,2)ethylene-nH2 using Diffusion Monte Carlo. This work has been started and is ongoing. We are studying systems involving 1 and 2 Ti bonding sites with up to 10 hydrogen molecules in numerous configurations. This work will establish a benchmark that will test the accuracy of density functional calculations and establish the feasibility of our methods for similar systems.

97 MATHEMATICS AND COMPUTING↗

Optimizations of a Hardware Decoder for Deep-Space Optical Communications

The National Aeronautics and Space Administration has developed a capacity approaching modulation and coding scheme that comprises a serial concatenation of an inner accumulate pulse-position modulation (PPM) and an outer convolutional code [or serially concatenated PPM (SCPPM)] for deep-space optical communications. Decoding of this code uses the turbo principle. However, due to the nonbinary property of SCPPM, a straightforward application of classical turbo decoding is very inefficient. Here, we present various optimizations applicable in hardware implementation of the SCPPM decoder. More specifically, we feature a Super Gamma computation to efficiently handle parallel trellis edges, a pipeline-friendly 'maxstar top-2' circuit that reduces the max-only approximation penalty, a low-latency cyclic redundancy check circuit for window-based decoders, and a high-speed algorithmic polynomial interleaver that leads to memory savings. Using the featured optimizations, we implement a 6.72 megabits-per-second (Mbps) SCPPM decoder on a single field-programmable gate array (FPGA). Compared to the current data rate of 256 kilobits per second from Mars, the SCPPM coded scheme represents a throughput increase of more than twenty-six fold. Extension to a 50-Mbps decoder on a board with multiple FPGAs follows naturally. We show through hardware simulations that the SCPPM coded system can operate within 1 dB of the Shannon capacity at nominal operating conditions.

quadratic polynomial interleaver↗

Ground-state structures of Hafnium clusters

Hafnium (Hf) is a very large tetra-valence d-block element which is able to form relatively long covalent bond. Researchers are interested to search for substitution to silicon in the semi-conductor industry. We attempt to obtain the ground-state structures of small Hf clusters at both empirical and density-functional theory (DFT) levels. For calculations at the empirical level, charge-optimized many-body functional potential (COMB) is used. The lowest-energy structures are obtained via a novel global-minimum search algorithm known as parallel tempering Monte-Carlo Basin-Hopping and Genetic Algorithm (PTMBHGA). The virtue of using COMB potential for Hf cluster calculation lies in the fact that by including the charge optimization at the valence shells, we can encourage the formation of proper bond hybridization, and thus getting the correct bond order. The obtained structures are further optimized using DFT to ensure a close proximity to the ground-state.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

ROOT: A C++ framework for petabyte data storage, statistical analysis and visualization

ROOT is an object-oriented C++ framework conceived in the high-energy physics (HEP) community, designed for storing and analyzing petabytes of data in an efficient way. Any instance of a C++ class can be stored into a ROOT file in a machine-independent compressed binary format. In ROOT the TTree object container is optimized for statistical data analysis over very large data sets by using vertical data storage techniques. These containers can span a large number of files on local disks, the web or a number of different shared file systems. In order to analyze this data, the user can chose out of a wide set of mathematical and statistical functions, including linear algebra classes, numerical algorithms such as integration and minimization, and various methods for performing regression analysis (fitting). In particular, the RooFit package allows the user to perform complex data modeling and fitting while the RooStats library provides abstractions and implementations for advanced statistical tools. Multivariate classification methods based on machine learning techniques are available via the TMVA package. A central piece in these analysis tools are the histogram classes which provide binning of one- and multi-dimensional data. Results can be saved in high-quality graphical formats like Postscript and PDF or in bitmap formats like JPG or GIF. The result can also be stored into ROOT macros that allow a full recreation and rework of the graphics. Users typically create their analysis macros step by step, making use of the interactive C++ interpreter CINT, while running over small data samples. Once the development is finished, they can run these macros at full compiled speed over large data sets, using on-the-fly compilation, or by creating a stand-alone batch program. Finally, if processing farms are available, the user can reduce the execution time of intrinsically parallel tasks - e.g. data mining in HEP - by using PROOF, which will take care of optimally distributing the work over the available resources in a transparent way.

99 GENERAL AND MISCELLANEOUS↗

Communication-avoiding symmetric-indefinite factorization

We describe and analyze a novel symmetric triangular factorization algorithm. The algorithm is essentially a block version of Aasen's triangular tridiagonalization. It factors a dense symmetric matrix A as the product A=PLTL T P T where P is a permutation matrix, L is lower triangular, and T is block tridiagonal and banded. The algorithm is the first symmetric-indefinite communication-avoiding factorization: it performs an asymptotically optimal amount of communication in a two-level memory hierarchy for almost any cache-line size. Adaptations of the algorithm to parallel computers are likely to be communication efficient as well; one such adaptation has been recently published. As a result, the current paper describes the algorithm, proves that it is numerically stable, and proves that it is communication optimal.

97 MATHEMATICS AND COMPUTING↗

ExaHDF5: Delivering Efficient Parallel I/O on Exascale Computing Systems

Scientific applications at exascale generate and analyze massive amounts of data. A critical requirement of these applications is the capability to access and manage this data efficiently on exascale systems. As such, parallel I/O, the key technology enables moving data between compute nodes and storage, faces monumental challenges from new applications, memory, and storage architectures considered in the designs of exascale systems. As the storage hierarchy is expanding to include node-local persistent memory, burst buffers, etc., as well as disk-based storage, data movement among these layers must be efficient. Parallel I/O libraries of the future should be capable of handling file sizes of many terabytes and beyond. In this paper, we describe new capabilities we have developed in Hierarchical Data Format version 5 (HDF5), the most popular parallel I/O library for scientific applications. HDF5 is one of the most used libraries at the leadership computing facilities for performing parallel I/O on existing HPC systems. The state-of-the-art features we describe include: Virtual Object Layer (VOL), Data Elevator, asynchronous I/O, full-featured single-writer and multiple-reader (Full SWMR), and parallel querying. In this paper, we introduce these features, their implementations, and the performance and feature benefits to applications and other libraries.

97 MATHEMATICS AND COMPUTING↗

CSB-RNN: A Faster-Than-Realtime RNN Acceleration Framework with Compressed Structured Blocks

Recurrent Neural Networks (RNN) is widely applied to temporal sequence analysis, where real-time performance is usually in demand. However, RNN suffers a heavy computational workload as the model comes with a large weight matrix. To alleviate the pain, model compression (pruning) schemes have been proposed for RNN that pruning the redundant (near-zero) weight-values. On the one hand, the non-structured pruning methods achieve a considerable pruning rate while bringing the computational irregularity, which is un-friendly to parallel-hardware. On the other hand, the existing structured pruning methods consider the hardware parallelism; However, they suffer a poor pruning rate due to the restrict constraints on pruning structure. This paper presents CSB-RNN, an optimized full-stack RNN framework with the novel compressed structured block (CSB) technique. The CSB-pruned RNN model comes with both fine-granularity that benefits the pruning rate and regular structure that facilitates the hardware-parallelism. Further, we propose a novel hardware architecture for inferencing the CSB-pruned model. Different from conventional parallel hardware, this architecture solves the block-workload imbalance issue and achieves an over 95% hardware utilization. With the experiments on 10 RNN models in 5 application domains, the CSB-RNN realizes 7×-20× lossless compression and up to 50× acceptable lossy-compression, which is 2×-7× to the prior art. With the addition of the novel hardware, the compressed-RNN inference reaches a super real-time latency of 10-400µs with FPGA implementation.

Shi, Runbin↗

Load Forecasting Based Distribution System Network Reconfiguration -- A Distributed Data-Driven Approach

In this paper, a short-term load forecasting approach based network reconfiguration is proposed in a parallel manner. Specifically, a support vector regression (SVR) based short-term load forecasting approach is designed to provide an accurate load prediction and benefit the network reconfiguration. Because of the nonconvexity of the three-phase balanced optimal power flow, a second-order cone program (SOCP) based approach is used to relax the optimal power flow problem. Then, the alternating direction method of multipliers (ADMM) is used to compute the optimal power flow in distributed manner. Considering the limited number of the switches and the increasing computation capability, the proposed network reconfiguration is solved in a parallel way. The numerical results demonstrate the feasible and effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Parallel performance of algebraic multigrid domain decomposition

Algebraic multigrid (AMG) is a widely used scalable solver and preconditioner for large-scale linear systems resulting from the discretization of a wide class of elliptic PDEs. While AMG has optimal computational complexity, the cost of communication has become a significant bottleneck that limits its scalability as processor counts continue to grow on modern machines. This article examines the design, implementation, and parallel performance of a novel algorithm, algebraic multigrid domain decomposition (AMG-DD), designed specifically to limit communication. The goal of AMG-DD is to provide a low-communication alternative to standard AMG V-cycles by trading some additional computational overhead for a significant reduction in communication cost. Numerical results show that AMG-DD achieves superior accuracy per communication cost compared with AMG, and speedup over AMG is demonstrated on a large GPU cluster.

97 MATHEMATICS AND COMPUTING↗

Distributed-memory Parallel Algorithms for Matching and Coloring

Graph matching and coloring constitute two fundamental classes of combinatorial problems having numerous established as well as emerging applications in computational science and engineering, high-performance computing, and informatics. We provide a snapshot of an on-going work on the design and implementation of new highly-scalable distributed-memory parallel algorithms for two prototypical problems from these classes, edge-weighted matching and distance-1 vertex coloring. Graph algorithms in general have low concurrency and poor data locality, making it challenging to achieve scalability on massively parallel machines. We overcome this challenge by employing a variety of techniques, including approximation, speculation and iteration, optimized communication, and randomization, in concert. We present preliminary results on weak and strong scalability studies conducted on an IBM Blue Gene/P machine employing up to tens of thousands of processors. The results show that the algorithms hold strong potential for computing at petascale.

Combinatorial scientific computing↗

An Optically Stimulated Luminescence Uranium Enrichment Monitor

The Pacific Northwest National Laboratory (PNNL) has pioneered the use of Optically Stimulated Luminescence (OSL) technology for use in personnel dosimetry and high dose radiation processing dosimetry. PNNL has developed and patented an alumina-based OSL dosimeter that is being used by the majority of medical X-ray and imaging technicians worldwide. PNNL has conceived of using OSL technology to passively measure the level of UF6 enrichment by attaching the prototype OSL monitor to pipes containing UF6 gas within an enrichment facility. The prototype OSL UF6 monitor utilizes a two-element approach with the first element open and unfiltered to measure both the low energy and high energy gammas from the UF6, while the second element utilizes a 3-mm thick tungsten filter to eliminate the low energy gammas and pass only the high energy gammas from the UF6. By placing a control monitor in the room away from the UF6 pipes and other ionizing radiation sources, the control readings can be subtracted from the UF6 pipe monitor measurements. The ratio of the shielded to the unshielded net measurements provides a means to estimate the level of uranium enrichment. PNNL has replaced the commercially available MicroStar alumina-based dosimeter elements with a composite of polyethylene plastic, high-Z glass powder, and BaFBr:Eu OSL phosphor powder at various concentrations. The high-Z glass was added in an attempt to raise the average “Z” of the composite dosimeter and increase the response. Additionally, since BaFBr:Eu OSL phosphor is optimally excited and emits light at different wavelengths compared to alumina, the commercially available MicroStar reader was modified for reading BaFBr:Eu in a parallel effort to increase reader sensitivity. PNNL will present the design and performance of our novel OSL uranium enrichment monitor based on a combination of laboratory and UF6 test loop measurements. PNNL will also report on the optimization effort to achieve the highest possible performance from both the OSL enrichment monitor and the new custom OSL reader modified for this application. This project has been supported by the US Department of Energy’s National Nuclear Security Administration’s Office of Dismantlement and Transparency (DOE/NNSA/NA-241).

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Ion temperature and rotation fluctuation measurements with ultra-fast charge exchange recombination spectroscopy (UF-CHERS) in the DIII-D tokamak

An upgraded detector and several optimizations have significantly improved the Ultra-Fast Charge Exchange Recombination Spectroscopy (UF-CHERS) diagnostic sensitivity to ion temperature and parallel velocity fluctuations at turbulence relevant spatio-temporal scales. Normalized broadband ion temperature and parallel velocity fluctuations down to x̃x∼1% (x = Ti, v∥) and up to ∼450 kHz have been measured in a variety of plasmas. The multi-field nature of the CHERS technique also allows measurements of the cross-phase angles of the fluctuating fields. UF-CHERS is optimized to observe emissions from the electron exchange reaction between intrinsic C6+ and hydrogenic neutral beam injected particles near 529 nm. UF-CHERS consists of two chords separated by ∼1 cm radially, less than the turbulence correlation length in DIII-D plasmas, which enables correlated measurements to suppress incoherent electronic and photon noise. The optical components of the spectrometer include a volume-phase-holographic grating with >90% transmission between 528 and 530 nm and f/2 200-mm lenses, selected to maximize the optical efficiency and photon flux. Diffracted light from each chord is collected in eight spectral bins, each with a bandwidth of ∼0.25 nm, and detected and amplified by chilled avalanche photodiodes and custom high-gain, wide bandwidth low-noise preamplifiers to achieve the optimal signal-to-noise ratio. The resulting signals are digitized at 1 MHz, 103–104× faster than the conventional CHERS diagnostics. Spatial coverage is achieved by repositioning a motorized fiber tray between plasmas. UF-CHERS measurements will advance the understanding of turbulent ion transport and contribute to the validation of transport models and simulations.

Truong, D. D. (ORCID:0000000285732539)↗

Bug fixes / enhancements to Parallel tempering Markov chain Monte Carlo sampler (PTMCMCSampler) v3

Markov chain Monte Carlo sampler useful for a variety of problems for optimization, numerical integration, and generating draws from a probability distribution. They are often used in physical and mathematical problems, especially when it is difficult or impossible to use other approaches. This disclosure is for new bug fixes and enhancements to an existing open source library that is already in the public domain under the MIT license. https://github.com/jellis18/PTMCMCSampler

Forrer, Mark↗

Quasi-Optimal Elimination Trees for 2D Grids with Singularities

We construct quasi-optimal elimination trees for 2D finite element meshes with singularities. These trees minimize the complexity of the solution of the discrete system. The computational cost estimates of the elimination process model the execution of the multifrontal algorithms in serial and in parallel shared-memory executions. Since the meshes considered are a subspace of all possible mesh partitions, we call these minimizers quasi-optimal. We minimize the cost functionals using dynamic programming. Finding these minimizers is more computationally expensive than solving the original algebraic system. Nevertheless, from the insights provided by the analysis of the dynamic programming minima, we propose a heuristic construction of the elimination trees that has cost O N e log ⁡ N e , where N e is the number of elements in the mesh. We show that this heuristic ordering has similar computational cost to the quasi-optimal elimination trees found with dynamic programming and outperforms state-of-the-art alternatives in our numerical experiments.

Paszyńska, A.↗

Thread Batching for High-performance Energy-efficient GPU Memory Design

Massive multi-threading in GPU imposes tremendous pressure on memory subsystems. Due to rapid growth in thread-level parallelism of GPU and slowly improved peak memory bandwidth, memory becomes a bottleneck of GPU’s performance and energy efficiency. In this article, we propose an integrated architectural scheme to optimize the memory accesses and therefore boost the performance and energy efficiency of GPU. First, we propose a thread batch enabled memory partitioning (TEMP) to improve GPU memory access parallelism. In particular, TEMP groups multiple thread blocks that share the same set of pages into a thread batch and applies a page coloring mechanism to bound each stream multiprocessor (SM) to the dedicated memory banks. After that, TEMP dispatches the thread batch to an SM to ensure high-parallel memory-access streaming from the different thread blocks. Second, a thread batch-aware scheduling (TBAS) scheme is introduced to improve the GPU memory access locality and to reduce the contention on memory controllers and interconnection networks. Experimental results show that the integration of TEMP and TBAS can achieve up to 10.3% performance improvement and 11.3% DRAM energy reduction across diverse GPU applications. We also evaluate the performance interference of the mixed CPU+GPU workloads when they are run on a heterogeneous system that employs our proposed schemes. Our results show that a simple solution can effectively ensure the efficient execution of both GPU and CPU applications.

Computer Science↗

Multi-physics Topology OPtimization and Additive Manufacturing for High-temperature Heat Exchangers

This research significantly advances the understanding of high-temperature heat exchanger design through an integrated approach that combines topology optimization (TO), triply periodic minimal surface (TPMS) structures, additive manufacturing (AM) and thermohydraulic testing. Each of these components contributes uniquely to a unified, high-performance design, fabrication and testing workflow. Topology optimization serves as the foundation of the design methodology by providing a systematic way to determine the most effective material layout for separating hot and cold fluids while maximizing thermal performance. The researchers introduced a novel three-material optimization framework using two density fields to represent hot fluid, cold fluid, and solid domains. This approach enables automated discovery of optimal shapes and flow paths that cannot be intuitively designed, especially under constraints imposed by manufacturing technologies. Furthermore, constraints such as minimal wall thickness and overhang angles were embedded into the optimization process, ensuring that resulting designs are not only thermally efficient but also manufacturable using modern additive techniques. In parallel, the study delves into the use of Gyroid-based TPMS geometries for constructing the core of the heat exchanger. TPMS structures are known for their high surface area, excellent fluid mixing capabilities, and minimal pressure drop characteristics. The researchers applied a data-driven modeling framework using Heteroscedastic Sparse Gaussian Process Regression (HSGPR) combined with genetic algorithms. This allowed for the rapid evaluation and optimization of key geometric parameters such as frequency, iso-value, and phase shift. The result was a set of Gyroid structures tailored for high heat transfer and low flow resistance, demonstrating clear improvements over conventional straight-channel designs. After the designing process, additive manufacturing played a critical role by turning these highly complex, optimized geometries into physical components. Utilizing Laser Powder Bed Fusion (LPBF) with Haynes 282, the study demonstrated the feasibility of fabricating these heat exchangers at high precision. Post-processing methods, including dilation-erosion operations, were applied to ensure local features adhered to self-supporting constraints. The fabricated structures were then subjected to thermohydraulic testing under conditions representative of supercritical CO 2 Brayton cycles, validating the predicted performance and confirming the viability of the full design-to-fabrication pipeline. Finally, thermohydraulic testing across the above studies served as a crucial experimental validation of advanced heat exchanger. Under consistent high-temperature and high-pressure conditions using supercritical CO 2 , the testing demonstrated that both TO and Gyroid-based TPMS designs significantly outperformed conventional straight-channel HXs. The TO design achieved a 115% increase in UA and NTU and a 27.6% boost in gravimetric power density, while the data-driven optimized Gyroid design delivered a 166% increase in UA and NTU and improved effectiveness from 68.7% to 86.1%. These results validate the simulation models, confirm the manufacturability of complex geometries under AM constraints, and provide key insights into design-performance trade-offs, thereby advancing the development of high-efficiency, compact heat exchangers for extreme environments.

36 MATERIALS SCIENCE↗