Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed parallelization”

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 865 records · Page 48

Aerodynamic Shape Optimization Using A Combined Distributed/Shared Memory Paradigm

Current parallel computational approaches involve distributed and shared memory paradigms. In the distributed memory paradigm, each processor has its own independent memory. Message passing typically uses a function library such as MPI or PVM. In the shared memory paradigm, such as that used on the SGI Origin 2000 machine, compiler directives are used to instruct the compiler to schedule multiple threads to perform calculations. In this paradigm, it must be assured that processors (threads) do not simultaneously access regions of memory in such away that errors would occur. This paper utilizes the latest version of the SGI MPI function library to combine the two parallelization paradigms to perform aerodynamic shape optimization of a generic wing/body.

Cheung, Samson↗

Integrating Cache Performance Modeling and Tuning Support in Parallelization Tools

With the resurgence of distributed shared memory (DSM) systems based on cache-coherent Non Uniform Memory Access (ccNUMA) architectures and increasing disparity between memory and processors speeds, data locality overheads are becoming the greatest bottlenecks in the way of realizing potential high performance of these systems. While parallelization tools and compilers facilitate the users in porting their sequential applications to a DSM system, a lot of time and effort is needed to tune the memory performance of these applications to achieve reasonable speedup. In this paper, we show that integrating cache performance modeling and tuning support within a parallelization environment can alleviate this problem. The Cache Performance Modeling and Prediction Tool (CPMP), employs trace-driven simulation techniques without the overhead of generating and managing detailed address traces. CPMP predicts the cache performance impact of source code level "what-if" modifications in a program to assist a user in the tuning process. CPMP is built on top of a customized version of the Computer Aided Parallelization Tools (CAPTools) environment. Finally, we demonstrate how CPMP can be applied to tune a real Computational Fluid Dynamics (CFD) application.

Waheed, Abdul↗

Simulating energetic ions and enhanced fusion rates from ion-cyclotron resonance heating with a full-wave/Fokker–Planck model

Reproducing fast-ion enhanced fusion rates from ion-cyclotron resonance heating (ICRH) in tokamaks requires the self-consistent coupling of a full-wave solver and a Fokker–Planck solver, which evolves multiple simultaneously resonant ion species. We introduce a new self-consistent model that iterates the TORIC full-wave solver with the CQL3D Fokker–Planck solver using the integrated plasma simulator (IPS). This model evolves the bounce-averaged ion distribution functions in both parallel and perpendicular velocity-space with a quasilinear radio frequency (RF) diffusion operator valid in the ion finite Larmor radius (FLR) limit and the RF electric fields with the resultant non-Maxwellian FLR dielectric tensor. This produces non-Maxwellian ICRH simulations that are fully self-consistent, fast, and interoperable with integrated modeling frameworks, such as TRANSP/GACODE/IPS-FASTRAN. We demonstrate our model's capabilities by validating it against experimental data in Alcator C-Mod. We then perform the first RF heating simulations of SPARC using self-consistent non-Maxwellian ion distributions to investigate the potential to enhance fusion rates using ion cyclotron resonance heating generated fast ions.

Physics↗

Two-phase flow behavior inside a header connected to multiple parallel channels

The main objective of this work is to examine the flow distribution of two-phase mixture to parallel channels and to investigate the flow behavior at header-channel junctions simulating the corresponding parts of compact heat exchangers. The cross-section of the header and the channels were fixed to 14 mm x 14 mm and 12 mm x 1.6 mm, respectively. The mass flux and the mass quality ranges were 70-165 kg/m{sup 2} s and 0.3-0.7, respectively. Air and water were used as the test fluids. The flow distribution at the fore part of the header (region A) is affected only by the upstream flow configuration and the rate of liquid flow separation decreased a flowing downwards. On the other hand, in the rear part, the downstream effect predominates over the upstream effect due to strong flow recirculation near the end plate. In this part, the liquid separation increased (region B) and then decreased (region C) as the mixture proceeds downwards. The validity of the existing models for branching flows at parallel T-junction was tested, and turned out to be appropriate for region A. However, the models were not applicable to the rear part due to a strong flow recirculation. Moreover, the effect of the membranes in channels was investigated, but that was minor. (author)

42 ENGINEERING↗

A Framework for Parallel Nonlinear Optimization by Partitioning Localized Constraints

We present a novel parallel framework for solving large-scale continuous nonlinear optimization problems based on constraint partitioning. The framework distributes constraints and variables to parallel processors and uses an existing solver to handle the partitioned subproblems. In contrast to most previous decomposition methods that require either separability or convexity of constraints, our approach is based on a new constraint partitioning theory and can handle nonconvex problems with inseparable global constraints. We also propose a hypergraph partitioning method to recognize the problem structure. Experimental results show that the proposed parallel algorithm can efficiently solve some difficult test cases.

97 MATHEMATICS AND COMPUTING↗

Two-state ion heating at quasi-parallel shocks

This paper documents the alternating occurrence of two different ion states of the ion distributions downstream from several quasi-parallel shocks: a cooler (and denser) core/shoulder type and a hotter (less dense) and more Maxwellian type. Three separate lines of evidence are presented to show that the two states are not related in an evolutionary sense, but that both are produced alternately at the shock: (1) the asymptotic downstream plasma parameters (density, ion temperautre, and flow speed) are intermediate between those characterizing the two different states closer to the shock, suggesting that the asymptotic state is produced by a mixing of the two initial states; (2) examples of apparently interpenetrating distributions are found during transitions from one state to the other; and (3) examples of both types of distributions are found at actual crossings of the shock ramp.

Thomsen, M. F.↗

Programmability of the HPCS Languages: A Case Study with a Quantum Chemistry Kernel

As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challenged to express the necessary levels of concurrency with the dominant parallel programming model, Fortran+MPI+OpenMP (or minor variations). In this paper, we examine the languages developed under the DARPA High-Productivity Computing Systems (HPCS) program (Chapel, Fortress, and X10) as representatives of a different parallel programming model which might be more effective on coming high-performance systems. The application used in this study is the Hartree-Fock method from quantum chemistry, which combines access to distributed data with a task-parallel algorithm and is characterized by significant irregularity in the computational tasks. We present several different implementation strategies for load balancing of the task parallel computation, as well as distributed array operations, in each of the three languages. We conclude that the HPCS languages provide a wide variety of mechanisms for expressing parallelism, which can be combined at multiple levels, making them quite expressive for this problem.

Shet, Aniruddha G↗

Programmability of the HPCS Languages: A Case Study with a Quantum Chemistry Kernel (Extended Version)

As high-end computer systems present users with rapidly increasing numbers of processors, possibly also incorporating attached co-processors, programmers are increasingly challenged to express the necessary levels of concurrency with the dominant parallel programming model, Fortran+MPI+OpenMP (or minor variations). In this paper, we examine the languages developed under the DARPA High-Productivity Computing Systems (HPCS) program (Chapel, Fortress, and X10) as representatives of a different parallel programming model which might be more effective on coming high-performance systems. The application used in this study is the Hartree-Fock method from quantum chemistry, which combines access to distributed data with a task-parallel algorithm and is characterized by significant irregularity in the computational tasks. We present several different implementation strategies for load balancing of the task parallel computation, as well as distributed array operations, in each of the three languages. We conclude that the HPCS languages provide a wide variety of mechanisms for expressing parallelism, which can be combined at multiple levels, making them quite expressive for this problem.

97 MATHEMATICS AND COMPUTING↗

Exploring Container Technologies for Large Scientific Libraries: Docker and Trilinos

The Trilinos Project produces, maintains and distributes a large collection of reusable, parallel scientific libraries. Docker provides container technologies that support compilation, packaging, distribution and execution of software on Linux, Mac OS and Windows systems, with emerging support for Cray platforms. In this short article we describe recent efforts to explore the potential for using Docker in a variety of settings to enhance several Trilinos Project workflows. The technical foundation for this article is presented in an Honors thesis of one of the authors.

97 MATHEMATICS AND COMPUTING↗

Use of networked workstations for parallel nonlinear structural dynamic simulations of rotating bladed-disk assemblies

The principal objective of this research is to investigate, develop and demonstrate coarse-grained, parallel-processing strategies for nonlinear dynamic simulations for rotating bladed-disk assemblies. The parallel -processing strategies addressed include numerical algorithms for parallel nonlinear solutions and techniques to effect load balancing among processors. The parallel environment employed is a distributed-memory, coarse-grained one consisting of networked workstations. A parallel explicit time integration method has been implemented for transient nonlinear solutions of rotationg bladed-disk assemblies. Automatic domain partitioning techniques have been investigated for load balancing among processors. Advanced computing environments, data structures and interactive computer graphics all contribute to an integrated parallel finite element analysis system to facilitate more efficient and powerful dynamic simulations.

Hsieh, Shang-Hsien↗

Uranium Chemical and Radiological Risk Assessment for Freshwater Ecosystems Receiving Ore Mining Releases: Principles, Equations and Parameters

Uranium is an element that has the solely characteristic to behave as significant hazard both from a chemical and radiological point of view. Exclusively of natural occurrence, its distribution into the environment may be influenced by human activities, such as nuclear fuel cycle, military use of depleted uranium, or coal and phosphate fertilizer use, which finally may impact freshwater ecosystems. Until now, the associated environmental impact and risk assessments were conducted separately. We propose here to apply the same methodology to evaluate the ecological risk due to potential chemotoxicity and radiotoxicity of uranium. This methodology is articulated into the classical four steps (EC, 2003: problem formulation, effect and exposure analysis, risk characterisation). The problem formulation dealt both with uranium viewed as a chemical element and as the three isotopes 234, 235 and 238 of uranium and their main daughters. Then, the exposure analysis of non-human species was led on the basis of a common conceptual model of the fluxes occurring in freshwater ecosystems. No-effect values for the ecosystem were derived using the same effect data treatment in parallel. A Species Sensitivity Distribution was fitted: (1) to the ecotoxicity data sets illustrating uranium chemotoxicity and allowing the estimation of a Predicted-No-Effect-Concentration for uranium in water expressed in {mu}g/L; (2) to radiotoxicity effect data as it was done within the ERICA project, allowing the estimation of a Predicted No-Effect-Dose-Rate (in {mu}Gy{center_dot}h{sup -1}). Two methods were then applied to characterize the risk to the ecosystem: a screening method using the risk quotient approach, involving for the radiological aspect back calculation of the water limiting concentration from the PNEDR for each isotope taken into account and a probabilistic risk assessment. A former uranium ore mining case-study will help in demonstrating the application of the whole methodology.

54 ENVIRONMENTAL SCIENCES↗

COHORT: Coordination of Heterogeneous Thermostatically Controlled Loads for Demand Flexibility

Demand flexibility is increasingly important for power grids. Careful coordination of thermostatically controlled loads (TCLs) can modulate energy demand, decrease operating costs, and increase grid resiliency. We propose a novel distributed control framework for the Coordination Of HeterOgeneous Residential Thermostatically controlled loads (COHORT). COHORT is a practical, scalable, and versatile solution that coordinates a population of TCLs to jointly optimize a grid-level objective, while satisfying each TCL’s end-use requirements and operational constraints. To achieve that, we decompose the grid-scale problem into subproblems and coordi- nate their solutions to find the global optimum using the alternating direction method of multipliers (ADMM). The TCLs’ local problems are distributed to and computed in parallel at each TCL, making COHORT highly scalable and privacy-preserving. While each TCL poses combinatorial and non-convex constraints, we characterize these constraints as a convex set through relaxation, thereby making COHORT computationally viable over long planning horizons. After coordination, each TCL is responsible for its own control and tracks the agreed-upon power trajectory with its preferred strategy. In this work, we translate continuous power back to discrete on/off actuation, using pulse width modulation. COHORT is generalizable to a wide range of grid objectives, which we demonstrate through three distinct use cases: generation following, minimizing ramping, and peak load curtailment. In a notable experiment, we validated our approach through a hardware-in-the-loop simulation, including a real-world air conditioner (AC) controlled via a smart thermostat, and simulated instances of ACs modeled after real-world data traces. During the 15-day experimental period, COHORT reduced daily peak loads by an average of 12.5% and maintained comfortable temperatures.

demand response↗

Method and structure for skewed block-cyclic distribution of lower-dimensional data arrays in higher-dimensional processor grids

A method and structure of distributing elements of an array of data in a computer memory to a specific processor of a multi-dimensional mesh of parallel processors includes designating a distribution of elements of at least a portion of the array to be executed by specific processors in the multi-dimensional mesh of parallel processors. The pattern of the designating includes a cyclical repetitive pattern of the parallel processor mesh, as modified to have a skew in at least one dimension so that both a row of data in the array and a column of data in the array map to respective contiguous groupings of the processors such that a dimension of the contiguous groupings is greater than one.

97 MATHEMATICS AND COMPUTING↗

Efficient Parallel Algorithm For Direct Numerical Simulation of Turbulent Flows

A distributed algorithm for a high-order-accurate finite-difference approach to the direct numerical simulation (DNS) of transition and turbulence in compressible flows is described. This work has two major objectives. The first objective is to demonstrate that parallel and distributed-memory machines can be successfully and efficiently used to solve computationally intensive and input/output intensive algorithms of the DNS class. The second objective is to show that the computational complexity involved in solving the tridiagonal systems inherent in the DNS algorithm can be reduced by algorithm innovations that obviate the need to use a parallelized tridiagonal solver.

Moitra, Stuti↗

On the Efficient Evaluation of the Exchange Correlation Potential on Graphics Processing Unit Clusters

The predominance of Kohn–Sham density functional theory (KS-DFT) for the theoretical treatment of large experimentally relevant systems in molecular chemistry and materials science relies primarily on the existence of efficient software implementations which are capable of leveraging the latest advances in modern high-performance computing (HPC). With recent trends in HPC leading toward increasing reliance on heterogeneous accelerator-based architectures such as graphics processing units (GPU), existing code bases must embrace these architectural advances to maintain the high levels of performance that have come to be expected for these methods. In this work, we purpose a three-level parallelism scheme for the distributed numerical integration of the exchange-correlation (XC) potential in the Gaussian basis set discretization of the Kohn–Sham equations on large computing clusters consisting of multiple GPUs per compute node. In addition, we purpose and demonstrate the efficacy of the use of batched kernels, including batched level-3 BLAS operations, in achieving high levels of performance on the GPU. We demonstrate the performance and scalability of the implementation of the purposed method in the NWChemEx software package by comparing to the existing scalable CPU XC integration in NWChem.

97 MATHEMATICS AND COMPUTING↗

Final report on LDRD project : advanced optical trigger systems.

Advanced optically-activated solid-state electrical switch development at Sandia has demonstrated multi-kA/kV switching and the path for scalability to even higher current/power. Realization of this potential requires development of new optical sources/switches based on key Sandia photonic device technologies: vertical-cavity surface-emitting lasers (VCSELs) and photoconductive semiconductor switch (PCSS) devices. The key to increasing the switching capacity of PCSS devices to 5kV/5kA and higher is to distribute the current in multiple parallel line filaments triggered by an array of high-brightness line-shaped illuminators. Commercial mechanically-stacked edge-emitting lasers have been used to trigger multiple filaments, but they are difficult to scale and manufacture with the required uniformity. In VCSEL arrays, adjacent lasers utilize identical semiconductor material and are lithographically patterned to the required dimensions. We have demonstrated multiple-line filament triggering using VCSEL arrays to approximate line generation. These arrays of uncoupled circular-aperture VCSELs have fill factors ranging from 2% to 30%. Using these arrays, we have developed a better understanding of the illumination requirements for stable triggering of multiple-filament PCSS devices. Photoconductive semiconductor switch (PCSS) devices offer advantages of high voltage operation (multi-kV), optical isolation, triggering with laser pulses that cannot occur accidentally in nature, low cost, high speed, small size, and radiation hardness. PCSS devices are candidates for an assortment of potential applications that require multi-kA switching of current. The key to increasing the switching capacity of PCSS devices to 5kV/5kA and higher is to distribute the current in multiple parallel line filaments triggered by an array of high-brightness line-shaped illuminators. Commercial mechanically-stacked edge-emitting lasers have been demonstrated to trigger multiple filaments, but they are difficult to scale and manufacture with the required uniformity. As a promising alternative to multiple discrete edge-emitting lasers, a single wafer of vertical-cavity surface-emitting lasers (VCSELs) can be lithographically patterned to achieve the desired layout of parallel line-shaped emitters, in which adjacent lasers utilize identical semiconductor material and thereby achieve a degree of intrinsic optical uniformity. Under this LDRD project, we have fabricated arrays of uncoupled circular-aperture VCSELs to approximate a line-shaped illumination pattern, achieving optical fill factors ranging from 2% to 30%. We have applied these VCSEL arrays to demonstrate single and dual parallel line-filament triggering of PCSS devices. Moreover, we have developed a better understanding of the illumination requirements for stable triggering of multiple-filament PCSS devices using VCSEL arrays. We have found that reliable triggering of multiple filaments requires matching of the turn-on time of adjacent VCSEL line-shaped-arrays to within approximately 1 ns. Additionally, we discovered that reliable triggering of PCSS devices at low voltages requires more optical power than we obtained with our first generation of VCSEL arrays. A second generation of higher-power VCSEL arrays was designed and fabricated at the end of this LDRD project, and testing with PCSS devices is currently underway (as of September 2008).

36 MATERIALS SCIENCE↗

FTK: A Simplicial Spacetime Meshing Framework for Robust and Scalable Feature Tracking

In this work, we present the Feature Tracking Kit (FTK), a framework that simplifies, scales, and delivers various feature-tracking algorithms for scientific data. The key of FTK is our simplicial spacetime meshing scheme that generalizes both regular and unstructured spatial meshes to spacetime while tessellating spacetime mesh elements into simplices. The benefits of using simplicial spacetime meshes include (1) reducing ambiguity cases for feature extraction and tracking, (2) simplifying the handling of degeneracies using symbolic perturbations, and (3) enabling scalable and parallel processing. The use of simplicial spacetime meshing simplifies and improves the implementation of several feature-tracking algorithms for critical points, quantum vortices, and isosurfaces. As a software framework, FTK provides end users with VTK/ParaView filters, Python bindings, a command line interface, and programming interfaces for feature-tracking applications. We demonstrate use cases as well as scalability studies through both synthetic data and scientific applications including tokamak, fluid dynamics, and superconductivity simulations. We also conduct end-to-end performance studies on the Summit supercomputer. FTK is open sourced under the MIT license: https://github.com/hguo/ftk.

97 MATHEMATICS AND COMPUTING↗

PhytoOracle: Scalable, modular phenomics data processing pipelines

As phenomics data volume and dimensionality increase due to advancements in sensor technology, there is an urgent need to develop and implement scalable data processing pipelines. Current phenomics data processing pipelines lack modularity, extensibility, and processing distribution across sensor modalities and phenotyping platforms. To address these challenges, we developed PhytoOracle (PO), a suite of modular, scalable pipelines for processing large volumes of field phenomics RGB, thermal, PSII chlorophyll fluorescence 2D images, and 3D point clouds. PhytoOracle aims to ( i ) improve data processing efficiency; ( ii ) provide an extensible, reproducible computing framework; and ( iii ) enable data fusion of multi-modal phenomics data. PhytoOracle integrates open-source distributed computing frameworks for parallel processing on high-performance computing, cloud, and local computing environments. Each pipeline component is available as a standalone container, providing transferability, extensibility, and reproducibility. The PO pipeline extracts and associates individual plant traits across sensor modalities and collection time points, representing a unique multi-system approach to addressing the genotype-phenotype gap. To date, PO supports lettuce and sorghum phenotypic trait extraction, with a goal of widening the range of supported species in the future. At the maximum number of cores tested in this study (1,024 cores), PO processing times were: 235 minutes for 9,270 RGB images (140.7 GB), 235 minutes for 9,270 thermal images (5.4 GB), and 13 minutes for 39,678 PSII images (86.2 GB). These processing times represent end-to-end processing, from raw data to fully processed numerical phenotypic trait data. Repeatability values of 0.39-0.95 (bounding area), 0.81-0.95 (axis-aligned bounding volume), 0.79-0.94 (oriented bounding volume), 0.83-0.95 (plant height), and 0.81-0.95 (number of points) were observed in Field Scanalyzer data. We also show the ability of PO to process drone data with a repeatability of 0.55-0.95 (bounding area).

59 BASIC BIOLOGICAL SCIENCES↗