Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “system partition”

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 37 records · Page 2
All sourcesNASA NTRSDOE OSTI
DOE OSTI2025

Incorporating the molecular-scale into a hydrodynamic description of confined aqueous systems

Hydrodynamics provides a continuum-level description of fluid motion, but its applicability at the nanoscale becomes uncertain due to the emerging importance of molecular-level effects such as spatial heterogeneity. Hydrodynamic boundary conditions that incorporate molecular details allow us to partition the system into a near-wall region and a bulk fluid region. We identify a hydrodynamic wall located inside the fluid that determines where slip begins. By extending the hydrodynamic wall with the slip length, the position of the extrapolated wall is established. This offers a unified description of both slip and stagnant flow behaviors, with wall hydrophobicity characterized by the relative location of the extrapolated wall with respect to the physical wall. Employing this concept in analyses of equilibrium molecular dynamics (MD) and non-equilibrium MD simulations of Couette and Poiseuille flows, our results demonstrate consistency between equilibrium and non-equilibrium approaches across different flow types and confinement levels. This demonstrates the robust nature of linear response theory. We then explore the effects of fluid-wall and bulk fluid interactions on the hydrodynamic properties. These findings enhance the effectiveness of molecular-based simulations for investigating complex confined systems in nanofluidics, biology, and colloidal science, offering a complementary molecular-scale perspective to traditional continuum approaches.

flow simulations↗
DOE OSTI2021

Projector-Based Quantum Embedding for Molecular Systems: An Investigation of Three Partitioning Approaches

Projector-based embedding is a relatively recent addition to the collection of methods that seek to utilize chemical locality to provide improved computational efficiency. This work considers the interactions between the different proposed procedures for this method and their effects on the accuracy of the results. The interplay between the embedded background, projector type, partitioning scheme, and level of atomic orbital (AO) truncation are investigated on a selection of reactions from the literature. The Huzinaga projection approach proves to be more reliable than the level-shift projection when paired with other procedural options. Active subsystem partitioning from the subsystem projected AO decomposition (SPADE) procedure proves slightly better than the combination of Pipek-Mezey localization and Mulliken population screening (PMM). Along with these two options, a new partitioning criteria is proposed based on subsystem von Neumann entropy and the related subsystem orbital occupancy. This new method overlaps with the previous PMM method, but the screening process is computationally simpler. Finally, AO truncation proves to be a robust option for the tested systems when paired with the Huzinaga projection, with satisfactory results being acquired at even the most severe truncation level.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2022

Design and analysis of CXL performance models for tightly-coupled heterogeneous computing

Truly heterogeneous systems enable partitioned workloads to be mapped to the hardware that nets the best performance. However, current practice requires that inter-device communication between different vendors' hardware use host memory as an intermediary step. To date, there are no widely adopted solutions that allow accelerators to directly transfer data. A new cache-coherent protocol, CXL, aims to facilitate easier, fine-grained sharing between accelerators. In this work we analyze existing methods for designing heterogeneous applications that target GPUs and FPGAs working collaboratively, followed by an exploration to show the benefits of a CXL-enabled system. Specifically, we develop a test application that utilizes both an NVIDIA P100 GPU and a Xilinx U250 FPGA to show current communication limitations. From this application, we capture overall execution time and throughput measurements on the FPGA and GPU. We use these measurements as inputs to novel CXL performance models to show that using CXL caching instead of host memory results in a 1.31X speedup, while a more tightly-coupled pipelined implementation using CXL-enabled hardware would result in a speedup of 1.45X.

Cabrera, Anthony↗
DOE OSTI2022

Peak cooling load shift capability of a thermal energy storage system integrated with an active insulation system in US climate zones

This study aims to evaluate a thermal energy storage (TES) system integrated with an active insulation system (AIS) to form a TES + AIS integrated wall system as a partition and as a secondary cooling system to shift the peak load and reduce cooling energy consumption. To understand and demonstrate its cooling performance, the TES + AIS integrated wall system was installed in an office building in Oak Ridge, Tennessee. To investigate the effect of the TES + AIS integrated wall system in a typical office building and various climate zones, the US Department of Energy’s prototype office building model was modified to accommodate the proposed system. In this work, results showed that the minimum size of the proposed system to achieve energy savings varies depending on climate conditions. The minimum size of the proposed system for cooling energy saving and shifting peak cooling demand in climate zones 2, 3, and 5 is 29.7 m 2 , whereas it is 44.6 m 2 in zones 4 and 6. By installing the minimum size of the proposed system, 11.3 % to 16.4 % of cooling energy can be shifted during discharge hours in a representative summer day.

25 ENERGY STORAGE↗
DOE OSTI2021

Computing partition functions in the one-clean-qubit model

We present a method to approximate partition functions of quantum systems using mixed-state quantum computation. For positive-semidefinite Hamiltonians, our method has an expected running-time that is almost linear in [M/( ε rel Z )] 2 , where M is the dimension of the quantum system, Z is the partition function, and ε rel is the relative precision. It is based on approximations of the exponential operator as linear combinations of certain operators related to block-encoding of Hamiltonians or Hamiltonian evolutions. The trace of each operator is estimated using a standard algorithm in the one-clean-qubit model. For large values of Z , our method may run faster than exact classical methods, whose complexities are polynomial in M . We also prove that a version of the partition function estimation problem within additive error is complete for the so-called DQC1 complexity class, suggesting that our method provides a superpolynomial speedup for certain parameter values. Overall, to attain a desired relative precision, we develop a classical procedure based on a sequence of approximations within predetermined additive errors that may be of independent interest.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2023

Data-Driven Smoothers for Extreme-Scale Computing

Patch-based relaxation refers to a family of methods for solving linear systems which partitions the matrix into smaller pieces often corresponding to groups of adjacent degrees of freedom residing within patches of the computational domain. The two most common families of patch-based methods are block-Jacobi and Schwarz methods, where the former typically corresponds to non-overlapping domains and the later implies some overlap. We focus on cases where each patch consists of the degrees of freedom on a finite element method mesh cell. Patch methods often capture complex local physics much more effectively than simpler point-smoothers such as Jacobi; however, forming, inverting, and applying each patch can be prohibitively expensive in terms of both storage and computation time. To this end, we propose several approaches for performing analysis on these patches and constructing a reduced representation. The compression techniques rely on either matrix norm comparisons or unsupervised learning via a clustering approach. We illustrate how it is frequently possible to retain/factor less than 5% of all patches and still develop a method that converges only a little slower than when all patches are stored/factored.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2024

Investigation of Mercury Compound Partitioning Through the Solvent Extraction System

Savannah River National Laboratory (SRNL) has been requested by Savannah River Mission Completion (SRMC)/ Salt Waste Processing Facility (SWPF) personnel to investigate the potential routes for titanium and mercury accumulations within the SWPF Flowsheet. This report documents work performed to examine how various forms of mercury can migrate through the multiple flowsheets of a solvent extraction system. This entailed 29 single stage distribution tests, a multi-stage Extraction-Scrub-Strip (ESS) test, and a detailed speciation analysis of several salt batch feed samples.

12 MANAGEMENT OF RADIOACTIVE AND NON-RADIOACTIVE W↗
DOE OSTI2021

Interconnect architecture for three-dimensional processing systems

A processing system includes a plurality of processor cores formed in a first layer of an integrated circuit device and a plurality of partitions of memory formed in one or more second layers of the integrated circuit device. The one or more second layers are deployed in a stacked configuration with the first layer. Each of the partitions is associated with a subset of the processor cores that have overlapping footprints with the partitions. The processing system also includes first memory paths between the processor cores and their corresponding subsets of partitions. The processing system further includes second memory paths between the processor cores and the partitions.

Jayasena, Nuwan S.↗
DOE OSTI2024

Range‐separated density functional theory using multiresolution analysis and quantum computing

Quantum computers are expected to outperform classical computers for specific problems in quantum chemistry. Such calculations remain expensive, but costs can be lowered through the partition of the molecular system. In the present study, partition was achieved with range-separated density functional theory (RS-DFT). The use of RS-DFT reduces both the basis set size and the active space size dependence of the ground state energy in comparison with the use of wave function theory (WFT) alone. The utilization of pair natural orbitals (PNOs) in place of canonical molecular orbitals (MOs) results in more compact qubit Hamiltonians. To test this strategy, a basis-set independent framework, known as multiresolution analysis (MRA), was employed to generate PNOs. Tests were conducted with the variational quantum eigensolver for a number of molecules. The results show that the proposed approach reduces the number of qubits needed to reach a target energy accuracy.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
DOE OSTI2024

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

The nodal admittance matrix (NAM)-based approach is suitable for analyzing the small-signal stability of large-scale power electronics-based power systems (PEPSs) as it preserves the system structure by utilizing the admittance matrix. Previously, NAM-based area partition has been proposed, which divides the system into various subareas and interconnections for easier analysis of the low-dimension matrix compared to the entire system-based high-dimension matrix. However, no partition algorithm has been presented for the NAM-based area partition method. This paper focuses on implementing the spectral partitioning algorithm for partitioning large-scale PEPSs into a low-dimension matrix to reduce the computation complexity of the analysis. These spectral components facilitate data transformation into a new space, enabling the application of traditional clustering methods like k-means. To evaluate the performance of the partitioning method, the subareas and interconnections obtained from the spectral clustering algorithm are incorporated into the NAM-based area partition method for a large system with 140 buses. The computational times of the original method, where the NAM-based criterion is directly applied to the entire system, are compared with those of the NAM-based partition method in MATLAB. PSCAD simulations of the whole system and the obtained subareas are conducted to validate the effectiveness of the proposed algorithm.

Nupur, Nupur↗
DOE OSTI2023

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution system planners can use to prepare for future extreme events is to plan multiple microgrids which can use local generation as much as possible to supply critical loads. But partitioning an existing distribution system such that multiple feasible islands are planned and which are capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the network graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithm based approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, United States.

genetic algorithm↗
DOE OSTI2023

Perennial grass root system specializes for multiple resource acquisitions with differential elongation and branching patterns

Roots optimize the acquisition of limited soil resources, but relationships between root forms and functions have often been assumed rather than demonstrated. Furthermore, how root systems co-specialize for multiple resource acquisitions is unclear. Theory suggests that trade-offs exist for the acquisition of different resource types, such as water and certain nutrients. Measurements used to describe the acquisition of different resources should then account for differential root responses within a single system. To demonstrate this, we grew Panicum virgatum in split-root systems that vertically partitioned high water availability from nutrient availability so that root systems must absorb the resources separately to fully meet plant demands. We evaluated root elongation, surface area, and branching, and we characterized traits using an order-based classification scheme. Plants allocated approximately 3/4th of primary root length towards water acquisition, whereas lateral branches were progressively allocated towards nutrients. However, root elongation rates, specific root length, and mass fraction were similar. Our results support the existence of differential root functioning within perennial grasses. Similar responses have been recorded in many plant functional types suggesting a fundamental relationship. Root responses to resource availability can be incorporated into root growth models via maximum root length and branching interval parameters.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2022

A Fast and Scalable Genetic Algorithm-Based Approach for Planning of Microgrids in Distribution Networks: Preprint

As a result of climate change, extreme weather events are occurring more frequently and with increasing impact. This trend poses a significant challenge for distribution utilities and system operators to ensure that there is uninterrupted power supply to critical loads in their networks; thus, the level of proactive preparation of the distribution system to be able to handle severe impacts of extreme weather events represents the system's resilience. One method that distribution systems use to prepare for extreme events is to form multiple microgrids and thereby isolate themselves from the grid supply by using local generation as much as possible to supply critical loads. But partitioning an existing system into multiple feasible islands capable of supporting critical loads is still challenging for distribution systems - first, because of the size of the graph partitioning problem and, second, because of the difficulty in properly formulating the desired attributes of such islands or microgrids. Therefore, this paper presents a genetic algorithmbased approach that facilitates incorporating multiple objectives for grid partitioning by formulating two types of problems - node allocation and edge elimination - and it considers multiple topological and resilience-enhancing objectives. The performance of the proposed genetic algorithm-based approach is numerically evaluated on multiple test systems as well as on a real distribution feeder in Colorado, USA.

edge elimination↗
DOE OSTI2021

Virtual Log-Structured Storage for High-Performance Streaming

Over the past decade, given the higher number of data sources (e.g., Cloud applications, Internet of things) and critical business demands, Big Data transitioned from batch-oriented to real-time analytics. Stream storage systems, such as Apache Kafka, are well known for their increasing role in real-time Big Data analytics. For scalable stream data ingestion and processing, they logically split a data stream topic into multiple partitions. Stream storage systems keep multiple data stream copies to protect against data loss while implementing a stream partition as a replicated log. This architectural choice enables simplified development while trading cluster size with performance and the number of streams optimally managed. This paper introduces a shared virtual log-structured storage approach for improving the cluster throughput when multiple producers and consumers write and consume in parallel data streams. Stream partitions are associated with shared replicated virtual logs transparently to the user, effectively separating the implementation of stream partitioning (and data ordering) from data replication (and durability). We implement the virtual log technique in the KerA stream storage system. When comparing with Apache Kafka, KerA improves the cluster ingestion throughput by up to 4x when multiple producers write over hundreds of data streams.

consistent stream ordering↗
DOE OSTI2026

Hierarchical Truncations for Many-Body Expansion Potentials

In this work, a new strategy to truncate high-order terms in the many-body expansion (MBE) is proposed. This new approach, which we call a hierarchical many-body expansion (HMBE), is based on a hierarchical partition of the system into multitier fragments and can in principle be applied to any large molecular system. Numerical tests on a series of (H 2 O) 64 structures are presented, demonstrating satisfactory relative energies between the clusters and binding energies of individual clusters compared with full-cluster calculations, with significantly fewer high-order terms computed than conventional MBE. The hierarchical truncation can be augmented by certain many-body terms for fragments at the interface between the partitions (called “Schengen terms”) to further improve accuracy. This work establishes the HMBE scheme as a promising framework to model very large systems (e.g., proteins), which are naturally built on a hierarchical structure.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗