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 109 records · Page 6

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↗

Extraction and classification of objects in multispectral images

Presented here is an algorithm that partitions a digitized multispectral image into parts that correspond to objects in the scene being sensed. The algorithm partitions an image into successively smaller rectangles and produces a partition that tends to minimize a criterion function. Supervised and unsupervised classification techniques can be applied to partitioned images. This partition-then-classify approach is used to process images sensed from aircraft and the ERTS-1 satellite, and the method is shown to give relatively accurate results in classifying agricultural areas and extracting urban areas.

Robertson, T. V.↗

Multi-time-step integration using nodal partitioning

An algorithm is presented which integrates different groups of nodes of a finite element mesh with different time steps and different integrators. Since the nodal groups are updated independently no unsymmetric systems need be solved. Stability is demonstrated by showing that an energy norm of the solution decreases after every update if the time step is less than a given critical value. The element eigenvalue inequality theorem is used to give the critical time step in terms of element eigenvalues.

Smolinski, P.↗

Parallel adaptive mesh refinement within the PUMAA3D Project

To enable the solution of large-scale applications on distributed memory architectures, we are designing and implementing parallel algorithms for the fundamental tasks of unstructured mesh computation. In this paper, we discuss efficient algorithms developed for two of these tasks: parallel adaptive mesh refinement and mesh partitioning. The algorithms are discussed in the context of two-dimensional finite element solution on triangular meshes, but are suitable for use with a variety of element types and with h- or p-refinement. Results demonstrating the scalability and efficiency of the refinement algorithm and the quality of the mesh partitioning are presented for several test problems on the Intel DELTA.

Freitag, Lori↗

Parallel algorithms for placement and routing in VLSI design

The computational requirements for high quality synthesis, analysis, and verification of very large scale integration (VLSI) designs have rapidly increased with the fast growing complexity of these designs. Research in the past has focused on the development of heuristic algorithms, special purpose hardware accelerators, or parallel algorithms for the numerous design tasks to decrease the time required for solution. Two new parallel algorithms are proposed for two VLSI synthesis tasks, standard cell placement and global routing. The first algorithm, a parallel algorithm for global routing, uses hierarchical techniques to decompose the routing problem into independent routing subproblems that are solved in parallel. Results are then presented which compare the routing quality to the results of other published global routers and which evaluate the speedups attained. The second algorithm, a parallel algorithm for cell placement and global routing, hierarchically integrates a quadrisection placement algorithm, a bisection placement algorithm, and the previous global routing algorithm. Unique partitioning techniques are used to decompose the various stages of the algorithm into independent tasks which can be evaluated in parallel. Finally, results are presented which evaluate the various algorithm alternatives and compare the algorithm performance to other placement programs. Measurements are presented on the parallel speedups available.

Brouwer, Randall Jay↗

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↗

Evaluating the performance of multicomputer configurations

Steps to optimize the performance of a multicomputer system (MCS) are discussed. Three aspects are emphasized: (1) the interconnection scheme that ties all the processors together, (2) the scheduling and mapping of the algorithm on the architecture, and (3) the mechanism for detecting parallelism and partitioning the algorithm into modules which achieve computational speedup when run on an MCS. Mapping and scheduling issues are addressed, and an application example is given.

Agrawal, D. P.↗

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↗

Algorithms for parallel flow solvers on message passing architectures

The purpose of this project has been to identify and test suitable technologies for implementation of fluid flow solvers -- possibly coupled with structures and heat equation solvers -- on MIMD parallel computers. In the course of this investigation much attention has been paid to efficient domain decomposition strategies for ADI-type algorithms. Multi-partitioning derives its efficiency from the assignment of several blocks of grid points to each processor in the parallel computer. A coarse-grain parallelism is obtained, and a near-perfect load balance results. In uni-partitioning every processor receives responsibility for exactly one block of grid points instead of several. This necessitates fine-grain pipelined program execution in order to obtain a reasonable load balance. Although fine-grain parallelism is less desirable on many systems, especially high-latency networks of workstations, uni-partition methods are still in wide use in production codes for flow problems. Consequently, it remains important to achieve good efficiency with this technique that has essentially been superseded by multi-partitioning for parallel ADI-type algorithms. Another reason for the concentration on improving the performance of pipeline methods is their applicability in other types of flow solver kernels with stronger implied data dependence. Analytical expressions can be derived for the size of the dynamic load imbalance incurred in traditional pipelines. From these it can be determined what is the optimal first-processor retardation that leads to the shortest total completion time for the pipeline process. Theoretical predictions of pipeline performance with and without optimization match experimental observations on the iPSC/860 very well. Analysis of pipeline performance also highlights the effect of uncareful grid partitioning in flow solvers that employ pipeline algorithms. If grid blocks at boundaries are not at least as large in the wall-normal direction as those immediately adjacent to them, then the first processor in the pipeline will receive a computational load that is less than that of subsequent processors, magnifying the pipeline slowdown effect. Extra compensation is needed for grid boundary effects, even if all grid blocks are equally sized.

Vanderwijngaart, Rob F.↗

Stratway: A Modular Approach to Strategic Conflict Resolution

In this paper we introduce Stratway, a modular approach to finding long-term strategic resolutions to conflicts between aircraft. The modular approach provides both advantages and disadvantages. Our primary concern is to investigate the implications on the verification of safety-critical properties of a strategic resolution algorithm. By partitioning the problem into verifiable modules much stronger verification claims can be established. Since strategic resolution involves searching for solutions over an enormous state space, Stratway, like most similar algorithms, searches these spaces by applying heuristics, which present especially difficult verification challenges. An advantage of a modular approach is that it makes a clear distinction between the resolution function and the trajectory generation function. This allows the resolution computation to be independent of any particular vehicle. The Stratway algorithm was developed in both Java and C++ and is available through a open source license. Additionally there is a visualization application that is helpful when analyzing and quickly creating conflict scenarios.

Hagen, George E.↗

Efficient algorithms for a class of partitioning problems

The problem of optimally partitioning the modules of chain- or tree-like tasks over chain-structured or host-satellite multiple computer systems is addressed. This important class of problems includes many signal processing and industrial control applications. Prior research has resulted in a succession of faster exact and approximate algorithms for these problems. Polynomial exact and approximate algorithms are described for this class that are better than any of the previously reported algorithms. The approach is based on a preprocessing step that condenses the given chain or tree structured task into a monotonic chain or tree. The partitioning of this monotonic take can then be carried out using fast search techniques.

Iqbal, M. Ashraf↗

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↗