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 1,351 records · Page 75

Evolution of the SLATE linear algebra library

SLATE (Software for Linear Algebra Targeting Exascale) is a distributed, dense linear algebra library targeting both CPU-only and GPU-accelerated systems, developed over the course of the Exascale Computing Project (ECP). While it began with several documents setting out its initial design, significant design changes occurred throughout its development. In some cases, these were anticipated: an early version used a simple consistency flag that was later replaced with a full-featured consistency protocol. In other cases, performance limitations and software and hardware changes prompted a redesign. Sequential communication tasks were parallelized; host-to-host MPI calls were replaced with GPU device-to-device MPI calls; more advanced algorithms such as Communication Avoiding LU and the Random Butterfly Transform (RBT) were introduced. Early choices that turned out to be cumbersome, error prone, or inflexible have been replaced with simpler, more intuitive, or more flexible designs. Applications have been a driving force, prompting a lighter weight queue class, nonuniform tile sizes, and more flexible MPI process grids. Of paramount importance has been building a portable library that works across several different GPU architectures – AMD, Intel, and NVIDIA – while keeping a clean and maintainable codebase. Here we explore the evolving design choices and their effects, both in terms of performance and software sustainability.

Gates, Mark↗

Scalable Algorithms for Inverse Problems With High-Dimensional Parameter Spaces

Inverse problems, which involve inferring unknown parameters from observed data, present significant computational challenges, especially in large-scale settings with high-dimensional unknown parameters and nonlinear relationships between the unknowns and observations. Bayesian inference provides an approach for addressing these problems, often relying on sequential sampling methods like Markov chain Monte Carlo (MCMC) to approximate the posterior distribution of the parameters. However, MCMC methods become computationally demanding as the dimensionality of the problem increases, particularly in large-scale systems where likelihood evaluations rely on solving partial differential equations (PDEs) on large spatial domains with finely resolved meshes. To overcome these limitations, recent advancements have focused on designing scalable computa tional techniques – for both PDE simulations and sampling strategies – to make Bayesian methods feasible for high-dimensional problems.

97 MATHEMATICS AND COMPUTING↗

Analysis of thermal stress and metal movement during welding

Objectives of study were: investigation of temperature changes caused by welding arc with analysis of temperature distribution; development of system of mathematical statements describing thermal stresses and plastic strains during welding; and development of system of mathematical solutions and computer programs for one-dimensional analysis.

Andrews, J. B.↗

The analysis and design of transonic two-element airfoil systems

The multiphase effort in the development of tools for the analysis and design of two-element airfoil systems, that is, airfoils with a slat or a flap at transonic speeds is described. The first phase involved the development of a method to compute the inviscid flow over such configurations. In the second phase the inviscid code was coupled to a boundary layer calculation program in order to compute the loss in performance due to viscous effects. An inverse code that constructs the airfoil system corresponding to a desired pressure distribution is described.

Volpe, G.↗

Satellite communication performance evaluation: Computational techniques based on moments

Computational techniques that efficiently compute bit error probabilities when only moments of the various interference random variables are available are presented. The approach taken is a generalization of the well known Gauss-Quadrature rules used for numerically evaluating single or multiple integrals. In what follows, basic algorithms are developed. Some of its properties and generalizations are shown and its many potential applications are described. Some typical interference scenarios for which the results are particularly applicable include: intentional jamming, adjacent and cochannel interferences; radar pulses (RFI); multipath; and intersymbol interference. While the examples presented stress evaluation of bit error probilities in uncoded digital communication systems, the moment techniques can also be applied to the evaluation of other parameters, such as computational cutoff rate under both normal and mismatched receiver cases in coded systems. Another important application is the determination of the probability distributions of the output of a discrete time dynamical system. This type of model occurs widely in control systems, queueing systems, and synchronization systems (e.g., discrete phase locked loops).

Omura, J. K.↗

Visual monitoring of autonomous life sciences experimentation

The goal of this research project is the development of a computer vision system to monitor and control life sciences experimentation on board space stations. The vision system is organized as a multiprocessor system with distributed processes selectively analyzing hierarchical imagery in order to monitor and control the appropriate instrumentation.

Blank, G. E.↗

Weight estimation of unconventional structures by structural optimization

Automated techniques are presented that are used in structural optimization technology, with emphasis on modifications of finite element models to obtain an optimal material distribution for minimum weight while satisfying the prescribed design requirements. It is anticipated that the future development of computer aided engineering (CAE) system will provide environments where structural analysis, a design optimization, and weight evaluation modules are integrated, sharing a common data base. Structural optimization capabilities obtained by integrating a finite element structural analysis program and a numerical optimization code are developed and applied to two illustrative examples: marine gear housing structural weight minimization and joined wing structures.

Miura, Hirokazu↗

MPAD MCC workstation system: ADDAM and EEVE

The flight control consoles in mission control at NASA's Johnson Space Center have evolved in sophistication to the level where expert systems are now being incorporated into them as flight controller assistants. The evolution of the gateway mode, designed to obtain and redistribute numerous kinds of data provided by Mission Control computers over a laser-optical network to enable rapid prototyping development of the above application expert systems is described. This automated distribution and management system serves as an effective buffering system for assuring the necessarily separate requirements of the operational and developmental environments.

Kozick, Bill, Jr.↗

Supporting large scale applications on networks of workstations

Distributed applications on networks of workstations are an increasingly common way to satisfy computing needs. However, existing mechanisms for distributed programming exhibit poor performance and reliability as application size increases. Extension of the ISIS distributed programming system to support large scale distributed applications by providing hierarchical process groups is discussed. Incorporation of hierarchy in the program structure and exploitation of this to limit the communication and storage required in any one component of the distributed system is examined.

Cooper, Robert↗

Inverse problems and optimal experiment design in unsteady heat transfer processes identification

Experimental-computational methods for estimating characteristics of unsteady heat transfer processes are analyzed. The methods are based on the principles of distributed parameter system identification. The theoretical basis of such methods is the numerical solution of nonlinear ill-posed inverse heat transfer problems and optimal experiment design problems. Numerical techniques for solving problems are briefly reviewed. The results of the practical application of identification methods are demonstrated when estimating effective thermophysical characteristics of composite materials and thermal contact resistance in two-layer systems.

Artyukhin, Eugene A.↗

The evolving trend in spacecraft health analysis

The Space Flight Operations Center inaugurated the concept of a central data repository for spacecraft data and the distribution of computing power to the end users for that data's analysis at the Jet Propulsion Laboratory. The Advanced Multimission Operations System is continuing the evolution of this concept as new technologies emerge. Constant improvements in data management tools, data visualization, and hardware lead to ever expanding ideas for improving the analysis of spacecraft health in an era of budget constrained mission operations systems. The foundation of this evolution, its history, and its current plans will be discussed.

Kirkpatrick, Russell L.↗

Continuation: The EOSDIS testbed data system

The continuation of the EOSDIS testbed ('Testbed') has materialized from a multi-task system to a fully functional stand-alone data archive distribution center that once was only X-Windows driven to a system that is accessible by all types of users and computers via the World Wide Web. Throughout the past months, the Testbed has evolved into a completely new system. The current system is now accessible through Netscape, Mosaic, and all other servers that can contact the World Wide Web. On October 1, 1995 we will open to the public and we expect that the statistics of the type of user, where they are located, and what they are looking for will drastically change. What is the most important change in the Testbed has been the Web interface. This interface will allow more users access to the system and walk them through the data types with more ease than before. All of the callbacks are written in such a way that icons can be used to easily move around in the programs interface. The homepage offers the user the opportunity to go and get more information about each satellite data type and also information on free programs. These programs are grouped into categories for types of computers that the programs are compiled for, along with information on how to FTP the programs back to the end users computer. The heart of the Testbed is still the acquisition of satellite data. From the Testbed homepage, the user selects the 'access to data system' icon, which will take them to the world map and allow them to select an area that they would like coverage on by simply clicking that area of the map. This creates a new map where other similar choices can be made to get the latitude and longitude of the region the satellite data will cover. Once a selection has been made the search parameters page will appear to be filled out. Afterwards, the browse image will be called for once the search is completed and the images for viewing can be selected. There are several other option pages, but once an order has been selected the Testbed will bring up the order list page and the user will then be able to place their order. After the order has been completed, the Testbed will mail the user to notify them of the completed order and how the images can be picked up.

Emery, Bill↗

Platform-Independence and Scheduling In a Multi-Threaded Real-Time Simulation

Aviation research often relies on real-time, pilot-in-the-loop flight simulation as a means to develop new flight software, flight hardware, or pilot procedures. Often these simulations become so complex that a single processor is incapable of performing the necessary computations within a fixed time-step. Threads are an elegant means to distribute the computational work-load when running on a symmetric multi-processor machine. However, programming with threads often requires operating system specific calls that reduce code portability and maintainability. While a multi-threaded simulation allows a significant increase in the simulation complexity, it also increases the workload of a simulation operator by requiring that the operator determine which models run on which thread. To address these concerns an object-oriented design was implemented in the NASA Langley Standard Real-Time Simulation in C++ (LaSRS++) application framework. The design provides a portable and maintainable means to use threads and also provides a mechanism to automatically load balance the simulation models.

Sugden, Paul P.↗

Desorption Kinetics of O and CO from Graphitic Carbon Surfaces

The desorption of O/CO from graphitic carbon surfaces is investigated using a one-dimensional model describing the adsorbate interactions with the surface phonon bath. The kinetics of desorption are described through the solution of a master equation for the time-dependent population of the adsorbate in an oscillator state, which is modified through thermal fluctuations at the surface. The interaction of the adsorbate with the surface phonons is explicitly captured by using the computed phonon density Of states (PDOS) of the surface. The coupling of the adsorbate with the phonon bath results in the transition of the adsorbate up and down a vibrational ladder. The adsorbate-surface interaction is represented in the model using a Morse potential, which allows for the desorption process to be directly modeled as a transition from bound to free (continuum) state. The PDOS is a property of the material and the lattice; and is highly sensitive to the presence of defects. The effect of etch pits along with random surface defects on the PDOS is considered in the present work. The presence of defects causes a redshift and broadening of the PDOS, which in turn changes the phonon frequency modes available for adsorbate coupling at the surface. Using the realistic PDOS distributions, the phonon-induced desorption (PID) model was used to compute the transition and desorption rates for both pristine and defective systems. Mathissen’s rule is used to compute the phonon relaxation time for pristine and defective systems based on the phonon scattering times for each of the different scattering processes. First, the desorption rates of the pristine system is fitted against the experimental values to obtain the Morse potential parameters for each of the observed adatoms. These Morse potential parameters are used along with the defective PDOS and phonon relaxation time to compute the desorption rates for the defective system. The defective system rates (both transition and desorption) were consistently lower in comparison with the pristine system. The difference between the transition rates is more significant at lower initial states due to higher energy spacing between the levels. In the case of the desorption rates, the difference between the defective and pristine system is more significant at higher temperatures. The desorption rates for each of the system shows an order of magnitude decrease with the strongly bound systems exhibiting the greatest reduction in the desorption rates.

Swaminathan-Gopalan, Krishnan↗

Sparse Linear Algebra Toolkit for Computational Aerodynamics

Finding solutions to sparse linear systems of equations is an essential step in Computational Engineering applications of interest to NASA. Linear systems of equations are composed and solved in almost every computational engineering application. The characteristics of linear systems vary greatly from one application to another. Accordingly, there are a wide variety of methods for the solution of linear systems of equations. The operations and methods prepared by the authors are focused on linear systems of interest to NASA, primarily those associated with Computational Fluid Dynamics (CFD), Aeroelasticity, and Aeroacoustics. The Sparse Linear Algebra Toolkit (SLAT) is a coordinated collection of software featuring operations, methods, and data structures that are useful when solving sparse linear systems of equations on modern computer architectures. The implemented operations and methods are designed and tuned for parallelism in shared memory, in distributed memory, and across the hybrid combination of distributed-shared memory. The toolkit includes novel methods and implementations for modern architectures and facilitates development of new approaches for meeting NASA’s evolving computational engineering challenges using evolving computer architectures that are not available in vendor libraries. In this paper, significant features and interfaces within SLAT are presented and verified for simulations performed with NASA’s CFD solver, FUN3D. The runtime and scaling performance of the Generalized Minimum Residual (GMRES) method implemented in SLAT is analyzed for the linear subproblems within the solution of turbulent Navier-Stokes equations employed in the simulation of high-lift configurations. Prior to this work, the SPARSKIT GMRES implementation was the only Krylov subspace method available within FUN3D. A strong scaling study shows the SLAT GMRES implementation facilitates accurate Reynolds-averaged Navier-Stokes CFD solutions between 15% and 56% faster than the SPARSKIT GMRES implementation.

Stephen L Wood↗

Emergency Voltage Regulation in Power Systems via Ripple-Type Control: Preprint

With increasing penetration of volatile renewable generation and cyber-physical disruptions, ensuring safe operation of bulk power systems has become unprecedentedly challenging. Since communication and computational costs restrict centralized system dispatch to be called upon every few minutes; and purely local schemes are shown to be insufficient, distributed controls have been advocated for handling unanticipated system conditions in real time. However, the applicability of distributed control schemes is fundamentally limited by their need for widespread communication and model cognizance. In this con-text, we put forth a hybrid low-communication saturation-driven protocol for the coordination of control agents that are distributed over a physical system and are allowed to communicate with peers over a ‘hotline’ communication network. Under this protocol, when agents observe a constraint violation based on local measurements, they respond locally until their control resources saturate, in which case they send a beacon for assistance to peer agents. The scheme ensures that minor violations are efficiently mitigated via fast local controls, while severe violations may be handled by a collaboration of a relatively small set of agents. We evaluate the performance of this scheme via extensive numerical tests on the IEEE 14-bus test feeder, where agents act upon noisy measurements under diverse scenarios of random load variations and severe low/high voltage events.

distributed control↗

Energy I-Corps 2023: Distributed Wind Energy Toolkit

This presentation covers the purpose and scope of an Energy I-Corps project focused on refining a suite of analytical tools designed to support distributed wind deployment. These tools - the Distributed Generation Market Demand (dGen), Distributed Wind Tools Assessing Performance (TAP), and the Hybrid Optimization and Performance Platform (HOPP) - combine to provide users with the ability to simulate consumer purchasing behavior, accurately assess wind resource to better predict turbine performance, and effectively design and optimize hybrid systems that include distributed wind.

deployment↗

Improved Evaluation of Large Network Matrices for Linear Power Flow Within Optimization Problems: Preprint

This work discusses methods for evaluating the Power Transfer Distribution Factor (PTDF) and Line Outage Distribution Factor (LODF) matrices by employing sparse linear algebra for large-scale computing applications. These matrices are critical in many power systems applications, such as the Unit Commitment Problem (UC), pre- and post-contingency power flow analysis, and transmission expansion. These matrices are typically dense, which means they require a significant amount of time and memory to be computed for large networks. However, by analyzing the structure of the matrices and their computation method, it is possible to use reduced memory methods based on sparse matrix operations. This paper shows that sparse linear algebra algorithms are faster and require less memory and time than traditional dense approaches. Additionally, we explore the effect of matrix sparsification by eliminating trailing digits on power flow calculations.

ENERGY PLANNING, POLICY, AND ECONOMY↗