Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Distributed System and Computing”

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
NASA NTRS1997

The Nature and Evolutionary History of GRO J1744-28

GRO J1744-28 is the first known X-ray source to display bursts, periodic pulsations, and quasi-periodic oscillations. This source may thus provide crucial clues that will lead to an understanding of the differences in the nature of the X-ray variability from various accreting neutron stars. The orbital period is 11.8 days, and the measured mass function of 1.31 x 10(exp -4) solar mass is one of the smallest among all known binaries. If we assume that the donor star is a low-mass giant transferring matter through the inner Lagrange point, then we can show that its mass is lower than approximately 0.7 solar mass and probably closer to 0.25 solar mass. Higher mass, but unevolved, donor stars are shown to be implausible. We also demonstrate that the current He core mass of the donor star lies in the range of 0.20-0.25 solar mass. Thus, this system is most likely in the final stages of losing its hydrogen-rich envelope, with only a small amount of mass remaining in the envelope. If this picture is correct, then GRO J1744-28 may well represent the closest observational link that we have between the low-mass X-ray binaries and recycled binary pulsars in wide orbits. We have carried out a series of binary evolution calculations and explored, both systematically and via a novel Monte Carlo approach, the range of initial system parameters and input physics that can lead to the binary parameters of the present-day GRO J1744-28 system. The input parameters include both the initial total mass and the core mass of the donor star, the neutron-star mass, the strength of the magnetic braking, the mass-capture fraction, and the specifics of the core mass/radius relation for giants. Through these evolution calculations, we compute probability distributions for the current binary system parameters (i.e., the total mass, core mass, radius, luminosity, and K-band magnitude of the donor star, the neutron star mass, the orbital inclination angle, and the semimajor axis of the binary). Our calculations yield the following values for the GRO J1744-28 system parameters (with 95% confidence limits in parentheses): donor star mass: 0.24 solar mass (0.2-0.7 solar mass); He core mass of the donor star: 0.22 solar mass (0.20-0.25 solar mass); neutron-star mass: 1.7 solar mass (1.39-1.96 solar mass); orbital inclination angle: 18deg (7deg-22deg); semi- major axis: 64 lt-s (60-67 lt-s); radius of the donor star: 6.2 solar radius(6-9 solar radius); luminosity of donor star: 23 solar luminosity (15-49 solar luminosity), and long-term mass transfer rate at the current epoch: 5 x 10(exp -10)solar mass/yr (2 x 10(exp -10) to 5 x 10(exp -9)solar mass/yr). We deduce that the magnetic field of the underlying neutron star lies in the range of approximately 1.8 x 10(exp 11)G to approximately 7 x 10(exp 11)G, with a most probable value of 2.7 x 10(exp 11)G. This is evidently sufficiently strong to funnel the accretion flow onto the magnetic polar caps and suppress the thermonuclear flashes that would otherwise give rise to the type 1 X-ray bursts observed in most X-ray bursters. We present a simple paradigm for magnetic accreting neutron stars where X-ray pulsars, GRO J1744-28, the Rapid Burster, and the type 1 X-ray bursters may form a continuum of possible behaviors among accreting neutron stars, with the strength of the neutron-star magnetic field serving as a crucial parameter that determines the mode of X-ray variability from a given object.

Rappaport, S.↗
NASA NTRS1989

The role of the host in a cooperating mainframe and workstation environment, volumes 1 and 2

In recent years, advancements made in computer systems have prompted a move from centralized computing based on timesharing a large mainframe computer to distributed computing based on a connected set of engineering workstations. A major factor in this advancement is the increased performance and lower cost of engineering workstations. The shift to distributed computing from centralized computing has led to challenges associated with the residency of application programs within the system. In a combined system of multiple engineering workstations attached to a mainframe host, the question arises as to how does a system designer assign applications between the larger mainframe host and the smaller, yet powerful, workstation. The concepts related to real time data processing are analyzed and systems are displayed which use a host mainframe and a number of engineering workstations interconnected by a local area network. In most cases, distributed systems can be classified as having a single function or multiple functions and as executing programs in real time or nonreal time. In a system of multiple computers, the degree of autonomy of the computers is important; a system with one master control computer generally differs in reliability, performance, and complexity from a system in which all computers share the control. This research is concerned with generating general criteria principles for software residency decisions (host or workstation) for a diverse yet coupled group of users (the clustered workstations) which may need the use of a shared resource (the mainframe) to perform their functions.

Kusmanoff, Antone↗
NASA NTRS2024

Computational Analysis of the X-57 Maxwell Airplane, the Landing Configuration with High-Lift Blowing and Aileron Deflections (Preliminary Fuselage)

The X-57 Maxwell is an all-electric airplane with a distributed electric propulsion system used for a high-lift system at takeoff and landing conditions. The Kestrel and USM3D flow solvers were used at NASA Langley to investigate the performance of the X-57 Maxwell in the development of an aerodynamic database. The configuration investigated in this paper had a 30° flap deflection, and in addition the pilot’s right aileron were deflected and undeflected in different cases. The solutions were computed at an airspeed of 58 KEAS, for an altitude of 6000 feet, and a flight Reynolds number of 0.588e+06 per foot. To evaluate the high-lift distributed electric propulsion system without aileron deflections, the solutions were computed for an angle-of-attack sweep from −2° to 20°, with the high-lift propellers blowing and the cruise propellers excluded from the simulation. To investigate the aileron effectiveness, the solutions were computed at angles of attack of −2° and 14°, for aileron deflections from −25° to 18° with the high-lift propellers blowing and the cruise propellers windmilling at idle-power. The high-lift propellers and the idle-power cruise propellers were modeled with an actuator disk. Results show negligible differences in lift, drag and pitching moment whether the idle-powered cruise propellers were included or excluded from the simulation. In general, the Kestrel and USM3D codes compared well for lift, drag and pitching moment for the landing configuration with no aileron control. The Kestrel code, using the Spalart-Allmaras turbulence model with the rotation corrections terms, predicted an increasing lift coefficient up to maximum lift coefficient of 4.65 at a 15° angle of attack. The USM3D code, using the Spalart-Allmaras turbulence model turbulence model with the Quadratic Constitutive Relation predicted an increasing lift coefficient up to maximum lift coefficient of 4.5 at a 12° angle of attack, with the lift remaining constant through a 14◦ angle of attack. A possible difference in lift coefficient between the codes for high angles of attack may result from the different available options used with the standard Spalart-Allmaras turbulence model. The Kestrel code predicted more drag across the range of angle of attack than the USM3D code. The codes compared well for pitching moment coefficient across the range of angle of attack. The Kestrel and USM3D codes compared well for aileron effectiveness at a 2° angle of attack. The Kestrel code predicts better aileron effectiveness than USM3D at a 14° angle of attack. There is more flow separation in the region outboard of the last high-lift nacelle for the USM3D solutions at a 14° angle of attack, which diminishes the ability of the aileron to be effective.

X-57 Maxwell Airplane↗
NASA NTRS1990

Remote voice training: A case study on space shuttle applications, appendix C

The Tile Automation System includes applications of automation and robotics technology to all aspects of the Shuttle tile processing and inspection system. An integrated set of rapid prototyping testbeds was developed which include speech recognition and synthesis, laser imaging systems, distributed Ada programming environments, distributed relational data base architectures, distributed computer network architectures, multi-media workbenches, and human factors considerations. Remote voice training in the Tile Automation System is discussed. The user is prompted over a headset by synthesized speech for the training sequences. The voice recognition units and the voice output units are remote from the user and are connected by Ethernet to the main computer system. A supervisory channel is used to monitor the training sequences. Discussions include the training approaches as well as the human factors problems and solutions for this system utilizing remote training techniques.

Mollakarimi, Cindy↗
DOE OSTI2020

Geomancy: Automated Performance Enhancement through Data Layout Optimization

Large distributed storage systems such as high- performance computing (HPC) systems used by national or international laboratories require sufficient performance and scale for demanding scientific workloads and must handle shifting workloads with ease. Ideally, data is placed in locations to optimize performance, but the size and complexity of large storage systems inhibit rapid effective restructuring of data layouts to maintain performance as workloads shift. To address these issues, we have developed Geomancy, a tool that models the placement of data within a distributed storage system and reacts to drops in performance. Using a combination of machine learning techniques suitable for temporal modeling, Geomancy determines when and where a bottleneck may happen due to changing workloads and suggests changes in the layout that mitigate or prevent them. Our approach to optimizing throughput offers benefits for storage systems such as avoiding potential bottlenecks and increasing overall I/O throughput from 11% to 30%.

Bel, Oceane M.↗
NASA NTRS1987

Distributed control architecture for real-time telerobotic operation

The emerging field of telerobotics places new demands on control system architecture to allow both autonomous operations and natural human-machine interfacing. The feasibility of multiprocessor systems performing parallel control computations is realizable. A practical distribution of control processors is presented and the issues involved in the realization of this architecture are discussed. A prototype dual axis controller based on the NOVIX computer is described, and results of its implementation are discussed. Application of this type of control system to a replicated, redundant manipulator system is also described.

Martin, H. L.↗
NASA NTRS2000

Multidisciplinary High-Fidelity Analysis and Optimization of Aerospace Vehicles: Formulation - Part 1

An objective of the High Performance Computing and Communication Program at the NASA Langley Research Center is to demonstrate multidisciplinary shape and sizing optimization of a complete aerospace vehicle configuration by using high-fidelity, finite element structural analysis and computational fluid dynamics aerodynamic analysis in a distributed, heterogeneous computing environment that includes high performance parallel computing. A software system has been designed and implemented to integrate a set of existing discipline analysis codes, some of them computationally intensive, into a distributed computational environment for the design of a highspeed civil transport configuration. The paper describes the engineering aspects of formulating the optimization by integrating these analysis codes and associated interface codes into the system. The discipline codes are integrated by using the Java programming language and a Common Object Request Broker Architecture (CORBA) compliant software product. A companion paper presents currently available results.

Walsh, J. L.↗
DOE OSTI2023

Streaming Readout and Remote Compute

Streaming Readout Data Acquisition systems coupled with distributed resources spread over vast geographic distances present new challenges to the next generation of experiments. High bandwidth modern network connectivity opens the possibility to utilize large, general-use, HTC systems that are not necessarily located close to the experiment. Near real-time response rates and workflow colocation can provide high reliability solutions to ensure efficient use of beam time. This talk will focus on a few technologies currently being developed at Jefferson Lab and in collaboration with ESnet to support fully streaming DAQ systems.

Lawrence, David↗
NASA NTRS1995

Nonlinear structural analysis on distributed-memory computers

A computational strategy is presented for the nonlinear static and postbuckling analyses of large complex structures on massively parallel computers. The strategy is designed for distributed-memory, message-passing parallel computer systems. The key elements of the proposed strategy are: (1) a multiple-parameter reduced basis technique; (2) a nested dissection (or multilevel substructuring) ordering scheme; (3) parallel assembly of global matrices; and (4) a parallel sparse equation solver. The effectiveness of the strategy is assessed by applying it to thermo-mechanical postbuckling analyses of stiffened composite panels with cutouts, and nonlinear large-deflection analyses of HSCT models on Intel Paragon XP/S computers. The numerical studies presented demonstrate the advantages of nested dissection-based solvers over traditional skyline-based solvers on distributed memory machines.

Watson, Brian C.↗
DOE OSTI2026

Risk-Aware Measurement Synchronization and Recovery for DSSE With Heterogeneous Data Sources

Power distribution systems are increasingly integrating heterogeneous sensors with varying data reporting rates and types, which pose challenges to achieving observability at the desired temporal resolution of distribution system state estimation (DSSE). Multisensor failures caused by extreme events exacerbate these issues, introducing substantial uncertainties into DSSE. This article proposes a novel solution to these challenges by ensuring high-resolution system observability despite heterogeneous data sources and multisensor failures. First, a deep learning architecture combining long short-term memory (LSTM) and graph convolutional network (GCN) is employed to synchronize meters with different reporting rates, aiming to achieve system observability. A random-walk-model-based approach is introduced to generate pseudo-measurements while properly characterizing their uncertainties under multisensor failures. Finally, a disaster-risk-informed observability metric (RiOM) is defined to quantify the uncertainty associated with state estimation results. The proposed framework offers deeper insights into the system observability on the fly compared with conventional analysis. The effectiveness of the framework is demonstrated on an IEEE standard test case and a large-scale real-world distribution feeder in mid-Minnesota in the U.S.

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2026

A Scalable, Distribution Network-Aware, Customer Privacy-Preserving Framework for Operation of Virtual Power Plants

This poster presents a hierarchical control framework for a virtual power plant that leverages behind-the-meter resources for grid services while maintaining customer privacy during setpoint disaggregation. Unlike many existing approaches, the virtual power plant model uses a hierarchical control strategy and an iterative approach to determine the optimal set point dis-aggregation without direct load control while maintaining system-level power flow and voltage constraints. The proposed approach is numerically validated on a synthetic distribution feeder in San Francisco, demonstrating the ability of the framework to provide privacy-preserving virtual power plant services.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Survey of Cybersecurity Governance, Threats, and Countermeasures for the Power Grid

The convergence of Information Technologies and Operational Technology systems in industrial networks presents many challenges related to availability, integrity, and confidentiality. In this paper, we evaluate the various cybersecurity risks in industrial control systems and how they may affect these areas of concern, with a particular focus on energy-sector Operational Technology systems. There are multiple threats and countermeasures that Operational Technology and Information Technology systems share. Since Information Technology cybersecurity is a relatively mature field, this paper emphasizes on threats with particular applicability to Operational Technology and their respective countermeasures. We identify regulations, standards, frameworks and typical system architectures associated with this domain. We review relevant challenges, threats, and countermeasures, as well as critical differences in priorities between Information and Operational Technology cybersecurity efforts and implications. These results are then examined against the recommended National Institute of Standards and Technology framework for gap analysis to provide a complete approach to energy sector cybersecurity. We provide analysis of countermeasure implementation to align with the continuous functions recommended for a sound cybersecurity framework.

29 ENERGY PLANNING, POLICY, AND ECONOMY↗
NASA NTRS1989

Pressure Distribution and Air Data System for the Aeroassist Flight Experiment

The Aeroassist Flight Experiment (AFE) is designed to provide critical flight data necessary for the design of future Aeroassist Space Transfer Vehicles (ASTV). This flight experiment will provide aerodynamic, aerothermodynamic, and environmental data for verification of experimental and computational flow field techniques. The Pressure Distribution and Air Data System (PD/ADS), one of the measurement systems incorporated into the AFE spacecraft, is designed to provide accurate pressure measurements on the windward surface of the vehicle. These measurements will be used to determine the pressure distribution and air data parameters (angle of attack, angle of sideslip, and free-stream dynamic pressure) encountered by the blunt-bodied vehicle over an altitude range of 76.2 km to 94.5 km. Design and development data are presented and include: measurement requirements, measurement heritage, theoretical studies to define the vehicle environment, flush-mounted orifice configuration, pressure transducer selection and performance evaluation data, and pressure tubing response analysis.

Gibson, Lorelei S.↗
DOE OSTI2021

Resilient Information Architecture Platform for Smart Grid (RIAPS)

A number of emerging trends will substantially alter the operation and control of the electric grid over the next several decades. These trends include ensuring resiliency under severe weather events, increasing integration of renewable electricity generation, supporting changing electricity demand patterns, and the improving cost effectiveness of distributed energy resources. To address these challenges, the future “Smart Grid” management will need to transition from centralized to coordinated distributed control paradigm. Reliable operation of the Smart Grid depends on distributed intelligence realized through software applications that run on distributed computing devices attached to the power system to collect data and collaboratively manage resources. However, much of the existing software for Smart Grid-enabled devices is either proprietary or developed with custom solutions, which limits interoperability among the heterogeneous devices and hinders the ability to manage system-level reliability, security, and resiliency requirements. Additionally, this approach makes Smart Grid applications hard to maintain, evolve, verify, and replace; resulting in high development and deployment costs. Further development of the Smart Grid requires a reusable software base-layer to move from hard-coded functionality to a plug-and-play architecture capable of managing system-level objectives and constraints in addition to providing consistent common services across heterogeneous devices and applications. Vanderbilt University, in collaboration with North Carolina State University and Washington State University has developed a foundation ‘software platform’ for developing and deploying robust, reliable, effective and secure software applications for the Smart Grid. The Resilient Information Architecture Platform for the Smart Grid (RIAPS) provides core services for building effective and powerful smart grid applications. It offers unique services for real-time data dissemination, fault tolerance, and coordination across apps distributed over the network.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2025

Decentralized Distributed Proximal Policy Optimization (DD-PPO) for High Performance Computing Scheduling on Multi-User Systems

Resource allocation in High Performance Computing (HPC) environments presents a complex and multifaceted challenge for job scheduling algorithms. Beyond the efficient allocation of system resources, schedulers must account for and optimize multiple performance metrics, including job wait time and system throughput. Traditional heuristic-based scheduling algorithms increasingly struggle and lack the efficiency needed to meet the demands and address the complexity and scale of modern HPC systems. Consequently, recent research efforts have focused on leveraging advancements in Artificial Intelligence (AI) and Deep Learning (DL), particularly Reinforcement Learning (RL), to develop more adaptable and intelligent scheduling strategies. Previous RL-based scheduling approaches have explored a range of algorithms, from Deep Q-Networks (DQN) to Proximal Policy Optimization (PPO), and more recently, hybrid methods that integrate Graph Neural Networks (GNNs) with RL techniques. However, a common limitation across these methods is their reliance on relatively small datasets, with few methods being evaluated using large-scale, multi-million-job trace datasets representative of real-world HPC workloads. Moreover, existing RL schedulers face scalability issues due to centralized policy updates, which hinder training efficiency and performance when applied to large datasets. This study introduces a novel RL-based scheduler utilizing Decentralized Distributed Proximal Policy Optimization (DD-PPO) algorithm, which supports large-scale distributed training across multiple workers without requiring parameter synchronization at every step. By eliminating reliance on centralized updates to a shared policy, the DD-PPO scheduler enhances scalability, training efficiency, and sample utilization. Experimental validation using a large real-world dataset containing over 11.5 million job traces collected from petascale HPC systems over six years assesses the influence of dataset scale on training effectiveness and compares DD-PPO performance to traditional and advanced scheduling approaches. The experimental results demonstrate improved scheduling performance in comparison to both heuristic-based schedulers and existing RL-based scheduling algorithms.

AI↗
NASA NTRS2018

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

Corbetta, M.↗
NASA NTRS2019

A Fast Monte Carlo Method for Model-Based Prognostics Based on Stochastic Calculus

This work proposes a fast Monte Carlo method to solve differential equations utilized in model-based prognostics. The methodology is derived from the theory of stochastic calculus, and the goal of such a method is to speed up the estimation of the probability density functions describing the independent variable evolution over time. In the prognostic scenarios presented in this paper, the stochastic differential equations describe variables directly or indirectly related to the degradation of a monitored system. The method allows the estimation of the probability density functions by solving the deterministic equation and approximating the stochastic integrals using samples of the model noise. By so doing, the prognostic problem is solved without the Monte Carlo simulation based on Euler's forward method, which is typically the most time consuming task of the prediction stage. Three different prognostic scenarios are presented as proof of concept: (i) life prediction of electrolytic capacitors, (ii) remaining time to discharge of Lithium-ion batteries, and (iii) prognostic of cracked structures under fatigue loading. The paper shows how the method produces probability density functions that are statistically indistinguishable from the distributions estimated with Euler's forward Monte Carlo simulation. However, the proposed solution is orders of magnitude faster when computing the time-to-failure distribution of the monitored system. The approach may enable complex real-time prognostics and health management solutions with limited computing power.

stochastic calculus↗