Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “shared”

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 343 records · Page 19
All sourcesNASA NTRSDOE OSTI
DOE OSTI2024

Utility-Scale Shared Energy Storage Deployment: Challenges, Research Gaps, and Opportunities

Although community energy storage (CES) and behind-the-meter (BTM) energy storage systems have been widely used to offer homeowners and communities a variety of localized benefits, their scalability and grid support functionalities are limited. On the other hand, utility-scale shared energy storage (USES) systems may offer a number of benefits for grid integration, scalability, and economic viability. When compared to BTM and CES alternatives, these large-scale systems provide more storage capacity, more efficient operations, and more economically viable options. The deployment of USES presents opportunities for optimizing grid performance, integrating renewable energy resources, and improving energy security at the community level. However, significant research gaps exist in optimizing the integration and operation of these systems, especially to allocate energy for consumer use, grid services, and enhancing energy resilience. This paper reviews the literature in this regard, focusing on the opportunities, research gaps, and challenges associated with USES deployment. Firstly, the paper provides an overview of USES systems and emphasizes their benefits. Secondly, the key challenges are identified, and research gaps associated with the operation and integration of these systems are highlighted. Lastly, some potential solutions and opportunities that can be adopted to facilitate the rapid deployment and management of USES are presented. Technological, economic, regulatory, and environmental aspects are also discussed in this paper, providing an overview of the current state and future prospects of this technology.

Gautam, Mukesh [BATTELLE (PACIFIC NW LAB)] (ORCID:↗
DOE OSTI2025

Day-Ahead Forecasting with Federated LSTM to Plan Energy Sharing in a Community Microgrid

Energy balancing in microgrids is a key enabler of resilience. Community microgrids located close to each other have the added benefit of networking and sharing surplus energy, if available. Such complex decision-making runs on optimization that requires reliable short-term (up to very-short-term) forecasts of energy generation and consumption for scheduling or trading. Each microgrid may also opt to not expose their sensitive data such as consumption patterns of individual businesses or residences. This paper investigates a federated approach to dayahead forecasting that trains naive long short-term memory (LSTM) at each business in a microgrid and aggregates weights at the microgrid controller using proximal regularization. This approach ensures that the controller has access only to energy surplus/deficit and not the actual generation or consumption values, avoiding unwanted exposure of sensitive data. A community microgrid in Adjuntas, Puerto Rico with 3 businesses is selected as a case study with a laboratory-scale computing setup. A central LSTM forecaster, where sensitive data from businesses are aggregated at the controller, is implemented as a baseline for qualifying the results. This work serves as a proof-of-concept for scaling the approach to networked and nested microgrids with more complex control options.

Sundararajan, Aditya [ORNL] (ORCID:000000033577854↗
DOE OSTI2023

Dynamics of Current-Sharing Within a REBCO Tape-Stack Cable

Current redistribution in a non-insulating REBCO tape-stack cable may enable the use of such a cable in a high field dipole without provision for transposition of the constituent tapes. As current is increased in the REBCO cable a dynamic resistance arises in the superconducting layer near operation at critical current. The critical current of each tape in the stack is determined by the local magnetic field variation within the cable. The superconducting-normal transition in REBCO occurs over a working range of current and, within that range, the longitudinal Ohmic electric field produces a transverse electric field between adjacent tapes with different critical currents. Circuit models indicate that, as a given tape approaches critical operation, current will naturally redistribute to neighboring tapes with higher current carrying capacity due to the dynamic rise in resistivity thus preventing premature quench. Here, a multi-scale model is being developed to study the dynamics of current-sharing, the limits of stability, and the impact of fluctuations in critical-current density along each tape.

43 PARTICLE ACCELERATORS↗
DOE OSTI2012

Aho-Corasick String Matching on Shared and Distributed Memory Parallel Architectures

String matching is at the core of many critical applications, including network intrusion detection systems, search engines, virus scanners, spam filters, DNA and protein sequencing, and data mining. For all of these applications string matching requires a combination of (sometimes all) the following characteristics: high and/or predictable performance, support for large data sets and flexibility of integration and customization. Many software based implementations targeting conventional cache-based microprocessors fail to achieve high and predictable performance requirements, while Field-Programmable Gate Array (FPGA) implementations and dedicated hardware solutions fail to support large data sets (dictionary sizes) and are difficult to integrate and customize. The advent of multicore, multithreaded, and GPU-based systems is opening the possibility for software based solutions to reach very high performance at a sustained rate. This paper compares several software-based implementations of the Aho-Corasick string searching algorithm for high performance systems. We discuss the implementation of the algorithm on several types of shared-memory high-performance architectures (Niagara 2, large x86 SMPs and Cray XMT), distributed memory with homogeneous processing elements (InfiniBand cluster of x86 multicores) and heterogeneous processing elements (InfiniBand cluster of x86 multicores with NVIDIA Tesla C10 GPUs). We describe in detail how each solution achieves the objectives of supporting large dictionaries, sustaining high performance, and enabling customization and flexibility using various data sets.

99 GENERAL AND MISCELLANEOUS↗
DOE OSTI2025

Sequential multidimensional heteroepitaxy of chalcogen-sharing 3D ZnSe and 2D MoSe 2 with quasi van der Waals interface engineering

Two-dimensional (2D) materials are emerging as a promising platform for epitaxial growth, largely free from the constraints of lattice constant and thermal expansion coefficient mismatches. Among them, transition metal dichalcogenides (TMDs), known for their superior electrical properties, are ideal for ultrathin semiconductor applications. Their unique epitaxial characteristics enable seamless integration with 3D materials, facilitating the development of gate stacks and heterojunction devices. In this regard, developing a process for growing high-quality 3D epitaxial materials before and after the growth of 2D TMDs and understanding the 2D/3D interface are crucial. This study demonstrates the sequential growth of fully epitaxial ZnSe/MoSe 2 /ZnSe heterostructures using metal-organic chemical vapor deposition. ZnSe and MoSe 2 , sharing chalcogen elements, enable large-area quasi van der Waals epitaxy with sharp interfaces without intermediate phase. Multiscale analysis involving transmission electron microscopy and density functional theory calculation reveals lattice commensurability, van der Waals gaps, termination, and interfacial reconstruction. Understanding these interactions is crucial for advancing multidimensional integration of 2D and 3D materials.

36 MATERIALS SCIENCE↗
DOE OSTI2024

RAP: Resource-aware Automated GPU Sharing for Multi-GPU Recommendation Model Training and Input Preprocessing

Ensuring high-quality recommendations for newly onboarded users requires the continuous retraining of Deep Learning Recommendation Models (DLRMs) with freshly generated data. To serve the online DLRM retraining, existing solutions use hundreds of CPU computing nodes designated for input preprocessing, causing significant power consumption that surpasses even the power usage of GPU trainers. To this end, we propose RAP, an end-to-end DLRM training framework that supports Resource-aware Automated GPU sharing for DLRM input Preprocessing and Training. The core idea of RAP is to accurately capture the remaining GPU computing resources during DLRM training for input preprocessing, achieving superior training efficiency without requiring additional resources. Specifically, RAP utilizes a co-running cost model to efficiently assess the costs of various input preprocessing operations, and it implements a resource-aware horizontal fusion technique that adaptively merges smaller kernels according to GPU availability, circumventing any interference with DLRM training. In addition, RAP leverages a heuristic searching algorithm that jointly optimizes both the input preprocessing graph mapping and the co-running schedule to maximize the end-to-end DLRM training throughput. The comprehensive evaluation shows that RAP achieves 78.3× speedup on average over CPU-based DLRM input preprocessing frameworks. In addition, the end-to-end training throughput of RAP is only 2.04% lower than the ideal case, which has no input preprocessing overhead.

Wang, Zheng↗
DOE OSTI2023

Elephants Sharing the Highway: Studying TCP Fairness in Large Transfers over High Throughput Links

Escalating bandwidth demand strains high-performance data networks, posing potential performance risks. TCP congestion control algorithms enhance reliability and optimize bandwidth usage. Network performance is influenced by factors such as AQM algorithms and router buffer size. In the context of constrained network resources, understanding how TCP flows share networks and the resulting performance impact is essential. This paper introduces insights into TCP fairness and performance involving a comparison of TCP CUBIC, Reno, Hamilton, and BBR versions 1 and 2 across real-world networks supporting high bandwidths of up to 25 Gbps. The research explores TCP behaviors with AQM algorithms like FIFO, FQ_CODEL, and RED, alongside diverse buffer sizes. Notably, findings reveal that manipulating buffers and queuing methods yields contrasting outcomes based on bandwidth. BBRv2 emerges as a superior fair algorithm, pivotal for swift transfers, particularly in scientific data scenarios. These results provide crucial guidance for future network design, ensuring equitable performance optimization.

Kiran, Mariam↗
DOE OSTI2025

Minimizing CGYRO HPC Communication Costs in Ensembles with XGYRO by Sharing the Collisional Constant Tensor Structure

First-principles fusion plasma simulations are both compute and memory intensive, and CGYRO is no exception. The use of many HPC nodes to fit the problem in the available memory thus results in significant communication overhead, which is hard to avoid for any single simulation. That said, most fusion studies are composed of ensembles of simulations, so we developed a new tool, named XGYRO, that executes a whole ensemble of CGYRO simulations as a single HPC job. By treating the ensemble as a unit, XGYRO can alter the global buffer distribution logic and apply optimizations that are not feasible on any single simulation, but only on the ensemble as a whole. The main saving comes from the sharing of the collisional constant tensor structure, since its values are typically identical between parameter-sweep simulations. This data structure dominates the memory consumption of CGYRO simulations, so distributing it among the whole ensemble results in drastic memory savings for each simulation, which in turn results in overall lower communication overhead.

CGYRO↗
DOE OSTI2025

Revenue-Maximizing Shared Parking and Electric Vehicle Charging Management in Multi-Unit Dwellings

In urban areas, searching for parking and electric vehicle (EV) charging can result in cruising, congestion, and environmental externalities. Recognizing the business opportunity of offering private parking and charging infrastructure access within multi-unit dwellings (MUDs) during daytime, we model a shared parking and EV charging management system. We maximize the revenue of MUD charging hubs in mixed land use, catering to public demand. Our approach accounts for the objectives of the two stakeholders involved: a demand model is fitted on the choices of EV charging users, and the supply model optimizes the allocation of parking and charging requests in an MUD parking lot. A binary integer linear programming model for the allocation of parking and charging spaces with a rolling horizon is integrated with matching rules that handle both parking and charging requests. In our numerical experiments in a neighborhood of Chicago, Illinois, we estimate the performance of the MUD parking and charging system with metrics that include revenue, number of matchings, and utilization rates. At any given time, MUDs with lower prices attract more charging requests, particularly those of longer duration, resulting in higher revenue and greater charging utilization. Dynamic pricing facilitates a more equitable distribution of requests; as MUD parking lots reach capacity and their fees increase, other MUDs become more competitive, attracting additional requests. Comparing our method against first-come-first-served and optimal-solution benchmarks, we demonstrate our model’s effectiveness in dynamically managing mixed parking and charging demand in MUD charging hubs.

electric vehicle, multi-unit dwelling, charging in↗
DOE OSTI2026

Substitution or Shared Utilization? Intrahousehold Vehicle Use in Mixed-Powertrain Households

While previous research has focused heavily on understanding the factors deriving alternative fuel vehicle adoption rates, there remains a significant gap in understanding how households distribute mileage across different powertrains. This study utilizes data from the 2022 Next Generation National Household Travel Survey to investigate vehicle miles traveled within a sample of 150 plug-in electric vehicle (PEV)-owning households (in which at least one battery electric vehicle is present), characterizing how different powertrains are integrated into daily mobility. Leveraging a Seemingly Unrelated Regression (SUR) framework the study jointly models the utilization of PEVs, hybrid electric vehicles (HEV), and internal combustion engine vehicles (ICEVs) while accounting for household-level substitution effects. The results provide evidence of an asymmetric substitution effect. In households with mixed-powertrain configurations, the ICEV captures a substantially higher share of household miles (compared with the PEV), acting as a utility sponge. Conversely, the model identifies specific socioeconomic and geographic cohorts that prioritize PEV as the primary household workhorse, indicating a systematic sorting effect. Although the sample size limits broader generalizability, these findings suggest that PEVs are used for frequent, specific routine-intensive roles, whereas the ICEV remains a specialized utility vehicle. These insights highlight distinct intrahousehold vehicle use behaviors that are often obscured by aggregate fleetwide statistics.

25 ENERGY STORAGE↗
DOE OSTI2012

Multi-core and many-core shared-memory parallel raycasting volume rendering optimization and tuning

Given the computing industry trend of increasing processing capacity by adding more cores to a chip, the focus of this work is tuning the performance of a staple visualization algorithm, raycasting volume rendering, for shared-memory parallelism on multi-core CPUs and many-core GPUs. Our approach is to vary tunable algorithmic settings, along with known algorithmic optimizations and two different memory layouts, and measure performance in terms of absolute runtime and L2 memory cache misses. Our results indicate there is a wide variation in runtime performance on all platforms, as much as 254% for the tunable parameters we test on multi-core CPUs and 265% on many-core GPUs, and the optimal configurations vary across platforms, often in a non-obvious way. For example, our results indicate the optimal configurations on the GPU occur at a crossover point between those that maintain good cache utilization and those that saturate computational throughput. This result is likely to be extremely difficult to predict with an empirical performance model for this particular algorithm because it has an unstructured memory access pattern that varies locally for individual rays and globally for the selected viewpoint. Our results also show that optimal parameters on modern architectures are markedly different from those in previous studies run on older architectures. In addition, given the dramatic performance variation across platforms for both optimal algorithm settings and performance results, there is a clear benefit for production visualization and analysis codes to adopt a strategy for performance optimization through auto-tuning. These benefits will likely become more pronounced in the future as the number of cores per chip and the cost of moving data through the memory hierarchy both increase.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

A model-based information sharing protocol for profile Hidden Markov Models used for HIV-1 recombination detection

Background: In many applications, a family of nucleotide or protein sequences classified into several subfamilies has to be modeled. Profile Hidden Markov Models (pHMMs) are widely used for this task, modeling each subfamily separately by one pHMM. However, a major drawback of this approach is the difficulty of dealing with subfamilies composed of very few sequences. One of the most crucial bioinformatical tasks affected by the problem of small-size subfamilies is the subtyping of human immunodeficiency virus type 1 (HIV-1) sequences, i.e., HIV-1 subtypes for which only a small number of sequences is known. Results: To deal with small samples for particular subfamilies of HIV-1, we introduce a novel model-based information sharing protocol. It estimates the emission probabilities of the pHMM modeling a particular subfamily not only based on the nucleotide frequencies of the respective subfamily but also incorporating the nucleotide frequencies of all available subfamilies. To this end, the underlying probabilistic model mimics the pattern of commonality and variation between the subtypes with regards to the biological characteristics of HI viruses. In order to implement the proposed protocol, we make use of an existing HMM architecture and its associated inference engine. Conclusions: We apply the modified algorithm to classify HIV-1 sequence data in the form of partial HIV-1 sequences and semi-artificial recombinants. Thereby, we demonstrate that the performance of pHMMs can be significantly improved by the proposed technique. Moreover, we show that our algorithm performs significantly better than Simplot and Bootscanning.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2015

Two-Party secret key distribution via a modified quantum secret sharing protocol

We present and demonstrate a method of distributing secret information based on N-party single-qubit Quantum Secret Sharing (QSS) in a modied plug-and-play two-party Quantum Key Distribution (QKD) system with N 2 intermediate nodes and compare it to both standard QSS and QKD. Our setup is based on the Clavis2 QKD system built by ID Quantique but is generalizable to any implementation. We show that any two out of N parties can build a secret key based on partial information from each other and with collaboration from the remaining N 2 parties. This method signicantly reduces the number of resources (single photon detectors, lasers and dark ber connections) needed to implement QKD on the grid.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2015

Escher: A Web Application for Building, Sharing, and Embedding Data-Rich Visualizations of Biological Pathways

Escher is a web application for visualizing data on biological pathways. Three key features make Escher a uniquely effective tool for pathway visualization. First, users can rapidly design new pathway maps. Escher provides pathway suggestions based on user data and genome-scale models, so users can draw pathways in a semi-automated way. Second, users can visualize data related to genes or proteins on the associated reactions and pathways, using rules that define which enzymes catalyze each reaction. Thus, users can identify trends in common genomic data types (e.g. RNA-Seq, proteomics, ChIP)—in conjunction with metabolite- and reaction-oriented data types (e.g. metabolomics, fluxomics). Third, Escher harnesses the strengths of web technologies (SVG, D3, developer tools) so that visualizations can be rapidly adapted, extended, shared, and embedded. This paper provides examples of each of these features and explains how the development approach used for Escher can be used to guide the development of future visualization tools.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2013

A Quartet of PIF bHLH Factors Provides a Transcriptionally Centered Signaling Hub That Regulates Seedling Morphogenesis through Differential Expression-Patterning of Shared Target Genes in Arabidopsis

Dark-grown seedlings exhibit skotomorphogenic development. Genetic and molecular evidence indicates that a quartet of Arabidopsis Phytochrome (phy)-Interacting bHLH Factors (PIF1, 3, 4, and 5) are critically necessary to maintaining this developmental state and that light activation of phy induces a switch to photomorphogenic development by inducing rapid degradation of the PIFs. Here, using integrated ChIP–seq and RNA–seq analyses, we have identified genes that are direct targets of PIF3 transcriptional regulation, exerted by sequence-specific binding to G-box (CACGTG) or PBE-box (CACATG) motifs in the target promoters genome-wide. In addition, expression analysis of selected genes in this set, in all triple pif-mutant combinations, provides evidence that the PIF quartet members collaborate to generate an expression pattern that is the product of a mosaic of differential transcriptional responsiveness of individual genes to the different PIFs and of differential regulatory activity of individual PIFs toward the different genes. Together with prior evidence that all four PIFs can bind to G-boxes, the data suggest that this collective activity may be exerted via shared occupancy of binding sites in target promoters.

59 BASIC BIOLOGICAL SCIENCES↗
DOE OSTI2017

ALFA Shared Autonomy Manipulation Data with a Seabotix vLBV300

This report outlines marine field demonstrations for manipulation tasks with a semi-Autonomous Underwater Vehicle (sAUV). The vehicle is built off a Seabotix vLBV300 platform with custom software interfacing it with the Robot Operating System (ROS). The vehicle utilizes an inertial navigation system available from Greensea Systems, Inc. based on a Gladiator Landmark 40 IMU coupled with a Teledyne Explorer Doppler Velocity Log to perform station keeping at a desired location and orientation. We performed two marine trials with the vehicle: a near-shore shared autonomy manipulation trial and an offshore attempted intervention trial. These demonstrations were designed to show the capabilities of our sAUV system for inspection and basic manipulation tasks in real marine environments.

16 TIDAL AND WAVE POWER↗
DOE OSTI2026

County Electric Vehicle Home Charging Access Shares From the 2030 National Charging Network Study

This file contains modeled county-level home electric vehicle charging access shares from the study The 2030 National Charging Network: Estimating U.S. Light-Duty Demand for Electric Vehicle Charging Infrastructure by Wood et al. (2023). These are based on modeling in There's No Place Like Home: Residential Parking, Electrical Access, and Implications for the Future of Electric Vehicle Charging Infrastructure by Ge et al. (2021).

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗