Search NASA⌕ Search

SEARCH · Search NASA

Results for “Incremental Computing”

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 55 records · Page 3

Resilience Evaluation and Enhancement for Island City Integrated Energy Systems

Extreme natural hazards, such as hurricanes or earthquakes, have a high probability of threatening energy supply security and causing high-order contingencies to island city-integrated energy systems (IC-IESs). To better evaluate and enhance resilience, a novel approach is proposed in this work for IC-IESs. The resilience of an IC-IES is analyzed from both the system level and the component level. At the system level, the impacts of extreme natural disasters are quantified. At the component level, the importance of individual components is analyzed through pre-failure and post-failure indices. The pre-failure index identifies the system’s weak links before an energy interruption, and the post-failure index determines the optimal repair strategy to restore the service. The proposed indices are solved by the impact increment method (IIM), which significantly improves computational efficiency without much affecting result accuracy. Numerical simulation studies are conducted on the modified Barry Island IES and IES E123-G48-H32 test systems. Furthermore, the results validate the effectiveness of the proposed approach.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Optimizing Management of Persistent Data Structures in High-Performance Analytics

Large-scale data analytics workflows ingest massive input data into various data structures, including graphs and key-value datastores. These data structures undergo multiple transformations and computations and are typically reused in incremental and iterative analytics workflows. Persisting in-memory views of these data structures enables reusing them beyond the scope of a single program run while avoiding repetitive raw data ingestion overheads. Memory-mapped I/O enables persisting in-memory data structures without data serialization and deserialization overheads. However, memory-mapped I/O lacks the key feature of persisting consistent snapshots of these data structures for incremental ingestion and processing. The obstacles to efficient virtual memory snapshots using memory-mapped I/O include background writebacks outside the application’s control, and the significantly high storage footprint of such snapshots. To address these limitations, we present Privateer, a memory and storage management tool that enables storage-efficient virtual memory snapshotting while also optimizing snapshot I/O performance. Here, we integrated Privateer into Metall, a state-of-the-art persistent memory allocator for C++, and the Lightning Memory-Mapped Database (LMDB), a widely-used key-value datastore in data analytics and machine learning. Privateer optimized application performance by 1.22× when storing data structure snapshots to node-local storage, and up to 16.7× when storing snapshots to a parallel file system. Privateer also optimizes storage efficiency of incremental data structure snapshots by up to 11× using data deduplication and compression.

Computer science↗

A NEW IMPLEMENTATION OF THE MAGNETOHYDRODYNAMICS-RELAXATION METHOD FOR NONLINEAR FORCE-FREE FIELD EXTRAPOLATION IN THE SOLAR CORONA

The magnetic field in the solar corona is usually extrapolated from a photospheric vector magnetogram using a nonlinear force-free field (NLFFF) model. NLFFF extrapolation needs considerable effort to be devoted to its numerical realization. In this paper, we present a new implementation of the magnetohydrodynamics (MHD) relaxation method for NLFFF extrapolation. The magnetofrictional approach, which is introduced for speeding the relaxation of the MHD system, is realized for the first time by the spacetime conservation-element and solution-element scheme. A magnetic field splitting method is used to further improve the computational accuracy. The bottom boundary condition is prescribed by incrementally changing the transverse field to match the magnetogram, and all other artificial boundaries of the computational box are simply fixed. We examine the code using two types of NLFFF benchmark tests, the Low and Lou semi-analytic force-free solutions and a more realistic solar-like case constructed by van Ballegooijen et al. The results show that our implementation is successful and versatile for extrapolations of either the relatively simple cases or the rather complex cases that need significant rebuilding of the magnetic topology, e.g., a flux rope. We also compute a suite of metrics to quantitatively analyze the results and demonstrate that the performance of our code in extrapolation accuracy basically reaches the same level of the present best-performing code, i.e., that developed by Wiegelmann.

79 ASTRONOMY AND ASTROPHYSICS↗

Discrete event modeling and massively parallel execution of epidemic outbreak phenomena

In complex phenomena such as epidemiological outbreaks, the intensity of inherent feedback effects and the significant role of transients in the dynamics make simulation the only effective method for proactive, reactive or post facto analysis. The spatial scale, runtime speed, and behavioral detail needed in detailed simulations of epidemic outbreaks cannot be supported by sequential or small-scale parallel execution, making it necessary to use large-scale parallel processing. Here, an optimistic parallel execution of a new discrete event formulation of a reaction–diffusion simulation model of epidemic propagation is presented to facilitate a dramatic increase in the fidelity and speed by which epidemiological simulations can be performed. Rollback support needed during optimistic parallel execution is achieved by combining reverse computation with a small amount of incremental state saving. Parallel speedup of over 5,500 and other runtime performance metrics of the system are observed with weak-scaling execution on a small (8,192-core) Blue Gene/P system, while scalability with a weak-scaling speedup of over 10,000 is demonstrated on 65,536 cores of a large Cray XT5 system. Scenarios representing large population sizes, with mobility and detailed state evolution modeled at the level of each individual, exceeding several hundreds of millions of individuals in the largest cases, are successfully exercised to verify model scalability.

Computer Science↗

Time-Efficient Qudit Gates through Incremental Pulse Re-seeding

Current efforts to build quantum computers focus mainly on the two-state qubit, which often involves suppressing readily-available higher states. In this work, we break this abstraction and synthesize short-duration control pulses for gates on generalized d-state qudits. We present Incremental Pulse Reseeding, a practical scheme to guide optimal control software to the lowest-duration pulse by iteratively seeding the optimizer with previous results. We find a near-linear relationship between Hilbert space dimension and gate duration through explicit pulse optimization for one- and two-qudit gates on transmons. Furthermore, our results suggest that qudit operations are much more efficient than previously expected in the practical regime of interest and have the potential to significantly increase the computational power of current hardware.

pulse synthesis↗

Towards Rapid Interactive Machine Learning: Evaluating Tradeoffs of Classification without Representation

Our contribution is the design and evaluation of an interac- tive machine learning interface that rapidly provides the user with model feedback after every interaction. To address visual scalability, this interface communicates with the user via a “tip of the iceberg” approach, where the user interacts with a small set of recommended instances for each class. To address computational scalability, we developed an O(n) classification algorithm that incorporates user feedback incrementally, and without consulting the underlying data’s representation matrix. Our computational evaluation showed that this algorithm has similar accuracy to several off-the-shelf classification algo- rithms with small amounts of labeled data. Empirical evalu- ation revealed that users performed better using our design compared to an equivalent active learning setup.

Arendt, Dustin L.↗

Circumventing mesh bias by r- and h-adaptive techniques for variational eigenfracture

This work introduces and compares mesh r- and h-adaptivity for the eigenfracture model originally proposed in Schmidt et al. (Multiscale Model Simul 7:1237–1266, 2009), Pandolfi and Ortiz (J Numer Methods Eng 92:694–714, 2012), with the goal of suppressing potential mesh bias due to the element deletion. In the r-adaptive approach, we compute the configurational force at each incremental step and move nodes near the crack tip parallel to the normalized configurational forces field such that the crack propagation direction can be captured more accurately within each incremental step. In the h-adapative approach, we introduce mesh refinement via a quad-tree algorithm to introduce more degrees of freedom within the nonlocal ϵ-neighborhood such that a more refined crack path can be reproduced with a higher mesh resolution. Our numerical examples indicate that the r-adaptive approach is able to replicate curved cracks and complex geometrical features, whereas the h-adaptive approach is advantageous in simulating sub-scale fracture when the nonlocal regions are smaller than the un-refined coarse mesh.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

On the Optimal Stabilization of an Integral Manifold

By the method of Lyapunov functions, we study the problem of optimal stabilization of an analytically defined integral manifold in the class of stochastic differential equations in the case where random perturbations belong to the class of processes with independent increments.

97 MATHEMATICS AND COMPUTING↗

Bayesian Tensor Decompositions for Scalable Supervised Learning of Scientific Data (Final Report)

In this document we highlight the detailed accomplishments and progress that we have made in this period. This progress seeks to address the three main objectives to provide new algorithms for quantifying uncertainty in low-multilinear-rank models and to leverage them for data analysis. These include: (1) develop probabilistic models for low-multilinear-rank functions; (2) develop a suite of Bayesian learning approaches to learn the probabilistic models from data; (3) apply the techniques on challenging problems arising in DOE-relevant applications.

97 MATHEMATICS AND COMPUTING↗

Discrete Event Modeling and Massively Parallel Execution of Epidemic Outbreak Phenomena

In complex phenomena such as epidemiological outbreaks, the intensity of inherent feedback effects and the significant role of transients in the dynamics make simulation the only effective method for proactive, reactive or post-facto analysis. The spatial scale, runtime speed, and behavioral detail needed in detailed simulations of epidemic outbreaks make it necessary to use large-scale parallel processing. Here, an optimistic parallel execution of a new discrete event formulation of a reaction-diffusion simulation model of epidemic propagation is presented to facilitate in dramatically increasing the fidelity and speed by which epidemiological simulations can be performed. Rollback support needed during optimistic parallel execution is achieved by combining reverse computation with a small amount of incremental state saving. Parallel speedup of over 5,500 and other runtime performance metrics of the system are observed with weak-scaling execution on a small (8,192-core) Blue Gene / P system, while scalability with a weak-scaling speedup of over 10,000 is demonstrated on 65,536 cores of a large Cray XT5 system. Scenarios representing large population sizes exceeding several hundreds of millions of individuals in the largest cases are successfully exercised to verify model scalability.

99 GENERAL AND MISCELLANEOUS↗

Reversible Parallel Discrete-Event Execution of Large-scale Epidemic Outbreak Models

The spatial scale, runtime speed and behavioral detail of epidemic outbreak simulations together require the use of large-scale parallel processing. In this paper, an optimistic parallel discrete event execution of a reaction-diffusion simulation model of epidemic outbreaks is presented, with an implementation over the $\mu$sik simulator. Rollback support is achieved with the development of a novel reversible model that combines reverse computation with a small amount of incremental state saving. Parallel speedup and other runtime performance metrics of the simulation are tested on a small (8,192-core) Blue Gene / P system, while scalability is demonstrated on 65,536 cores of a large Cray XT5 system. Scenarios representing large population sizes (up to several hundred million individuals in the largest case) are exercised.

99 GENERAL AND MISCELLANEOUS↗

Modernization and optimization of a legacy open-source CFD code for high-performance computing architectures

Legacy codes remain a crucial element of today's simulation-based engineering ecosystem due to the extensive validation process and investment in such software. The rapid evolution of high-performance computing architectures necessitates the modernization of these codes. One approach to modernization is a complete overhaul of the code. However, this could require extensive investments, such as rewriting in modern languages, new data constructs, etc., which will necessitate systematic verification and validation to re-establish the credibility of the computational models. The current study advocates using a more incremental approach and is a culmination of several modernization efforts of the legacy code MFIX, which is an open-source computational fluid dynamics code that has evolved over several decades, widely used in multiphase flows and still being developed by the National Energy Technology Laboratory. Two different modernization approaches,‘bottom-up’ and ‘top-down’, are illustrated. Here, preliminary results show up to 8.5x improvement at the selected kernel level with the first approach, and up to 50% improvement in total simulated time with the latter were achieved for the demonstration cases and target HPC systems employed.

97 MATHEMATICS AND COMPUTING↗

Parallelizing AT with MatlabMPI

The Accelerator Toolbox (AT) is a high-level collection of tools and scripts specifically oriented toward solving problems dealing with computational accelerator physics. It is integrated into the MATLAB environment, which provides an accessible, intuitive interface for accelerator physicists, allowing researchers to focus the majority of their efforts on simulations and calculations, rather than programming and debugging difficulties. Efforts toward parallelization of AT have been put in place to upgrade its performance to modern standards of computing. We utilized the packages MatlabMPI and pMatlab, which were developed by MIT Lincoln Laboratory, to set up a message-passing environment that could be called within MATLAB, which set up the necessary pre-requisites for multithread processing capabilities. On local quad-core CPUs, we were able to demonstrate processor efficiencies of roughly 95% and speed increases of nearly 380%. By exploiting the efficacy of modern-day parallel computing, we were able to demonstrate incredibly efficient speed increments per processor in AT's beam-tracking functions. Extrapolating from prediction, we can expect to reduce week-long computation runtimes to less than 15 minutes. This is a huge performance improvement and has enormous implications for the future computing power of the accelerator physics group at SSRL. However, one of the downfalls of parringpass is its current lack of transparency; the pMatlab and MatlabMPI packages must first be well-understood by the user before the system can be configured to run the scripts. In addition, the instantiation of argument parameters requires internal modification of the source code. Thus, parringpass, cannot be directly run from the MATLAB command line, which detracts from its flexibility and user-friendliness. Future work in AT's parallelization will focus on development of external functions and scripts that can be called from within MATLAB and configured on multiple nodes, while expending minimal communication overhead with the integrated MATLAB library.

43 PARTICLE ACCELERATORS↗

Integrating Asynchronous Task Parallelism with OpenSHMEM, In: OpenSHMEM 2016: OpenSHMEM and Related Technologies. Enhancing OpenSHMEM for Hybrid Environments

Partitioned Global Address Space (PGAS) programming models combine shared and distributed memory features, and provide a foundation for high-productivity parallel programming using lightweight one-sided communications. The OpenSHMEM programming interface has recently begun gaining popularity as a lightweight library-based approach for developing PGAS applications, in part through its use of a symmetric heap to realize more efficient implementations of global pointers than in other PGAS systems. However, current approaches to hybrid inter-node and intra-node parallel programming in OpenSHMEM rely on the use of multithreaded programming models (e.g., pthreads, OpenMP) that harness intra-node parallelism but are opaque to the OpenSHMEM runtime. This OpenSHMEM+X approach can encounter performance challenges such as bottlenecks on shared resources, long pause times due to load imbalances, and poor data locality. Furthermore, OpenSHMEM+X requires the expertise of hero-level programmers, compared to the use of just OpenSHMEM. All of these are hard challenges to mitigate with incremental changes. This situation will worsen as computing nodes increase their use of accelerators and heterogeneous memories.

Computer Science↗

Probabilistic Resilience-Oriented Assessment Approach for Transmission Networks Under Wildfires

The rising threat of wildfires poses significant challenges to power transmission networks, particularly in areas prone to such disasters. Traditional approaches for wildfire risk assessment neglect some potential wildfire scenarios. Here, this paper introduces a probabilistic resilience-oriented assessment approach for power transmission networks to address this gap. Initially, a probabilistic wildfire model is developed to capture uncertainties in ignition, intensity, and fire spread. Next, a spatiotemporal fragility model is constructed to assess the impact of wildfires on transmission corridors, incorporating Thermal Aging (TA) and Dynamic Thermal Rate (DTR) change. Finally, a comprehensive resilience metric is defined to evaluate system performance, leveraging the fragility model to determine component and system-level resilience. The approach employs a combinatorial enumeration method to generate potential wildfire scenarios, enhanced by an impact-increment-based state enumeration (IISE) method for computational efficiency. The proposed method provides critical insights for identifying system vulnerabilities and developing robust strategies to protect transmission networks from wildfires. The efficacy of this approach is validated through extensive scenarios of the RTS-GMLC system across Southern California, Nevada and Arizona.

Vahedi, Soroush [Univ. of Connecticut, Storrs, CT ↗

Mesoscopic Modeling and Rapid Simulation of Incremental Changes in Epidemic Scenarios on GPUs

In simulation-based studies and analyses of epidemics, a major challenge lies in resolving the conflict between fidelity of models and the speed of their simulation. Another related challenge arises in dealing with the large number of what–if scenarios that need to be explored. Here, we describe new computational methods that together provide an approach to dealing with both challenges. A mesoscopic modeling approach is described that strikes a middle ground between macroscopic models based on coupled differential equations and microscopic models built on fine-grained behaviors at the individual entity level. The mesoscopic approach offers the ability to incorporate complex compositions of multiple layers of dynamics even while retaining the potential for aggregate behaviors at varying levels. It also is an excellent match to the accelerator-based architectures of modern computing platforms in which graphical processing units (GPUs) can be exploited for fast simulation via the parallel execution mode of single instruction multiple thread (SIMT). The challenge of simulating a large number of scenarios is addressed via a method of sharing model state and computation across a tree of what–if scenarios that are localized, incremental changes to a large base simulation. A combination of the mesoscopic modeling approach and the incremental what–if scenario tree evaluation has been implemented in the software on modern GPUs. Synthetic simulation scenarios are presented to demonstrate the computational characteristics of our approach. Results from the experiments with large population data, including USA, UK, and India, illustrate the modeling methodology and computational performance on thousands of synthetically generated what–if scenarios. Execution of our implementation scaled to 8192 GPUs of supercomputing platforms demonstrates the ability to rapidly evaluate what–if scenarios several orders of magnitude faster than the conventional methods.

97 MATHEMATICS AND COMPUTING↗

Decomposing the Train-Scheduling Problem into Integer-Optimal Polytopes

This paper presents conditions for which the linear relaxation for the train-scheduling problem is integer optimal. These conditions are then used to identify how to partition a general problem’s feasible region into integer-optimal polytopes. Such an approach yields an extended formulation that contains far fewer binary variables. Our computational experiments show that this approach results in significant computational savings. Moreover, this approach scales well when the train-scheduling problem is modeled using smaller time increments, allowing for higher fidelity models to be solved without significantly increasing the required computational time.

97 MATHEMATICS AND COMPUTING↗

Incremental nonnegative matrix factorization based on correlation and graph regularization for matrix completion

Matrix factorization is widely used in recommendation systems, text mining, face recognition and computer vision. As one of the most popular methods, nonnegative matrix factorization and its incremental variants have attracted much attention. The existing incremental algorithms are established based on the assumption of samples are independent and only update the new latent variable of weighting coefficient matrix when the new sample comes, which may lead to inferior solutions. To address this issue, we investigate a novel incremental nonnegative matrix factorization algorithm based on correlation and graph regularizer (ICGNMF). The correlation is mainly used for finding out those correlated rows to be updated, that is, we assume that samples are dependent on each other. We derive the updating rules for ICGNMF by considering the correlation. We also present tests on widely used image datasets, and show ICGNMF reduces the error by comparing other methods.

Zhang, Xiaoxia↗