SEARCH · Engineering Papers
Results for “parallel methods”
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.
Analysis, Verification, and Application of Equations and Procedures for Design of Exhaust-pipe Shrouds
Investigations were made to develop a simplified method for designing exhaust-pipe shrouds to provide desired or maximum cooling of exhaust installations. Analysis of heat exchange and pressure drop of an adequate exhaust-pipe shroud system requires equations for predicting design temperatures and pressure drop on cooling air side of system. Present experiments derive such equations for usual straight annular exhaust-pipe shroud systems for both parallel flow and counter flow. Equations and methods presented are believed to be applicable under certain conditions to the design of shrouds for tail pipes of jet engines.
Lattice Boltzmann model for simulation of magnetohydrodynamics
A numerical method, based on a discrete Boltzmann equation, is presented for solving the equations of magnetohydrodynamics (MHD). The algorithm provides advantages similar to the cellular automaton method in that it is local and easily adapted to parallel computing environments. Because of much lower noise levels and less stringent requirements on lattice size, the method appears to be more competitive with traditional solution methods. Examples show that the model accurately reproduces both linear and nonlinear MHD phenomena.
Computing at Los Alamos: A Brief Overview, and Details on Codesign Performance Prediction through Just-in-time-compiled Parallel Discrete Event Simulation
This presentation discusses quantum computing methods performed at LANL as well as event simulation models.
Parallel/distributed direct method for solving linear systems
A new family of parallel schemes for directly solving linear systems is presented and analyzed. It is shown that these schemes exhibit a near optimal performance and enjoy several important features: (1) For large enough linear systems, the design of the appropriate paralleled algorithm is insensitive to the number of processors as its performance grows monotonically with them; (2) It is especially good for large matrices, with dimensions large relative to the number of processors in the system; (3) It can be used in both distributed parallel computing environments and tightly coupled parallel computing systems; and (4) This set of algorithms can be mapped onto any parallel architecture without any major programming difficulties or algorithmical changes.
Introduction to this Special Issue on Geostatistics and Scaling of Remote Sensing
The germination of this special PE&RS issue began at the Royal Geographical Society (with the Institute of British Geographers)(RCS-IBC) annual meeting in January, 1997 held at the University of Exeter in Exeter, England. The cold and snow of an England winter were greatly tempered by the friendly and cordial discussions that ensued at the meeting on possible ways to foster both dialog and research across "the Big Pond" between geographers in the US and the UK on the use of geostatistics and geospatial techniques for remote sensing of land surface processes. It was decided that one way to stimulate and enhance cooperation on the application of geostatistics and geospatial methods in remote sensing was to hold parallel sessions on these topics at appropriate meeting venues in 1998 in both the US and the UK Selected papers given at these sessions would be published as a special issue of PE&RS on the US side, and as a special issue of Computers and Geosciences (C&G) on the UK side, to highlight the commonality in research on geostatistics and geospatial methods in remote sensing and spatial data analysis on both sides of the Atlantic Ocean. As a consequence, a session on "Ceostatistics and Geospatial Techniques for Remote Sensing of Land Surface Processes" was held at the Association of American Geographers (AAG) annual meeting in Boston, Massachusetts in March, 1998, sponsored by the AAG's Remote Sensing Specialty Group (RSSG). A similar session was held at the RGS-IBG annual meeting in Guildford, Surrey, England in January 1998, organized by the Modeling and Advanced Techniques Special Interest Group (MAT SIG) of the Remote Sensing Society (RSS). The six papers that in part, comprise this issue of PE&RS, are the US complement to such a dual journal publication effort. Both of us are co-editors of each of the journal special issues, with the lead editor of each journal being from their respective side of the Atlantic where the journals are published. The special issue of C&G that constitutes the other half of this co-edited journal series will be published in early 1999, with 3 papers by US authors being published along with 6 papers authored by individuals from the UK and other places in Europe.
Architecture and method for a burst buffer using flash technology
A parallel supercomputing cluster includes compute nodes interconnected in a mesh of data links for executing an MPI job, and solid-state storage nodes each linked to a respective group of the compute nodes for receiving checkpoint data from the respective compute nodes, and magnetic disk storage linked to each of the solid-state storage nodes for asynchronous migration of the checkpoint data from the solid-state storage nodes to the magnetic disk storage. Each solid-state storage node presents a file system interface to the MPI job, and multiple MPI processes of the MPI job write the checkpoint data to a shared file in the solid-state storage in a strided fashion, and the solid-state storage node asynchronously migrates the checkpoint data from the shared file in the solid-state storage to the magnetic disk storage and writes the checkpoint data to the magnetic disk storage in a sequential fashion.
Low profile, highly configurable, current sharing paralleled wide band gap power device power module
A method of making a power module includes providing a base plate defining a topology pattern, providing a power substrate above the base plate, providing at least two power contacts and arranging solder catches in the at least two power contacts, soldering the at least two power contacts to the power substrate utilizing the solder catches, and securing a housing to the power substrate.
On the perturbation effect and LET dependence of beam quality correction factors in carbon ion beams
Background: In a recent study, we reported beam quality correction factors, f Q , in carbon ion beams using Monte Carlo (MC) methods for a cylindrical and a parallel-plate ionization chamber (IC). A non-negligible perturbation effect was observed; however, the magnitude of the perturbation correction due to the specific IC subcomponents was not included. Furthermore, the stopping power data presented in the International Commission on Radiation Units and Measurements (ICRU) report 73 were used, whereas the latest stopping power data have been reported in the ICRU report 90. Purpose: The aim of this study was to extend our previous work by computing f Q correction factors using the ICRU 90 stopping power data and by reporting IC-specific perturbation correction factors. Possible energy or linear energy transfer (LET) dependence of the f Q correction factor was investigated by simulating both pristine beams and spread-out Bragg peaks (SOBPs). Methods: The TOol for PArticle Simulation (TOPAS)/GEANT4 MC code was used in this study. A 30 × 30 × 50 cm 3 water phantom was simulated with a uniform 10 × 10 cm 2 parallel beam incident on the surface. A Farmer-type cylindrical IC (Exradin A12) and two parallel-plate ICs (Exradin P11 and A11) were simulated in TOPAS using the manufacturer-provided geometrical drawings. The f Q correction factor was calculated in pristine carbon ion beams in the 150–450 MeV/u energy range at 2 cm depth and in the middle of the flat region of four SOBPs. The k Q correction factor was calculated by simulating the f Qo correction factor in a 60 Co beam at 5 cm depth. The perturbation correction factors due to the presence of the individual IC subcomponents, such as the displacement effect in the air cavity, collecting electrode, chamber wall, and chamber stem, were calculated at 2 cm depth for monoenergetic beams only. Additionally, the mean dose-averaged and track-averaged LET was calculated at the depths at which the f Q was calculated. Results: The ICRU 90 f Q correction factors were reported. The p dis correction factor was found to be significant for the cylindrical IC with magnitudes up to 1.70%. The individual perturbation corrections for the parallel-plate ICs were <1.0% except for the A11 p cel correction at the lowest energy. The f Q correction for the P11 IC exhibited an energy dependence of >1.00% and displayed differences up to 0.87% between pristine beams and SOBPs. Conversely, the f Q for A11 and A12 displayed a minimal energy dependence of <0.50%. The energy dependence was found to manifest in the LET dependence for the P11 IC. A statistically significant LET dependence was found only for the P11 IC in pristine beams only with a magnitude of <1.10%. Conclusions: The perturbation and k Q correction factor should be calculated for the specific IC to be used in carbon ion beam reference dosimetry as a function of beam quality.
A New Semistructured Algebraic Multigrid Method
Multigrid methods are well suited to large massively parallel computer architectures because they are mathematically optimal and display good parallelization properties. Since current architecture trends are favoring regular compute patterns to achieve high performance, the ability to express structure has become much more important. The hypre software library provides high-performance multigrid preconditioners and solvers through conceptual interfaces, including a semistructured interface that describes matrices primarily in terms of stencils and logically structured grids. This paper presents a new semistructured algebraic multigrid (SSAMG) method built on this interface. The numerical convergence and performance of a CPU implementation of this method are evaluated for a set of semistructured problems. In conclusion, SSAMG achieves significantly better setup times than hypre’s unstructured AMG solvers and comparable convergence. In addition, the new method is capable of solving more complex problems than hypre’s structured solvers.
Development of a New Fixed-source Sensitivity Tally Capability in the MCNP ® Code [Slides]
Current work includes FSEN capability development, continued verification of adjoint-weighted sensitivity method, and improvement of algorithm speed and parallelism capability. Future work is forecasted to include extensions to non-Boltzmann responses, adding more responses and particle types, and connection to new MCNP6.3 tally backend.
Fast multiscale contrast independent preconditioners for linear elastic topology optimization problems
The goal of this work is to present a fast and viable approach for the numerical solution of the high-contrast state problems arising in topology optimization. The optimization process is iterative, and the gradients are obtained by an adjoint analysis, which requires the numerical solution of large high-contrast linear elastic problems with features spanning several length scales. The size of the discretized problems forces the utilization of iterative linear solvers with solution time dependent on the quality of the preconditioner. The lack of clear separation between the scales, as well as the high-contrast, imposes severe challenges on the standard preconditioning techniques. Thus, here we propose new methods for the high-contrast elasticity equation with performance independent of the high-contrast and the multi-scale structure of the elasticity problem. The solvers are based on two-levels domain decomposition techniques with a carefully constructed coarse level to deal with the high-contrast and multi-scale nature of the problem. The construction utilizes spectral equivalence between scalar diffusion and each displacement block of the elasticity problems and, in contrast to previous solutions proposed in the literature, is able to select the appropriate dimension of the coarse space automatically. The new methods inherit the advantages of domain decomposition techniques, such as easy parallelization and scalability. Finally, the presented numerical experiments demonstrate the excellent performance of the proposed methods.
Near Real-Time Probabilistic Damage Diagnosis Using Surrogate Modeling and High Performance Computing
This work investigates novel approaches to probabilistic damage diagnosis that utilize surrogate modeling and high performance computing (HPC) to achieve substantial computational speedup. Motivated by Digital Twin, a structural health management (SHM) paradigm that integrates vehicle-specific characteristics with continual in-situ damage diagnosis and prognosis, the methods studied herein yield near real-time damage assessments that could enable monitoring of a vehicle's health while it is operating (i.e. online SHM). High-fidelity modeling and uncertainty quantification (UQ), both critical to Digital Twin, are incorporated using finite element method simulations and Bayesian inference, respectively. The crux of the proposed Bayesian diagnosis methods, however, is the reformulation of the numerical sampling algorithms (e.g. Markov chain Monte Carlo) used to generate the resulting probabilistic damage estimates. To this end, three distinct methods are demonstrated for rapid sampling that utilize surrogate modeling and exploit various degrees of parallelism for leveraging HPC. The accuracy and computational efficiency of the methods are compared on the problem of strain-based crack identification in thin plates. While each approach has inherent problem-specific strengths and weaknesses, all approaches are shown to provide accurate probabilistic damage diagnoses and several orders of magnitude computational speedup relative to a baseline Bayesian diagnosis implementation.
Highly Efficient Compensation-Based Parallelism for Wavefront Loops on GPUs
Wavefront loops are widely used in many scientific applications, e.g., partial differential equation (PDE) solvers and sequence alignment tools. However, due to the data dependencies in wavefront loops, it is challenging to fully utilize the abundant compute units of GPUs and to reuse data through their memory hierarchy. Existing solutions can only optimize for these factors to a limited extent. For example, tiling-based methods optimize memory access but may result in load imbalance; while compensation-based methods, which change the original order of computation to expose more parallelism and then compensate for it, suffer from both global synchronization overhead and limited generality. In this paper, we first prove under which circumstances that breaking data dependencies and properly changing the sequence of computation operators in our compensation-based method does not affect the correctness of results. Based on this analysis, we design a highly efficient compensation-based parallelism on GPUs. Our method provides weighted scan-based GPU kernels to optimize the computation and combines with the tiling method to optimize memory access and synchronization. The performance results on the NVIDIA K80 and P100 GPU platforms demonstrate that our method can achieve significant improvements for four types of real-world application kernels over the state-of-the-art research.
Hydrodynamic irreversibility of non-Brownian suspensions in highly confined duct flow
The irreversible behaviour of a highly confined non-Brownian suspension of spherical particles at low Reynolds number in a Newtonian fluid is studied experimentally and numerically. In the experiment, the suspension is confined in a thin rectangular channel that prevents complete particle overlap in the narrow dimension and is subjected to an oscillatory pressure-driven flow. In the small cross-sectional dimension, particles rapidly separate to the walls, whereas in the large dimension, features reminiscent of shear-induced migration in bulk suspensions are recovered. Furthermore, as a consequence of the channel geometry and the development and application of a single-camera particle tracking method, three-dimensional particle trajectories are obtained that allow us to directly associate relative particle proximity with the observed migration. Companion simulations of a steadily flowing suspension highly confined between parallel plates are conducted using the force coupling method, which also show rapid migration to the walls as well as other salient features observed in the experiment. While we consider relatively low volume fractions compared to most prior work in the area, we nevertheless observe significant and rapid migration, which we attribute to the high degree of confinement.
Progress in Parallel Schur Complement Preconditioning for Computational Fluid Dynamics
We consider preconditioning methods for nonself-adjoint advective-diffusive systems based on a non-overlapping Schur complement procedure for arbitrary triangulated domains. The ultimate goal of this research is to develop scalable preconditioning algorithms for fluid flow discretizations on parallel computing architectures. In our implementation of the Schur complement preconditioning technique, the triangulation is first partitioned into a number of subdomains using the METIS multi-level k-way partitioning code. This partitioning induces a natural 2X2 partitioning of the p.d.e. discretization matrix. By considering various inverse approximations of the 2X2 system, we have developed a family of robust preconditioning techniques. A computer code based on these ideas has been developed and tested on the IBM SP2 and the SGI Power Challenge array using MPI message passing protocol. A number of example CFD calculations will be presented to illustrate and assess various Schur complement approximations.
Computing the ankle-brachial index with parallel computational fluid dynamics
The ankle-brachial index (ABI), a ratio of arterial blood pressure in the ankles and upper arms, is used to diagnose and monitor circulatory conditions such as coarctation of the aorta and peripheral artery disease. Computational simulations of the ABI can potentially determine the parameters that produce an ABI indicative of ischemia or other abnormalities in blood flow. However, 0- and 1-D computational methods are limited in describing a 3-D patient-derived geometry. Thus, we present a massively parallel framework for computational fluid dynamics (CFD) simulations in the full arterial system. Additionally, using the lattice Boltzmann method to solve the Navier–Stokes equations, we employ highly parallelized and scalable methods to generate the simulation domain and efficiently distribute the computational load among processors. For the first time, we compute an ABI with 3-D CFD. In this proof-of-concept study, we investigate the dependence of ABI on the presence of stenoses, or narrowed regions of the arteries, by directly modifying the arterial geometry. As a result, our framework enables the computation a hemodynamic factor characterizing flow at the scale of the full arterial system, in a manner that is extensible to patient-specific imaging data and holds potential for treatment planning.
Error Propagation for Response Matrix Methods in the Many Node Limit
The response matrix method has been a useful solution method for radiation transport problems for decades. The method is desirable for many reasons. It can be extended to both fixed source and eigenvalue problems. In addition, a key aspect of the method is a shift of computational expense to a precomputation phase. Methods and codes employing response matrix or response matrix-like methods have enjoyed formidable computational efficiency while solving large problems. However, current applications of the method rely on large node sizes and few nodes to maximize computational efficiency. As part of a desire to make these methods more amenable to applications such as parallel computing in the future, the number of nodes in problems may increase, and node size will decrease. The effect of this change has not been well studied except for a few cases. In the past, it was determined that a poor approximation of angular dependence of flux on node interfaces could lead to large error propagation for fixed source problems, but a newer study indicates that changing node sizes as well as number of nodes poses little challenge for response methods in the eigenvalue case. This paper presents the unintuitive result that for response matrix methods increasing the spatial resolution of the problem may dramatically decrease accuracy - this effect is demonstrated on a simple analytic 1-D benchmark problem. (authors)