Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned algorithm”

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 73 records · Page 4

GraphMeta: Managing HPC Rich Metadata in Graphs

High-performance computing (HPC) systems face increasingly critical metadata management challenges, especially in the approaching exascale era. These challenges arise not only from exploding metadata volumes, but also from increasingly diverse metadata, which contains data provenance and arbitrary user-defined attributes in addition to traditional POSIX metadata. This ‘rich’ metadata is becoming critical to supporting advanced data management functionality such as data auditing and validation. In our prior work, we identified a graph-based model as a promising solution to uniformly manage HPC rich metadata due to its flexibility and generality. However, at the same time, graph-based HPC rich metadata anagement also introduces significant challenges to the underlying infrastructure. In this study, we first identify the challenges on the underlying infrastructure to support scalable, high-performance rich metadata management. Based on that, we introduce GraphMeta, a graphbased engine designed for this use case. It achieves performance scalability by introducing a new graph partitioning algorithm and a write-optimal storage engine. We evaluate GraphMeta under both synthetic and real HPC metadata workloads, compare it with other approaches, and demonstrate its advantages in terms of efficiency and usability for rich metadata management in HPC systems.

Dai, Dong↗

Futility

The Futility package contains the following: 1) Definition of the size of integers and real numbers; 2) A generic Unit test harness; 3) Definitions for some basic extensions to the Fortran language: arbitrary length strings, a parameter list construct, exception handlers, command line processor, timers; 4) Geometry definitions: point, line, plane, box, cylinder, polyhedron; 5) File wrapper functions: standard Fortran input/output files, Fortran binary files, HDF5 files; 6) Parallel wrapper functions: MPI, and Open MP abstraction layers, partitioning algorithms; 7) Math utilities: BLAS, Matrix and Vector definitions, Linear Solver methods and wrappers for other TPLs (PETSC, MKL, etc), preconditioner classes; 8) Misc: random number generator, water saturation properties, sorting algorithms.

Collins, Benjamin S.↗

Evaluation of Stimulation by Shear Slip in Fractured Rock Using a 3D Coupled Thermo-Poro-Mechanical FEM

This paper presents a 3D finite element model for simulating shear slip on fractures in rock in response to coupled thermo-poro-mechanical processes. The modeling is part of a broader effort to investigate the role of pore pressure and cooling by cold water injection on shear slip and permeability increase in granitic rock using laboratory shearing experiments under triaxial conditions. In particular, 3D thermo-poro-mechanical finite element modeling and analysis of injection experiment in fractured rock has been carried out to analyze the role of pore pressure, temperature, fracture deformation and their interactions. 4-noded tetrahedral elements are employed for intact rock deformation and transport processes within the matrix. To represent the mechanical response of a fracture surface, zero thickness contact interface element is developed based on recently developed element partitioning algorithm and procedures for applying hydraulic pressure on the fracture surfaces. A Mohr-Coulomb type criterion is adapted to capture the slip on the fracture and to quantify its reversible and irreversible deformation. The numerical model has been calibrated using results from well controlled, advanced laboratory experiments. Excellent agreement between modeling and experimental observations is achieved. Simulation results illustrate that pore pressure increase and rock matrix/fracture surface cooling cause the fracture system to deform and slip. Fracture slip is promoted due to its normal stress reduction associated with cooling effect of cold fluid injection. The numerical model provides a physics-based understanding of the role of coupled processes on shear stimulation phenomenon and the resulting permeability enhancement.

58 GEOSCIENCES↗

Data-driven estimation of energy consumption for electric bus under real-world driving conditions

Reliable and accurate estimation of an electric bus’s instantaneous energy consumption is critical in evaluating energy impacts of planning and control of electric bus operations. In this study, we developed machine learning-based long short-term memory (LSTM) and artificial neural network (ANN) models to estimate 1 Hz energy consumption of electric buses based on continuous monitoring data of electric buses in Chattanooga, Tennessee, in 2019 and 2020. We propose a data-partitioning algorithm to separate energy charging and discharging modes before applying data-driven estimation models. Here, a K-fold cross-validation-based model selection process was conducted to identify the optimal model structure and input variables in terms of prediction accuracy. The estimation results show the predicted mean absolute percentage error rates of LSTM and ANN models were 3% and 5%, respectively. We compared the proposed models with existing models in the literature based on the same testing data to demonstrate the predictability of our models.

Artificial neural network↗

GSplit: Scaling Graph Neural Network Training on Large Graphs via Split-Parallelism

Graph neural networks (GNNs), an emerging class of machine learning models for graphs, have gained popularity for their superior performance in various graph analytical tasks. Mini-batch training is commonly used to train GNNs on large graphs, and data parallelism is the standard approach to scale mini-batch training across multiple GPUs. Data parallel approaches contain redundant work as subgraphs sampled by different GPUs contain significant overlap. To address this issue, we introduce a hybrid parallel mini-batch training paradigm called Split parallelism. Split parallelism avoids redundant work by splitting the sampling, loading, and training of each mini-batch across multiple GPUs. Split parallelism, however, introduces communication overheads that can be more than the savings from removing redundant work. We further present a lightweight partitioning algorithm that probabilistically minimizes these overheads. We implement spllit parllelism in GSplit and show that it outperforms state-of-the-art mini-batch training systems like DGL, Quiver, and P3.

Lim, Seung-Hwan [ORNL] (ORCID:0000000194616866)↗

A unified algorithm for predicting partition coefficients for PBPK modeling of drugs and environmental chemicals

The algorithms in the literature focusing to predict tissue:blood PC (P{sub tb}) for environmental chemicals and tissue:plasma PC based on total (K{sub p}) or unbound concentration (K{sub pu}) for drugs differ in their consideration of binding to hemoglobin, plasma proteins and charged phospholipids. The objective of the present study was to develop a unified algorithm such that P{sub tb}, K{sub p} and K{sub pu} for both drugs and environmental chemicals could be predicted. The development of the unified algorithm was accomplished by integrating all mechanistic algorithms previously published to compute the PCs. Furthermore, the algorithm was structured in such a way as to facilitate predictions of the distribution of organic compounds at the macro (i.e. whole tissue) and micro (i.e. cells and fluids) levels. The resulting unified algorithm was applied to compute the rat P{sub tb}, K{sub p} or K{sub pu} of muscle (n = 174), liver (n = 139) and adipose tissue (n = 141) for acidic, neutral, zwitterionic and basic drugs as well as ketones, acetate esters, alcohols, aliphatic hydrocarbons, aromatic hydrocarbons and ethers. The unified algorithm reproduced adequately the values predicted previously by the published algorithms for a total of 142 drugs and chemicals. The sensitivity analysis demonstrated the relative importance of the various compound properties reflective of specific mechanistic determinants relevant to prediction of PC values of drugs and environmental chemicals. Overall, the present unified algorithm uniquely facilitates the computation of macro and micro level PCs for developing organ and cellular-level PBPK models for both chemicals and drugs.

60 APPLIED LIFE SCIENCES↗

A parallel evolutionary multiple-try metropolis Markov chain Monte Carlo algorithm for sampling spatial partitions

We develop an Evolutionary Markov Chain Monte Carlo (EMCMC) algorithm for sampling spatial partitions that lie within a large, complex, and constrained spatial state space. Our algorithm combines the advantages of evolutionary algorithms (EAs) as optimization heuristics for state space traversal and the theoretical convergence properties of Markov Chain Monte Carlo algorithms for sampling from unknown distributions. Local optimality information that is identified via a directed search by our optimization heuristic is used to adaptively update a Markov chain in a promising direction within the framework of a Multiple-Try Metropolis Markov Chain model that incorporates a generalized Metropolis-Hastings ratio. We further expand the reach of our EMCMC algorithm by harnessing the computational power afforded by massively parallel computing architecture through the integration of a parallel EA framework that guides Markov chains running in parallel.

97 MATHEMATICS AND COMPUTING↗

CARPE DIEM: Coupled Algorithms for Robust Partitioning of Equations for the Dynamic Interactions of Evolving Materials

From aircraft design to non-proliferation, technical and policy decisions are becoming increasingly reliant on simulation of complex, real-world, multi-physics systems involving multiple interacting domains. As the power of computers has grown, deficiencies associated with traditional low-order-accurate mechanisms for inter-domain coupling have become increasingly apparent. The CARPE DIEM project addressed such deficiencies in the context of fluid-structure interaction (FSI) by developing new algorithms and simulation techniques that are based on a novel and rigorous mathematical approach and that are designed for efficiency on modern high-performance computing platforms.

36 MATERIALS SCIENCE↗

Multicomponent dynamics of coupled quantum subspaces and field-induced molecular ionizations

To describe successive ionization steps of a many-electron atom or molecule driven by an ultrashort, intense laser pulse, we introduce a hierarchy of successive two-subspace Feshbach partitions of the N-electron Hilbert space, and solve the partitioned time-dependent Schrödinger equation by a short-time unitary algorithm. The partitioning scheme allows one to use different level of theory to treat the many-electron dynamics in different subspaces. We illustrate the procedure on a simple two-active-electron model molecular system subjected to a few-cycle extreme Ultra-Violet (XUV) pulse to study channel-resolved photoelectron spectra as a function of the pulse's central frequency and duration. We observe how the momentum and kinetic-energy distributions of photoelectrons accompanying the formation of the molecular cation in a given electronic state (channel) change as the XUV few-cycle pulse's width is varied, from a form characteristic of an impulsive ionization regime, corresponding to the limit of a delta-function pulse, to a form characteristic of multiphoton above-threshold ionization, often associated with continuous-wave infinitely long pulse.

74 ATOMIC AND MOLECULAR PHYSICS↗

WE-E-17A-06: Assessing the Scale of Tumor Heterogeneity by Complete Hierarchical Segmentation On MRI

Purpose: In many cancers, intratumoral heterogeneity exists in vascular and genetic structure. We developed an algorithm which uses clinical imaging to interrogate different scales of heterogeneity. We hypothesize that heterogeneity of perfusion at large distance scales may correlate with propensity for disease recurrence. We applied the algorithm to initial diagnosis MRI of rhabdomyosarcoma patients to predict recurrence. Methods: The Spatial Heterogeneity Analysis by Recursive Partitioning (SHARP) algorithm recursively segments the tumor image. The tumor is repeatedly subdivided, with each dividing line chosen to maximize signal intensity difference between the two subregions. This process continues to the voxel level, producing segments at multiple scales. Heterogeneity is measured by comparing signal intensity histograms between each segmented region and the adjacent region. We measured the scales of contrast enhancement heterogeneity of the primary tumor in 18 rhabdomyosarcoma patients. Using Cox proportional hazards regression, we explored the influence of heterogeneity parameters on relapse-free survival (RFS). To compare with existing methods, fractal and Haralick texture features were also calculated. Results: The complete segmentation produced by SHARP allows extraction of diverse features, including the amount of heterogeneity at various distance scales, the area of the tumor with the most heterogeneity at each scale, and for a given point in the tumor, the heterogeneity at different scales. 10/18 rhabdomyosarcoma patients suffered disease recurrence. On contrast-enhanced MRI, larger scale of maximum signal intensity heterogeneity, relative to tumor diameter, predicted for shorter RFS (p=0.05). Fractal dimension, fractal fit, and three Haralick features did not predict RFS (p=0.09-0.90). Conclusion: SHARP produces an automatic segmentation of tumor regions and reports the amount of heterogeneity at various distance scales. In rhabdomyosarcoma, RFS was shorter when the primary tumor exhibited larger scale of heterogeneity on contrast-enhanced MRI. If validated on a larger dataset, this imaging biomarker could be useful to help personalize treatment.

60 APPLIED LIFE SCIENCES↗

Enhanced Approximate Nearest Neighbor via Local Area Focused Search.

Approximate Nearest Neighbor (ANN) algorithms are increasingly important in machine learning, data mining, and image processing applications. There is a large family of space- partitioning ANN algorithms, such as randomized KD-Trees, that work well in practice but are limited by an exponential increase in similarity comparisons required to optimize recall. Additionally, they only support a small set of similarity metrics. We present Local Area Fo- cused Search (LAFS), a method that enhances the way queries are performed using an existing ANN index. Instead of a single query, LAFS performs a number of smaller (fewer similarity comparisons) queries and focuses on a local neighborhood which is refined as candidates are identified. We show that our technique improves performance on several well known datasets and is easily extended to general similarity metrics using kernel projection techniques.

97 MATHEMATICS AND COMPUTING↗

Paleo-Megadroughts and Abrupt Climate Changes in the Speleothem Records. Final report

This project is motivated by the speleothem isotope records in Asia, which show regional responses in the hydrologic cycle to different climate forcings. Speleothem isotopic records are typically interpreted in terms of local precipitation variations or monsoon intensity. Our study demonstrates that non-local processes also play an important role. We started this project to understand the regional difference in speleothem isotopic composition between the Last Glacial Maximum (LGM) and the present-day. The record in Southwest China showed greater depletion during the LGM compared to those in East China. Our modeling and analysis showed that speleothems record, in addition, large scale changes in atmospheric circulation and moisture transport and their subsequent impact on precipitation. We developed an algorithm to partition total precipitation according to their formation dynamics, namely into frontal and non-frontal precipitation, and showed that the two have different trends and hence different causal mechanism. We then focused our subsequent attention on circulation impacts on precipitation changes. We applied a machine learning algorithm to detect rainbands in the ERA-Interim reanalysis product, and showed that the seasonal migrations of the rainbands are tied to the seasonal migrations of the jet stream, in particular the northerlies of the jet meanders. These northerlies, in turn, are partly topographic Rossby waves excited as the upstream westerlies impinge on the Tibetan Plateau. The seasonal variations of these upstream westerlies thus contribute to the seasonal movements of the rainbands and regional precipitation changes. Our analysis of the modern precipitation isotope record further confirms the importance of jet stream changes in the isotopic variations and shows that isotope-enriched years have reduced summer seasonality, with less pronounced northward migration of the jet.

54 ENVIRONMENTAL SCIENCES↗

Spectral Clustering-Based Partitioning of Large-Scale Power Electronics-Based Power Systems for Small-Signal Stability Analysis

The nodal admittance matrix (NAM)-based approach is well-suited for small-signal stability analysis of large-scale power electronics-based power systems (PEPSs), as it preserves the system structure through its admittance matrix. Previous studies have explored partitioning such systems into subareas and interconnections to reduce computational burden; however, they lacked a formal algorithmic procedure for determining feasible partitions. While several grid partitioning methods, such as those based on graph theory or machine learning, exist in the literature, they cannot be directly applied to NAM-based analysis due to differing objectives and constraints. Here, this paper addresses this gap by presenting a systematic, step-by-step procedure for applying a spectral partitioning algorithm that yields a division of the system into subareas suitable for NAM-based analysis. The computational complexity of the proposed method is also derived to demonstrate its efficiency and justify the practicality of the resulting subarea decomposition. The performance of the partitioning method is evaluated by applying the spectral clustering-derived subareas and interconnections to the NAM-based partitioning approach on a 140-bus system. Computational times for the full-system and partitioned NAM analyses are compared using MATLAB. Additionally, PSCAD simulations of the complete system and partitioned subareas are carried out to verify the effectiveness of the proposed method.

Nupur [Univ. of Tennessee, Knoxville, TN (United S↗

Efficient Extraction of High Centrality Vertices in Distributed Graphs

Betweenness centrality (BC) is an important measure for identifying high value or critical vertices in graphs, in variety of domains such as communication networks, road networks, and social graphs. However, calculating betweenness values is prohibitively expensive and, more often, domain experts are interested only in the vertices with the highest centrality values. In this paper, we first propose a partition-centric algorithm (MS-BC) to calculate BC for a large distributed graph that optimizes resource utilization and improves overall performance. Further, we extend the notion of approximate BC by pruning the graph and removing a subset of edges and vertices that contribute the least to the betweenness values of other vertices (MSL-BC), which further improves the runtime performance. We evaluate the proposed algorithms using a mix of real-world and synthetic graphs on an HPC cluster and analyze its strengths and weaknesses. The experimental results show an improvement in performance of upto 12x for large sparse graphs as compared to the state-of-the-art, and at the same time highlights the need for better partitioning methods to enable a balanced workload across partitions for unbalanced graphs such as small-world or power-law graphs.

97 MATHEMATICS AND COMPUTING↗

Thunderstorm Cloud-Type Classification from Space-Based Lightning Imagers

The organization and structure of thunderstorms determines the extent and severity of their hazards to the general public and their consequences for the Earth system. Distinguishing vigorous convective regions that produce heavy rain and hail from adjacent regions of stratiform clouds or overhanging anvil clouds that produce light to no rainfall is valuable in operations and physical research. Cloud-type algorithms that partition convection from stratiform regions have been developed for space-based radar, passive microwave, and now Geostationary Operational Environmental Satellites (GOES) Advanced Baseline Imager (ABI) multispectral products. However, there are limitations for each of these products including temporal availability, spatial coverage, and the degree to which they based on cloud microphysics. We report we have developed a cloud-type algorithm for GOES Geostationary Lightning Mapper (GLM) observations that identifies convective/nonconvective regions in thunderstorms based on signatures of interactions with nonconvective charge structures in the lightning flash data. The GLM sensor permits a rapid (20 s) update cycle over the combined GOES-16–GOES-17 domain across all hours of the day. Storm regions that do not produce lightning will not be classified by our algorithm, however. The GLM cloud-type product is intended to provide situational awareness of electrified nonconvective clouds and to complement other cloud-type retrievals by providing a contemporary assessment tied to lightning physics. We propose that a future combined ABI–GLM cloud-type algorithm would be a valuable product that could draw from the strengths of each instrument and approach.

54 ENVIRONMENTAL SCIENCES↗

Virtual-Voltage Partition-Based Approach to Optimal Transmission Switching

This article deals with optimal transmission switching (OTS) problems involving binary decisions about network topology and nonconvex power flow constraints. We adopt a semidefinite programming formulation for the optimal power flow (OPF) problem that, however, remains nonconvex due to the presence of discrete variables and bilinear products between the decision variables. To tackle the latter, we introduce a physically inspired, virtual-voltage approximation that leads to provable lower and upper bounds on the solution of the original problem. To deal with the exponential complexity caused by the discrete variables, we introduce a graph partition-based algorithm that breaks the problem into several parallel mixed-integer subproblems of smaller size. Simulations on the IEEE bus test cases demonstrate the high degree of accuracy and affordable computational requirements of our approach.

42 ENGINEERING↗

Hybrid and Parallel Domain-Decomposition Methods Development to Enable Monte Carlo for Reactor Analyses

This paper describes code and methods development at the Oak Ridge National Laboratory focused on enabling high-fidelity, large-scale reactor analyses with Monte Carlo (MC). Current state-of-the-art tools and methods used to perform real commercial reactor analyses have several undesirable features, the most significant of which is the non-rigorous spatial decomposition scheme. Monte Carlo methods, which allow detailed and accurate modeling of the full geometry and are considered the gold standard for radiation transport solutions, are playing an ever-increasing role in correcting and/or verifying the deterministic, multi-level spatial decomposition methodology in current practice. However, the prohibitive computational requirements associated with obtaining fully converged, system-wide solutions restrict the role of MC to benchmarking deterministic results at a limited number of state-points for a limited number of relevant quantities. The goal of this research is to change this paradigm by enabling direct use of MC for full-core reactor analyses. The most significant of the many technical challenges that must be overcome are the slow, non-uniform convergence of system-wide MC estimates and the memory requirements associated with detailed solutions throughout a reactor (problems involving hundreds of millions of different material and tally regions due to fuel irradiation, temperature distributions, and the needs associated with multi-physics code coupling). To address these challenges, our research has focused on the development and implementation of (1) a novel hybrid deterministic/MC method for determining high-precision fluxes throughout the problem space in k-eigenvalue problems and (2) an efficient MC domain-decomposition (DD) algorithm that partitions the problem phase space onto multiple processors for massively parallel systems, with statistical uncertainty estimation. The hybrid method development is based on an extension of the FW-CADIS method, which attempts to achieve uniform statistical uncertainty throughout a designated problem space. The MC DD development is being implemented in conjunction with the Denovo deterministic radiation transport package to have direct access to the 3-D, massively parallel discrete-ordinates solver (to support the hybrid method) and the associated parallel routines and structure. This paper describes the hybrid method, its implementation, and initial testing results for a realistic 2-D quarter core pressurized-water reactor model and also describes the MC DD algorithm and its implementation.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗