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 1,099 records · Page 61

Unsaturated Groundwater and Heat Transport Model

TOUGH2-MP is a massive parallel version of the TOUGH2 Code, designed for computationally efficient parallel simulation of isothermal and nonisothermal flows of multicomponent, multiphase fluids in one, two, and three-dimensional porous and fractured media. The code runs on computers with parallel architecture or clusters and can be used for applications, such as radioactive waste disposal, CO2 geological sequestration, environmental assessment and remediation, reservoir engineering, and groundwater hydrology. The parallel simulator has achieved orders-of-the-magnitude improvement in computational time and/or modeling problem size. The parallel simulator uses fully implicit time differencing and solves large, sparse linear systems arising from discretization of the partial differential equations for mass and energy balance. A domain decomposition approach is adopted for multiphase flow simulations with coarse- granularity parallel computation. Current version of TOUGH2-MP includes following modules: EOS1, EOS2, EOS3, EOS4, EOS5, EOS7, EOS7R, E0S8, EOS9, ECO2N, EWASG, and T2R3D.

Zhang, Keni↗

Poloidally and radially resolved parallel D{sup +} velocity measurements in the DIII-D boundary and comparison to neoclassical computations

First measurements of the D{sup +} parallel velocity, V{sub ||}{sup D+}, in L-mode discharges in the DIII-D [J. L. Luxon, Nucl. Fusion 42, 614 (2002)] tokamak boundary region at two poloidal locations, {theta}{approx}0 deg. and {theta}{approx}255 deg., made using Mach probes, feature a peak with velocities of up to 80 km/s at the midplane last closed flux surface (LCFS), as high as ten times the charge exchange recombination C{sup 6+} toroidal velocity, V{sub {phi}}{sup C6+}, in the same location. The V{sub ||}{sup D+} profiles are very asymmetric poloidally, by a factor of 8-10, and feature a local peak at the midplane. This peak, 1-2 cm wide, is located at or just inside the LCFS, and it suggests a large source of momentum in that location. This momentum source is quantified at {approx}0.31 N m by using a simple momentum transport model. This is the most accurate measurement of the effects of so called 'intrinsic' edge momentum source to date. The V{sub ||}{sup D+} measurements are quantitatively consistent with a purely neoclassical computational modeling of V{sub ||}{sup D+} by the code NEO[E. A. Belli and J. Candy, Plasma Phys. Controlled Fusion 50, 095010 (2008)], using V{sub {phi}}{sup C6+} as input, for {rho}{approx}0.7-0.95 at the two poloidal locations, where V{sub ||}{sup D+} measurements exist. The midplane NEO-calculated V{sub ||}{sup D+} grows larger than V{sub ||}{sup C6+} in the steeper edge gradient region and trends to agreement with the probe-measured V{sub ||}{sup D+} data near {rho}{approx}1, where the local V{sub ||}{sup D+} velocity peak exists. The measurements and computations were made in OH and L-mode discharges on an upper single null, with ion {nabla}B{sub T} drift away from the divertor. The rotating layer finding is similar in auxiliary heated discharges with and without external momentum input, except that at higher density the edge velocity weakens.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

A parallel WLS state estimator on shared memory computers

This paper describes our experience with developing a parallel weighted- least-square (WLS) state estimation (SE) program for shared-memory parallel computers. Since the key computational kernel of the WLS algorithm based on the Newton-Raphson approach is a solver of sparse linear equations, a significant part of our effort was focused on selecting, implementing and evaluating this algorithm. An optimized shared memory version of the conjugate gradient (CG) algorithm was found to be competitive to state-of-the-art implementation of LU solvers for the SE problem on the SGI Altix, a shared memory architecture. We also ported the full SE algorithm including CG to the Cray MTA-2 shared memory multithreaded architecture and investigated its performance.

97 MATHEMATICS AND COMPUTING↗

Parallel Programming Models and Systems for High Performance Computing. In: Emerging Research in Cloud Distributed Computing Systems

A parallel programming model is an abstraction of a parallel system that allows expression of both algorithms and shared data structures. To accommodate the diversity in parallel system architectures and user requirements, there are a variety of programming models including the models providing a shared memory view or a distributed memory view of the system. The programming models are implemented as libraries, language extensions, or compiler directives. This chapter provides a discussion on programming models and its implementations aimed at application developers, system software researchers, and hardware architects. The first part provides an overview of the programming models. The second part is an in-depth discussion on high-performance networking interface to implement the programming model. The last part of the chapter discusses implementation of a programming model with a case study. Each part of the chapter concludes with a discussion on current research trends and its impact on future architectures.

Venkata, Manjunath Gorentia↗

Parallel, distributed and GPU computing technologies in single-particle electron microscopy

An introduction to the current paradigm shift towards concurrency in software. Most known methods for the determination of the structure of macromolecular complexes are limited or at least restricted at some point by their computational demands. Recent developments in information technology such as multicore, parallel and GPU processing can be used to overcome these limitations. In particular, graphics processing units (GPUs), which were originally developed for rendering real-time effects in computer games, are now ubiquitous and provide unprecedented computational power for scientific applications. Each parallel-processing paradigm alone can improve overall performance; the increased computational performance obtained by combining all paradigms, unleashing the full power of today’s technology, makes certain applications feasible that were previously virtually impossible. In this article, state-of-the-art paradigms are introduced, the tools and infrastructure needed to apply these paradigms are presented and a state-of-the-art infrastructure and solution strategy for moving scientific applications to the next generation of computer hardware is outlined.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

An extensible operating system design for large-scale parallel machines.

Running untrusted user-level code inside an operating system kernel has been studied in the 1990's but has not really caught on. We believe the time has come to resurrect kernel extensions for operating systems that run on highly-parallel clusters and supercomputers. The reason is that the usage model for these machines differs significantly from a desktop machine or a server. In addition, vendors are starting to add features, such as floating-point accelerators, multicore processors, and reconfigurable compute elements. An operating system for such machines must be adaptable to the requirements of specific applications and provide abstractions to access next-generation hardware features, without sacrificing performance or scalability.

43 PARTICLE ACCELERATORS↗

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↗

OpenMP-style parallelism in data-centered multicore computing with R

R is a domain specific language widely used for data analysis by the statistics community as well as by researchers in finance, biology, social sciences, and many other disciplines. As R programs are linked to input data, the exponential growth of available data makes high-performance computing with R imperative. To ease the process of writing parallel programs in R, code transformation from a sequential program to a parallel version would bring much convenience to R users. In this paper, we present our work in semiautomatic parallelization of R codes with user-added OpenMPstyle pragmas. While such pragmas are used at the frontend, we take advantage of multiple parallel backends with different R packages. We provide flexibility for importing parallelism with plug-in components, impose built-in MapReduce for data processing, and also maintain code reusability. We illustrate the advantage of the on-the-fly mechanisms which can lead to significant applications in data-centered parallel computing.

Jiang, Lei↗