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,423 records · Page 79

The Additive Manufacturing Moment Measure - A Parallel Computation Technique for Determining Build Variance in the Laser Powder Bed Fusion Process

Additive manufacturing (AM) has unique process attributes that facilitate the creation of optimized, complex, and unique parts for aerospace applications. However, the multi-scale and complicated building process for AM parts can cause unexpected build conditions that result in microstructural variability within the deposited material. The need for richer datasets and computational modeling capabilities to improve AM process reliability is a consequence of this microstructural variability. A computational approach, referred to as the Additive Manufacturing Moment Measure (AM3), addresses this need by leveraging the way AM processes fuse material in precise, incremental steps. During the layering sequence, each previous step contributes to the condition of the current step at the center of the heat source. The precise steps can be selected to systematically create a time-space point field with co-located machine input and in-situ sensor data. The sequential nature of the AM process, coupled with nearest neighbor calculations, allows for a fully parallel computation for part-scale build profile analysis. The AM3 concept introduced here enables part-scale assessment directly from build files and in-situ process monitoring sensors alike. The AM moment measures were calculated for build point fields and compared with co-located in-situ and ex-situ nondestructive evaluation and optical microscopy observations. These comparisons permit a better understanding of how the sequential process actions can affect the quality of a laser powder bed fusion (LPBF) build. Details of the AM3technique will be discussed and compared to measured LPBF part characteristics. The AM3 results indicate a strong potential to advance the qualification process for aerospace applications.

Additive Manufacturing↗

Optimization of switch diagnostics on the MAIZE linear transformer driver

The MAIZE Linear Transformer Driver is made of 40 capacitor-switch-capacitor `bricks' connected in parallel. When these 40 bricks are charged to 100-kV and then discharged synchronously, the MAIZE facility generates a 1-MA current pulse with a 100-ns rise time into a matched load impedance. Discharging each of the capacitors in a brick is carried out by the breakdown of a spark-gap switch, a process which results in the emission of light. Monitoring this output light with a fiber optic coupled to a photomultiplier tube (PMT) and an oscilloscope channel provides information on switch performance and timing jitter– whether a switch red early, late, or in phase with the other switches. However, monitoring each switch with a dedicated detector- oscilloscope channel can be problematic for facilities where the number of switches to be monitored (e.g., 40 on MAIZE) greatly exceeds the number of detector-oscilloscope channels available. The technique of using fibers to monitor light emission from switches can be optimized by treating a PMT as a binary digit or bit and using a combinatorial encoding scheme, where each switch is monitored by a unique combination of fiber- PMT-oscilloscope channels simultaneously. By observing the unique combination of ber-PMT-oscilloscope channels that are turned on, the pre-firing or late-firing of a single switch on MAIZE can be identified by as few as six PMT-oscilloscope channels. The number of PMT-oscilloscope channels, N , required to monitor X switches can be calculated by 2 N = X + 1, where the number '2' is selected because the PMT-oscilloscope acts as a bit. Here, we demonstrate the use of this diagnostic technique on MAIZE. In conclusion, we also present an analysis of how this technique could be scaled to monitor the tens of thousands of switches proposed for various next generation pulsed power facilities.

47 OTHER INSTRUMENTATION↗

A Parallel Multiblock Mesh Movement Scheme For Complex Aeroelastic Applications

A scheme has been developed for the movement of multiblock, structured grids due to surface deformation arising from aeroelastics, control surface movement, or design optimization. Elements of the method include a blending of a surface spline approximation and nearest surface point movement for block boundaries. Transfinite interpolation is employed for volume grid deformation. The scheme is demonstrated on a range of simple and complex aeroelastic aircraft applications using Navier-Stokes computational fluid dynamics and modal structural analyses on parallel processors. Results are robust and accurate, requiring only minimal user input specification.

Potsdam, Mark A.↗

Recent developments and applications of

The salient features of the real-space multigrid method and its recent applications are described. This method is suitable for very large scale, massively parallel calculations of atomic and electronic structure, as well as quantum molecular dynamics. Its nearly O(N) implementation provides a compact, variationally optimized basis that is also very useful for fully O(N) calculations of quantum transport. Recently, we also developed a hybrid method for simulating biomolecules in solution, in which most of the solvent is inexpensively treated using an approximate density-functional method, while the biomolecule and its first solvation shells are described at the full Kohn Sham level. Our calculations show excellent parallel efficiency and scaling on massively parallel supercomputers.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Porting DMRG++ Scientific Application to OpenPOWER

With the rapidly changing microprocessor designs and architectural diversity (multi-cores, many-cores, accelerators) for the next generation HPC systems, scientific applications must adapt to the hardware, to exploit the different types of parallelism and resources available in the architecture. To get the benefit of all the in-node hardware threads, it is important to use a single programming model to map and coordinate the available work to the different heterogeneous execution units in the node (e.g., multi-core hardware threads (latency optimized), accelerators (bandwidth optimized), etc.).Our goal is to show that we can manage the node complexity of these systems by using OpenMP for in-node parallelization by exploiting different “programming styles” supported by OpenMP 4.5 to program CPU cores and accelerators. Finding out the suitable programming-style (e.g., SPMD style, multi-level tasks, accelerator programming, nested parallelism, or a combination of these) using the latest features of OpenMP to maximize performance and achieve performance portability across heterogeneous and homogeneous systems is still an open research problem.We developed a mini-application, Kronecker Product (KP), from the original DMRG++ application (sparse matrix algebra) computational motif to experiment with different OpenMP programming styles on an OpenPOWER architecture and present their results in this paper.

Chatterjee, Ronnie↗

Three-dimensional reconstruction of statistically optimal unit cells of polydisperse particulate composites from microtomography

In this paper, we present a systematic approach for characterization and reconstruction of statistically optimal representative unit cells of polydisperse particulate composites. Microtomography is used to gather rich three-dimensional data of a packed glass bead system. First-, second-, and third-order probability functions are used to characterize the morphology of the material, and the parallel augmented simulated annealing algorithm is employed for reconstruction of the statistically equivalent medium. Both the fully resolved probability spectrum and the geometrically exact particle shapes are considered in this study, rendering the optimization problem multidimensional with a highly complex objective function. A ten-phase particulate composite composed of packed glass beads in a cylindrical specimen is investigated, and a unit cell is reconstructed on massively parallel computers. Further, rigorous error analysis of the statistical descriptors (probability functions) is presented and a detailed comparison between statistics of the voxel-derived pack and the representative cell is made.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Preparing NERSC users for Cori, a Cray XC40 system with Intel many integrated cores

The newest NERSC supercomputer Cori is a Cray XC40 system consisting of 2,388 Intel Xeon Haswell nodes and 9,688 Intel Xeon-Phi “Knights Landing” (KNL) nodes. Compared to the Xeon-based clusters NERSC users are familiar with, optimal performance on Cori requires consideration of KNL mode settings; process, thread, and memory affinity; fine-grain parallelization; vectorization; and use of the high-bandwidth MCDRAM memory. This paper describes our efforts preparing NERSC users for KNL through the NERSC Exascale Science Application Program, Web documentation, and user training. We discuss how we configured the Cori system for usability and productivity, addressing programming concerns, batch system configurations, and default KNL cluster and memory modes. Here, system usage data, job completion analysis, programming and running jobs issues, and a few successful user stories on KNL are presented.

97 MATHEMATICS AND COMPUTING↗

Grappolo

Community detection has become a fundamental operation in numerous graph-theoretic applications. It is used to reveal natural divisions that exist within real world networks without imposing prior size or cardinality constraints on the set of communities. Despite its potential for application, there is only limited support for community detection on large-scale parallel computers, largely owing to the irregular and inherently sequential nature of the underlying heuristics. In this paper, we present parallelization heuristics for fast community detection using the Louvain method as the serial template. The Louvain method is an iterative heuristic for modularity optimization. Originally developed by Blondel et al. in 2008, the method has become increasingly popular owing to its ability to detect high modularity community partitions in a fast and memory-efficient manner. However, the method is also inherently sequential, thereby limiting its scalability. Here, we observe certain key properties of this method that present challenges for its parallelization, and consequently propose heuristics that are designed to break the sequential barrier. For evaluation purposes, we implemented our heuristics using OpenMP multithreading, and tested them over real world graphs derived from multiple application domains (e.g., internet, citation, biological). Compared to the serial Louvain implementation, our parallel implementation is able to produce community outputs with a higher modularity for most of the inputs tested, in comparable number of iterations, while providing real speedups of up to 8x using 32 threads. In addition, our parallel implementation was able to exhibit weak scaling properties on up to 32 threads.

Halappanavar, Mahantesh↗

Generic Optimization Program User Manual Version 3.0.0

GenOpt is an optimization program for the minimization of a cost function that is evaluated by an external simulation program. It has been developed for optimization problems where the cost function is computationally expensive and its derivatives are not available or may not even exist. GenOpt can be coupled to any simulation program that reads its input from text files and writes its output to text files. The independent variables can be continuous variables (possibly with lower and upper bounds), discrete variables, or both, continuous and discrete variables. Constraints on dependent variables can be implemented using penalty or barrier functions. GenOpt uses parallel computing to evaluate the simulations. GenOpt has a library with local and global multi-dimensional and one-dimensional optimization algorithms, and algorithms for doing parametric runs. An algorithm interface allows adding new minimization algorithms without knowing the details of the program structure. GenOpt is written in Java so that it is platform independent. The platform independence and the general interface make GenOpt applicable to a wide range of optimization problems. GenOpt has not been designed for linear programming problems, quadratic programming problems, and problems where the gradient of the cost function is available. For such problems, as well as for other problems, special tailored software exists that is more efficient.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Application of an Evolutionary Algorithm for Parameter Optimization in a Gully Erosion Model

Herein we demonstrate how to use model optimization to determine a set of best-fit parameters for a landform model simulating gully incision and headcut retreat. To achieve this result we employed the Covariance Matrix Adaptation Evolution Strategy (CMA-ES), an iterative process in which samples are created based on a distribution of parameter values that evolve over time to better fit an objective function. CMA-ES efficiently finds optimal parameters, even with high-dimensional objective functions that are non-convex, multimodal, and non-separable. We ran model instances in parallel on a high-performance cluster, and from hundreds of model runs we obtained the best parameter choices. This method is far superior to brute-force search algorithms, and has great potential for many applications in earth science modeling. We found that parameters representing boundary conditions tended to converge toward an optimal single value, whereas parameters controlling geomorphic processes are defined by a range of optimal values.

97 MATHEMATICS AND COMPUTING↗

Portable interactive visualization of large-scale simulations in geotechnical engineering using Unity3D

Development in large-scale geotechnical engineering simulation places tremendous demand for efficient visualization of such simulation data. This study presents a lightweight software tool, i.e. Geotechnical Interactive Visualization (GIV), as a solution to this challenge, which achieves efficient interactive visualization of large-scale simulations data in geotechnical engineering. Visualization data flow and algorithms specifically optimized for common geotechnical engineering applications are implemented in GIV. GIV can visualize geotechnical structure models with time-varying attributes attached to mesh with fixed topology, and also models with time-varying mesh topologies but no attributes attached, the two most common visualization tasks in geotechnical engineering. Furthermore, challenges for large-scale simulation data visualization, including parallel simulation data redundancy, massive data size, dynamic user interaction, and portability are overcome via specifically designed algorithms for simulation data preprocessing and optimized visualization modules using the powerful 3D rendering and interactive game engine Unity3D. Comparison of GIV with several widely used visualization tools for the visualization of large-scale idealized datasets and realistic geotechnical simulations highlights the visualization efficiency, smooth interactivity, and lightweight features of GIV.

42 ENGINEERING↗

An optimized posterior axillary boost technique in radiation therapy to supraclavicular and axillary lymph nodes: A comparative study

To assess the advantages of an optimized posterior axillary (AX) boost technique for the irradiation of supraclavicular (SC) and AX lymph nodes. Five techniques for the treatment of SC and levels I, II, and III AX lymph nodes were evaluated for 10 patients selected at random: a direct anterior field (AP); an anterior to posterior parallel pair (AP-PA); an anterior field with a posterior axillary boost (PAB); an anterior field with an anterior axillary boost (AAB); and an optimized PAB technique (OptPAB). The target coverage, hot spots, irradiated volume, and dose to organs at risk were evaluated and a statistical analysis comparison was performed. The AP technique delivered insufficient dose to the deeper AX nodes. The AP-PA technique produced larger irradiated volumes and higher mean lung doses than the other techniques. The PAB and AAB techniques originated excessive hot spots in most of the cases. The OptPAB technique produced moderate hot spots while maintaining a similar planning target volume (PTV) coverage, irradiated volume, and dose to organs at risk. This optimized technique combines the advantages of the PAB and AP-PA techniques, with moderate hot spots, sufficient target coverage, and adequate sparing of normal tissues. The presented technique is simple, fast, and easy to implement in routine clinical practice and is superior to the techniques historically used for the treatment of SC and AX lymph nodes.

61 RADIATION PROTECTION AND DOSIMETRY↗

Data Structure and Parallel Decomposition Considerations on a Fibonacci Grid

The Fibonacci grid, proposed by Swinbank and Purser (see companion abstract), provides attractive properties for global numerical atmospheric prediction by offering an optimally homogeneous, geometrically regular, and approximately isotropic discretization, with only the polar regions requiring special numerical treatment. It is a mathematical idealization, applied to the sphere, of the multi-spiral patterns often found in botanical structures, such as in pine cones and sunflower heads. Computationally, it is natural to organize the domain, into zones, in each of which the same pair, or triple, of "Fibonacci spirals" dominate. But the further subdivision of such zones into "tiles" of a shape and size suitable for distribution to the processors of a massively parallel computer requires very careful consideration if the subsequent spatial computations along the respective spirals, especially those computations (such as compact differencing schemes) that involve recursion, can be implemented in an efficient "load-balanced "manner without requiring excessive amounts of inter-processor communications. In this paper we show how certain "number theoretic" properties of the Fibonacci sequence (whose numbers prescribe the multiplicity of successive spirals) may be exploited in the decomposition of grid zones into tidy arrangements of triangular grid tiles, each tile possessing one side approximately parallel to the constant-latitude zone boundary. We also describe how the spatially recursive processes may be decomposed across such a tiling, and the directionality of the recursions reversed on alternate grid lines, to ensure a very high degree of load balancing throughout the execution of the computations required for one time step of a global model.

Michalakes, John↗

Parallelism of the SANDstorm hash algorithm.

Mainstream cryptographic hashing algorithms are not parallelizable. This limits their speed and they are not able to take advantage of the current trend of being run on multi-core platforms. Being limited in speed limits their usefulness as an authentication mechanism in secure communications. Sandia researchers have created a new cryptographic hashing algorithm, SANDstorm, which was specifically designed to take advantage of multi-core processing and be parallelizable on a wide range of platforms. This report describes a late-start LDRD effort to verify the parallelizability claims of the SANDstorm designers. We have shown, with operating code and bench testing, that the SANDstorm algorithm may be trivially parallelized on a wide range of hardware platforms. Implementations using OpenMP demonstrates a linear speedup with multiple cores. We have also shown significant performance gains with optimized C code and the use of assembly instructions to exploit particular platform capabilities.

97 MATHEMATICS AND COMPUTING↗

Drive-pressure optimization in ramp-wave compression experiments through differential evolution

Ramp-wave dynamic-compression experiments are used to examine quasi-isentropic loading paths in materials. The gradual and continuous increase in pressure created by ramp waves make these types of experiments ideal for studying nonequilibrium material behavior, such as solidification kinetics. In ramp-wave compression experiments, the input drive pressure to the experimental setup may be exerted through one of a number of different mechanisms (e.g., magnetic fields, gas-gun-driven impactors, or high-energy lasers) and is generally required for simulating such experiments. Yet, regardless of the specific mechanism, this drive pressure cannot be measured directly (measurements are generally taken at a location near the back of the experimental setup through a transparent window), leading to an inverse problem where one must determine the drive pressure at the front of the experimental setup (i.e., the input) that corresponds to the particle velocity (the output) measured near the back of the experimental setup. Furthermore, we solve this inverse problem using a heuristic optimization algorithm, known as differential evolution, coupled with a multiphysics, hydrodynamics code that simulates the compression of the experimental setup. By running many rounds of forward simulations of the experimental setup, our optimization process iteratively searches for a drive pressure that is optimized to closely reproduce the experimentally measured particle velocity near the back of the experimental setup. While our optimization methodology requires a significant number of hydrodynamics simulations to be conducted, many of these can be performed in parallel, which greatly reduces the time cost of our methodology. One novel aspect of our method for determining the drive pressure is that it does not require physical modeling of the drive mechanism and can thus be broadly applied to many types of ramp-compression experiments, regardless of the drive mechanism.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Optimized Radiator Geometries for Hot Lunar Thermal Environments

The optimum radiator configuration in hot lunar thermal environments is one in which the radiator is parallel to the ground and has no view to the hot lunar surface. However, typical spacecraft configurations have limited real estate available for top-mounted radiators, resulting in a desire to use the spacecraft's vertically oriented sides. Vertically oriented, flat panel radiators will have a large view factor to the lunar surface, and thus will be subjected to significant incident lunar infrared heat. Consequently, radiator fluid temperatures will need to exceed approximately 325 K (assuming standard spacecraft radiator optical properties) in order to provide positive heat rejection at lunar noon. Such temperatures are too high for crewed spacecraft applications in which a heat pump is to be avoided. A recent study of vertically oriented radiator configurations subjected to lunar noon thermal environments led to the discovery of a novel radiator concept that yielded positive heat rejection at lower fluid temperatures. This radiator configuration, called the Intense Thermal Infrared Reflector (ITIR), has exhibited superior performance to all previously analyzed concepts in terms of heat rejection in the lunar noon thermal environment. A key benefit of ITIR is the absence of louvers or other moving parts and its simple geometry (no parabolic shapes). ITIR consists of a specularly reflective shielding surface and a diffuse radiating surface joined to form a horizontally oriented V-shape (shielding surface on top). The point of intersection of these surfaces is defined by two angles, those which define the tilt of each surface with respect to the local horizontal. The optimum set of these angles is determined on a case-by-case basis. The idea assumes minimal conductive heat transfer between shielding and radiating surfaces, and a practical design would likely stack sets of these surfaces on top of one another to reduce radiator thickness.

Ochoa, Dustin↗