Search NASA⌕ Search

SEARCH · Search NASA

Results for “distributed 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 487 records · Page 27
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Human-computer interaction in distributed supervisory control tasks

An overview of activities concerned with the development and applications of the Operator Function Model (OFM) is presented. The OFM is a mathematical tool to represent operator interaction with predominantly automated space ground control systems. The design and assessment of an intelligent operator aid (OFMspert and Ally) is particularly discussed. The application of OFM to represent the task knowledge in the design of intelligent tutoring systems, designated OFMTutor and ITSSO (Intelligent Tutoring System for Satellite Operators), is also described. Viewgraphs from symposia presentations are compiled along with papers addressing the intent inferencing capabilities of OFMspert, the OFMTutor system, and an overview of intelligent tutoring systems and the implications for complex dynamic systems.

Mitchell, Christine M.↗
NASA NTRS1993

Measurements over distributed high performance computing and storage systems

A strawman proposal is given for a framework for presenting a common set of metrics for supercomputers, workstations, file servers, mass storage systems, and the networks that interconnect them. Production control and database systems are also included. Though other applications and third part software systems are not addressed, it is important to measure them as well.

Williams, Elizabeth↗
NASA NTRS1993

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗
NASA NTRS1993

The alignment-distribution graph

Implementing a data-parallel language such as Fortran 90 on a distributed-memory parallel computer requires distributing aggregate data objects (such as arrays) among the memory modules attached to the processors. The mapping of objects to the machine determines the amount of residual communication needed to bring operands of parallel operations into alignment with each other. We present a program representation called the alignment-distribution graph that makes these communication requirements explicit. We describe the details of the representation, show how to model communication cost in this framework, and outline several algorithms for determining object mappings that approximately minimize residual communication.

Chatterjee, Siddhartha↗
NASA NTRS1994

Application of a distributed network in computational fluid dynamic simulations

A general-purpose 3-D, incompressible Navier-Stokes algorithm is implemented on a network of concurrently operating workstations using parallel virtual machine (PVM) and compared with its performance on a CRAY Y-MP and on an Intel iPSC/860. The problem is relatively computationally intensive, and has a communication structure based primarily on nearest-neighbor communication, making it ideally suited to message passing. Such problems are frequently encountered in computational fluid dynamics (CDF), and their solution is increasingly in demand. The communication structure is explicitly coded in the implementation to fully exploit the regularity in message passing in order to produce a near-optimal solution. Results are presented for various grid sizes using up to eight processors.

Deshpande, Manish↗
NASA NTRS1996

Effects of Spatial Gradients on Electron Runaway Acceleration

The runaway process is known to accelerate electrons in many laboratory plasmas and has been suggested as an acceleration mechanism in some astrophysical plasmas, including solar flares. Current calculations of the electron velocity distributions resulting from the runaway process are greatly restricted because they impose spatial homogeneity on the distribution. We have computed runaway distributions which include consistent development of spatial gradients in the energetic tail. Our solution for the electron velocity distribution is presented as a function of distance along a finite length acceleration region, and is compared with the equivalent distribution for the infinitely long homogenous system (i.e., no spatial gradients), as considered in the existing literature. All these results are for the weak field regime. We also discuss the severe restrictiveness of this weak field assumption.

MacNeice, Peter↗
NASA NTRS2019

A Comparative Study on Computation of Cumulative Distribution Function in Predicting Time of Failure of Engineering Systems

Estimating accurate Time-of-Failure (ToF) of a system is key in making the decisions that impact operational safety and optimize cost. In this context, it is interesting to note that different approaches have been explored to tackle the problem of estimating ToF. The difference is in part characterized by different definitions of the hazard zones. The conventional definition for the cumulative distribution function (CDF) calculation is assumed to have well-defined hazard zones, that is, hazard zones defined as a function of the system state trajectory. An alternate method suggests the use of hazard zones defined as a function of the system state at time , instead of hazard zones defined as a function of system state up to and including time k (Acuna and Orchard 2018, 2017). This paper explores these differences and their impact on ToF estimation. Results for the conventional CDF definition indicated that, (i) the cumulative distribution function is always an increasing function of time, even when realizations of the degradation process are not monotonic, (ii) the sum of all probabilities is always 1 and does not need to be normalized, and (iii) all probabilities are positive and less than or equal to 1. Similar results are not observed for CDF calculation with hazard zones defined as a function only of the system state at time . Results for ToF estimation using Acuna's definition differ, suggesting that there is an underlying assumption of independence in the hazard zone definition. Therefore, we present an alternate definition of hazard zone which guarantees the properties of a well-defined CDF with a more straightforward ToF definition.

Hazard Zone↗
NASA NTRSDate not supplied

Derivation of Integrated Load Distributions from Resampled Computational Data

Principal component analysis (PCA) has been the center of many surrogate models used to characterize fluid flows in recent years. However, little work has been done to character- ize the uncertainty in the PCA transform itself and its effect on derived surrogate models. To explore the uncertainty, a typical interpolated surrogate model is constructed for a represen- tative aerodynamic body from computational data. The computational data is then resampled to explore the robustness of the PCA transformation. The variations of the model predictions during this resampling are analyzed to get a measure of confidence in the PCA transformation, which is then applied to the interpolated surrogate model to get uncertainty on integrated force predictions. An initial test case has been explored with promising results.

Principal Component Analysis↗
NASA NTRSDate not supplied

Derivation of Integrated Load Distributions from Resampled Computational Data

Principal component analysis (PCA) has been the center of many surrogate models used to characterize fluid flows in recent years. However, little work has been done to character- ize the uncertainty in the PCA transform itself and its effect on derived surrogate models. To explore the uncertainty, a typical interpolated surrogate model is constructed for a represen- tative aerodynamic body from computational data. The computational data is then resampled to explore the robustness of the PCA transformation. The variations of the model predictions during this resampling are analyzed to get a measure of confidence in the PCA transformation, which is then applied to the interpolated surrogate model to get uncertainty on integrated force predictions. An initial test case has been explored with promising results.

Computational Fluid Dynamics↗
DOE OSTI2025

SWARM: Reimagining scientific workflow management systems in a distributed world

Modern scientific workflows process massive amounts of data from diverse instruments and sensors, leveraging geographically distributed, heterogeneous compute and storage resources—from leadership-class systems to edge devices—connected by high-performance networks. The diversity of resources introduces challenges in harnessing their full potential, with resilience issues arising across applications, system software, networks, storage, and hardware. Today, workflow management systems (WMS) coordinate the execution of computation and data management tasks across target resources. However, WMS’s centralized nature makes them vulnerable to faults and scalability issues that may result in failures of entire computational campaigns. In conclusion, this paper introduces a novel agentic framework for workflow management, fully distributing and decentralizing the WMS functions and modeling them as swarm intelligence agents infused with advanced artificial intelligence solutions and traditional distributed computing algorithms that can make coordinated decisions in the presence of failures of the underlying cyberinfrastructure.

Swarm intelligence↗
NASA NTRS1994

Open solutions to distributed control in ground tracking stations

The advent of high speed local area networks has made it possible to interconnect small, powerful computers to function together as a single large computer. Today, distributed computer systems are the new paradigm for large scale computing systems. However, the communications provided by the local area network is only one part of the solution. The services and protocols used by the application programs to communicate across the network are as indispensable as the local area network. And the selection of services and protocols that do not match the system requirements will limit the capabilities, performance, and expansion of the system. Proprietary solutions are available but are usually limited to a select set of equipment. However, there are two solutions based on 'open' standards. The question that must be answered is 'which one is the best one for my job?' This paper examines a model for tracking stations and their requirements for interprocessor communications in the next century. The model and requirements are matched with the model and services provided by the five different software architectures and supporting protocol solutions. Several key services are examined in detail to determine which services and protocols most closely match the requirements for the tracking station environment. The study reveals that the protocols are tailored to the problem domains for which they were originally designed. Further, the study reveals that the process control model is the closest match to the tracking station model.

Heuser, William Randy↗
NASA NTRS1966

Computer programs calculate potential and charge distributions in a plasma

Computer program determines the potential and charge distributions between two electrodes in a plasma. Solutions of the Vlasov equations for plane, cylindrical, and spherical geometries are determined and density distributions are found for each of these configurations over a range of conditions.

Jefferies, N. P.↗
NASA NTRS1993

An inverse method for computation of structural stiffness distributions of aeroelastically optimized wings

An inverse method has been developed to compute the structural stiffness properties of wings given a specified wing loading and aeroelastic twist distribution. The method directly solves for the bending and torsional stiffness distribution of the wing using a modal representation of these properties. An aeroelastic design problem involving the use of a computational aerodynamics method to optimize the aeroelastic twist distribution of a tighter wing operating at maneuver flight conditions is used to demonstrate the application of the method. This exercise verifies the ability of the inverse scheme to accurately compute the structural stiffness distribution required to generate a specific aeroelastic twist under a specified aeroelastic load.

Schuster, David M.↗