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,693 records · Page 94

Stable large-scale solver for Ginzburg–Landau equations for superconductors

Understanding the interaction of vortices with inclusions in type-II superconductors is a major outstanding challenge both for fundamental science and energy applications. At application-relevant scales, the long-range interactions between a dense configuration of vortices and the dependence of their behavior on external parameters, such as temperature and an applied magnetic field, are all important to the net response of the superconductor. Capturing these features, in general, precludes analytical description of vortex dynamics and has also made numerical simulation prohibitively expensive. Here we report on a highly optimized iterative implicit solver for the time-dependent Ginzburg-Landau equations suitable for investigations of type-II superconductors on massively parallel architectures. Its main purpose is to study vortex dynamics in disordered or geometrically confined mesoscopic systems. In this work, we present the discretization and time integration scheme in detail for two types of boundary conditions. We describe the necessary conditions for a stable and physically accurate integration of the equations of motion. Using an inclusion pattern generator, we can simulate complex pinning landscapes and the effect of geometric confinement. We show that our algorithm, implemented on a GPU, can provide static and dynamic solutions of the Ginzburg-Landau equations for mesoscopically large systems over thousands of time steps in a matter of hours. Using our formulation, studying scientifically-relevant problems is a computationally reasonable task.

Sadovskyy, I. A.↗

Large Scale GPU Accelerated PPMLR-MHD Simulations for Space Weather Forecast

PPMLR-MHD is a new magnetohydrodynamics (MHD) model used to simulate the interactions of the solar wind with the magnetosphere, which has been proved to be the key element of the space weather cause-and-effect chain process from the Sun to Earth. Compared to existing MHD methods, PPMLR-MHD achieves the advantage of high order spatial accuracy and low numerical dissipation. However, the accuracy comes at a cost. On one hand, this method requires more intensive computation. On the other hand, more boundary data is subject to be transferred during the process of simulation. In this work, we present a parallel hybrid solution of the PPMLR-MHD model implemented using the computing capabilities of both CPUs and GPUs. We demonstrate that our optimized implementation alleviates the data transfer overhead by using GPU Direct technology and can scale up to 151 processes and achieve significant performance gains by distributing the workload among the CPUs and GPUs on Titan at Oak Ridge National Laboratory. The performance results show that our implementation is fast enough to carry out highly accurate MHD simulations in real time.

Computer Science↗

Locality Aware Concurrent Start for Stencil Applications

Stencil computations are at the heart of many physical simulations used in scientific codes. Thus, there exists a plethora of optimization efforts for this family of computations. Among these techniques, tiling techniques that allow concurrent start have proven to be very efficient in providing better performance for these critical kernels. Nevertheless, with many core designs being the norm, these optimization techniques might not be able to fully exploit locality (both spatial and temporal) on multiple levels of the memory hierarchy without compromising parallelism. It is no longer true that the machine can be seen as a homogeneous collection of nodes with caches, main memory and an interconnect network. New architectural designs exhibit complex grouping of nodes, cores, threads, caches and memory connected by an ever evolving network-on-chip design. These new designs may benefit greatly from carefully crafted schedules and groupings that encourage parallel actors (i.e. threads, cores or nodes) to be aware of the computational history of other actors in close proximity. In this paper, we provide an efficient tiling technique that allows hierarchical concurrent start for memory hierarchy aware tile groups. Each execution schedule and tile shape exploit the available parallelism, load balance and locality present in the given applications. We demonstrate our technique on the Intel Xeon Phi architecture with selected and representative stencil kernels. We show improvement ranging from 5.58% to 31.17% over existing state-of-the-art techniques.

Locality Aware execution, jagged tiling↗

RAPIDS: Reconciling Availability, Accuracy, and Performance in Managing Geo-Distributed Scientific Data

In modern science, big data plays an increasingly important role. Many scientific applications, such as running simulations on supercomputers or conducting experiments on advanced instruments, produce huge amount of data at unprecedented speed. Analyzing and understanding such big data is the key for scientists to make scientific breakthroughs. However, data might become unavailable for scientists to access when outages or maintenance of the storage system occur, which severely hinders scientific discovery. To improve the data availability, data duplication and erasure coding (EC) are often used. But as the scientific data gets larger, using these two methods can cause considerable storage and network overhead.In this paper, we propose RAPIDS, a hybrid approach that combines the multigrid-based error-bounded lossy compression with erasure coding, to significantly reduce the storage and network overhead required for maintaining high data availability. Our experiments show that RAPIDS reduces the storage overhead by up to 7.5x and network overhead by up to 3x to achieve the same level of availability compared to the regular EC method. We improve RAPIDS by building two models to optimize the fault tolerance configurations and data gathering strategy. We demonstrate that RAPIDS significantly improves performance when running on many CPU cores in parallel or on GPUs.

Wan, Lipeng↗

Accelerating String Set Matching in FPGA Hardware for Bioinformatics Research

Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomics. The process of matching peptide sequences against a genome translated in six reading frames is part of a proteogenomic mapping pipeline that is used as a case-study. The Aho-Corasick algorithm is adapted for execution in field programmable gate array (FPGA) devices in a manner that optimizes space and performance. In this approach, the traditional Aho-Corasick finite state machine (FSM) is split into smaller FSMs, operating in parallel, each of which matches up to 20 peptides in the input translated genome. Each of the smaller FSMs is further divided into five simpler FSMs such that each simple FSM operates on a single bit position in the input (five bits are sufficient for representing all amino acids and special symbols in protein sequences). Results: This bit-split organization of the Aho-Corasick implementation enables efficient utilization of the limited random access memory (RAM) resources available in typical FPGAs. The use of onchip RAM as opposed to FPGA logic resources for FSM implementation also enables rapid reconfiguration of the FPGA without the place and routing delays associated with complex digital designs. Conclusion: Experimental results show storage efficiencies of over 80% for several data sets. Furthermore, the FPGA implementation executing at 100 MHz is nearly 20 times faster than an implementation of the traditional Aho-Corasick algorithm executing on a 2.67 GHz workstation.

59 BASIC BIOLOGICAL SCIENCES↗

Final Scientific/Technical Report

A variety of calcifying organisms produce a transient or metastable amorphous calcium carbonate (ACC) precursor phase that is assembled and subsequently transformed into a crystalline biomineral, typically calcite or aragonite. The complex shapes, hierarchical structures, and unique physical properties of the biominerals that result from this calcification pathway have stimulated interest in adapting these concepts for the design and creation of bio-inspired functional materials in the laboratory. ACC also forms as a reactive precursor in diverse inorganic systems and is likely to play a much broader role in calcium carbonate formation. Knowledge of the structure, composition, and behavior of this metastable phase is critical for establishing a structural and mechanistic framework for calcium carbonate formation and its role in biogeochemical processes, including carbon cycling. Minor additives, such as magnesium, phosphorus, and organic macromolecules, are known to play important roles in controlling ACC stability, transformation kinetics, and selection of final crystalline polymorph. Molecular water also occurs in many types of ACC and is thought to play a structural role in its stability and transformation behavior. One of the major challenges that remain unresolved is identification of the structural basis for the role of these minor additives and molecular water. The absence of long-range order in ACC, and other amorphous phases, has posed a challenge for study by techniques commonly used for crystalline solids. Preliminary studies in our group show that the combination of two techniques, synchrotron X-ray-based pair distribution function (PDF) analysis and nuclear magnetic resonance (NMR) spectroscopy can provide entirely new insight to structural properties of synthetic ACC over length scales that are most relevant for understanding its transformation properties. Building on preliminary experiments, we propose a systematic study of synthesis, structure, and transformation behavior in abiotic systems. The work will specifically address the influence of phosphate as a minor additive. PDF analysis will utilize total X-ray scattering data collected at synchrotron facilities optimized for this method and will provide direct characterization of the short- and intermediate-range structure of ACC synthesized under controlled conditions. Parallel computational work using reverse Monte Carlo methods will allow structural models to be constructed for a more complete analysis of PDF results. NMR spectroscopy, using a variety of single- and double-resonance techniques, will provide information on H and CO3 components, including dynamical properties, and their relationship to stabilizing additives. PDF and NMR results will be complemented by parallel studies using X-ray absorption and FT-IR spectroscopy to allow direct comparison to previous studies. These techniques will be used to follow the transformation of different ACC samples, with specific additives, to crystalline phases under controlled condition (e.g., relative humidity). This work will provide the structural and mechanistic basis for understanding ACC stability, its transformation behavior, and the factors that govern polymorph selection. This new insight will directly benefit researchers in diverse fields, as well as adding to the framework of knowledge for understanding and controlling calcium carbonate formation in natural and engineered systems.

58 GEOSCIENCES↗

Enabling Floating Offshore VAWT Design by Coupling OWENS and OpenFAST

Vertical-axis wind turbines (VAWTs) have a long history, with a wide variety of turbine archetypes that have been designed and tested since the 1970s. While few utility-scale VAWTs currently exist, the placement of the generator near the turbine base could make VAWTs advantageous over tradition horizontal-axis wind turbines for floating offshore wind applications via reduced platform costs and improved scaling potential. However, there are currently few numerical design and analysis tools available for VAWTs. One existing engineering toolset for aero-hydro-servo-elastic simulation of VAWTs is the Offshore Wind ENergy Simulator (OWENS), but its current modeling capability for floating systems is non-standard and not ideal. This article describes how OWENS has been coupled to several OpenFAST modules to update and improve modeling of floating offshore VAWTs and discusses the verification of these new capabilities and features. The results of the coupled OWENS verification test agree well with a parallel OpenFAST simulation, validating the new modeling and simulation capabilities in OWENS for floating VAWT applications. These developments will enable the design and optimization of floating offshore VAWTs in the future.

17 WIND ENERGY↗

Stereo depth distortions in teleoperation

In teleoperation, a typical application of stereo vision is to view a work space located short distances (1 to 3m) in front of the cameras. The work presented here treats converged camera placement and studies the effects of intercamera distance, camera-to-object viewing distance, and focal length of the camera lenses on both stereo depth resolution and stereo depth distortion. While viewing the fronto-parallel plane 1.4 m in front of the cameras, depth errors are measured on the order of 2cm. A geometric analysis was made of the distortion of the fronto-parallel plane of divergence for stereo TV viewing. The results of the analysis were then verified experimentally. The objective was to determine the optimal camera configuration which gave high stereo depth resolution while minimizing stereo depth distortion. It is found that for converged cameras at a fixed camera-to-object viewing distance, larger intercamera distances allow higher depth resolutions, but cause greater depth distortions. Thus with larger intercamera distances, operators will make greater depth errors (because of the greater distortions), but will be more certain that they are not errors (because of the higher resolution).

Diner, Daniel B.↗

Parallel-Vector Algorithm For Rapid Structural Anlysis

New algorithm developed to overcome deficiency of skyline storage scheme by use of variable-band storage scheme. Exploits both parallel and vector capabilities of modern high-performance computers. Gives engineers and designers opportunity to include more design variables and constraints during optimization of structures. Enables use of more refined finite-element meshes to obtain improved understanding of complex behaviors of aerospace structures leading to better, safer designs. Not only attractive for current supercomputers but also for next generation of shared-memory supercomputers.

Agarwal, Tarun R.↗

SPEEDES - A multiple-synchronization environment for parallel discrete-event simulation

Synchronous Parallel Environment for Emulation and Discrete-Event Simulation (SPEEDES) is a unified parallel simulation environment. It supports multiple-synchronization protocols without requiring users to recompile their code. When a SPEEDES simulation runs on one node, all the extra parallel overhead is removed automatically at run time. When the same executable runs in parallel, the user preselects the synchronization algorithm from a list of options. SPEEDES currently runs on UNIX networks and on the California Institute of Technology/Jet Propulsion Laboratory Mark III Hypercube. SPEEDES also supports interactive simulations. Featured in the SPEEDES environment is a new parallel synchronization approach called Breathing Time Buckets. This algorithm uses some of the conservative techniques found in Time Bucket synchronization, along with the optimism that characterizes the Time Warp approach. A mathematical model derived from first principles predicts the performance of Breathing Time Buckets. Along with the Breathing Time Buckets algorithm, this paper discusses the rules for processing events in SPEEDES, describes the implementation of various other synchronization protocols supported by SPEEDES, describes some new ones for the future, discusses interactive simulations, and then gives some performance results.

Steinman, Jeff S.↗

Implementing Scientific Simulation Codes Highly Tailored for Vector Architectures Using Custom Configurable Computing Machines

The motivation for this work comes from an observation that amidst the push for Massively Parallel (MP) solutions to high-end computing problems such as numerical physical simulations, large amounts of legacy code exist that are highly optimized for vector supercomputers. Because re-hosting legacy code often requires a complete re-write of the original code, which can be a very long and expensive effort, this work examines the potential to exploit reconfigurable computing machines in place of a vector supercomputer to implement an essentially unmodified legacy source code. Custom and reconfigurable computing resources could be used to emulate an original application's target platform to the extent required to achieve high performance. To arrive at an architecture that delivers the desired performance subject to limited resources involves solving a multi-variable optimization problem with constraints. Prior research in the area of reconfigurable computing has demonstrated that designing an optimum hardware implementation of a given application under hardware resource constraints is an NP-complete problem. The premise of the approach is that the general issue of applying reconfigurable computing resources to the implementation of an application, maximizing the performance of the computation subject to physical resource constraints, can be made a tractable problem by assuming a computational paradigm, such as vector processing. This research contributes a formulation of the problem and a methodology to design a reconfigurable vector processing implementation of a given application that satisfies a performance metric. A generic, parametric, architectural framework for vector processing implemented in reconfigurable logic is developed as a target for a scheduling/mapping algorithm that maps an input computation to a given instance of the architecture. This algorithm is integrated with an optimization framework to arrive at a specification of the architecture parameters that attempts to minimize execution time, while staying within resource constraints. The flexibility of using a custom reconfigurable implementation is exploited in a unique manner to leverage the lessons learned in vector supercomputer development. The vector processing framework is tailored to the application, with variable parameters that are fixed in traditional vector processing. Benchmark data that demonstrates the functionality and utility of the approach is presented. The benchmark data includes an identified bottleneck in a real case study example vector code, the NASA Langley Terminal Area Simulation System (TASS) application.

Rutishauser, David↗

Strategies for the GPU Implementation of the OVERFLOW CFD Code

Wondering how to port a large, computational fluid dynamics (CFD) solver, written in Fortran, to run effectively on GPUs? Join this talk to learn about the strategies NASA’s OVERFLOW CFD code has used to effectively utilize GPUs to greatly improve the time to solution compared to CPUs. OVERFLOW is an overset, structured grid, computational fluid dynamics (CFD) flow solver developed by NASA and widely used by government, US industry, and academia. It is known for its effective use of CPU hardware, but this talk will discuss recent efforts to modify the code to run efficiently on GPUs. We will describe our use of OpenACC, CUDA Fortran, and CUDA C++, discussing why and how we use each to map our problem onto NVIDIA GPUs. We will also describe structural changes we made in the code to expose enough parallelism to effectively use the GPU hardware. Finally, we will present the performance benefits from running OVERFLOW on GPUs compared to the well optimized CPU version of the code.

GPU Programming↗

Impact of component size on PHEV energy consumption using global optimization.

Plug-in hybrid electric vehicles are a promising alternative to gas-only vehicles and offer the potential to greatly reduce fuel use in transportation. Their potential energy consumption is highly linked to the size of components. This study focuses on the impact of the electric system energy and power on control and energy consumption. Based on a parallel pre-transmission architecture, several vehicles were modeled, with an all-electric range from 5 to 40 miles on the UDDS, to illustrate various levels of available electric energy. Five others vehicles were created, with various levels of power and same battery energy. The vehicles were then simulated under optimal control on multiple combinations of cycle and distance by using a global optimization algorithm. The global optimization algorithm, based on the Bellman principle, ensures a fair comparison between different vehicles by making each vehicle operate at its maximal potential. The results from each optimization are thoroughly analyzed to highlight control patterns. The potential minimal fuel consumption that can be achieved by each of them is presented. The results can also be used to find the potential minimal greenhouse gases emissions.

54 ENVIRONMENTAL SCIENCES↗

Ion extraction system optimization

The extraction of a beam from ion sources is dominated by the strong space charge of the beam, due to the initial low speed of the particles. Several mathematical and computational issues are discussed, with reference to a diode design based on thin anode lens effect, yielding a parallel beam at its exit, which is the first block of many high current electrostatic accelerators. Perturbation to uniform current density are analyzed. Effect of a thick anode lens is also treated.

43 PARTICLE ACCELERATORS↗

Parallelization and Performance Portability in Hydrodynamics Codes

With the eve of Exascale computing, performance and portability are at the forefront of all scientific codes. Adding more cores and more energy to a system is no longer a sustainable way to achieve performance, and extra effort must now be made to improve performance in all areas of code and code development. Using hydrodynamic codes as a basis, this work explores numerous techniques to achieve performance in different ways. Adaptive mesh refinement (AMR) is a necessary technique to improve memory optimization in mesh-based simulations. However it is invasive and conventionally difficult to integrate into existing applications, so we present a new branch of AMR to create a smooth transition to these optimizations, which not only improves performance, but also greatly reduces developer effort. We introduce the concept of this improvement as Phantom-Cell AMR, and assess theoretically the improvements, as well as present an application of its use. Other work included involves and investigation into an efficient data structure that ensures optimal memory layout for cache performance, with a target of making codes performant and portable across all architectures. All of the work targets both performance and portability, not just on CPU hardware, but specifically across GPU architectures. Parallel performance is key to all of the methods presented, but the research makes a great effort to improve the portability of all applications to prepare for current high performance computing systems and those on the horizon.

97 MATHEMATICS AND COMPUTING↗

Speeding up particle track reconstruction using a parallel Kalman filter algorithm

One of the most computationally difficult problems expected for the High-Luminosity Large Hadron Collider (HL-LHC) is determining the trajectory of charged particles during event reconstruction. Algorithms used at the LHC today rely on Kalman filtering, which builds physical trajectories incrementally while incorporating material effects and error estimation. Recognizing the need for faster computational throughput, we have adapted Kalman-filter-based methods for highly parallel, many-core SIMD architectures that are now prevalent in high-performance hardware. In this paper, we discuss the design and performance of the improved tracking algorithm, referred to as mkFit. A key piece of the algorithm is the Matriplex library, containing dedicated code to optimally vectorize operations on small matrices. The physics performance of the mkFit algorithm is comparable to the nominal CMS tracking algorithm when reconstructing tracks from simulated proton-proton collisions within the CMS detector. We study the scaling of the algorithm as a function of the parallel resources utilized and find large speedups both from vectorization and multi-threading. mkFit achieves a speedup of a factor of 6 compared to the nominal algorithm when run in a single-threaded application within the CMS software framework.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Linear quadratic regulators with eigenvalue placement in a specified region

A linear optimal quadratic regulator is developed for optimally placing the closed-loop poles of multivariable continuous-time systems within the common region of an open sector, bounded by lines inclined at + or - pi/2k (k = 2 or 3) from the negative real axis with a sector angle of pi/2 or less, and the left-hand side of a line parallel to the imaginary axis in the complex s-plane. The design method is mainly based on the solution of a linear matrix Liapunov equation, and the resultant closed-loop system with its eigenvalues in the desired region is optimal with respect to a quadratic performance index.

Shieh, Leang S.↗

Impact of Airfoils on Aerodynamic Optimization of Heavy Lift Rotorcraft

Rotor airfoils were developed for two large tiltrotor designs, the Large Civil Tilt Rotor (LCTR) and the Military Heavy Tilt Rotor (MHTR). The LCTR was the most promising of several rotorcraft concepts produced by the NASA Heavy Lift Rotorcraft Systems Investigation. It was designed to carry 120 passengers for 1200 nm, with performance of 350 knots cruise at 30,000 ft altitude. A parallel design, the MHTR, had a notional mission of 40,000 Ib payload, 500 nm range, and 300 knots cruise at 4000 ft, 95 F. Both aircraft were sized by the RC code developed by the U. S. Army Aeroflightdynamics Directorate (AFDD). The rotors were then optimized using the CAMRAD II comprehensive analysis code. Rotor airfoils were designed for each aircraft, and their effects on performance analyzed by CAMRAD II. Airfoil design criteria are discussed for each rotor. Twist and taper optimization are presented in detail for each rotor, with discussions of performance improvements provided by the new airfoils, compared to current technology airfoils. Effects of stall delay and blade flexibility on performance are also included.

Acree, Cecil W., Jr.↗