Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel applications”

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,603 records · Page 89

DAKOTA : a multilevel parallel object-oriented framework for design optimization, parameter estimation, uncertainty quantification, and sensitivity analysis. Version 5.0, user's reference manual.

The DAKOTA (Design Analysis Kit for Optimization and Terascale Applications) toolkit provides a flexible and extensible interface between simulation codes and iterative analysis methods. DAKOTA contains algorithms for optimization with gradient and nongradient-based methods; uncertainty quantification with sampling, reliability, and stochastic finite element methods; parameter estimation with nonlinear least squares methods; and sensitivity/variance analysis with design of experiments and parameter study methods. These capabilities may be used on their own or as components within advanced strategies such as surrogate-based optimization, mixed integer nonlinear programming, or optimization under uncertainty. By employing object-oriented design to implement abstractions of the key components required for iterative systems analyses, the DAKOTA toolkit provides a flexible and extensible problem-solving environment for design and performance analysis of computational models on high performance computers. This report serves as a reference manual for the commands specification for the DAKOTA software, providing input overviews, option descriptions, and example specifications.

97 MATHEMATICS AND COMPUTING↗

A fast parallel 3D Poisson solver with longitudinal periodic and transverse open boundary conditions for space-charge simulations

A three-dimensional (3D) Poisson solver with longitudinal periodic and transverse open boundary conditions can have important applications in beam physics of particle accelerators. Here, we present a fast efficient method to solve the Poisson equation using a spectral finite-difference method. This method uses a computational domain that contains the charged particle beam only and has a computational complexity of $O(N_u (logN_{mode}))$, where $N_u$ is the total number of unknowns and $N_{mode}$ is the maximum number of longitudinal or azimuthal modes. This saves both the computational time and the memory usage of using an artificial boundary condition in a large extended computational domain. The new 3D Poisson solver is parallelized using a message passing interface (MPI) on multi-processor computers and shows a reasonable parallel performance up to hundreds of processor cores.

97 MATHEMATICS AND COMPUTING↗

Inter-Disciplinary Collaboration in Support of the Post-Standby TREAT Mission

Although analysis methods have advanced significantly in the last two decades, high fidelity multi- physics methods for reactors systems have been under development for only a few years and are not presently mature nor deployed. Furthermore, very few methods provide the ability to simulate rapid transients in three dimensions. Data for validation of advanced time-dependent multi- physics is sparse; at TREAT, historical data were not collected for the purpose of validating three-dimensional methods, let alone multi-physics simulations. Existing data continues to be collected to attempt to simulate the behavior of experiments and calibration transients, but it will be insufficient for the complete validation of analysis methods used for TREAT transient simulations. Hence, a 2018 restart will most likely occur without the direct application of advanced modeling and simulation methods. At present, the current INL modeling and simulation team plans to work with TREAT operations staff in performing reactor simulations with MAMMOTH, in parallel with the software packages currently being used in preparation for core restart (e.g., MCNP5, RELAP5, ABAQUS). The TREAT team has also requested specific measurements to be performed during startup testing, currently scheduled to run from February to August of 2018. These startup measurements will be crucial in validating the new analysis methods in preparation for ultimate application for TREAT operations and experiment design. This document describes the collaboration between modeling and simulation staff and restart, operations, instrumentation and experiment development teams to be able to effectively interact and achieve successful validation work during restart testing.

97 MATHEMATICS AND COMPUTING↗

ISMB Conference Funding to Support Attendance of Early Researchers and Students

ISMB Conference Funding for Students and Young Scientists Historical Description The Intelligent Systems for Molecular Biology (ISMB) conference has provided a general forum for disseminating the latest developments in bioinformatics on an annual basis for the past 22 years. ISMB is a multidisciplinary conference that brings together scientists from computer science, molecular biology, mathematics and statistics. The goal of the ISMB meeting is to bring together biologists and computational scientists in a focus on actual biological problems, i.e., not simply theoretical calculations. The combined focus on “intelligent systems” and actual biological data makes ISMB a unique and highly important meeting. 21 years of experience in holding the conference has resulted in a consistently well-organized, well attended, and highly respected annual conference. "Intelligent systems" include any software which goes beyond straightforward, closed-form algorithms or standard database technologies, and encompasses those that view data in a symbolic fashion, learn from examples, consolidate multiple levels of abstraction, or synthesize results to be cognitively tractable to a human, including the development and application of advanced computational methods for biological problems. Relevant computational techniques include, but are not limited to: machine learning, pattern recognition, knowledge representation, databases, combinatorics, stochastic modeling, string and graph algorithms, linguistic methods, robotics, constraint satisfaction, and parallel computation. Biological areas of interest include molecular structure, genomics, molecular sequence analysis, evolution and phylogenetics, molecular interactions, metabolic pathways, regulatory networks, developmental control, and molecular biology generally. Emphasis is placed on the validation of methods using real data sets, on practical applications in the biological sciences, and on development of novel computational techniques. The ISMB conferences are distinguished from many other conferences in computational biology or artificial intelligence by an insistence that the researchers work with real molecular biology data, not theoretical or toy examples; and from many other biological conferences by providing a forum for technical advances as they occur, which otherwise may be shunned until a firm experimental result is published. The resulting intellectual richness and cross-disciplinary diversity provides an important opportunity for both students and senior researchers. ISMB has become the premier conference series in this field with refereed, published proceedings, establishing an infrastructure to promote the growing body of research.

60 APPLIED LIFE SCIENCES↗

GPU-Accelerated Text Mining

Accelerating hardware devices represent a novel promise for improving the performance for many problem domains but it is not clear for which domains what accelerators are suitable. While there is no room in general-purpose processor design to significantly increase the processor frequency, developers are instead resorting to multi-core chips duplicating conventional computing capabilities on a single die. Yet, accelerators offer more radical designs with a much higher level of parallelism and novel programming environments. This present work assesses the viability of text mining on CUDA. Text mining is one of the key concepts that has become prominent as an effective means to index the Internet, but its applications range beyond this scope and extend to providing document similarity metrics, the subject of this work. We have developed and optimized text search algorithms for GPUs to exploit their potential for massive data processing. We discuss the algorithmic challenges of parallelization for text search problems on GPUs and demonstrate the potential of these devices in experiments by reporting significant speedups. Our study may be one of the first to assess more complex text search problems for suitability for GPU devices, and it may also be one of the first to exploit and report on atomic instruction usage that have recently become available in NVIDIA devices.

43 PARTICLE ACCELERATORS↗

A high-performance parallel algorithm for nonnegative matrix factorization

Non-negative matrix factorization (NMF) is the problem of determining two non-negative low rank factors W and H, for the given input matrix A, such that A ≈ WH. NMF is a useful tool for many applications in different domains such as topic modeling in text mining, background separation in video analysis, and community detection in social networks. Despite its popularity in the data mining community, there is a lack of efficient distributed algorithms to solve the problem for big data sets. We propose a high-performance distributed-memory parallel algorithm that computes the factorization by iteratively solving alternating non-negative least squares (NLS) subproblems for W and H. It maintains the data and factor matrices in memory (distributed across processors), uses MPI for interprocessor communication, and, in the dense case, provably minimizes communication costs (under mild assumptions). As opposed to previous implementations, our algorithm is also flexible: (1) it performs well for both dense and sparse matrices, and (2) it allows the user to choose any one of the multiple algorithms for solving the updates to low rank factors W and H within the alternating iterations. We demonstrate the scalability of our algorithm and compare it with baseline implementations, showing significant performance improvements.

Kannan, Ramakrishnan↗

Parallel 3D Finite Element Particle-in-Cell Simulations with Pic3P

SLAC's Advanced Computations Department (ACD) has developed the parallel 3D Finite Element electromagnetic Particle-In-Cell code Pic3P. Designed for simulations of beam-cavity interactions dominated by space charge effects, Pic3P solves the complete set of Maxwell-Lorentz equations self-consistently and includes space-charge, retardation and boundary effects from first principles. Higher-order Finite Element methods with adaptive refinement on conformal unstructured meshes lead to highly efficient use of computational resources. Massively parallel processing with dynamic load balancing enables large-scale modeling of photoinjectors with unprecedented accuracy, aiding the design and operation of next-generation accelerator facilities. Applications include the LCLS RF gun and the BNL polarized SRF gun.

43 PARTICLE ACCELERATORS↗

Boundary-element parallel-computing algorithm for the microstructural analysis of general composites

A standard continuum-mechanics-based 3D boundary-element (BE) algorithm has been devised to the microstructural modeling of complex heterogeneous solids such as general composites. In the particular applications of this paper, the mechanical properties of carbon-nanotube reinforced composites are estimated from three-dimensional representative volume elements (RVEs). The shell-like thin-walled carbon nanotubes (CNTs) are also simulated with 3D BE models, and a generic subregion-by-subregion (SBS) algorithm makes the microstructural description of the CNT polymer systems possible. In fact, based on this algorithm, a general scalable BE parallel code is proposed. Square and hexagonal fiber-packing patterns are considered to simulate the 3D composite microstructures.

36 MATERIALS SCIENCE↗

Fit Fly: A Case Study of Interconnect Innovation through Parallel Simulation

To meet the demand for exascale-level performance from high-performance computing (HPC) interconnects, many system architects are turning to simulation results for accurate and reliable predictions of the performance of prospective technologies. Testing full-scale networks with a variety of benchmarking tools, including synthetic workloads and application traces, can give crucial insight into what ideas are most promising without needing to physically construct a test network. While flexible, however, this approach is extremely compute time intensive. We address this time complexity challenge through the use of large-scale, optimistic parallel simulation that ultimately leads to faster HPC network architecture innovations. In this paper we demonstrate this innovation capability through a real-world network design case study. Specifically, we have simulated and compared four extreme-scale interconnects: Dragonfly, Megafly, Slim Fly, and a new dual-rail-dual-plane variation of the Slim Fly network topology. We present this new variant of Slim Fly, dubbed Fit Fly, to show how interconnect innovation and evaluation-beyond what is possible through analytic methods-can be achieved through parallel simulation. We validate and compare the model with various network designs using the CODES interconnect simulation framework. By running large-scale simulations in a parallel environment, we are able to quickly generate reliable performance results that can help network designers break ground on the next generation of high-performance network designs.

High Performance Computing↗

Graphene Oxide‐Template Controlled Cuboid‐Shaped High‐Capacity VS 4 Nanoparticles as Anode for Sodium‐Ion Batteries

Abstract Room‐temperature sodium‐ion batteries have attracted great attentions for large‐scale energy storage applications in renewable energy. However, exploring suitable anode materials with high reversible capacity and cyclic stability is still a challenge. The VS 4 , with parallel quasi‐1D chains structure of V 4+ (S 2 2− ) 2 , which provides large interchain distance of 5.83 Å and high capacity, has showed great potential for sodium storage. Here, the uniform cuboid‐shaped VS 4 nanoparticles are prepared as anode for sodium‐ion batteries by the controllable of graphene oxide (GO)‐template contents. It exhibits superb electrochemical performances of high‐specific charge capacity (≈580 mAh·g −1 at 0.1 A·g −1 ), long‐cycle‐life (≈98% retain at 0.5 A·g− 1 after 300 cycles), and high rates (up to 20 A·g −1 ). In addition, electrolytes are optimized to understand the sodium storage mechanism. It is thus demonstrated that the findings have great potentials for the applications in high‐performance sodium‐ion batteries.

Wang, Sizhe↗

Universal scheme for finite-probability perfect transfer of arbitrary multispin states through spin chains

In combination with the theories of open system and quantum recovering measurement, we propose a quantum state transfer scheme using spin chains by performing two sequential operations: a projective measurement on the spins of ‘environment’ followed by suitably designed quantum recovering measurements on the spins of interest. The scheme allows perfect transfer of arbitrary multispin states through multiple parallel spin chains with finite probability. Our scheme is universal in the sense that it is state-independent and applicable to any model possessing spin–spin interactions. We also present possible methods to implement the required measurements taking into account the current experimental technologies. As applications, we consider two typical models for which the probabilities of perfect state transfer are found to be reasonably high at optimally chosen moments during the time evolution. - Highlights: • Scheme that can achieve perfect quantum state transfer is devised. • The scheme is state-independent and applicable to any spin-interaction models. • The scheme allows perfect transfer of arbitrary multispin states. • Applications to two typical models are considered in detail.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

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↗

Analysis and compression of six-dimensional gyrokinetic datasets using higher order singular value decomposition

Higher order singular value decomposition (HOSVD) is explored as a tool for analyzing and compressing gyrokinetic data. An efficient numerical implementation of an HOSVD algorithm is described. HOSVD is used to analyze the full six-dimensional (three spatial, two velocity space, and time dimensions) gyrocenter distribution function from gyrokinetic simulations of ion temperature gradient, electron temperature gradient, and trapped electron mode driven turbulence. The HOSVD eigenvalues for the velocity space coordinates decay very rapidly, indicating that only a few structures in velocity space can capture the most important dynamics. In almost all of the cases studied, HOSVD extracts parallel velocity space structures which are very similar to orthogonal polynomials. HOSVD is also used to compress gyrokinetic datasets, an application in which it is shown to significantly outperform the more commonly used singular value decomposition. It is shown that the effectiveness of the HOSVD compression improves as the dimensionality of the dataset increases. (C) 2012 Elsevier Inc. All rights reserved.

equation↗

Diagnosing collisionless energy transfer using field–particle correlations: gyrokinetic turbulence

Determining the physical mechanisms that extract energy from turbulent fluctuations in weakly collisional magnetized plasmas is necessary for a more complete characterization of the behaviour of a variety of space and astrophysical plasmas. Such a determination is complicated by the complex nature of the turbulence as well as observational constraints, chiefly that in situ measurements of such plasmas are typically only available at a single point in space. Recent work has shown that correlations between electric fields and particle velocity distributions constructed from single-point measurements produce a velocity-dependent signature of the collisionless damping mechanism. We extend this work by constructing field–particle correlations using data sets drawn from single points in strongly driven, turbulent, electromagnetic gyrokinetic simulations to demonstrate that this technique can identify the collisionless mechanisms operating in such systems. The velocity-space structure of the correlation between proton distributions and parallel electric fields agrees with expectations of resonant mechanisms transferring energy collisionlessly in turbulent systems. This work motivates the eventual application of field–particle correlations to spacecraft measurements in the solar wind, with the ultimate goal to determine the physical mechanisms that dissipate magnetized plasma turbulence.

Physics↗

Threshold for electron trapping nonlinearity in Langmuir waves

We assess when electron trapping nonlinearity is expected to be important in Langmuir waves. The basic criterion is that the inverse of the detrapping rate {nu}{sub d} of electrons in the trapping region of velocity space must exceed the bounce period of deeply trapped electrons, {tau}{sub B}{identical_to}(n{sub e}/{delta}n){sup 1/2}2{pi}/{omega}{sub pe}. A unitless figure of merit, the 'bounce number'N{sub B}{identical_to}1/{nu}{sub d}{tau}{sub B}, encapsulates this condition and defines a trapping threshold amplitude for which N{sub B}=1. The detrapping rate is found for convective loss (transverse and longitudinal) out of a spatially finite Langmuir wave. Simulations of driven waves with a finite transverse profile, using the 2D-2V Vlasov code LOKI, show trapping nonlinearity increases continuously with N{sub B} for transverse loss, and is significant for N{sub B} Almost-Equal-To 1. The detrapping rate due to Coulomb collisions (both electron-electron and electron-ion) is also found, with pitch-angle scattering and parallel drag and diffusion treated in a unified manner. A simple way to combine convective and collisional detrapping is given. Application to underdense plasma conditions in inertial confinement fusion targets is presented. The results show that convective transverse loss is usually the most potent detrapping process in a single f/8 laser speckle. For typical plasma and laser conditions on the inner laser cones of the National Ignition Facility, local reflectivities {approx}3% are estimated to produce significant trapping effects.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Directional multimode coupler for planar magnonics: Side-coupled magnetic stripes

We experimentally demonstrate spin waves coupling in two laterally adjacent magnetic stripes. By the means of Brillouin light scattering spectroscopy, we show that the coupling efficiency depends both on the magnonic waveguides' geometry and the characteristics of spin-wave modes. In particular, the lateral confinement of coupled yttrium-iron-garnet stripes enables the possibility of control over the spin-wave propagation characteristics. Numerical simulations (in time domain and frequency domain) reveal the nature of intermodal coupling between two magnonic stripes. The proposed topology of multimode magnonic coupler can be utilized as a building block for fabrication of integrated parallel functional and logic devices such as the frequency selective directional coupler or tunable splitter, enabling a number of potential applications for planar magnonics.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

MiniApp for Density Matrix Renormalization Group Hamiltonian Application Kernel

We present two miniapps that implement the core computational kernel of the DMRG++ application, a generic C++ code that implements the Density Matrix Renormalization Group (DMRG) algorithm. The DMRG++ core Kronecker multiplication kernel is formulated using a batched BLAS approach, with implementation that targets both multi-core CPUs using OpenMP and GPGPU using the MAGMA library. The kernel evaluates the matrix-vector multiplication of the target Hamiltonian matrix used in Lanczos algorithm for computing the lowest eigenvalue and eigenvector. The Hamiltonian matrix is expressed compactly as sums of Kronecker products of small dense matrices. We demonstrate improved performance of the miniapp on synthetic problem, and show the performance of the DMRG++ application using a plugin based on the miniapp. We also present an OpenMP miniapp that explores the use of nested parallel constructs to implement the Kronecker multiplication kernel, exploring the use of nested OpenMP worksharing and tasking abstractions to implement the multi-level parallel multiplication algorithm. The miniapp has been used as a co-design vehicle for evaluating features in the OpenMP-4.5 and upcoming OpenMP-5.0 standards.

Elwasif, Wael↗

Why Does Flow Director Cause Packet Reordering?

Intel Ethernet Flow Director is an advanced network interface card (NIC) technology. It provides the benefits of parallel receive processing in multiprocessing environments and can automatically steer incoming network data to the same core on which its application process resides. However, our analysis and experiments show that Flow Director cannot guarantee in-order packet delivery in multiprocessing environments. Packet reordering causes various negative impacts. E.g., TCP performs poorly with severe packet reordering. In this paper, we use a simplified model to analyze why Flow Director can cause packet reordering. Our experiments verify our analysis.

Wu, Wenji↗