Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchical 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 433 records · Page 24

A Performance Portable, Fully Implicit Landau Collision Operator with Batched Linear Solvers

Modern accelerators use hierarchical parallel programming models that enable massive multithreading within a processing element (PE), with multiple PEs per device driven by traditional processes. Batching is a technique for exposing PE-level parallelism in algorithms that have traditionally run on MPI processes or multiple threads within a single process. Opportunities for batching arise in, for example, kinetic discretizations of magnetized plasmas where collisions are advanced in velocity space at each spatial point independently. This paper builds on previous work on a high-performance, fully nonlinear, Landau collision operator by batching the linear solver, as well as batching the spatial point problems and adding new support for multiple grids for multiscale, multispecies problems. An anisotropic relaxation verification test that agrees well with previously published results and analytical models is presented. The performance results from NVIDIA A100 and AMD MI250X nodes are presented with hardware utilization analysis for each architecture. Finally, the entire implicit Landau operator time advance is implemented in Kokkos for performance portability, running entirely on the device and is available in the PETSc numerical library.

97 MATHEMATICS AND COMPUTING↗

The architecture of a video image processor for the space station

The architecture of a video image processor for space station applications is described. The architecture was derived from a study of the requirements of algorithms that are necessary to produce the desired functionality of many of these applications. Architectural options were selected based on a simulation of the execution of these algorithms on various architectural organizations. A great deal of emphasis was placed on the ability of the system to evolve and grow over the lifetime of the space station. The result is a hierarchical parallel architecture that is characterized by high level language programmability, modularity, extensibility and can meet the required performance goals.

Yalamanchili, S.↗

Decentralized hierarchical partitioning of centralized integrated controllers

A framework for a decentralized hierarchical controller partitioning structure is developed. This structure allows for the design of separate airframe and propulsion controllers which, when assembled, will meet the overall design criterion for the integrated airframe/propulsion system. An algorithm based on parameter optimization of the state-space representation for the subsystem controllers is described. The algorithm is currently being applied to an integrated flight propulsion control design example.

Schmidt, Phillip↗

Predicting Future Hourly Residential Electrical Consumption: A Machine Learning Case Study

Whole building input models for energy simulation programs are frequently created in order to evaluate specific energy savings potentials. They are also often utilized to maximize cost-effective retrofits for existing buildings as well as to estimate the impact of policy changes toward meeting energy savings goals. Traditional energy modeling suffers from several factors, including the large number of inputs required to characterize the building, the specificity required to accurately model building materials and components, simplifying assumptions made by underlying simulation algorithms, and the gap between the as-designed and as-built building. Prior works have attempted to mitigate these concerns by using sensor-based machine learning approaches to model energy consumption. However, a majority of these prior works focus only on commercial buildings. The works that focus on modeling residential buildings primarily predict monthly electrical consumption, while commercial models predict hourly consumption. This means there is not a clear indicator of which techniques best model residential consumption, since these methods are only evaluated using low-resolution data. We address this issue by testing seven different machine learning algorithms on a unique residential data set, which contains 140 different sensors measurements, collected every 15 minutes. In addition, we validate each learner's correctness on the ASHRAE Great Energy Prediction Shootout, using the original competition metrics. Our validation results confirm existing conclusions that Neural Network-based methods perform best on commercial buildings. However, the results from testing our residential data set show that Feed Forward Neural Networks, Support Vector Regression (SVR), and Linear Regression methods perform poorly, and that Hierarchical Mixture of Experts (HME) with Least Squares Support Vector Machines (LS-SVM) performs best - a technique not previously applied to this domain.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

A Novel Algorithm for CAD to CSG Conversion in McCAD

Modeling and simulation lie at the heart of the design process of any nuclear application. An accurate representation of the radiation environment ensures not only the feasibility of new technologies, but it also aids in operation, maintenance, and even decommissioning. With increasingly complex designs, high-fidelity models have become a necessity for design maturity. McCAD has been under development for many years at Karlsruhe Institute of Technology (KIT) to facilitate the process of generating suitable models for nuclear analyses. In this paper, an overview of the major advances in the new version of the code is presented. A novel conversion algorithm has proven to be robust in significantly reducing the processing time to generate radiation transport models, making it easier to iterate on design details. A first-of-a-kind capability to generate hierarchical void cells is also discussed with preliminary analysis showing performance gains for particle tracking.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

End-To-End Decentralized Transmission Line Protection in IBR-Dominated Weak Grids Using Interpretable Data-Driven Methods

Traditional transmission line protection relies on predictable synchronous-based fault signatures, which frequently fail under the non-standard, current-limited fault characteristics of Inverter-Based Resources (IBRs). This study investigates how to achieve secure, communication-free fault isolation in IBR-dominated weak grids without relying on opaque, computationally heavy "black-box" machine learning algorithms. To address this, we propose a novel, standalone, and inherently interpretable data-driven protection framework. Unlike centralized methods requiring multi-terminal communication, this decentralized approach relies solely on local measurements using a hierarchical linear-kernel Support Vector Machine (SVM). The methodology decomposes the protection task into four sequential stages that mimic traditional protection elements: fault detection and fault direction identification, fault type classification, zone classification, and location estimation. This multi-stage architecture allows for specialized feature engineering at each stage, combining high computational efficiency with logic traceability. The framework's end-to-end performance was validated via C-code and PSCAD/EMTDC co-simulation, utilizing a real-world utility network and an OEM black-box IBR model. The proposed relay achieves 97.2% overall accuracy and provides a reliable trip decision within a 2.5-cycle window. The results confirm 100% accuracy in fundamental fault detection, reliable zone selectivity across low to moderate fault resistances, and robust security against non-fault transients, proving its immediate viability for integration into commercial numerical relays.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Did the GPU obfuscate the load imbalance in my MPI simulation?

The current proliferation of GPU-based HPC systems necessitates a method for assessing the performance of simulations on heterogeneous machines. The addition of GPUs to a system adds multiple hierarchical levels of parallelism to the node architecture. In this paper, we demonstrate that the traditional load imbalance metric is insufficient for capturing the load imbalance on GPU-based machines, since it treats the GPU as a monolithic entity and ignores the internal parallelism. We propose a new hierarchical metric that improves the correlation of measured performance and application workload by up to 20.61%. Using our metric for determining application load instead of the traditional metric as the input for the load balancing algorithm reduces the residual load imbalance by up to 4× in our application.

Eberius, David↗

WE-G-BRD-04: BEST IN PHYSICS (JOINT IMAGING-THERAPY): An Integrated Model-Based Intrafractional Organ Motion Tracking Approach with Dynamic MRI in Head and Neck Radiotherapy

Purpose: In-treatment dynamic cine images, provided by the first commercially available MRI-guided radiotherapy system, allow physicians to observe intrafractional motion of head and neck (H&N) internal structures. Nevertheless, high anatomical complexity and relatively poor cine image contrast/resolution have complicated automatic intrafractional motion evaluation. We proposed an integrated model-based approach to automatically delineate and analyze moving structures from on-board cine images. Methods: The H&N upper airway, a complex and highly deformable region wherein severe internal motion often occurs, was selected as the target-to-be-tracked. To reliably capture its motion, a hierarchical structure model containing three statistical shapes (face, face-jaw, and face-jaw-palate) was first built from a set of manually delineated shapes using principal component analysis. An integrated model-fitting algorithm was then employed to align the statistical shapes to the first to-be-detected cine frame, and multi-feature level-set contour propagation was performed to identify the airway shape change in the remaining frames. Ninety sagittal cine MR image sets, acquired from three H&N cancer patients, were utilized to demonstrate this approach. Results: The tracking accuracy was validated by comparing the results to the average of two manual delineations in 20 randomly selected images from each patient. The resulting dice similarity coefficient (93.28+/−1.46 %) and margin error (0.49+/−0.12 mm) showed good agreement with the manual results. Intrafractional displacements of anterior, posterior, inferior, and superior airway boundaries were observed, with values of 2.62+/−2.92, 1.78+/−1.43, 3.51+/−3.99, and 0.68+/−0.89 mm, respectively. The H&N airway motion was found to vary across directions, fractions, and patients, and highly correlated with patients’ respiratory frequency. Conclusion: We proposed the integrated computational approach, which for the first time allows to automatically identify the H&N upper airway and quantify in-treatment H&N internal motion in real-time. This approach can be applied to track other structures’ motion, and provide guidance on patient-specific prediction of intra-/inter-fractional structure displacements.

60 APPLIED LIFE SCIENCES↗

Steps toward fault-tolerant quantum chemistry.

Developing quantum chemistry programs on the coming generation of exascale computers will be a difficult task. The programs will need to be fault-tolerant and minimize the use of global operations. This work explores the use a task-based model that uses a data-centric approach to allocate work to different processes as it applies to quantum chemistry. After introducing the key problems that appear when trying to parallelize a complicated quantum chemistry method such as coupled-cluster theory, we discuss the implications of that model as it pertains to the computational kernel of a coupled-cluster program - matrix multiplication. Also, we discuss the extensions that would required to build a full coupled-cluster program using the task-based model. Current programming models for high-performance computing are fault-intolerant and use global operations. Those properties are unsustainable as computers scale to millions of CPUs; instead one must recognize that these systems will be hierarchical in structure, prone to constant faults, and global operations will be infeasible. The FAST-OS HARE project is introducing a scale-free computing model to address these issues. This model is hierarchical and fault-tolerant by design, allows for the clean overlap of computation and communication, reducing the network load, does not require checkpointing, and avoids the complexity of many HPC runtimes. Development of an algorithm within this model requires a change in focus from imperative programming to a data-centric approach. Quantum chemistry (QC) algorithms, in particular electronic structure methods, are an ideal test bed for this computing model. These methods describe the distribution of electrons in a molecule, which determine the properties of the molecule. The computational cost of these methods is high, scaling quartically or higher in the size of the molecule, which is why QC applications are major users of HPC resources. The complexity of these algorithms means that MPI alone is insufficient to achieve parallel scaling; QC developers have been forced to use alternative approaches to achieve scalability and would be receptive to radical shifts in the programming paradigm. Initial work in adapting the simplest QC method, Hartree-Fock, to this the new programming model indicates that the approach is beneficial for QC applications. However, the advantages to being able to scale to exascale computers are greatest for the computationally most expensive algorithms; within QC these are the high-accuracy coupled-cluster (CC) methods. Parallel coupledcluster programs are available, however they are based on the conventional MPI paradigm. Much of the effort is spent handling the complicated data dependencies between the various processors, especially as the size of the problem becomes large. The current paradigm will not survive the move to exascale computers. Here we discuss the initial steps toward designing and implementing a CC method within this model. First, we introduce the general concepts behind a CC method, focusing on the aspects that make these methods difficult to parallelize with conventional techniques. Then we outline what is the computational core of the CC method - a matrix multiply - within the task-based approach that the FAST-OS project is designed to take advantage of. Finally we outline the general setup to implement the simplest CC method in this model, linearized CC doubles (LinCC).

99 GENERAL AND MISCELLANEOUS↗

Optimization by decomposition in structural and multidisciplinary applications

An algorithm for a general, multilevel structural optimization by substructuring is derived, based on the linear decomposition concept that is rooted in the Bellman's Optimality Criterion enhanced with the optimum sensitivity derivatives used as a means to account for coupling among the subproblems, each of which is limited to optimization of a substructure. The algorithm applies also to those multidisciplinary problems whose subproblems form a hierarchy similar to that of substructures. In systems where the subproblems communicate with each other at the same level, the decomposition becomes non-hierarchic and the system may be optimized as a whole based on the derivatives of the system behavior with respect to the design variables computed by a method that bypasses finite differencing on the system analysis. When a multidisciplinary system includes a structure as its part, a hybrid, hierarchic/non-hierarchic decomposition applies. Numerical examples and references to computational experience accumulated to date illustrate the discussion.

Sobieszczanski-Sobieski, Jaroslaw↗

Formation Flying With Decentralized Control in Libration Point Orbits

A decentralized control framework is investigated for applicability of formation flying control in libration orbits. The decentralized approach, being non-hierarchical, processes only direct measurement data, in parallel with the other spacecraft. Control is accomplished via linearization about a reference libration orbit with standard control using a Linear Quadratic Regulator (LQR) or the GSFC control algorithm. Both are linearized about the current state estimate as with the extended Kalman filter. Based on this preliminary work, the decentralized approach appears to be feasible for upcoming libration missions using distributed spacecraft.

Folta, David↗

A class Hierarchical, object-oriented approach to virtual memory management

The Choices family of operating systems exploits class hierarchies and object-oriented programming to facilitate the construction of customized operating systems for shared memory and networked multiprocessors. The software is being used in the Tapestry laboratory to study the performance of algorithms, mechanisms, and policies for parallel systems. Described here are the architectural design and class hierarchy of the Choices virtual memory management system. The software and hardware mechanisms and policies of a virtual memory system implement a memory hierarchy that exploits the trade-off between response times and storage capacities. In Choices, the notion of a memory hierarchy is captured by abstract classes. Concrete subclasses of those abstractions implement a virtual address space, segmentation, paging, physical memory management, secondary storage, and remote (that is, networked) storage. Captured in the notion of a memory hierarchy are classes that represent memory objects. These classes provide a storage mechanism that contains encapsulated data and have methods to read or write the memory object. Each of these classes provides specializations to represent the memory hierarchy.

Russo, Vincent F.↗

Piecewise linear approximation with minimum number of linear segments and minimum error: A fast approach to tighten and warm start the hierarchical mixed integer formulation

In several areas of economics and engineering, it is often necessary to fit discrete data points or approximate nonlinear functions with continuous functions. Piecewise linear (PWL) functions are a convenient way to achieve this. PWL functions can be modeled in mathematical problems using only linear and integer variables. Moreover, there is a computational benefit in using PWL functions that have the least possible number of segments. This work proposes a novel hierarchical mixed integer linear programming (MILP) formulation that identifies a continuous PWL approximation with minimum number of linear segments for a given target maximum error. The proposed MILP formulation also identifies the solution with the least maximum error among the solutions with minimum number of segments. Then, this work proposes a fast iterative algorithm that identifies non necessarily continuous PWL approximations by solving O(S log N) linear programming (LP) problems, where N is the number of data points and S is the minimum number of segments in the non necessarily continuous case. This work demonstrates that tight bounds for the MILP problem can be derived from these approximations. Next, a fast algorithm is introduced to transform a non necessarily continuous PWL approximation into a continuous one. Finally, the tight bounds and the continuous PWL approximations are used to tighten and warm start the MILP problem. The tightened formulation is shown in experimental results to be more efficient, especially for large data sets, with a solution time that is up to two orders of magnitude less than the existing literature.

97 MATHEMATICS AND COMPUTING↗

Polymers in Deep Eutectic Solvents

The project investigated the behavior of polymers in ionic liquids such as deep eutectic solvents using an array of techniques. These included the development of atomistic force fields, coarse graining these force fields to the united atom level, large scale molecular dynamics (MD) simulations using new thermostat algorithms, and machine learning (ML) methods for the phase behavior. The project demonstrated the feasibility and accuracy of first principles force fields for ionic liquids, deep-eutectic solvents, and urea-water mixtures. A novel hierarchical coarse graining method was then used to develop accurate and efficient united-atom models, using which microsecond simulations were performed for polymers in ionic liquids. These simulations were in quantitative agreement with experiment, thus resolving previous controversies. Methods were also developed to obtain the potential of mean force between complex ions in solution. Finally, supervised ML methods were developed for the phase behavior of polymers in ionic liquids.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Evidence of a Dwarf Galaxy Stream Populating the Inner Milky Way Halo

Stellar streams produced from dwarf galaxies provide direct evidence of the hierarchical formation of the Milky Way. Here, we present the first comprehensive study of the LMS-1 stellar stream, that we detect by searching for wide streams in the Gaia EDR3 data set using the STREAMFINDER algorithm. This stream was recently discovered by Yuan et al. We detect LMS-1 as a 60° long stream to the north of the galactic bulge, at a distance of ~20 kpc from the Sun, together with additional components that suggest that the overall stream is completely wrapped around the inner Galaxy. Using spectroscopic measurements from the Large Sky Area Multi-Object Fiber Spectroscopic Telescope, the Sloan Digital Sky Survey, and the Apache Point Observatory Galactic Evolution Experiment, we infer that the stream is very metal-poor (<[Fe/H]> = –2.1) with a significant metallicity dispersion (σ [Fe/H] = 0.4), and it possesses a large radial velocity dispersion (σ v = 20 ± 4 km s–1 ). These estimates together imply that LMS-1 is a dwarf galaxy stream. The orbit of LMS-1 is close to polar, with an inclination of 75° to the galactic plane. Both the orbit and metallicity of LMS-1 are remarkably similar to the globular clusters NGC 5053, NGC 5024, and the stellar stream Indus. As a result, these findings make LMS-1 an important contributor to the stellar population of the inner Milky Way halo.

79 ASTRONOMY AND ASTROPHYSICS↗

A Generalized approach to the operationalization of Software Quality Models

Comprehensive measures of quality are a research imperative, yet the development of software quality models is a wicked problem. Definitive solutions do not exist and quality is subjective at its most abstract. Definitional measures of quality are contingent on a domain, and even within a domain, the choice of representative characteristics to decompose quality is subjective. Thus, the operationalization of quality models brings even more challenges. A promising approach to quality modeling is the use of hierarchies to represent characteristics, where lower levels of the hierarchy represent concepts closer to real-world observations. Building upon prior hierarchical modeling approaches, we developed the Platform for Investigative software Quality Understanding and Evaluation (PIQUE). PIQUE surmounts several quality modeling challenges because it allows modelers to instantiate abstract hierarchical models in any domain by leveraging organizational tools tailored to their specific contexts. Here, we introduce PIQUE; exemplify its utility with two practical use cases; address challenges associated with parameterizing a PIQUE model; and describe algorithmic techniques that tackle normalization, aggregation, and interpolation of measurements.

Data aggregation↗

Software and hardware for intelligent robots

Various architectures and their respective software for Hierarchically Intelligent Robots are discussed. They conform to the Principle of Increasing Precision with Decreasing Intelligence by following a three-level structure. The architecture of the organization and coordination levels is presented here and their algorithms are outlined.

Saridis, G. N.↗

Web-based wide-area monitoring platform for ringdown and clustering analytics in power systems

This paper introduces an open-source research platform for monitoring the Mexican interconnected power grid, allowing real-time processing and information extraction of the grid’s dynamic condition. Moreover, the platform is a Python-based development that embeds different ringdown and clustering analytics tools. In the case of ringdown analysis, the modal information can be extracted using some of the most known algorithms, i.e., Prony analysis, eigensystem realization algorithm (ERA), and matrix pencil (MP). For clustering analysis, the coherent behaviour of generator and non-generator buses is provided by applying recent state-of-the-art techniques such as affinity propagation, K-means, hierarchical agglomerative clustering, and typicality data analysis. The results of up to 93 PMUs show that this open-source platform suits researchers’ and engineers’ power system dynamic analysis requirements.

Clustering↗