Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Parallel computers.”

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 685 records · Page 38

Probing Particle Impingement in Boilers Using High-Performance Computing with Parallel CPUs and GPUs

The major goals of the project are to calculate and analyze particle impingement within boilers, quantify effects of particulates in boilers, and predict damage rates of boilers under different cycling modes. Collectively, these initiatives develop insight into existing coal plant challenges using advanced modeling tools, particularly those leveraging high-performance computing resources. High-performance CFD computing forms a central theme in this project that will employ a high degree of coordination and communication between these initiatives to realize a final, rigorously sound, and validated computational capability upon completion. These results will create a holistic, comprehensive, systems-level assessment of damage rates under different cycling modes. Together, these objectives will develop critical insight into damage mechanisms in existing coal plant challenges for accurately and efficiently assessing operating performance in fossil energy power plants.

20 FOSSIL-FUELED POWER PLANTS↗

Mapping unstructured grid problems to the connection machine

We present a highly parallel graph mapping technique that enables one to solve unstructured grid problems on massively parallel computers. Many implicit and explicit methods for solving discretizated partial differential equations require each point in the discretization to exchange data with its neighboring points every time step or iteration. The time spent communicating can limit the high performance promised by massively parallel computing. To eliminate this bottleneck, we map the graph of the irregular problem to the graph representing the interconnection topology of the computer such that the sum of the distances that the messages travel is minimized. We show that, in comparison to a naive assignment of processors, our heuristic mapping algorithm significantly reduces the communication time on the Connection Machine, CM-2.

Hammond, Steven W.↗

Look-ahead Dynamic Simulation

Look-ahead dynamic simulation software system incorporates the high performance parallel computing technologies, significantly reduces the solution time for each transient simulation case, and brings the dynamic simulation analysis into on-line applications to enable more transparency for better reliability and asset utilization. It takes the snapshot of the current power grid status, functions in parallel computing the system dynamic simulation, and outputs the transient response of the power system in real time.

Jin, Shuangshuang↗

Online data analysis and reduction: An important co-design motif for extreme-scale computers

A growing disparity between supercomputer computation speeds and I/O rates means that it is rapidly becoming infeasible to analyze supercomputer application output only after that output has been written to a file system. Instead, data-generating applications must run concurrently with data reduction and/or analysis operations, with which they exchange information via high-speed methods such as interprocess communications. The resulting parallel computing motif, online data analysis and reduction (ODAR), has important implications for both application and HPC systems design. Here we introduce the ODAR motif and its co-design concerns, describe a co-design process for identifying and addressing those concerns, present tools that assist in the co-design process, and present case studies to illustrate the use of the process and tools in practical settings.

Data Analysis↗

A study of equation solvers for linear and non-linear finite element analysis on parallel processing computers

Concurrent computing environments provide the means to achieve very high performance for finite element analysis of systems, provided the algorithms take advantage of multiple processors. The authors have examined several algorithms for both linear and nonlinear finite element analysis. The performance of these algorithms on an Alliant FX/80 parallel supercomputer has been studied. For single load case linear analysis, the optimal solution algorithm is strongly problem dependent. For multiple load cases or nonlinear analysis through a modified Newton-Raphson method, decomposition algorithms are shown to have a decided advantage over element-by-element preconditioned conjugate gradient algorithms.

Watson, Brian C.↗

Parallel solution of finite element equations

The paper examines several parallel processing solution algorithms for finite element equations arising in linear equilibrium problems. Two basic groups of algorithms, direct and iterative, are investigated with respect to a number of parallel computer architectures and associated selection criteria. The direct algorithms include: LR-Gauss, Crout, Cholesky, Cyclic Reduction and WZ-factorization. The iterative methods examined are: Accelerated Gauss-Seidel, Surrogate Stiffness, Jacobi, Series Expansion, and Energy Monte Carlo. For real-time applications, where the object is to minimize the execution time, Cyclic Reduction appears to be best suited. This assumes a computer with an unlimited number of parallel processors. However, for computers with a limited number of parallel processors that must be used efficiently, both Gauss factorization and Jacobi-like iterative methods rank favorably.

Salama, M.↗

Parallel CFD Supporting NASA's Space Operations Mission Directorate

This slide presentation reviews the use of parallel Computational Fluid Dynamics (CFD) in support of NASA's space operations. Particular attention was devoted to the development of the Space Shuttle, and the use of CFD in designing the shuttle and the work after the Columbia accident. The presentation ends with a discussion of the reasons for CFD and the use of parallel computers in the design and testing of spacecraft.

Gomez, Reynaldo J., III↗

IOrchestrator: improving the performance of multi-node I/O systems via inter-server coordination

A cluster of I/O nodes and a parallel file system are often used to provide high-throughput I/O service to a parallel compute cluster. To exploit I/O parallelism parallel file systems stripe file data across the I/O nodes. While this practice is effective in serving asynchronous requests, it may break individual program's spatial locality, which can seriously degrade I/O performance when the I/O nodes concurrently serve synchronous requests from multiple I/O-intensive programs. In this paper we propose a scheme, Orchestrator, to improve the I/O performance of multi-I/O-node systems by orchestrating I/O services among programs when such inter-I/O-node coordination is dynamically determined to be cost effective. We have implemented IOrchestrator in the PVFS2 parallel file system. Our experiments with representative parallel benchmarks show that IOrchestrator can significantly improve I/O performance - by up to a factor of 2.5 - delivered by a cluster of I/O nodes servicing concurrently-running parallel programs. Notably, we have not observed any scenarios in which the use of IOrchestrator causes significant performance degradation.

97 MATHEMATICS AND COMPUTING↗

Massively parallel electrical conductivity imaging of the subsurface: Applications to hydrocarbon exploration

Three-dimensional (3D) geophysical imaging is now receiving considerable attention for electrical conductivity mapping of potential offshore oil and gas reservoirs. The imaging technology employs controlled source electromagnetic (CSEM) and magnetotelluric (MT) fields and treats geological media exhibiting transverse anisotropy. Moreover when combined with established seismic methods, direct imaging of reservoir fluids is possible. Because of the size of the 3D conductivity imaging problem, strategies are required exploiting computational parallelism and optimal meshing. The algorithm thus developed has been shown to scale to tens of thousands of processors. In one imaging experiment, 32,768 tasks/processors on the IBM Watson Research Blue Gene/L supercomputer were successfully utilized. Over a 24 hour period we were able to image a large scale field data set that previously required over four months of processing time on distributed clusters based on Intel or AMD processors utilizing 1024 tasks on an InfiniBand fabric. Electrical conductivity imaging using massively parallel computational resources produces results that cannot be obtained otherwise and are consistent with timeframes required for practical exploration problems.

54 ENVIRONMENTAL SCIENCES↗

Performance Analysis and Optimization on the UCLA Parallel Atmospheric General Circulation Model Code

An analysis is presented of several factors influencing the performance of a parallel implementation of the UCLA atmospheric general circulation model (AGCM) on massively parallel computer systems. Several modificaitons to the original parallel AGCM code aimed at improving its numerical efficiency, interprocessor communication cost, load-balance and issues affecting single-node code performance are discussed.

atmospheric study optimization strategies parallel↗

Description of Sensor Assignment Optimization Method as Deployed on a Multi-Node Cluster

Data analytic methods are being developed to address the problem of how to assign a sensor set in a nuclear facility such that a requisite level of process monitoring capability is realized and that the sensor set is sufficiently rich to determine the status of the individual sensors with respect to need for calibration. There is an awareness in the nuclear industry that data analytics combined with rich sensor sets represent a means to improve operations and reduce costs. In the industry the calibration problem has been previously approached as an empirical data-driven problem with several methods having been developed. However, the experience of the utilities over the past ten years with these methods indicates that the absence of physics-based information renders the data-driven approach less reliable. Complicating factors such as the inherent variability of operation (both equipment alignment and operating condition) can confound a pure data-driven approach while there are no rigorous guidelines for determining what constitutes an adequate sensor set. The solution under development to overcome these shortcomings supplements the data analytic method with process information in a so-called process-constrained data-analytic approach. Simple balance equations are written for generic components (e.g., mechanical pump, valve, and heat exchanger). These do not require a priori knowledge of process parameters, such as heat transfer coefficients or friction factors. All that is needed on the part of the utility user is to identify the components and how they are connected. This report describes the development of a parallel computing capability for determining the optimal sensor set. The optimal sensor set problem suffers from the curse of dimensionality. Computation time increases exponentially as the size of the system grows. To overcome this difficulty a pre-conditioner algorithm is developed to find an approximate solution close the actual solution. This serves as a seed for the full-blown algorithm and acts to constrain the space that must searched. The optimization algorithms are described and the implementation on a parallel computing platform is described. The application of the method to a use case we are solving in collaboration with our utility partner served to illustrate how the default sensor set in a nuclear plant may not provide sufficient coverage to infer sensor calibration status.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Saltstone SDU6 Modeling Study

A new disposal unit, designated as Saltstone Disposal Unit 6 (SDU6), is being designed for support of site accelerated closure goals and salt waste projections identified in the new Liquid Waste System Plan. The unit is a cylindrical disposal cell of 375 ft in diameter and 43 ft in height, and it has a minimum 30 million gallons of capacity. SRNL was requested to evaluate the impact of an increased grout placement height on the flow patterns radially spread on the floor and to determine whether grout quality is impacted by the height. The primary goals of the work are to develop the baseline Computational Fluid Dynamics (CFD) model and to perform the evaluations for the flow patterns of grout material in SDU6 as a function of elevation of grout discharge port and grout rheology. Two transient grout models have been developed by taking a three-dimensional multiphase CFD approach to estimate the domain size of the grout materials radially spread on the facility floor and to perform the sensitivity analysis with respect to the baseline design and operating conditions such as elevation height of the discharge port and fresh grout properties. For the CFD modeling calculations, air-grout Volume of Fluid (VOF) method combined with Bingham plastic and time-dependent grout models were used for examining the impact of fluid spread performance for the initial baseline configurations and to evaluate the impact of grout pouring height on grout quality. The grout quality was estimated in terms of the air volume fraction for the grout layer formed on the SDU6 floor, resulting in the change of grout density. The study results should be considered as preliminary scoping analyses since benchmarking analysis is not included in this task scope. Transient analyses with the Bingham plastic model were performed with the FLUENT TM code on the high performance parallel computing platform in SRNL. The analysis coupled with a transient grout aging model was performed by using ANSYS-CFX code in the parallel computing platform in Mercer University. Recommended operational guidance was developed assuming that local shear rates and flow patterns related to radial spread along the SDU floor can be used as a measure of grout performance and spatial dispersion affected by the grout height and viscosity. The main conclusions drawn from the grout modeling and calculations are as follows: • The 5 ft height baseline results show that when the 150 gpm grout flow with a 5 Pa yield stress and a 60 cp viscosity is poured down through a 3 inch discharge port, the grout is spread radially up to about 64 ft distance from the pouring center after 2 hours’ pouring time. The air volume fraction of the grout layer is about 29% at 5 minutes’ transient time, and it is reduced by about 9% in 2 hours’ pouring time, resulting in the grout density consisting of about 80% grout and 20% air volume fractions. • The sensitivity results show that when the discharge port is located at a higher position, a larger amount of air is trapped inside the layer formed below the discharge port at the early transient time of less than 30 minutes because of the higher impinging momentum of the grout flow on the floor, resulting in the formation of less smooth layer. • The results clearly indicate that the radial spread for the 43 ft discharge port is about 10% faster than that of the 5 ft discharge port for the early transient period of 5 minutes. However, for the pouring time longer than half an hour, the discharge port height does not affect the radial distance spread on the disposal floor. • When grout quality is related to grout volume fraction, the grout volume fraction for the 43 ft discharge port has lower volume fraction than the 5 ft discharge port for the transient period of the first 5 minutes. However, for the pouring time longer than half an hour, the discharge port height does not affect the grout volume fraction for the layer accumulated on the disposal floor. • A modified Bingham plastic model coupled with time-dependent viscosity behavior was developed for conducting the initial scoping calculations to assess the impact of fluid residence time on radial spreading and basic flow patterns. • The results for the transient viscosity model show that when grout material becomes more viscous, the thickness of the grout layer accumulated on the floor becomes higher, but the radial distance spread on the horizontal floor becomes smaller. The early transient results for the grout density with about 32% air volume fractions are in reasonable agreement with those of the idealized Bingham plastic model. • It is recommended that the current models developed here be benchmarked against the experimental results for critical applications of the modeling results.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗

Prestack reverse time migration for 3D marine reflection seismic data

Prestack reverse time migration (RTM) is a method for imaging the subsurface using the inner product of wavefield extrapolation in shot domain and in receiver domain. It is well known that RTM is better for preserving amplitudes and phases than other prestack migrations. Since 3D seismic data is huge data volume and it needs heavy computing works, it requires parallel computing in order to have a meaningful depth image of the 3D subsurface. We implemented a parallelized version of 3D RTM for prestack depth migration. The results of numerical example for 3D SEG/EAGE salt model showed good agreement with the original geological model. We applied RTM to offshore 3D seismic reflection data. The study area is 12 × 25 km with 120 survey lines. Shot and receiver spacing is 25 m and 12.5 m. The line spacing is 100 m. Shot gathers were preprocessed to enhance signal to noise ratio and velocity model was calculated from conventional stack velocity. Both of them were used to obtain 3D image using RTM. The results show reasonable subsurface image.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Global synchronization of parallel processors using clock pulse width modulation

A circuit generates a global clock signal with a pulse width modification to synchronize processors in a parallel computing system. The circuit may include a hardware module and a clock splitter. The hardware module may generate a clock signal and performs a pulse width modification on the clock signal. The pulse width modification changes a pulse width within a clock period in the clock signal. The clock splitter may distribute the pulse width modified clock signal to a plurality of processors in the parallel computing system.

97 MATHEMATICS AND COMPUTING↗

A parallel hub-and-spoke system for large-scale scenario-based optimization under uncertainty

Practical solution of stochastic programming problems generally requires the use of parallel computing resources. Here, we describe the open source package mpi-sppy, in which efficient and scalable parallelization is a central feature. We report computational experiments that demonstrate the ability to solve very large stochastic programming problems - including mixed-integer variants - in minutes of wall clock time, efficiently leveraging significant parallel computing resources. We report results for the largest publicly available instances of stochastic mixed-integer unit commitment problems, solving to provably tight optimality gaps. In addition, we introduce a novel software architecture that facilitates combinations of methods for accelerating convergence that can be combined in plug-and-play manner. Finally, the mpi-sppy package is written in Python, leverages the widely used Pyomo (http://www.pyomo.org) library for modeling mathematical programs, builds on existing MPI implementations to ensure efficiency and scalability, and is available via http://github.com/Pyomo/mpi-sppy.

97 MATHEMATICS AND COMPUTING↗

Iterative Importance Sampling Algorithms for Parameter Estimation

In parameter estimation problems one computes a posterior distribution over uncertain parameters defined jointly by a prior distribution, a model, and noisy data. Markov chain Monte Carlo (MCMC) is often used for the numerical solution of such problems. An alternative to MCMC is importance sampling, which can exhibit near perfect scaling with the number of cores on high performance computing systems because samples are drawn independently. However, finding a suitable proposal distribution is a challenging task. Several sampling algorithms have been proposed over the past years that take an iterative approach to constructing a proposal distribution. We investigate the applicability of such algorithms by applying them to two realistic and challenging test problems, one in subsurface flow, and one in combustion modeling. More specifically, we implement importance sampling algorithms that iterate over the mean and covariance matrix of Gaussian or multivariate t-proposal distributions. Our implementation leverages massively parallel computers, and we present strategies to initialize the iterations using “coarse” MCMC runs or Gaussian mixture models.

97 MATHEMATICS AND COMPUTING↗

Multiprocessing the Sieve of Eratosthenes

The Sieve of Eratosthenes for finding prime numbers in recent years has seen much use as a benchmark algorithm for serial computers while its intrinsically parallel nature has gone largely unnoticed. The implementation of a parallel version of this algorithm for a real parallel computer, the Flex/32, is described and its performance discussed. It is shown that the algorithm is sensitive to several fundamental performance parameters of parallel machines, such as spawning time, signaling time, memory access, and overhead of process switching. Because of the nature of the algorithm, it is impossible to get any speedup beyond 4 or 5 processors unless some form of dynamic load balancing is employed. We describe the performance of our algorithm with and without load balancing and compare it with theoretical lower bounds and simulated results. It is straightforward to understand this algorithm and to check the final results. However, its efficient implementation on a real parallel machine requires thoughtful design, especially if dynamic load balancing is desired. The fundamental operations required by the algorithm are very simple: this means that the slightest overhead appears prominently in performance data. The Sieve thus serves not only as a very severe test of the capabilities of a parallel processor but is also an interesting challenge for the programmer.

Bokhari, S.↗

Parallel implicit unstructured grid Euler solvers

A mesh-vertex finite volume scheme for solving the Euler equations on triangular unstructured meshes is implemented on an MIMD (multiple instruction/multiple data stream) parallel computer. An explicit four-stage Runge-Kutta scheme is used to solve two-dimensional flow problems. A family of implicit schemes is also developed to solve these problems, where the linear system that arises at each time step is solved by a preconditioned GMRES algorithm. Two partitioning strategies are employed, one that partitions triangles and the other that partitions vertices. The choice of the preconditioner in a distributed memory setting is discussed. All the methods are compared both in terms of elapsed times and convergence rates. It is shown that the implicit schemes offer adequate parallelism at the expense of minimal sequential overhead. The use of a global coarse grid to further minimize this overhead is also investigated. The schemes are implemented on a distributed memory parallel computer, the iPSC/860.

Venkatakrishnan, V.↗