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 325 records · Page 18
All sourcesNASA NTRSDOE OSTI
NASA NTRS1979

Approaches to adaptive digital control focusing on the second order modal descriptions of large, flexible spacecraft dynamics

The widespread modal analysis of flexible spacecraft and recognition of the poor a priori parameterization possible of the modal descriptions of individual structures have prompted the consideration of adaptive modal control strategies for distributed parameter systems. The current major approaches to computationally efficient adaptive digital control useful in these endeavors are explained in an original, lucid manner using modal second order structure dynamics for algorithm explication. Difficulties in extending these lumped-parameter techniques to distributed-parameter system expansion control are cited.

Johnson, C. R., Jr.↗
DOE OSTI2020

How fast can one resize a distributed file system?

Efficient resource utilization becomes a major concern as large-scale distributed computing infrastructures keep growing in size. Malleability, the possibility for resource managers to dynamically increase or decrease the amount of resources allocated to a job, is a promising way to save energy and costs. However, state-of-the-art parallel and distributed storage systems have not been designed with malleability in mind. The reason is mainly the supposedly high cost of data transfers required by resizing operations. Nevertheless, as network and storage technologies evolve, old assumptions about potential bottlenecks can be revisited. In this study, we evaluate the viability of malleability as a design principle for a distributed storage system. We specifically model the minimal duration of the commission and decommission operations. To show how our models can be used in practice, we evaluate the performance of these operations in HDFS, a relevant state-of-the-art distributed file system. We show that the existing decommission mechanism of HDFS is good when the network is the bottleneck, but can be accelerated by up to a factor 3 when storage is the limiting factor. We also show that the commission in HDFS can be substantially accelerated. With the highlights provided by our model, we suggest improvements to speed both operations in HDFS. We discuss how the proposed models can be generalized for distributed file systems with different assumptions and what perspectives are open for the design of efficient malleable distributed file systems.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2002

Planning Systems for Distributed Operations

This viewgraph representation presents an overview of the mission planning process involving distributed operations (such as the International Space Station (ISS)) and the computer hardware and software systems needed to support such an effort. Topics considered include: evolution of distributed planning systems, ISS distributed planning, the Payload Planning System (PPS), future developments in distributed planning systems, Request Oriented Scheduling Engine (ROSE) and Next Generation distributed planning systems.

Maxwell, Theresa G.↗
DOE OSTI2025

A Review of Quantum Computing Technologies in Power System Optimization

As modern power grids increasingly integrate variable renewable generation, distributed energy resources, and energy storage systems, classical optimization techniques are facing unprecedented challenges. This review examines the emerging application of quantum computing to overcome these challenges in power system optimization, including optimal power flow (OPF), unit commitment (UC), economic dispatch (ED), and intelligent switching and topology optimization (IS-TO). Recent research has introduced various quantum methodologies—such as gate-based, annealing-based, variational algorithms, and quantum-inspired algorithms—to address the combinatorial complexity inherent in grid reconfiguration and energy management. The review summaries the quantum algorithms, quantum devices and the power system test cases, highlighting hybrid quantum–classical strategies that leverage the complementary strengths of both paradigms. Some quantum advantages have been observed, including theoretical speedup, accurate simulation results, scalable qubit usage, efficient QUBO mapping. In particular, the review emphasizes the importance of integrating quantum optimization techniques with classical control frameworks, these hybrid approaches demonstrate the potential to improve real-time grid management and operational reliability. A significant portion of the analysis is devoted to the practical limitations of current quantum devices. Present-day quantum hardware, operating in the noisy intermediate-scale quantum (NISQ) era, remains highly sensitive to noise and limited in qubit connectivity, which constrains the scale and accuracy of implemented algorithms. The review delves into specific challenges such as the need for qubit-efficient encoding techniques and error mitigation strategies that are critical for handling real-world grid optimization problems. In addition, the work draws attention to the performance discrepancies between theoretical quantum speedups and experimental validations, underscoring the importance of rigorous benchmark studies using representative power grid test cases. In summary, this review highlights both the promise and limitations of quantum computing for power system optimization. It provides a comprehensive overview of the state-of-the-art technologies, categorizes recent advancements in algorithm design, and discusses practical considerations for implementation, and serves as an informative resource on current research. Future research directions include developing robust hybrid frameworks, advancing qubit-efficient formulations, and scaling up experimental demonstrations to confirm the theoretical advantages of quantum methods in large-scale power system operations.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2022

Electromagnetic Transient (EMT) Simulation Algorithms for Evaluation of Large-Scale Extreme Fast Charging Systems (T&D Models)

Simulation of high-fidelity models of extreme fast charging (XFC) systems and large-area power grids with many XFCs can be time consuming in traditional simulators. Traditional simulators use a single method of discretization for all the components that results in imposing a large computational burden of inverting a large matrix as well as increased computations related to single method of discretization (that is typically a trapezoidal method). To overcome the problem of simulating large-area power grids with many XFCs, in this paper, advanced numerical simulation algorithms are applied for the first time together to reduce the dimension of matrix inversion. Here, the algorithms include numerical stiffness-based segregation, time constant-based segregation, clustering and aggregation on differential algebraic equations (DAEs), and multi-order integration approaches. These algorithms apply multiple discretization algorithms rather than a single discretization algorithm that further reduces the computational burden. The approaches mentioned here have resulted in speed-up of up to 18x in the simulation of a single distribution system with 15 XFCs and of up to 271x in the simulation of a transmission-distribution system with 300 XFCs in multiple distribution feeders with respect to conventional simulators (like power systems computer aided design [PSCAD]).

42 ENGINEERING↗
DOE OSTI2024

Taylor-Expansion-Based Robust Power Flow in Unbalanced Distribution Systems: A Hybrid Data-Aided Method

Traditional power flow methods often adopt certain assumptions designed for passive balanced distribution systems, thus lacking practicality for unbalanced operation. moreover, their computation accuracy and efficiency are heavily subject to unknown errors and bad data in measurements or prediction data of distributed energy resources (ders). to address these issues, this paper proposes a hybrid data-aided robust power flow algorithm in unbalanced distribution systems, which combines taylor series expansion knowledge with a data-driven regression technique. the proposed method initiates a linearization power flow model to derive an explicitly analytical solution by modified taylor expansion. to mitigate the approximation loss that surges due to the der integration and bad data, we further develop a data-aided robust support vector regression approach to estimate the errors efficiently. comparative analysis in the 13-bus and 123-bus ieee unbalanced feeders shows that the proposed hybrid algorithm achieves superior computational efficiency, with guaranteed accuracy and robustness against outliers.

data-driven↗
DOE OSTI2024

Operational Analytics Studies for ATLAS Distributed Computing: Data Popularity Forecast and Utilization of the WLCG Centers

Operational analytics is the direction of research related to the analysis of the current state of computing processes and the prediction of future states in order to anticipate imbalances and take timely measures to stabilize a complex system. There are two relevant areas in ATLAS Distributed Computing that are currently the focus of studies: user physics analysis including the forecast of popularity of data samples among users, and evaluating WLCG centers for their readiness to process user analysis payloads. Studying these areas is challenging due to the complexity involved, as it requires a comprehensive understanding of numerous boundary conditions typically found in large-scale distributed computing infrastructures. Forecasts of data popularity are problematic without the categorization of user tasks by their types (data transformation or physics analysis), which do not always appear on the surface but may induce noise, which introduces significant distortions for predictive analysis. Evaluating the WLCG resources by their analysis workloads is also a challenging task as it is necessary to find a balance between the workload of the resource, its performance, the waiting time for jobs on it, as well as the volume of jobs that it processes. This is especially difficult in a heterogeneous computing environment, where legacy resources are used along with modern high-performance machines. We will look at these areas of research in detail and discuss what tools and methods are used in our work, demonstrating results already obtained.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗
NASA NTRS1993

NASA Langley Research Center's distributed mass storage system

There is a trend in institutions with high performance computing and data management requirements to explore mass storage systems with peripherals directly attached to a high speed network. The Distributed Mass Storage System (DMSS) Project at NASA LaRC is building such a system and expects to put it into production use by the end of 1993. This paper presents the design of the DMSS, some experiences in its development and use, and a performance analysis of its capabilities. The special features of this system are: (1) workstation class file servers running UniTree software; (2) third party I/O; (3) HIPPI network; (4) HIPPI/IPI3 disk array systems; (5) Storage Technology Corporation (STK) ACS 4400 automatic cartridge system; (6) CRAY Research Incorporated (CRI) CRAY Y-MP and CRAY-2 clients; (7) file server redundancy provision; and (8) a transition mechanism from the existent mass storage system to the DMSS.

Pao, Juliet Z.↗
NASA NTRS1985

Some key considerations in evolving a computer system and software engineering support environment for the space station program

The space station data management system involves networks of computing resources that must work cooperatively and reliably over an indefinite life span. This program requires a long schedule of modular growth and an even longer period of maintenance and operation. The development and operation of space station computing resources will involve a spectrum of systems and software life cycle activities distributed across a variety of hosts, an integration, verification, and validation host with test bed, and distributed targets. The requirement for the early establishment and use of an apporopriate Computer Systems and Software Engineering Support Environment is identified. This environment will support the Research and Development Productivity challenges presented by the space station computing system.

Mckay, C. W.↗
NASA NTRS2019

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

negotiation↗
NASA NTRS2019

A Scheduling Algorithm Compatible with a Distributed Management of Arrivals in the National Airspace System

The current system used by the FAA to schedule arrivals is the Traffic Based Flow Manager (TBFM). It is a centralized system that gives an operator (airline) no influence over scheduled times of arrival assigned to its flights. Future systems for managing arrival scheduling are proposed as distributed systems. Such a system is called upon to give operators influence to schedule and negotiate resources for their flights, and to resolve other technical challenges, such as eliminating a single point of failure. A distributed system for managing diverse air traffic will need the capability of computing a schedule for the given arriving flights in a way that complies with the operational constraints. This paper contributes an algorithm that computes such a schedule. Although developed as part of an effort toward a distributed system, the algorithm itself is neither inherently distributed nor inherently centralized and can be used in either type of system.

Sadovsky, A.↗
DOE OSTI2020

Flexible Machine Learning-Based Cyberattack Detection Using Spatiotemporal Patterns for Distribution Systems

This letter develops a flexible machine learning detection method for cyberattacks in distribution systems considering spatiotemporal patterns. Spatiotemporal patterns are recognized by the graph Laplacian based on system-wide measurements. A flexible Bayes classifier (BC) is used to train spatiotemporal patterns which could be violated when cyberattacks occur. Cyberattacks are detected by using flexible BCs online. The effectiveness of the developed method is demonstrated through standard IEEE 13- and 123-node test feeders.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS2015

2nd Generation QUATARA Flight Computer Project

Single core flight computer boards have been designed, developed, and tested (DD&T) to be flown in small satellites for the last few years. In this project, a prototype flight computer will be designed as a distributed multi-core system containing four microprocessors running code in parallel. This flight computer will be capable of performing multiple computationally intensive tasks such as processing digital and/or analog data, controlling actuator systems, managing cameras, operating robotic manipulators and transmitting/receiving from/to a ground station. In addition, this flight computer will be designed to be fault tolerant by creating both a robust physical hardware connection and by using a software voting scheme to determine the processor's performance. This voting scheme will leverage on the work done for the Space Launch System (SLS) flight software. The prototype flight computer will be constructed with Commercial Off-The-Shelf (COTS) components which are estimated to survive for two years in a low-Earth orbit.

Falker, Jay↗
NASA NTRS1992

Concurrent file operations in a high performance FORTRAN

Distributed memory multiprocessor systems can provide the computing power necessary for large scale scientific applications. A critical performance issue for a number of these applications is the efficient transfer of data to secondary storage. Recently several research groups have proposed FORTRAN language extensions for exploiting the data parallelism of such scientific codes on distributed memory architectures. However, few of these high performance FORTRAN's provide appropriate constructs for controlling the use of the parallel I/O capabilities of modern multiprocessing machines. In this paper, we propose constructs to specify I/O operations for distributed data structures in the context of Vienna Fortran. These operations can be used by the programmer to provide information which can help the compiler and runtime environment make the most efficient use of the I/O subsystem.

Brezany, Peter↗
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↗