Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel algorithms.”

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

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

At least 793 records · Page 44

Computation Annual Report (2013)

Computation provides the intellectual electricity that helps make Lawrence Livermore National Laboratory (LLNL) a thriving and innovative research and development (R&D) institution. Our hardware, software, and discipline experts are integrated into almost every field of research at LLNL. Our in-house programs, software applications, and support initiatives help achieve mission-critical national-security objectives for the U.S. Departments of Energy, Homeland Security, and Defense, as well as other federal and state agencies. We deliver comprehensive support to a wide set of scientific disciplines that include physical sciences (materials modeling, fluid dynamics), biology (genomic sequencing), mathematics (scalable algorithms), and computer sciences (parallel processing, real-time control systems). This year, we have expanded our outreach with high performance computing (HPC) collaborations and made great strides in our capabilities related to mathematical computation, control systems, and computation infrastructure, many of them in concert with partners in industry and academia. The Computation workforce remains highly motivated and passionate about melding computational expertise with cutting-edge science and technology to enable breakthroughs. 2013 has once again proven that Computation provides the foundation and support that are essential for productivity at LLNL. Every scientific discipline and program leverages the tools and expertise provided by our staff. We remain at the forefront of HPC moving towards exascale and have developed the infrastructure and proficiency to make this an achievable goal. Our researchers repeatedly deliver outstanding research, attracting collaborations with the biggest names in academia and industry, while joining forces with other national laboratories to further push the bounds of what is scientifically possible. Computation’s mission is echoed by the President of the United States in his assertion that “our future depends on reaffirming America’s role as the world’s engine of scientific discovery and technological innovation.” Driven by this lofty goal, we employ our state-of-the-art computational capabilities to ensure LLNL’s position as a global science and technology leader.

97 MATHEMATICS AND COMPUTING↗

HPC-enabled computation of demand models at scale

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗

HPC4Mobilty w/ UCB

The purpose of this project is to examine the energy impact of urban-scale traffic for the Los Angeles Basin by developing and implementing a scalable traffic assignment model. An energy optimization function will be posed and when integrated into the optimization code for travel assignment it can be mathematically proven to converge. The energy optimization function can then be compared to the typical travel time optimization that is traditionally used in traffic assignment models. The analysis will begin with static traffic assignment models with the routing for all origin and destinations computed in parallel on high performance computing facilities. Convergence of the numerical methods rely on the solution of convex programs (or extensions of these). This step will mostly consist of demonstrating the ability to parallelize the Frank Wolfe algorithm on various platforms. This work will contribute to LBNL’s efforts to develop new processes, analytical tools, program designs, and business models to advance the state of the art in next-generation sustainable transportation solutions.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

In previous work, we have introduced a mathematical model for solving a discretized version of the process family design problem. This involves two sets of decision variables. One set selects which unit module designs are included in the process platform out of a candidate set of options; the other set determines which of these unit module designs are assigned to each variant. In this work, we exploit a parallelized Progressive Hedging (PH) algorithm to solve even larger scale design problems. PH is a well-known algorithm traditionally used to solve stochastic programming problems. While our problem is not a two-stage stochastic programming problem, the structure is similar, and it can be directly mapped to the PH approach, which we employ here to solve this deterministic optimization problem. We decompose our problem by process variant. We treat the platform unit module design variables as first-stage and the assignment of unit module designs to variants as second-stage, solving the problem using mpi-sppy. We demonstrate this approach on case studies of CC, water desalination, and refrigeration.

Stinchfield, Georgia↗

Performance of Replica-Exchange Wang-Landau Sampling for the 2D Ising Model: A Brief Survey

We report a brief performance study of the replica-exchange Wang-Landau algorithm, a recently proposed parallel realization of Wang-Landau sampling, using the 2D Ising model as a test case. The simulation time is found to scale inversely with the square root of the number of subwindows (and thus number of processors) used to span the global parameter space. We also investigate the time profiles for random walkers in dierent subwindows to complete iterations, which will aid the development of and adaptive load-balancing scheme.

Zhao, Yiwei↗

Stochastic Inversion of 2D Magnetotelluric Data

The algorithm is developed to invert 2D magnetotelluric (MT) data based on sharp boundary parametrization using a Bayesian framework. Within the algorithm, we consider the locations and the resistivity of regions formed by the interfaces are as unknowns. We use a parallel, adaptive finite-element algorithm to forward simulate frequency-domain MT responses of 2D conductivity structure. Those unknown parameters are spatially correlated and are described by a geostatistical model. The joint posterior probability distribution function is explored by Markov Chain Monte Carlo (MCMC) sampling methods. The developed stochastic model is effective for estimating the interface locations and resistivity. Most importantly, it provides details uncertainty information on each unknown parameter. Hardware requirements: PC, Supercomputer, Multi-platform, Workstation; Software requirements C and Fortan; Operation Systems/version is Linux/Unix or Windows

Chen, Jinsong↗

BASTet (Berkeley Analysis and Storage Toolkit)

BASTet is an advanced software library written in Python. BASTet serves as the analysis and storage library for the OpenMSI project. BASTet is an integrate framework for: i) storage of spectral imaging data, ii) storage of derived analysis data, iii) provenance of analyses, iv) integration and execution of analyses via complex workflows. BASTet implements the API for the HDF5 storage format used by OpenMSI. Analyses that are developed using BASTet benefit from direct integration with storage format, automatic tracking of provenance, and direct integration with command-line and workflow execution tools. BASTet also defines interfaces to enable developers to directly integrate their analysis with OpenMSI's web-based viewing infrastruture without having to know OpenMSI. BASTet also provides numerous helper classes and tools to assist with the conversion of data files, ease parallel implementation of analysis algorithms, ease interaction with web-based functions, description methods for data reduction. BASTet also includes detailed developer documentation, user tutorials, iPython notebooks, and other supporting documents.

Bowen, Benjamin↗

Multi-View, Deep Learning, and Contextual Analysis: Promising Approaches for sUAS Land Cover Classification

Small Unmanned Aircraft System (sUAS) image collection and preprocessing to produce orthoimages, point clouds, and digital surface models have made great leaps forward in the past years. These advances and the wide spectrum of existing and emerging sUAS applications mandate parallel improvements in the algorithms used for image classification that take into consideration the specific characteristics of sUAS imagery. This chapter presents several alternative approaches to improve classification accuracy using redundant information in overlapped sUAS imagery captured in a typical sUAS mission. These include Deep Convolution Neural Network (DCNN) classification, Fully Convolutional Neural (FCN) Network, and contextual relationships under an Object-Based Image Analysis (OBIA) framework. The chapter synthesizes the results of implementing the introduced classification approaches using a case study of high-resolution sUAS images captured in a wetland area in Central Florida.

Liu, Tao↗

Phase-space finite elements in a least-squares solution of the transport equation

The linear Boltzmann transport equation is solved using a least-squares finite element approximation in the space, angular and energy phase-space variables. The method is applied to both neutral particle transport and also to charged particle transport in the presence of an electric field, where the angular and energy derivative terms are handled with the energy/angular finite elements approximation, in a manner analogous to the way the spatial streaming term is handled. For multi-dimensional problems, a novel approach is used for the angular finite elements: mapping the surface of a unit sphere to a two-dimensional planar region and using a meshing tool to generate a mesh. In this manner, much of the spatial finite-elements machinery can be easily adapted to handle the angular variable. The energy variable and the angular variable for one-dimensional problems make use of edge/beam elements, also building upon the spatial finite elements capabilities. The methods described here can make use of either continuous or discontinuous finite elements in space, angle and/or energy, with the use of continuous finite elements resulting in a smaller problem size and the use of discontinuous finite elements resulting in more accurate solutions for certain types of problems. The work described in this paper makes use of continuous finite elements, so that the resulting linear system is symmetric positive definite and can be solved with a highly efficient parallel preconditioned conjugate gradients algorithm. The phase-space finite elements capability has been built into the Sceptre code and applied to several test problems, including a simple one-dimensional problem with an analytic solution available, a two-dimensional problem with an isolated source term, showing how the method essentially eliminates ray effects encountered with discrete ordinates, and a simple one-dimensional charged-particle transport problem in the presence of an electric field. (authors)

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Multi-cycle boiling water reactor fuel cycle optimization

In this work a new computer code, BWROPT (Boiling Water Reactor Optimization), is presented. BWROPT uses the Parallel Simulated Annealing (PSA) algorithm to solve the out-of-core optimization problem coupled with an in-core optimization that determines the optimum fuel loading pattern. However it uses a Haling power profile for the depletion instead of optimizing the operating strategy. The result of this optimization is the optimum new fuel inventory and the core loading pattern for the first cycle considered in the optimization. Several changes were made to the optimization algorithm with respect to other nuclear fuel cycle optimization codes that use PSA. Instead of using constant sampling probabilities for the solution perturbation types throughout the optimization as is usually done in PSA optimizations the sampling probabilities are varied to get a better solution and/or decrease runtime. The new fuel types available for use can be sorted into an array based on any number of parameters so that each parameter can be incremented or decremented, which allows for more precise fuel type selection compared to random sampling. Also, the results are sorted by the new fuel inventory of the first cycle for ease of comparing alternative solutions. (authors)

11 NUCLEAR FUEL CYCLE AND FUEL MATERIALS↗

Self-Consistent Computation of Electromagnetic Fields and Phase Space Densities for Particles on Curved Planar Orbits

We discuss our progress on the self-consistent calculation of the 4D phase space density (PSD) and electromagnetic fields in a Vlasov-Maxwell formulation. We emphasize Coherent Synchrotron Radiation (CSR) from arbitrary curved planar orbits, with shielding from the vacuum chamber, but space charge forces are naturally included. Our focus on the Vlasov equation will provide simulations with lower numerical/statistical noise than standard PIC methods, and will allow the study of issues such as emittance degradation and microbunching due to space charge and CSR in bunch compressors. The fields excited by the bunch are computed in the lab frame from a new double integral formula. The field formula is derived from retarded potentials by changes of variables. It is singularity-free and requires no computation of retarded times. Ultimately, the Vlasov equation will be integrated in beam frame coordinates using our method of local characteristics. As an important intermediate step, we have developed a 'self consistent Monte Carlo algorithm', and a corresponding parallel code. This gives an accurate representation of the source and will help in understanding the PSD support. In addition we have (1) studied carefully a 2D phase space Vlasov analogue and (2) derived an improved expression of the field of a 1D charge/current distribution which accounts for the interference of different bends and other effects usually neglected. Bunch compressors will be emphasized.

43 PARTICLE ACCELERATORS↗

Spherical Harmonic Transform Algorithms

A collection of MATLAB classes for computing spherical harmonic transforms are presented and used to solve simple partial differential equations on the sphere. The spectral synthesis and analysis using fast Fourier transforms and Legendre transforms with the associated Legendre functions are presented in depth. A set of methods associated with a spectral\_field class provides spectral approximation to the $\DIV$, $\CURL$, $\GRAD$, and $\LAPL$ in spherical geometr y. Laplace inversion and Helmholtz equation solvers are also methods for this clas s. Investigation of algorithms and analysis for spherical harmonic transform optio ns for parallel high performance computers are discussed in the context of global climate and weather models.

spherical harmonic transform algorithms parallel c↗

Direct simulation Monte Carlo on petaflop supercomputers and beyond

The gold-standard definition of the Direct Simulation Monte Carlo (DSMC) method is given in the 1994 book by Bird [Molecular Gas Dynamics and the Direct Simulation of Gas Flows (Clarendon Press, Oxford, UK, 1994)], which refined his pioneering earlier papers in which he first formulated the method. In the intervening 25 years, DSMC has become the method of choice for modeling rarefied gas dynamics in a variety of scenarios. The chief concern to applying DSMC to more dense or even continuum flows is its computational expense compared to continuum computational fluid dynamics methods. The dramatic (nearly billion-fold) increase in speed of the largest supercomputers over the last 30 years has thus been a key enabling factor in using DSMC to model a richer variety of flows, due to the method’s inherent parallelism. We have developed the open-source SPARTA DSMC code with the goal of running DSMC efficiently on the largest machines, both current and future. It is largely an implementation of Bird’s 1994 formulation. In this work, we describe algorithms used in SPARTA to enable DSMC to operate in parallel at the scale of many billions of particles or grid cells, or with billions of surface elements. We highlight a few examples of the kinds of fundamental physics questions and engineering applications that DSMC can address at these scales.

97 MATHEMATICS AND COMPUTING↗

Utilizing High Performance Computing for Chemistry: Parallel Computational Chemistry

Parallel hardware has become readily available to the computational chemistry research community. This perspective will review the current state of parallel computational chemistry software utilizing high-performance parallel computing platforms.Hardware and software trends and their effect on quantum chemistry methodologies, algorithms, and software development will also be discussed.

99 GENERAL AND MISCELLANEOUS↗

Domain decomposition solution of nonlinear two-dimensional parabolic problems by random trees

A domain decomposition method is developed for the numerical solution of nonlinear parabolic partial differential equations in any space dimension, based on the probabilistic representation of solutions as an average of suitable multiplicative functionals. Such a direct probabilistic representation requires generating a number of random trees, whose role is that of the realizations of stochastic processes used in the linear problems. First, only few values of the sought solution inside the space-time domain are computed (by a Monte Carlo method on the trees). An interpolation is then carried out, in order to approximate interfacial values of the solution inside the domain. Thus, a fully decoupled set of sub-problems is obtained. The algorithm is suited to massively parallel implementation, enjoying arbitrary scalability and fault tolerance properties. Pruning the trees is shown to increase appreciably the efficiency of the algorithm. Numerical examples conducted in 2D, including some for the KPP equation, are given.

97 MATHEMATICS AND COMPUTING↗

Toward Parallel Document Clustering

A key challenge to automated clustering of documents in large text corpora is the high cost of comparing documents in a multimillion dimensional document space. The Anchors Hierarchy is a fast data structure and algorithm for localizing data based on a triangle inequality obeying distance metric, the algorithm strives to minimize the number of distance calculations needed to cluster the documents into “anchors” around reference documents called “pivots”. We extend the original algorithm to increase the amount of available parallelism and consider two implementations: a complex data structure which affords efficient searching, and a simple data structure which requires repeated sorting. The sorting implementation is integrated with a text corpora “Bag of Words” program and initial performance results of end-to-end a document processing workflow are reported.

99 GENERAL AND MISCELLANEOUS↗

Accuracy of the explicit energy-conserving particle-in-cell method for under-resolved simulations of capacitively coupled plasma discharges

The traditional explicit electrostatic momentum-conserving particle-in-cell algorithm requires strict resolution of the electron Debye length to deliver numerical stability and accuracy. The explicit electrostatic energy-conserving particle-in-cell algorithm alleviates this constraint with minimal modification to the traditional algorithm, retaining its simplicity, ease of parallelization, and acceleration on modern supercomputing architectures. In this article, we apply the algorithm to model a one-dimensional radio frequency capacitively coupled plasma discharge relevant to industrial applications. The energy-conserving approach closely matches the results from the momentum-conserving algorithm and retains accuracy even for cell sizes up to 8 times the electron Debye length. For even larger cells, the algorithm loses accuracy due to poor resolution of steep gradients within the radio frequency sheath. Accuracy can be recovered by adopting a non-uniform grid, which resolves the sheath and allows for cell sizes up to 32 times the electron Debye length in the quasi-neutral bulk of the discharge. The effect is an up to 8 times reduction in the number of required simulation cells, an improvement that can compound in higher-dimensional simulations. We therefore consider the explicit energy-conserving algorithm as a promising approach to significantly reduce the computational cost of full-scale device simulations and a pathway to delivering kinetic simulation capabilities of use to industry.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗