SEARCH · Search NASA

Results for “parallel implementation”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 1,099 records · Page 61

All sources NASA NTRS DOE OSTI

DOE OSTI2017

Automated Work Packages: Radio Frequency Identification, Bluetooth Beacons, and Video Applications in the Nuclear Power Industry

The need to move conventional paper-based work packages into an electronic state motivated the development of a large span of electronic work package forms that ranged from simple Portable Document Format (PDF) files to adaptive and intelligent electronic forms. In parallel to this development, the Department of Energy Light Water Reactor Sustainability Program (LWRS) initiated the automated work package as a pilot project to evaluate implementing state of the art automation techniques into the work package process to improve the economic and safety of the work process. Through a multiple year’s effort, the automated work package project have developed a vision of the future work package that relies on automation in all critical and human factor challenging tasks. The vision identified gaps in the work process, the means to automate them, and evaluated the implementation, feasibility and benefits of these means. This was conducted through continues engagement with the nuclear power industry. The aim of this report is to study the potential of three automation technologies, which have been advancing in various industries, in the current work process of nuclear power plants. The study is to determine the feasibility and benefits of incorporating the technologies and determine potential gaps, if any, that need to be addressed to facilitate deployment of the studied technologies. The three automation technologies identified for this effort are ultra-high frequency (UHF) radio frequency identification (RFID), Bluetooth low energy (BLE) beacons, and video monitoring and recording. As part of this effort, the Idaho National Laboratory (INL) collaborated with Xcel Energy Inc. to evaluate these technologies. During the research and development scope of the effort, INL engaged Xcel Energy Inc. periodically and exchanged valuable insight on the means to implement these technologies in a nuclear power plant. Multiple pilot prototypes were developed and tested in a user study conducted at Xcel Energy Inc. in Minneapolis, Minnesota. The outcome of this effort resulted in significant findings that included the detailed means to custom fit the technologies to fit the nuclear power industry need, and identifying and evaluating several applications of high economic or safety potential. The limitations and obstacles that could impact deployment of the technologies were also identified, and the means of how to address these limitations and obstacles were studied.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

DOE OSTI2023

Integration of Ultrawide Bandgap Photoconducting Semiconductor Switches into High-Voltage, High-Current Pulser Systems

In this feasibility study we will evaluate the viability of integrating ultrawide bandgap (UWBG) photoconducting semiconductor switches (PCSS) in high-voltage pulser systems capable of driving low-impedance dynamic loads critical for next-generation accelerator and RF-source applications. The project consisted of developing modelling tools that would inform design of UWBG PCSS packages that could be mounted onto conventional circuit boards. Specifically, we are interested in evaluating the following through simulation software: (1) resistance to electrical breakdown (2) proximity effects due to high-frequency skin effect (3) transient behavior from switching (4) effective transmission of RF signals (5) thermal dynamics of the switch under operation (6) sensitivity to inhomogeneities in optical excitation of the material (7) cross-talk effects from parallel switching structures, and (8) susceptibility of system to damaged components. The project resulted in the development of a special-purpose circuit code that implements photoconductivity physics. This code was used to evaluate objectives 1-6 above, identifying a critical requirement associated with the need for fine control of dopant concentrations in the UWBG material to reach an optimal solution for voltage standoff and laser light responsivity requirements. In addition, we identified that the temperature dependence of the electrical conductivity of this material was typically not well-measured and developed a platform for measuring both the “dark” and “illuminated” conductivity on real physical switches in the lab to better inform our models.

24 POWER TRANSMISSION AND DISTRIBUTION↗

DOE OSTI2016

Matrix Factorizations at Scale: a Comparison of Scientific Data Analytics in Spark and C+MPI Using Three Case Studies

We explore the trade-offs of performing linear algebra using Apache Spark, compared to traditional C and MPI implementations on HPC platforms. Spark is designed for data analytics on cluster computing platforms with access to local disks and is optimized for data-parallel tasks. We examine three widely-used and important matrix factorizations: NMF (for physical plausibility), PCA (for its ubiquity) and CX (for data interpretability). We apply these methods to 1.6TB particle physics, 2.2TB and 16TB climate modeling and 1.1TB bioimaging data. The data matrices are tall-and-skinny which enable the algorithms to map conveniently into Spark’s data parallel model. We perform scaling experiments on up to 1600 Cray XC40 nodes, describe the sources of slowdowns, and provide tuning guidance to obtain high performance.

Gittens, Alex↗

DOE OSTI2018

System and method of storing and analyzing information

A system and method of storing and analyzing information is disclosed. The system includes a compiler layer to convert user queries to data parallel executable code. The system further includes a library of multithreaded algorithms, processes, and data structures. The system also includes a multithreaded runtime library for implementing compiled code at runtime. The executable code is dynamically loaded on computing elements and contains calls to the library of multithreaded algorithms, processes, and data structures and the multithreaded runtime library.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

System and method of storing and analyzing information

Feo, John T.↗

DOE OSTI2017

What does fault tolerant Deep Learning need from MPI?

Deep Learning (DL) algorithms have become the {\em de facto} Machine Learning (ML) algorithm for large scale data analysis. DL algorithms are computationally expensive -- even distributed DL implementations which use MPI require days of training (model learning) time on commonly studied datasets. Long running DL applications become susceptible to faults -- requiring development of a fault tolerant system infrastructure, in addition to fault tolerant DL algorithms. This raises an important question: {\em What is needed from MPI for designing fault tolerant DL implementations?} In this paper, we address this problem for permanent faults. We motivate the need for a fault tolerant MPI specification by an in-depth consideration of recent innovations in DL algorithms and their properties, which drive the need for specific fault tolerance features. We present an in-depth discussion on the suitability of different parallelism types (model, data and hybrid); a need (or lack thereof) for check-pointing of any critical data structures; and most importantly, consideration for several fault tolerance proposals (user-level fault mitigation (ULFM), Reinit) in MPI and their applicability to fault tolerant DL implementations. We leverage a distributed memory implementation of Caffe, currently available under the Machine Learning Toolkit for Extreme Scale (MaTEx). We implement our approaches by extending MaTEx-Caffe for using ULFM-based implementation. Our evaluation using the ImageNet dataset and AlexNet neural network topology demonstrates the effectiveness of the proposed fault tolerant DL implementation using OpenMPI based ULFM.

Amatya, Vinay C.↗

DOE OSTI2025

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

DOE OSTI2024

An exploration of online-simulation-driven portfolio scheduling in Workflow Management Systems

Workflow Management Systems used to automate the execution of scientific workflow applications on parallel and distributed computing platforms must make scheduling decisions at runtime. A large number of workflow scheduling algorithms have been proposed in the literature, but often these algorithms are evaluated based on simplifying assumptions that may not hold in practice. Furthermore, published algorithm evaluation and/or comparison results are necessarily only for a subset of all possible scenarios, and thus may not include scenarios relevant to particular use-cases. Consequently, it is difficult for Workflow Management Systems (WMSs) developers to decide which scheduling algorithm should be implemented. To obviate this difficulty, one possible approach is to implement a portfolio of scheduling algorithms and select the most effective algorithm at runtime. One method for performing this selection is to run an online simulation for each algorithm in the portfolio. The algorithm that leads to the best performance, in simulation, is selected for future use. The above simulation-driven portfolio scheduling (SDPS) approach has been proposed in a few parallel and distributed computing contexts. The main objective of this work is to evaluate the feasibility and potential merit of SDPS if implemented in WMSs. Here we perform this evaluation using simulated WMS executions, where the simulations are instantiated from real-world platform and workflow configurations. Our main finding is that SDPS is on par with or outperforms an approach in which a single algorithm is used, where this algorithm is the one that performs best on average across all our experimental scenarios. Furthermore, we find that SDPS remains an attractive proposition even in the presence of high levels of simulation error and for simulators with relatively low levels of sophistication. In many of our experimental scenarios we find that mitigating simulation error at runtime can further improve performance. Finally, we show that simulation overhead can be made sufficiently low for SDPS to be feasible in practice.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

The ARES High-level Intermediate Representation

The LLVM intermediate representation (IR) lacks semantic constructs for depicting common high-performance operations such as parallel and concurrent execution, communication and synchronization. Currently, representing such semantics in LLVM requires either extending the intermediate form (a signi cant undertaking) or the use of ad hoc indirect means such as encoding them as intrinsics and/or the use of metadata constructs. In this paper we discuss a work in progress to explore the design and implementation of a new compilation stage and associated high-level intermediate form that is placed between the abstract syntax tree and when it is lowered to LLVM's IR. This highlevel representation is a superset of LLVM IR and supports the direct representation of these common parallel computing constructs along with the infrastructure for supporting analysis and transformation passes on this representation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Characterization of applied fields for ion mobility separations in traveling wave based structures for lossless ion manipulations (SLIM)

Ion mobility (IM) is rapidly gaining attention for the analysis of biomolecules due to the ability to distinguish the shapes of ions. However, conventional constant electric field drift tube IM has limited resolving power, constrained by practical limitations on the path length and maximum applied voltage. The implementation of traveling waves (TW) in IM removes the latter limitation, allowing higher resolution to be achieved using extended path lengths. These can be readily obtainable in structures for lossless ion manipulations (SLIM), which are fabricated from electric fields that are generated by appropriate potentials applied to arrays of electrodes patterned on two parallel surfaces. In this work we have investigated the relationship between the various SLIM variables, such as electrode dimensions, inter-surface gap, and the TW applied voltages, that directly impact the fields experienced by ions. Ion simulation and theoretical calculations have been utilized to understand the dependence of SLIM geometry and effective electric field. The variables explored impact both ion confinement and the observed IM resolution in Structures for Lossless Ion Manipulations (SLIM) modules.

Hamid, Ahmed M.↗

DOE OSTI2017

Parallel Multivariate Spatio-Temporal Clustering of Large Ecological Datasets on Hybrid Supercomputers

A proliferation of data from vast networks of remote sensing platforms (satellites, unmanned aircraft systems (UAS), airborne etc.), observational facilities (meteorological, eddy covariance etc.), state-of-the-art sensors, and simulation models offer unprecedented opportunities for scientific discovery. Unsupervised classification is a widely applied data mining approach to derive insights from such data. However, classification of very large data sets is a complex computational problem that requires efficient numerical algorithms and implementations on high performance computing (HPC) platforms. Additionally, increasing power, space, cooling and efficiency requirements has led to the deployment of hybrid supercomputing platforms with complex architectures and memory hierarchies like the Titan system at Oak Ridge National Laboratory. The advent of such accelerated computing architectures offers new challenges and opportunities for big data analytics in general and specifically, large scale cluster analysis in our case. Although there is an existing body of work on parallel cluster analysis, those approaches do not fully meet the needs imposed by the nature and size of our large data sets. Moreover, they had scaling limitations and were mostly limited to traditional distributed memory computing platforms. We present a parallel Multivariate Spatio-Temporal Clustering (MSTC) technique based on k-means cluster analysis that can target hybrid supercomputers like Titan. We developed a hybrid MPI, CUDA and OpenACC implementation that can utilize both CPU and GPU resources on computational nodes. We describe performance results on Titan that demonstrate the scalability and efficacy of our approach in processing large ecological data sets.

Sreepathi, Sarat↗

DOE OSTI2020

A fully implicit, scalable, conservative nonlinear relativistic Fokker–Planck 0D-2P solver for runaway electrons

Upon application of a sufficiently strong electric field, electrons break away from thermal equilibrium and approach relativistic speeds. These highly energetic ‘runaway’ electrons (~ MeV) play a significant role in tokamak disruption physics, and therefore their accurate understanding is essential to develop reliable mitigation strategies. As such, we have developed a fully implicit solver for the 0D-2P (i.e., including two momenta coordinates) relativistic nonlinear Fokker–Planck equation (rFP). As in earlier implicit rFP studies (NORSE, CQL3D), electron–ion interactions are modeled using the Lorentz operator, and synchrotron damping using the Abraham–Lorentz–Dirac reaction term. However, our implementation improves on these earlier studies by (1) ensuring exact conservation properties for electron collisions, (2) strictly preserving positivity, and (3) being scalable algorithmically and in parallel. Key to our proposed approach is an efficient multigrid preconditioner for the linearized rFP equation, a multigrid elliptic solver for the Braams–Karney potentials, and a novel adaptive technique to determine the associated boundary values. We verify the accuracy and efficiency of the proposed scheme with numerical results ranging from small electric-field electrical conductivity measurements to the accurate reproduction of runaway tail dynamics when strong electric fields are applied.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2022

Thermal ion kinetic effects and Landau damping in fishbone modes

We report the kinetic–magnetohydrodynamic (MHD) hybrid simulation approach for macroscopic instabilities in plasmas can be extended to include the kinetic effects of both thermal ions and energetic ions. The new coupling scheme includes synchronization of the density and parallel velocity between thermal ions and MHD, in addition to pressure coupling, to ensure the quasineutrality condition and avoid numerical errors. The new approach has been implemented in the kinetic-MHD code M3D-C1-K, and was used to study the thermal ion kinetic effects and Landau damping in fishbone modes in both DIII-D and NSTX. It is found that the thermal ion kinetic effects can cause an increase of the frequencies of the non-resonant n = 1 fishbone modes driven by energetic particles for q min >1, and Landau damping can provide additional stabilization effects. A nonlinear simulation for n = 1 fishbone mode in NSTX is also performed, and the perturbation on magnetic flux surfaces and the transport of energetic particles are calculated.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2015

Lattice cluster theory for dense, thin polymer films

While the application of the lattice cluster theory (LCT) to study the miscibility of polymer blends has greatly expanded our understanding of the monomer scale molecular details influencing miscibility, the corresponding theory for inhomogeneous systems has not yet emerged because of considerable technical difficulties and much greater complexity. Here, we present a general formulation enabling the extension of the LCT to describe the thermodynamic properties of dense, thin polymer films using a high dimension, high temperature expansion. Whereas the leading order of the LCT for bulk polymer systems is essentially simple Flory-Huggins theory, the highly non-trivial leading order inhomogeneous LCT (ILCT) for a film with L layers already involves the numerical solution of 3(L − 1) coupled, highly nonlinear equations for the various density profiles in the film. The new theory incorporates the essential “transport” constraints of Helfand and focuses on the strict imposition of excluded volume constraints, appropriate to dense polymer systems, rather than the maintenance of chain connectivity as appropriate for lower densities and as implemented in self-consistent theories of polymer adsorption at interfaces. The ILCT is illustrated by presenting examples of the computed profiles of the density, the parallel and perpendicular bonds, and the chain ends for free standing and supported films as a function of average film density, chain length, temperature, interaction with support, and chain stiffness. The results generally agree with expected general trends.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2023

Towards fast, accurate predictions of RF simulations via data-driven modeling: Forward and lateral models

Three machine learning techniques (multilayer perceptron, random forest, and Gaussian process) provide fast surrogate models for lower hybrid current drive (LHCD) simulations. A single GENRAY/CQL3D simulation without radial diffusion of fast electrons requires several minutes of wall-clock time to complete, which is acceptable for many purposes, but too slow for integrated modeling and real-time control applications. More accurate simulations with fast electron diffusion are even slower, requiring multiple hours of run time with parallel processing. The machine learning models use a database of 16,000+ GEN-RAY/CQL3D simulations for training, validation, and testing. Latin hypercube sampling methods implemented in πScope ensure that the database covers the range of 9 input parameters (n e0 , T e0 , I p , B t , R 0 , n ∥︀ , Z e f f , V loop , P LHCD ) with sufficient density in all regions of parameter space. The surrogate models reduce the computation time from minutes-hours to ms with high accuracy across the input parameter space. Data-driven surrogate models also allow for solving inverse and “lateral” problems. A surrogate model for the inverse problem maps from a desired current drive or power deposition profile to a set of input parameters that would result in such a profile, while a surrogate model for the lateral problem maps from a measured experimental quantity such as hard x-ray emission to a current drive or power deposition profile. In conclusion, the πScope database creation workflow is flexible and applicable to other RF simulation codes such as TORIC.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

DOE OSTI2017

Proteolysis of truncated hemolysin A yields a stable dimerization interface

Wild-type and variant forms of HpmA265 (truncated hemolysin A) from Proteus mirabilis reveal a right-handed, parallel β-helix capped and flanked by segments of antiparallel β-strands. The low-salt crystal structures form a dimeric structure via the implementation of on-edge main-chain hydrogen bonds donated by residues 243–263 of adjacent monomers. Surprisingly, in the high-salt structures of two variants, Y134A and Q125A-Y134A, a new dimeric interface is formed via main-chain hydrogen bonds donated by residues 203–215 of adjacent monomers, and a previously unobserved tetramer is formed. In addition, an eight-stranded antiparallel β-sheet is formed from the flap regions of crystallographically related monomers in the high-salt structures. This new interface is possible owing to additional proteolysis of these variants after Tyr240. The interface formed in the high-salt crystal forms of hemolysin A variants may mimic the on-edge β-strand positioning used in template-assisted hemolytic activity.

Novak, Walter R. P.↗

DOE OSTI2015

YARNsim: Simulating Hadoop YARN

Despite the popularity of the Apache Hadoop system, its success has been limited by issues such as single points of failure, centralized job/task management, and lack of support for programming models other than MapReduce. The next generation of Hadoop, Apache Hadoop YARN, is designed to address these issues. In this paper, we propose YARNsim, a simulation system for Hadoop YARN. YARNsim is based on parallel discrete event simulation and provides protocol-level accuracy in simulating key components of YARN. YARNsim provides a virtual platform on which system architects can evaluate the design and implementation of Hadoop YARN systems. Also, application developers can tune job performance and understand the tradeoffs between different configurations, and Hadoop YARN system vendors can evaluate system efficiency under limited budgets. To demonstrate the validity of YARNsim, we use it to model two real systems and compare the experimental results from YARNsim and the real systems. The experiments include standard Hadoop benchmarks, synthetic workloads, and a bioinformatics application. The results show that the error rate is within 10% for the majority of test cases. The experiments prove that YARNsim can provide what-if analysis for system designers in a timely manner and at minimal cost compared with testing and evaluating on a real system.

Hadoop↗

DOE OSTI2016

WarpIV: In situ visualization and analysis of ion accelerator simulations

The generation of short pulses of ion beams through the interaction of an intense laser with a plasma sheath offers the possibility of compact and cheaper ion sources for many applications--from fast ignition and radiography of dense targets to hadron therapy and injection into conventional accelerators. To enable the efficient analysis of large-scale, high-fidelity particle accelerator simulations using the Warp simulation suite, the authors introduce the Warp In situ Visualization Toolkit (WarpIV). WarpIV integrates state-of-the-art in situ visualization and analysis using VisIt with Warp, supports management and control of complex in situ visualization and analysis workflows, and implements integrated analytics to facilitate query- and feature-based data analytics and efficient large-scale data analysis. WarpIV enables for the first time distributed parallel, in situ visualization of the full simulation data using high-performance compute resources as the data is being generated by Warp. The authors describe the application of WarpIV to study and compare large 2D and 3D ion accelerator simulations, demonstrating significant differences in the acceleration process in 2D and 3D simulations. WarpIV is available to the public via https://bitbucket.org/berkeleylab/warpiv. The Warp In situ Visualization Toolkit (WarpIV) supports large-scale, parallel, in situ visualization and analysis and facilitates query- and feature-based analytics, enabling for the first time high-performance analysis of large-scale, high-fidelity particle accelerator simulations while the data is being generated by the Warp simulation suite. Furthermore, this supplemental material https://extras.computer.org/extra/mcg2016030022s1.pdf provides more details regarding the memory profiling and optimization and the Yee grid recentering optimization results discussed in the main article.

43 PARTICLE ACCELERATORS↗