Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “hierarchy”

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 649 records · Page 36
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Cooperative Load Scheduling for Multiple Aggregators Using Hierarchical ADMM

Demand response (DR) serves an important role in improving the efficiency and stability of power systems. In recent years, with advances in communication and smart device technologies, many aggregators have emerged to facilitate end customer participation in DR programs. These aggregators, equipped with customized optimal control algorithms, are capable of providing various grid services. Among them is load scheduling during DR events, namely following a load signal provided by the utility company while minimizing overall customer discomfort. However, as the number of aggregators keeps increasing, it becomes challenging for utility companies to conduct load scheduling for multiple aggregators and generate reference signals for each of them. This paper proposes an optimization framework using hierarchical alternating direction method of multipliers (H-ADMM) to optimally generate load following signals for multiple aggregators. Under this framework, utility and multiple aggregators work in a cooperative manner, aiming at minimizing an overall system cost from different levels of the power system hierarchy, while protecting user privacy. A case study has been conducted in a system with multiple aggregators, based on control of HVAC loads. Experimental results validate the effectiveness of the proposed algorithm.

ADMM↗
DOE OSTI2020

Agent-Based Framework for Supporting Behind the Meter Transactive Power Electronic Systems

In this paper, the concept of a framework based on an agent-based interface for power stages in a power electronic system is presented. The presented concept or agent system is able to consider any number of different types of sources, types of converters, communication protocols, embedded decision making to support transactive, and hierarchy for large system integration. The concept is presented through several examples including the implementation on an actual physical system and demonstration of transactive type controls.

Starke, Michael↗
DOE OSTI2020

A Model-Predictive Hierarchical-Control Framework for Aggregating Residential DERs to Provide Grid Regulation Services

This paper develops a hierarchical control frame-work to aggregate and to manage behind-the-meter distributed energy resources (DERs), which will be ubiquitous in future distribution systems. In the proposed framework, firstly, each controller in the hierarchy determines the flexibility of the DERs such that the obtained flexibility is feasible with respect to its operational purview. For example, the operational purview of a home energy management system may only consider consumer comfort preferences, while that for an aggregator or a grid controller may consider network voltage management as well. Based on the feasible flexibility, optimal setpoints for the DERs is then determined by the hierarchical controllers to help the distribution power network in voltage regulation, coordination issues with existing transmission-level conventional generators, etc. Therefore, the proposed strategy, which is based on model-predictive control, can be effectively utilized by the distribution network to coordinate several DERs to provide grid regulation services. Numerical simulations performed on the IEEE 37-bus test system demonstrate the efficacy of the proposed approach.

behind-the-meter↗
DOE OSTI2022

Distributed Hierarchical Contour Trees

Contour trees are a significant tool for data analysis as they capture both local and global variation. However, their utility has been limited by scalability, in particular for distributed computation and storage. We report a distributed data structure for storing the contour tree of a data set distributed on a cluster, based on a fan-in hierarchy, and an algorithm for computing it based on the boundary tree that represents only the superarcs of a contour tree that involve contours that cross boundaries between blocks. This allows us to limit the communication cost for contour tree computation to the complexity of the block boundaries rather than of the entire data set.

Carr, Hamish A↗
DOE OSTI2021

Structured Adaptive Mesh Refinement Adaptations to Retain Performance Portability With Increasing Heterogeneity

Adaptive mesh refinement (AMR) is an important method that enables many mesh-based applications to run at effectively higher resolution within limited computing resources by allowing high resolution only where really needed. This advantage comes at a cost, however: greater complexity in the mesh management machinery and challenges with load distribution. With the current trend of increasing heterogeneity in hardware architecture, AMR presents an orthogonal axis of complexity. Additionally, the usual techniques, such as asynchronous communication and hierarchy management for parallelism and memory that are necessary to obtain reasonable performance are very challenging to reason about with AMR. Different groups working with AMR are bringing different approaches to this challenge. Here, we examine the design choices of several AMR codes and also the degree to which demands placed on them by their users influence these choices.

42 ENGINEERING↗
DOE OSTI2025

The Persistent Challenge of Data Locality in the Post-Exascale Era

The era of exascale computing, exemplified by systems like Frontier achieving exaflop-level performance, marks a milestone. However, the quest for sheer compute power leads to strong imbalance in system design. Hence, scaling advancements in memory, network bandwidth, and storage are also necessary and pose challenges, with a crucial need to address data locality issues. This article underscores the fundamental importance of data locality as a key abstraction for optimizing application performance. Despite notable software solutions, the growing complexity of parallelism and memory hierarchy demands performance-portable data locality solutions across diverse computing platforms. Additionally, the article revisits data locality aspects, covering hardware considerations, application perspectives, software stack abstractions, and tool support. It concludes with insights into data locality challenges and opportunities, emphasizing the ongoing significance of collaborative research for progress in this critical issue.

Unat, Didem [Koc University, Istanbul (Turkey)] (O↗
DOE OSTI2023

Automatic Code Generation for High-Performance Graph Algorithms

Graph problems are common across fields of scientific computing and social sciences. However, despite their importance, implementing graph algorithms effectively on modern computing systems is a challenging task that requires significant programming effort and generally results in customized implementations. Current computing and memory hierarchies are not architected for irregular computations resulting in challenges for graph algorithms to achieve high performance on those architectures. In this paper, we present GraphX, a novel compiler framework and DSL designed to simplify the development of efficient graph algorithms and achieve high performance on modern computing systems. GraphX consists of a DSL for efficient implementation of graph algorithms, various optimizations, such as support for sparse linear algebra and workspace transformations, optimized graph primitives, including semiring and masking, and a high-performance code generation engine. Using GraphX, users can implement graph algorithms using a semantically-rich language with graph-oriented operators. GraphX uses these semantics to automatically generate efficient code for target architectures, increasing performance and portability across architectures. The composable nature of GraphX makes it possible to extend the set of optimizations and architectures without modifying the source code. We demonstrate GraphX outperforms state-of-the-art graph libraries, such as LAGraph, up to $3.7 speedup in semiring operations, $2.19 speedup in an important sparse computational kernel, and $9.05 speedup in graph processing algorithms.

compiler, graph algorithms, semiring, masking, wor↗
DOE OSTI2020

A Hybrid Framework Combining Model-Based and Data-Driven Methods for Hierarchical Decentralized Robust Dynamic State Estimation

This paper combines model-based and data-driven methods to develop a hierarchical, decentralized, robust dynamic state estimator (DSE). A two-level hierarchy is proposed, where the lower level consists of robust, model-based, decentralized DSEs. The state estimates sent from the lower level are received at the upper level, where they are filtered by a robust data-driven DSE after a principled sparse selection. This selection allows us to shrink the dimension of the problem at the upper level and hence significantly speed up the computational time. The proposed hybrid framework does not depend on the centralized infrastructure of the control centers; thus it can be completely embedded into the wide-area measurement systems. This feature will ultimately facilitate the placement of hierarchical decentralized control schemes at the phasor data concentrator locations. Also, the network model is not necessary; thus, a topology processor is not required. Finally, there is no assumption on the dynamics of the electric loads. The proposed framework is tested on the 2,000-bus synthetic Texas system, and shown to be capable of reconstructing the dynamic states of the generators with high accuracy, and of forecasting in the advent of missing data.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2023

Distributed Energy Resource Management Systems: Preserving Customer Privacy through K-Anonymity

The smart grid represents the next generation of electricity distribution systems that utilizes recent technological innovations. It uses digital communication between its components and entities to attain more automation, self-sufficiency, and reliability. One of the many concerns in smart grid digital communication discussions is the possibility of violating customers’ privacy. Violating customers’ privacy imposes a significant barrier as smart grid desirable attributes are tightly tied to customers’ participation. Employing privacy models can address concerns regarding information privacy in smart grid digital communication. In this work, we provide an approach to utilizing K-anonymity to ensure data within the system excludes Personally Identifiable Information. Results suggest that a dynamically generated generalization hierarchy minimizes information loss incurred by the anonymization process.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗
DOE OSTI2022

Performance Debugging and Tuning of Flash-X with Data Analysis Tools

State-of-the-art multiphysics simulations running on large scale leadership computing platforms have many variables contributing to their performance and scaling behavior. We recently encountered an interesting performance anomaly in Flash-X, a multiphysics multicomponent simulation software, when characterizing its performance behavior on several large-scale HPC platforms. The anomaly was tracked down to the interaction between the use of dynamic allocation of scratch data and data locality in the cache hierarchy. In this paper we present the details of unexpected performance variability of Flash-X, its extensive analysis using the performance measurement tool TAU to collect the data and Python data analysis libraries to explore the data, and our insights from this experience. In this process, we discovered and removed or mitigated two additional performance limiting bottlenecks for performance tuning.

Huck, Kevin↗
DOE OSTI2024

Shifting Between Compute and Memory Bounds: A Compression-Enabled Roofline Model

In the evolving landscape of high-performance computing, especially to fight the end of Moore’s Law and Dennard’s Scaling, the ability to shift between compute-bound and memory-bound states is critical for enhancing adaptability and flexibility to diverse system and domain-specific architectures. Such capability is vital for optimizing performance across distinguished hardware configurations, such as accelerators, memory hierarchies, and cache systems. Despite that ad hoc optimization techniques, such as compressed/approximate computation, have been enabled for compute-/data-intensive computing for improved performance in distinct hardware settings, there lacks an understanding of 1) the rational behind performance improvement; 2) capability of different optimizations; 3) what optimization to respond to specific computational and memory demands. This work proposes a compression-enabled roofline model to facilitate this adaptability with data compression techniques to balance and transform between computational and memory demands. This model enables applications to adjust in response to the specific strengths and limitations of the underlying hardware and system to optimize resource utilization. The effectiveness of this approach is demonstrated with matrix multiplication kernels on different input sizes, with turning on/off various compression techniques, including 1) low-precision floating point; 2) sparse matrix formulation; and 3) compressed arrays with ZFP. By reducing memory transfer volumes and cache misses and increasing data locality and computational intensity through compression, the specific roofline model can transform between compute and memory bounds to align more efficiently with system capabilities. This advancement not only improves overall performance but also maximizes adaptability in diverse computing environments.

Naraparaju, Ramasoumya [University of Washington]↗
DOE OSTI2021

InversionNet3D: Efficient and Scalable Learning for 3-D Full-Waveform Inversion

Seismic full-waveform inversion (FWI) techniques aim to find a high-resolution subsurface geophysical model provided with waveform data. Some recent effort in data-driven FWI has shown some encouraging results in obtaining 2-D velocity maps. However, due to high computational complexity and large memory consumption, the reconstruction of 3-D high-resolution velocity maps via deep networks is still a great challenge. Here, in this article, we present InversionNet3D (InvNet3D), an efficient and scalable encoder–decoder network for 3-D FWI. The proposed method employs group convolution in the encoder to establish an effective hierarchy for learning information from multiple sources while cutting down unnecessary parameters and operations at the same time. The introduction of invertible layers further reduces the memory consumption of intermediate features during training and, thus, enables the development of deeper networks with more layers and higher capacity as required by different application scenarios. Experiments on the 3-D Kimberlina dataset demonstrate that InvNet3D achieves state-of-the-art reconstruction performance with lower computational cost and lower memory footprint compared to the baseline.

58 GEOSCIENCES↗
DOE OSTI2021

Evaluating Spatial Accelerator Architectures with Tiled Matrix-Matrix Multiplication.

There is a growing interest in custom spatial accelerators for machine learning applications. These accelerators employ a spatial array of processing elements (PEs) interacting via custom buffer hierarchies and networks-on-chip. The efficiency of these accelerators comes from employing optimized dataflow (i.e., spatial/temporal partitioning of data across the PEs and fine-grained scheduling) strategies to optimize data reuse. The focus of this work is to evaluate these accelerator architectures using a tiled general matrix-matrix multiplication (GEMM) kernel. To do so, we develop a framework that finds optimized mappings (dataflow and tile sizes) for a tiled GEMM for a given spatial accelerator and workload combination, leveraging an analytical cost model for runtime and energy. Finally, our evaluations over five spatial accelerators demonstrate that the tiled GEMM mappings systematically generated by our framework achieve high performance on various GEMM workloads and accelerators.

42 ENGINEERING↗
DOE OSTI2021

A Network-Aware Distributed Energy Resource Aggregation Framework for Flexible, Cost-Optimal, and Resilient Operation

To efficiently use the ubiquitous behind-the-meter distributed energy resources (DERs) in distribution systems for providing grid services, this paper presents a hierarchical control framework for DER optimal aggregation and control. We first develop a convex optimization model to evaluate the DER flexibility, and then use a convex model-predictive-control based approach to dispatch those DERs. The hierarchical control framework consists of a utility controller, community aggregators and multiple home energy management systems. The flexibility of the DERs is evaluated by each controller in the hierarchy such that the resultant flexibility is feasible given its operational domain. Based on the determined flexibility, the hierarchical controllers then compute optimal setpoints for the DERs to help the distribution system regulate node voltages and provide other distribution grid services. Numerical simulations performed on a model of a real distribution feeder in Colorado, using actual DER data in a residential community demonstrate that the proposed approach can effectively alleviate voltage issues and support resilient operation.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Deep Hierarchical Super Resolution for Scientific Data

We present a novel technique for hierarchical super resolution (SR) with neural networks (NNs), which upscales volumetric data represented with an octree data structure to a high-resolution uniform gridwith minimal seam artifacts on octree node boundaries. Our method uses existing state-of-the-art SR models and adds flexibility to upscale input data with varying levels of detail across the domain, instead of only uniform grid data that are supported in previous approaches.The key is to use a hierarchy of SR NNs, each trained to perform 2x SR between two levels of detail, with a hierarchical SR algorithm that minimizes seam artifacts by starting from the coarsest level of detail and working up.We show that our hierarchical approach outperforms baseline interpolation and hierarchical upscaling methods, and demonstrate the usefulness of our proposed approach across three use cases including data reduction using hierarchical downsampling+SR instead of uniform downsampling+SR, computation savings for hierarchical finite-time Lyapunov exponent field calculation, and super-resolving low-resolution simulation results for a high-resolution approximation visualization.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2025

Concept Lens: Visual Comparison and Evaluation of Generative Model Manipulations

Generative models are becoming a transformative technology for the creation and editing of images. However, it remains challenging to harness these models for precise image manipulation. These challenges often manifest as inconsistency in the editing process, where both the type and amount of semantic change, depend on the image being manipulated. Moreover, there exist many methods for computing image manipulations, whose development is hindered by the matter of inconsistency. This paper aims to address these challenges by improving how we evaluate, compare, and explore the space of manipulations offered by a generative model. We present Concept Lens, a visual interface that is designed to aid users in understanding semantic concepts carried in image manipulations, and how these manipulations vary over generated images. Given the large space of possible images produced by a generative model, Concept Lens is designed to support the exploration of both generated images, and their manipulations, at multiple levels of detail. To this end, the layout of Concept Lens is informed by two hierarchies: a hierarchical organization of (1) original images, grouped by their similarities, and (2) image manipulations, where manipulations that induce similar changes are grouped together. This layout allows one to discover the types of images that consistently respond to a group of manipulations, and vice versa, manipulations that consistently respond to a group of codes. We show the benefits of this design across multiple use cases, specifically, studying the quality of manipulations for a single method, and offering a means of comparing different methods.

clustering↗
DOE OSTI2020

Microbial macroecology: In search of mechanisms governing microbial biogeographic patterns

Abstract Introduction Rapidly advancing technologies and accumulating information about microbial communities across the globe allow the quantification of microbial properties and functions at a macro‐scale. These emerging microbial biogeographic patterns call for a practical macroecological approach to investigate their underlying mechanisms. Aims The primary aims of this paper are to review the advancements of microbial macroecology in seeking mechanisms governing microbial biogeographic patterns, and to further lay out a roadmap for microbial macroecology in 10 years. Methods We reviewed the progress of microbial macroecology and demonstrated the application of the microbial macroecological approach to microbial biogeographic patterns with three case studies. Results Microbial macroecology provides a platform for understanding microbial abundance, community structure, and functioning across space, time, and taxonomic hierarchy. It emphasizes the integral effects of environmental filtering, microbial responses, diversification, dispersal, and local extinction that drive the microbial biogeographic patterns. The microbial macroecological approach emphasizes the last two stages of the four‐stage scientific method applied to microbial ecology: (a) describing microbial traits across scales to reveal patterns, (b) mathematically representing these patterns, (c) developing and testing conceptual models to build a mechanistic understanding of these patterns from a macroecological perspective, (d) plugging the new knowledge into the theoretical advancements. Three case studies were used to demonstrate the microbial macroecological approach for understanding the global patterns of microbial biomass carbon, microbial composition (fungi : bacteria ratio), and microbial carbon use efficiency. Conclusions Microbial macroecology offers a platform for understanding the mechanisms that drive biogeographic patterns of microbial abundance, diversity and functions. It is likely that these patterns and mechanisms will be increasingly incorporated into predictive models that link climate, carbon dynamics, and biogeochemical processes. A roadmap is outlined for the growing microbial macroecology field; we expect significant progress will be made in five research directions over the next 10 years.

Xu, Xiaofeng↗
DOE OSTI2020

Spatial and temporal patterns in age structure of Golden Eagles wintering in eastern North America

The behavior of wildlife varies seasonally, and that variation can have substantial demographic consequences. This is especially true for long-distance migrants where the use of landscapes varies by season and, sometimes, age cohort. In this study, we tested the hypothesis that distributional patterns of Golden Eagles (Aquila chrysaetos) wintering in eastern North America are age-structured (i.e., birds of similar ages winter together) through the analysis of 370,307 images collected by motion-sensitive trail cameras set over bait during the winters of 2012–2013 and 2013–2014. At nine sites with sufficient data for analysis, we documented 145 eagle visits in 2012–2013 and 146 in 2013–2014. We found significant between-year variation in age structure of wintering eastern Golden Eagles, driven largely by annual differences in the proportion of first-winter birds. However, although many other species show spatial structure in wintering behavior, our analysis revealed no latitudinal organization among age cohorts of wintering eastern Golden Eagles. The lack of age-related latitudinal segregation in wintering behavior does not exclude the possibility that these eagles have sex-based or other types of dominance hierarchies that could result in spatial or temporal segregation. Alternatively, other mechanisms such as food availability or habitat structure may determine the distribution and abundance of Golden Eagles in winter.

59 BASIC BIOLOGICAL SCIENCES↗