Search NASA⌕ Search

SEARCH · Search NASA

Results for “Parallel in Time”

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 217 records · Page 12

Estimate the Electromechanical States Using Particle Filtering and Smoothing

Accurate knowledge of electromechanical states is critical for efficient and reliable control of a power system. This paper proposes a particle filtering approach to estimate the electromechanical states of power systems from Phasor Measurement Unit (PMU) data. Without having to go through laborious linearization procedure, the proposed particle filtering techniques can estimate states of a complex power system, which is often non-linear and has non-Gaussian noise. The proposed method is evaluated using a multi-machine system with both large and small disturbances. Sensitivity studies of the dynamic state estimation performance are also presented to show the robustness of the proposed method. The inherent decoupling properties of particle filtering make it highly scalable and the potential to reduce computational time through parallel implementation is very promising.

Auxiliary Particle Filter↗

A Recursive Hypergraph Bipartitioning Framework for Reducing Bandwidth and Latency Costs Simultaneously

Intelligent partitioning models are commonly used for efficient parallelization of irregular applications on distributed systems. These models usually aim to minimize a single communication cost metric, which is either related to communication volume or message count. However, both volume- and message-related metrics should be taken into account during partitioning for a more efficient parallelization. There are only a few works that consider both of them and they usually address each in separate phases of a two-phase approach. In this work, we propose a recursive hypergraph bipartitioning framework that reduces the total volume and total message count in a single phase. In this framework, the standard hypergraph models, nets of which already capture the bandwidth cost, are augmented with message nets. The message nets encode the message count so that minimizing conventional cutsize captures the minimization of bandwidth and latency costs together. Our model provides a more accurate representation of the overall communication cost by incorporating both the bandwidth and the latency components into the partitioning objective. The use of the widely-adopted successful recursive bipartitioning framework provides the flexibility of using any existing hypergraph partitioner. In conclusion, the experiments on instances from different domains show that our model on the average achieves up to 52 percent reduction in total message count and hence results in 29 percent reduction in parallel running time compared to the model that considers only the total volume.

97 MATHEMATICS AND COMPUTING↗

Reduce Operations: Send Volume Balancing While Minimizing Latency

Communication hypergraph model was introduced in a two-phase setting for encapsulating multiple communication cost metrics (bandwidth and latency), which are proven to be important in parallelizing irregular applications. In the first phase, computational-task-to-processor assignment is performed with the objective of minimizing total volume while maintaining computational load balance. In the second phase, communication-task-to-processor assignment is performed with the objective of minimizing total number of messages while maintaining communication-volume balance. The reduce-communication hypergraph model suffers from failing to correctly encapsulate send-volume balancing. We propose a novel vertex weighting scheme that enables part weights to correctly encode send-volume loads of processors for send-volume balancing. The model also suffers from increasing the total communication volume during partitioning. To decrease this increase, we propose a method that utilizes the recursive bipartitioning framework and refines each bipartition by vertex swaps. For performance evaluation, we consider column-parallel SpMV, which is one of the most widely known applications in which the reduce-task assignment problem arises. Extensive experiments on 313 matrices show that, compared to the existing model, the proposed models achieve considerable improvements in all communication cost metrics. Furthermore, these improvements lead to an average decrease of 30% in parallel SpMV time on 512 processors for 70 matrices with high irregularity.

97 MATHEMATICS AND COMPUTING↗

Optimal Black Start Allocation for Power System Restoration

Equipment failures, operator errors, natural disasters and cyber-attacks can and have caused extended blackouts of the electric grid. Even though such events are rare, preparedness for them is critical because extended power outages endanger human lives, compromise national security, or result in economic losses of billions of dollars. Since most of the generating units cannot restart without connecting to an energized grid, the system operator relies on a few units with the ability to start autonomously, called Black Start (BS) units, to restore the power system. Allocating and maintaining these units is costly and can severely impact the restoration security and time. We formulate an optimization problem to optimally allocate BS units in the grid, while simultaneously optimizing over the restoration sequence. We extend existing optimal allocation models by including grid considerations such as active power nodal balance, transmission switching, nodal reactive power support and voltage limits. In order to aid the branch and bound tree that solves the resulting large scale mixed integer program, we propose a randomized heuristic that is executed multiple times in parallel on a high-performance computing environment to find feasible solutions. Here, we proceed to solve the IEEE-39, the IEEE-118, and a simplified WECC system with 225 nodes and 136 generators to near optimality.

97 MATHEMATICS AND COMPUTING↗

A Posteriori Error Analysis of Two-Stage Computation Methods with Application to Efficient Discretization and the Parareal Algorithm

We consider numerical methods for initial value problems that employ a two stage approach consisting of solution on a relatively coarse discretization followed by solution on a relatively fine discretization. Examples include adaptive error control, parallel-in-time solution schemes, and efficient solution of adjoint problems for computing a posteriori error estimates. We describe a general formulation of two stage computations then perform a general a posteriori error analysis based on computable residuals and solution of an adjoint problem. The analysis accommodates various variations in the two stage computation and in formulation of the adjoint problems. We apply the analysis to compute “dual-weighted” a posteriori error estimates, to develop novel algorithms for efficient solution that take into account cancellation of error, and to the Parareal Algorithm. We test the various results using several numerical examples.

97 MATHEMATICS AND COMPUTING↗

Partitioning Models for Scaling Parallel Sparse Matrix-Matrix Multiplication

We investigate outer-product--parallel, inner-product--parallel, and row-by-row-product--parallel formulations of sparse matrix-matrix multiplication (SpGEMM) on distributed memory architectures. For each of these three formulations, we propose a hypergraph model and a bipartite graph model for distributing SpGEMM computations based on one-dimensional (1D) partitioning of input matrices. Here, we also propose a communication hypergraph model for each formulation for distributing communication operations. The computational graph and hypergraph models adopted in the first phase aim at minimizing the total message volume and balancing the computational loads of processors, whereas the communication hypergraph models adopted in the second phase aim at minimizing the total message count and balancing the message volume loads of processors. That is, the computational partitioning models reduce the bandwidth cost and the communication hypergraph models reduce the latency cost. Our extensive parallel experiments on up to 2048 processors for a wide range of realistic SpGEMM instances show that although the outer-product--parallel formulation scales better, the row-by-row-product--parallel formulation is more viable due to its significantly lower partitioning overhead and competitive scalability. For computational partitioning models, our experimental findings indicate that the proposed bipartite graph models are attractive alternatives to their hypergraph counterparts because of their lower partitioning overhead. Finally, we show that by reducing the latency cost besides the bandwidth cost through using the communication hypergraph models, the parallel SpGEMM time can be further improved up to 32%.

97 MATHEMATICS AND COMPUTING↗

Statistical Analysis of Variation in the Human Plasma Proteome

Quantifying the variation in the human plasma proteome is an essential prerequisite for disease-specific biomarker detection. We report here on the longitudinal and individual variation in human plasma characterized by two-dimensional difference gel electrophoresis (2-D DIGE) using plasma samples from eleven healthy subjects collected three times over a two week period. Fixed-effects modeling was used to remove dye and gel variability. Mixed-effects modeling was then used to quantitate the sources of proteomic variation. The subject-to-subject variation represented the largest variance component, while the time-within-subject variation was comparable to the experimental variation found in a previous technical variability study where one human plasma sample was processed eight times in parallel and each was then analyzed by 2-D DIGE in triplicate. Here, 21 protein spots had larger than 50% CV, suggesting that these proteins may not be appropriate as biomarkers and should be carefully scrutinized in future studies. Seventy-eight protein spots showing differential protein levels between different individuals or individual collections were identified by mass spectrometry and further characterized using hierarchical clustering. The results present a first step toward understanding the complexity of longitudinal and individual variation in the human plasma proteome, and provide a baseline for improved biomarker discovery.

Corzett, Todd H.↗

Reprocessing plant scale model integration

The national laboratory complex contains a number of niche modeling capabilities for fuel cycle facilities, at different scales and utilizing a range of codes or modeling platforms. The goal of this work has been to integrate modeling capabilities for reprocessing plants to develop a plant scale model. The Separations and Safeguards Performance Model (SSPM), developed in Matlab Simulink, has been used as a base to integrate more detailed codes. In the past, both the AMUSE and SEPHIS solvent extraction codes were integrated into the SSPM to provide more realistic modeling of the separations in aqueous reprocessing plants. For this work, the AMUSE integration was expanded to include time dependence and more fully integrated for both UREX and TRUEX contactor banks. The Nitron code is a new continuous dissolver model which has been examined for integration in the SSPM as well. Finally, in order to improve the model run time, a parallel processing capability was added. The integration progress along with initial results from testing are presented.

Cipiti, Benjamin B.↗

Bioaccumulation Using Surrogate Samplers (Bass): Evaluation Of A Passive Sampler As An Alternative Monitoring Tool For Environmental Contaminants At The Savannah River Site

DOE sites conduct traditional environmental monitoring programs that require collecting, processing, and analyzing water, sediment, and fish samples. However, recently developed passive sampling technologies, such as Diffusive Gradient in Thin films (DGT), may measure the chemical phases that are available and toxic to organisms (the bioavailable fraction), thereby producing more accurate and economical results than traditional methods. Our laboratory study showed that dissolved copper concentrations measured by DGT probes were strongly correlated with the uptake of copper by Lumbriculus variegatus, an aquatic worm, and with concentrations of copper measured by conventional methods. Dissolved copper concentrations in DGT probes increased with time of exposure, paralleling the increase in copper with time that ocurred in Lumbriculus. Additional studies with a combination of seven dissolved metals showed similar results. These findings support the use of DGT as a biomimetic monitoring tool and provide a basis for refinement of these methods for cost-effective environmental monitoring at DOE sites.

54 ENVIRONMENTAL SCIENCES↗

Predicting Execution Times for Disk-based and In-Situ Parallel Data Analytics (Final Technical Report)

In recent years, there has been a significant amount of interests in in-situ analytics on simulation programs. For a variety of reasons, it is desirable to be able to predict the execution time of an analytics program. At the same time, frameworks such as MapReduce have become popular for scientific data analytics. This paper focuses on developing performance models for predicting execution time of parallel data analytics, with a special emphasis on in-situ analytics. We take two distinct approach towards performance prediction. We first expand SKOPE (a SKeleton framewOrk for Performance Exploration) with performance models for disk data read, cache performance, and page fault penalty. Second, an analytical performance model is also developed. We have evaluated our performance prediction framework as well as the analytical model on three hardware setups with well-known data mining algorithms implemented in three programming paradigms, MapReduce, MATE (a MapReduce-like parallel system with an alternate API for multi-core environments) and Smart (a MapReduce-like framework for in-situ analytics). Results show that our performance prediction framework along with the incorporated performance models are capable of accurately predicting execution times for parallel scientific analytics on different hardware setups.

97 MATHEMATICS AND COMPUTING↗

Neutron (and other Particle) Transport at LANL: An Overview [Presentation]

For decades, Los Alamos National Laboratory has been at the forefront of neutron transport methods research and code development. One such code is PARTISN, the LANL parallel time-dependent discrete ordinate neutron transport code. In this presentation, we describe the various research efforts currently underway by the PARTISN and other code teams. Some examples of current research are a block automated mesh refinement scheme, the application of tensor trains to the discretized neutron transport equation, and GPU code porting. The block automated mesh refinement scheme uses cross section information to refine and coarsen the solution mesh to improve time to solution and reduce memory. The tensor train approach expresses discretized transport operators as tensor products of vectors and matrices to compress the size of linear systems being solved by transport codes. Rather than relying on matrix-free methods such as the transport sweep, we have access to an operator that can be inverted, reshaped, or manipulated algebraically. Finally, we describe how PARTISN is used, what problems we are looking to solve, and what the future holds for neutron transport at LANL. In addition to this, we briefly describe the various research efforts in other particle transport teams using both deterministic and Monte Carlo methods. In the presentation, we list possible opportunities for collaboration between the laboratory and faculty and students.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Dynamic Network Analysis of Nuclear Science Literature for Research Influence Assessment

Analyzing nuclear science literature via data-driven methods is a critical step for assessing research influence and technology advancements. Indicators of scholarly activities may be buried in large volumes of nuclear research publications and collaboration networks over time. Mining for relevant scholarly influence trends in large volumes of text can be computationally challenging; however, open-source information on research collaborations over time can offer opportunities to extract meaningful insights. While network centrality analysis of scholarly research provides topology-based insights, additional emphasis on dynamics associated with the diffusion of information through these networks is important. Here this paper represents a step in that direction through the development of a novel dynamic network analysis framework and computational engine to identify key entities and capabilities over time within global scholarly nuclear science collaboration networks. Network theoretic, stochastic simulation, and optimization methods are leveraged to address variability in scholarly interactions, influence propagation, and collaboration patterns via network connections. A topic-aware influence maximization algorithm is developed to address the goal of identifying key influential authors in diverse research topics over time. Efficient parallelized implementation of the algorithm is applied to reduce computational costs. A proof-of-concept case study using open-source Scopus data with 33,517 published nuclear research papers from 2000-2019 is presented and representative analytic insights are generated. Broad implications of these insights are discussed and future research directions are also identified.

98 NUCLEAR DISARMAMENT, SAFEGUARDS, AND PHYSICAL P↗

Candidate Core Designs for the Transformational Challenge Reactor

Early cycle activities under the Transformational Challenge Reactor (TCR) program focused on analyzing and maturing four reactor core design concepts: two fast-spectrum systems and two thermal-spectrum systems. A rapid, iterative approach has been implemented through which designs can be modified and analyzed and subcomponents can be manufactured in parallel over time frames of weeks rather than months or years. To meet key program initiatives (e.g., timeline, material use), several constraints—including fissile material availability (less than 250 kg of HALEU), component availabilities, materials compatibility, and additive manufacturing capabilities—were factored into the design effort, yielding small (less than one cubic meter in volume) cores with near-term viability. The fast-spectrum designs did not meet the fissile material constraint, so the thermal-spectrum systems became the primary design focus. Since significant progress has been made on advanced moderator materials (YH x ) under the TCR program, gas-cooled thermal-spectrum systems using less than 250 kg of HALEU that occupy less than 1 m 3 are now feasible. The designs for two of these systems have been evolved and matured. In both thermal-spectrum design concepts, bidirectional coolant flow is used. Coolant flows down through YH x moderator elements and is reversed in a bottom manifold and core support structure, and then flows up though or around the fuel elements. The main difference between the two thermal-spectrum design concepts is the fuel elements—one uses traditional UO 2 ceramic fuel, and the other uses UN-bearing TRISO fuel particles embedded inside a SiC matrix. Finally, core neutronics and thermal performance for these systems are assessed and summarized herein.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Modeling and Analysis Methods for an On-line Enrichment Monitor

The International Atomic Energy Agency (IAEA) has developed an On-Line Enrichment Monitor (OLEM) as one possible component in a new generation of safeguards measures for uranium enrichment plants. The OLEM measures 235U emissions from the UF6 gas flowing through a unit header pipe using NaI(Tl) spectrometers, and corrects for gas density changes using pressure and temperature sensors in order to determine the enrichment of the gas as a function of time. In parallel with the OLEM instrument development, a Virtual OLEM (VOLEM) software tool has been developed that is capable of producing synthetic gamma-ray, pressure, and temperature data representative of a wide range of enrichment plant operating conditions. VOLEM complements instrument development activities and allows the study of OLEM for scenarios that will be difficult or impossible to evaluate empirically. Uses of VOLEM include: investigation of hardware design options; inter-comparison of candidate gamma-ray spectral analysis and enrichment estimation algorithms; uncertainty budget analysis and performance prediction for typical and atypical operational scenarios; and testing of the OLEM data acquisition, analysis and reporting software. This paper describes the technical foundations of VOLEM and illustrates how it can be used. An overview of the nominal instrument design and deployment scenario for OLEM is provided, with emphasis on the key online-assay measurement challenge: accurately determining the portion of the total 235U signal that comes from a background that includes solid uranium deposits on the piping walls. Monte Carlo modeling tools, data analysis algorithms and uncertainty quantification methods are described. VOLEM is then used to quantitatively explore the uncertainty budgets and predicted instrument performance for a plausible range of typical plant operating parameters, and one set of candidate analysis algorithms. Additionally, a series of VOLEM case studies illustrates how an online enrichment monitor might respond in scenarios expected to be atypical, for example weak pressure transients or significant changes in background levels.

Smith, Leon E.↗

Deep Packet/Flow Analysis using GPUs

Deep packet inspection (DPI) faces severe performance challenges in high-speed networks (40/100 GE) as it requires a large amount of raw computing power and high I/O throughputs. Recently, researchers have tentatively used GPUs to address the above issues and boost the performance of DPI. Typically, DPI applications involve highly complex operations in both per-packet and per-flow data level, often in real-time. The parallel architecture of GPUs fits exceptionally well for per-packet network traffic processing. However, for stateful network protocols such as TCP, their data stream need to be reconstructed in a per-flow level to deliver a consistent content analysis. Since the flow-centric operations are naturally antiparallel and often require large memory space for buffering out-of-sequence packets, they can be problematic for GPUs, whose memory is normally limited to several gigabytes. In this work, we present a highly efficient GPU-based deep packet/flow analysis framework. The proposed design includes a purely GPU-implemented flow tracking and TCP stream reassembly. Instead of buffering and waiting for TCP packets to become in sequence, our framework process the packets in batch and uses a deterministic finite automaton (DFA) with prefix-/suffix- tree method to detect patterns across out-of-sequence packets that happen to be located in different batches. In conclusion, evaluation shows that our code can reassemble and forward tens of millions of packets per second and conduct a stateful signature-based deep packet inspection at 55 Gbit/s using an NVIDIA K40 GPU.

97 MATHEMATICS AND COMPUTING↗