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 559 records · Page 31

Synchronous and asynchronous optimized Schwarz methods for one-way subdivision of bounded domains

Convergence of both synchronous and asynchronous optimized Schwarz algorithms for the shifted Laplacian operator on a bounded rectangular domain, in a one-way subdivision of the computational domain, with overlap, is shown. Convergence results are obtained under very mild conditions on the size of the subdomains and on the amount of overlap. A couple of results are also given, relating the convergence rate of the asynchronous method to changes in the size of the domain. Numerical experiments illustrate the theoretical results.

97 MATHEMATICS AND COMPUTING↗

Augmented Lagrangian formulation of orbital-free density functional theory

We present an Augmented Lagrangian formulation and its real-space implementation for non-periodic Orbital-Free Density Functional Theory (OF-DFT) calculations. In particular, we rewrite the constrained minimization problem of OF-DFT as a sequence of minimization problems without any constraint, thereby making it amenable to powerful unconstrained optimization algorithms. Further, we develop a parallel implementation of this approach for the Thomas–Fermi–von Weizsacker (TFW) kinetic energy functional in the framework of higher-order finite-differences and the conjugate gradient method. With this implementation, we establish that the Augmented Lagrangian approach is highly competitive compared to the penalty and Lagrange multiplier methods. Additionally, we show that higher-order finite-differences represent a computationally efficient discretization for performing OF-DFT simulations. Overall, we demonstrate that the proposed formulation and implementation are both efficient and robust by studying selected examples, including systems consisting of thousands of atoms. We validate the accuracy of the computed energies and forces by comparing them with those obtained by existing plane-wave methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

High-throughput feedback-enabled optogenetic stimulation and spectroscopy in microwell plates

Abstract The ability to perform sophisticated, high-throughput optogenetic experiments has been greatly enhanced by recent open-source illumination devices that allow independent programming of light patterns in single wells of microwell plates. However, there is currently a lack of instrumentation to monitor such experiments in real time, necessitating repeated transfers of the samples to stand-alone analytical instruments, thus limiting the types of experiments that could be performed. Here we address this gap with the development of the optoPlateReader (oPR), an open-source, solid-state, compact device that allows automated optogenetic stimulation and spectroscopy in each well of a 96-well plate. The oPR integrates an optoPlate illumination module with a module called the optoReader, an array of 96 photodiodes and LEDs that allows 96 parallel light measurements. The oPR was optimized for stimulation with blue light and for measurements of optical density and fluorescence. After calibration of all device components, we used the oPR to measure growth and to induce and measure fluorescent protein expression in E. coli . We further demonstrated how the optical read/write capabilities of the oPR permit computer-in-the-loop feedback control, where the current state of the sample can be used to adjust the optical stimulation parameters of the sample according to pre-defined feedback algorithms. The oPR will thus help realize an untapped potential for optogenetic experiments by enabling automated reading, writing, and feedback in microwell plates through open-source hardware that is accessible, customizable, and inexpensive.

59 BASIC BIOLOGICAL SCIENCES↗

Power and Performance Trade-offs for Space Time Adaptive Processing

Computational efficiency – performance relative to power or energy – is one of the most important concerns when designing RADAR processing systems. This paper analyzes power and performance trade-offs for a typical Space Time Adaptive Processing (STAP) application. We study STAP implementations for CUDA and OpenMP on two computationally efficient architectures, Intel Haswell Core I7-4770TE and NVIDIA Kayla with a GK208 GPU. We analyze the power and performance of STAP’s computationally intensive kernels across the two hardware testbeds. We also show the impact and trade-offs of GPU optimization techniques. We show that data parallelism can be exploited for efficient implementation on the Haswell CPU architecture. The GPU architecture is able to process large size data sets without increase in power requirement. The use of shared memory has a significant impact on the power requirement for the GPU. A balance between the use of shared memory and main memory access leads to an improved performance in a typical STAP application.

Gawande, Nitin A.↗

Exploiting Vector and Multicore Parallelsim for Recursive, Data- and Task-Parallel Programs

Modern hardware contains parallel execution resources that are well-suited for data-parallelism-vector units-and task parallelism-multicores. However, most work on parallel scheduling focuses on one type of hardware or the other. In this work, we present a scheduling framework that allows for a unified treatment of task- and data-parallelism. Our key insight is an abstraction, task blocks, that uniformly handles data-parallel iterations and task-parallel tasks, allowing them to be scheduled on vector units or executed independently as multicores. Our framework allows us to define schedulers that can dynamically select between executing task- blocks on vector units or multicores. We show that these schedulers are asymptotically optimal, and deliver the maximum amount of parallelism available in computation trees. To evaluate our schedulers, we develop program transformations that can convert mixed data- and task-parallel pro- grams into task block-based programs. Using a prototype instantiation of our scheduling framework, we show that, on an 8-core system, we can simultaneously exploit vector and multicore parallelism to achieve 14×-108× speedup over sequential baselines.

Ren, Bin↗

LLNL/thicket

Thicket is a python-based toolkit for Exploratory Data Analysis (EDA) of parallel performance data that enables performance optimization and understanding of applications’ performance on supercomputers. It bridges the performance tool gap between being able to consider only a single instance of a simulation run (e.g., single platform, single measurement tool, or single scale) and finding actionable insights in multi-dimensional, multi-scale, multi-architecture, and multi-tool performance datasets.

Brink, Stephanie Labasan↗

Evaluating Multi-core Architectures through Accelerating the Three-Dimensional Lax–Wendroff Correction

Wave propagation forward modeling is a widely used computational method in oil and gas exploration. The iterative stencil loops in such problems have broad applications in scientific computing. However, executing such loops can be highly time time-consuming, which greatly limits application’s performance and power efficiency. In this paper, we accelerate the forward modeling technique on the latest multi-core and many-core architectures such as Intel Sandy Bridge CPUs, NVIDIA Fermi C2070 GPU, NVIDIA Kepler K20x GPU, and the Intel Xeon Phi Co-processor. For the GPU platforms, we propose two parallel strategies to explore the performance optimization opportunities for our stencil kernels. For Sandy Bridge CPUs and MIC, we also employ various optimization techniques in order to achieve the best.

3D Wave Forward Modeling↗

SciDAC Center for Gyrokinetic Particle Simulation of Turbulent Transport in Burning Plasmas

During the first year of the SciDAC gyrokinetic particle simulation (GPS) project, the GPS team (Zhihong Lin, Liu Chen, Yasutaro Nishimura, and Igor Holod) at the University of California, Irvine (UCI) studied the tokamak electron transport driven by electron temperature gradient (ETG) turbulence, and by trapped electron mode (TEM) turbulence and ion temperature gradient (ITG) turbulence with kinetic electron effects, extended our studies of ITG turbulence spreading to core-edge coupling. We have developed and optimized an elliptic solver using finite element method (FEM), which enables the implementation of advanced kinetic electron models (split-weight scheme and hybrid model) in the SciDAC GPS production code GTC. The GTC code has been ported and optimized on both scalar and vector parallel computer architectures, and is being transformed into objected-oriented style to facilitate collaborative code development. During this period, the UCI team members presented 11 invited talks at major national and international conferences, published 22 papers in peer-reviewed journals and 10 papers in conference proceedings. The UCI hosted the annual SciDAC Workshop on Plasma Turbulence sponsored by the GPS Center, 2005-2007. The workshop was attended by about fifties US and foreign researchers and financially sponsored several gradual students from MIT, Princeton University, Germany, Switzerland, and Finland. A new SciDAC postdoc, Igor Holod, has arrived at UCI to initiate global particle simulation of magnetohydrodynamics turbulence driven by energetic particle modes. The PI, Z. Lin, has been promoted to the Associate Professor with tenure at UCI.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Parameter Estimation and Model Validation of Nonlinear Dynamical Networks

In the performance period of this work under a DOE contract, the co-PIs, Philip Gill and Henry Abarbanel, developed new methods for statistical data assimilation for problems of DOE interest, including geophysical and biological problems. This included numerical optimization algorithms for variational principles, new parallel processing Monte Carlo routines for performing the path integrals of statistical data assimilation. These results have been summarized in the monograph: “Predicting the Future: Completing Models of Observed Complex Systems” by Henry Abarbanel, published by Spring-Verlag in June 2013. Additional results and details have appeared in the peer reviewed literature.

42 ENGINEERING↗

Characterization of bandwidth requirements of algorithms for extreme scale science

Technology trends have resulted in widely different rates of improvement in computational throughput as compared to data movement rates in computer systems. With future systems, the cost of data movement through the memory hierarchy is expected to become even more dominant relative to the cost of performing arithmetic operations, both in terms of time and energy. Therefore, optimizing data access costs will become ever more critical in the coming years. However, unlike the well understood model of computational complexity in terms of the number of elementary operations to execute an algorithm, the inherent data-movement complexity of computations is unknown for most algorithms. Given the crucial importance of optimizing data access costs in scalable parallel systems, it is of great interest to develop techniques for understanding the inherent data movement complexity of an algorithm. In this project, we focus on this fundamental and significant problem.

97 MATHEMATICS AND COMPUTING↗

Tandem particle-slurry batch reactors for solar water splitting (Final Scientific/Technical Report)

Economically, particle slurry reactors are projected to be one of the most promising technologies for solar photoelectrochemical hydrogen production, according to a 2009 techno-economic analysis commissioned by the US DOE and performed by Directed Technologies, Inc. The Fuel Cell Technologies Office’s Multi-Year Research, Development and Demonstration (MYRD&D) goals and targets are to reduce the cost of H 2 produced from renewable sources at the plant gate (i.e. not including delivery, dispensing, or storage) to < $2.00/gge, equivalent to ~$2.00/kg H 2 . Research results from our techno-economic modeling research suggest that this target could be met using particle slurry reactors assuming STH efficiencies in the range of 5 – 10%, materials lifetimes of < 1 year, and nanoparticles that cost up to 20 times more than projected costs of TiO 2 -coated Fe 2 O 3 nanoparticles. Although most large worldwide research efforts directed at solar photoelectrochemical hydrogen production focus on wafer-based designs, the projected lower cost for a particle slurry reactor at these disparate projected STH efficiencies clearly suggests that particle slurry reactors could be a scalable and deployable technology, assuming several challenges are overcome. These major technological challenges include the demonstration of a vertically-stacked-vessel architecture that is capable of operating sustainably while mostly relying on diffusion and natural convection to mix the redox shuttles between the vessels, and the demonstration that photocatalyst particles can operate at an overall 1% STH efficiency or larger when incorporated into this two-vessel design. Our research adds to the understanding of photocatalytic reactors for solar water splitting through numerical modeling results and experimental results. Numerical models were developed to simulate relevant device physics including particle and reactor dimensions which affect optical, transport, and rheological properties, electrocatalytic and photovoltaic properties of particles at various temperatures, and properties of redox shuttles and separators. Moreover, theoretical maximum solar-to-hydrogen efficiencies for ensembles of particles like in photocatalyst reactors were modeled and simulated and shown to equal or exceed those of photoelectrochemical designs under most scenarios. These results help determine constraints on the reactor that will enable more optimal designs for future prototypes. In parallel, experiments were performed to identify the most effective redox shuttles and to empirically validate the numerical models and simulations. Toward the latter, state-of-the-art light-absorbing particles and electrocatalysts were synthesized and characterized physically and photoelectrochemically for water electrolysis and redox chemistry with redox shuttles in the form factor of mesoporous electrodes and free-floating particles. The most promising materials candidates were used in a suspension reactor to evaluate performance toward photocatalytic H 2 production and results from the two measurements were compared. Predominantly, state-of-the-art cocatalyst-modified Rh-doped SrTiO 3 and BiVO 4 particles were further characterized to assess for their ability to perform visible-light-driven H 2 and O 2 evolution, respectively, and results were similar to those reported for the state-of-the-art in the peer-reviewed literature. Outcomes from this work inform the public of the effectiveness and promise of solar photocatalytic water splitting for clean and renewable hydrogen production. This work may also help increase research interest and funding for photocatalysis projects, which will accelerate development of a technology that will benefit the public by generating fuel while emitting few greenhouse gases and pollutants.

08 HYDROGEN↗

User-Oriented Improvements in the MOOSE framework in support of Multiphysics Simulation

The MOOSE Framework is a foundational capability used by NEAMS to create over 15 different simulation tools for advanced nuclear reactors. Due to this ubiquity, improvements to the framework in support of modeling and simulation goals are critical to the program. These improvements can take many forms including optimization, improved user experience, streamlined APIs, parallelism, and new capability. The work transcribed in the report was in direct support of the simulation tools and is already deployed or will be deployed in the coming months. The capabilities implemented were, in the same order as this report, chainable execution objects or executors, support for transfers between applications at the same level in a coupling scheme, support for boundary/subdomain restricted transfers, support for transfers between applications with different coordinate or unit systems, support for MOOSE applications in the NEAMS workbench, deployment of MOOSE application of the INL HPC OnDemand platform, addition of a triangular meshing library in libMesh and increased support of face variables.

97 MATHEMATICS AND COMPUTING↗

High-performance epistasis detection in quantitative trait GWAS

epiSNP is a program for identifying pairwise single nucleotide polymorphism (SNP) interactions (epistasis) in quantitative-trait genome-wide association studies (GWAS). A parallel MPI version (EPISNPmpi) was created in 2008 to address this computationally expensive analysis on large data sets with many quantitative traits and SNP markers. However, the falling cost of genotyping has led to an explosion of large-scale GWAS data sets that challenge EPISNPmpi’s ability to compute results in a reasonable amount of time. Therefore, we optimized epiSNP for modern multi-core and highly parallel many-core processors to efficiently handle these large data sets. This paper describes the serial optimizations, dynamic load balancing using MPI-3 RMA operations, and shared-memory parallelization with OpenMP to further enhance load balancing and allow execution on the Intel Xeon Phi coprocessor (MIC). For a large GWAS data set, our optimizations provided a 38.43× speedup over EPISNPmpi on 126 nodes using 2 MICs on TACC’s Stampede Supercomputer. We also describe a Coarray Fortran (CAF) version that demonstrates the suitability of PGAS languages for problems with this computational pattern. We show that the Coarray version performs competitively with the MPI version on the NERSC Edison Cray XC30 supercomputer. Finally, the performance benefits of hyper-threading for this application on Edison (average 1.35× speedup) are demonstrated.

97 MATHEMATICS AND COMPUTING↗

Code modernization strategies for short-range non-bonded molecular dynamics simulations

Modern HPC systems are increasingly relying on greater core counts and wider vector registers. Thus, applications need to be adapted to fully utilize these hardware capabilities. One class of applications that can benefit from this increase in parallelism are molecular dynamics simulations. In this paper, we describe our efforts at modernizing the ESPResSo++ simulation package for molecular dynamics by restructuring its particle data layout for efficient memory accesses and applying vectorization techniques to benefit the calculation of short-range non-bonded forces, which results in an overall three times speedup and serves as a baseline for further optimizations. We also implement fine-grained parallelism for multi-core CPUs through HPX, a C++ runtime system which uses lightweight threads and an asynchronous many-task approach to maximize concurrency. Our goal is to evaluate the performance of an HPX-based approach compared to the bulk-synchronous MPI-based implementation. This requires the introduction of an additional layer to the domain decomposition scheme that defines the task granularity. On spatially inhomogeneous systems, which impose a corresponding load-imbalance in traditional MPI-based approaches, we demonstrate that by choosing an optimal task size, the efficient work-stealing mechanisms of HPX can overcome the overhead of communication resulting in an overall 1.4 times speedup compared to the baseline MPI version.

97 MATHEMATICS AND COMPUTING↗

A new augmentation based algorithm for extracting maximal chordal subgraphs

If every cycle of a graph is chordal length greater than three then it contains an edge between non-adjacent vertices. Chordal graphs are of interest both theoretically, since they admit polynomial time solutions to a range of NP-hard graph problems, and practically, since they arise in many applications including sparse linear algebra, computer vision, and computational biology. A maximal chordal subgraph is a chordal subgraph that is not a proper subgraph of any other chordal subgraph. Existing algorithms for computing maximal chordal subgraphs depend on dynamically ordering the vertices, which is an inherently sequential process and therefore limits the algorithms’ parallelizability. In our paper we explore techniques to develop a scalable parallel algorithm for extracting a maximal chordal subgraph. We demonstrate that an earlier attempt at developing a parallel algorithm may induce a non-optimal vertex ordering and is therefore not guaranteed to terminate with a maximal chordal subgraph. We then give a new algorithm that first computes and then repeatedly augments a spanning chordal subgraph. After proving that the algorithm terminates with a maximal chordal subgraph, we then demonstrate that this algorithm is more amenable to parallelization and that the parallel version also terminates with a maximal chordal subgraph. That said, the complexity of the new algorithm is higher than that of the previous parallel algorithm, although the earlier algorithm computes a chordal subgraph which is not guaranteed to be maximal. Finally, we experimented with our augmentation-based algorithm on both synthetic and real-world graphs. We provide scalability results and also explore the effect of different choices for the initial spanning chordal subgraph on both the running time and on the number of edges in the maximal chordal subgraph.

97 MATHEMATICS AND COMPUTING↗

Global Transformations for Legacy Parallel Applications via Structural Analysis and Rewriting

Performance and scalability optimization of large HPC applications is currently a labor-intensive, manual process with very low productivity. Major difficulties come from the disaggregated environment for HPC application development: the compiler is only involved in local decisions (core or multithreaded domain), while a library-based, communication-oriented programming model realizes whole-machine parallelism. Realizing any major global change in such a disaggregated environment is very difficult and involves changing large portions of the source code. We present semi-automated techniques, based on structural analysis and rewriting, for performing global transformations on an HPC application source code. We present two case studies using the Self-Consistent Field (SCF) standalone benchmark as well as the Coupled Cluster (CCSD) module (2.9 million lines of Fortran code), a key module of the NWChem computational chemistry application. We demonstrate how structural rewriting techniques can be used to automate transformations that affect multiple sections of the application's source code. We show that the transformations can be applied in a systematic fashion across the source code bases with minimal manual effort. These transformations improve the scalability of the SCF benchmark by more than two orders of magnitude and the performance of the full CCSD module by a factor of 4.0.

legacy parallel applications↗

Impact of Component Sizing in Plug-In Hybrid Electric Vehicles for Energy Resource and Greenhouse Emissions Reduction

Widespread use of alternative hybrid powertrains currently appears inevitable and many opportunities for substantial progress remain. The necessity for environmentally friendly vehicles, in conjunction with increasing concerns regarding U.S. dependency on foreign oil and climate change, has led to significant investment in enhancing the propulsion portfolio with new technologies. Recently, plug-in hybrid electric vehicles (PHEVs) have attracted considerable attention due to their potential to reduce petroleum consumption and greenhouse gas (GHG) emissions in the transportation sector. PHEVs are especially appealing for short daily commutes with excessive stop-and-go driving. However, the high costs associated with their components, and in particular, with their energy storage systems have been significant barriers to extensive market penetration of PEVs. In the research reported here, we investigated the implications of motor/generator and battery size on fuel economy and GHG emissions in a medium duty PHEV. An optimization framework is proposed and applied to two different parallel powertrain configurations, pre-transmission and post-transmission, to derive the Pareto frontier with respect to motor/generator and battery size. The optimization and modeling approach adopted here facilitates better understanding of the potential benefits from proper selection of motor/generator and battery size on fuel economy and GHG emissions. This understanding can help us identify the appropriate sizing of these components and thus reducing the PHEV cost. Addressing optimal sizing of PHEV components could aim at an extensive market penetration of PHEVs.

design optimization↗