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 199 records · Page 11

Integrated flight/propulsion control system architectures for a high speed aircraft

The present investigation is concerned with the impact of integrated flight, inlet, and engine control system architectures on system effectiveness and life cycle cost (LCC). The aircraft employed in the investigation is a modified YF-12 with a cruise Mach number of 2.5. The aircraft has two advanced technology aircraft JT-69 afterburning, low-bypass turbofan engines. Advanced technologies suitable for use in future flight/propulsion control systems are related to distributed computer networks, fault tolerant computers and software, analytical redundancy, self-checking microprocessor pairs, advanced direct drive actuators, fiber optic data buses, VLSI microcircuits, and skewed sensors. The integrated architectures were found to have fewer sensors, actuators, and power sources than the nonintegrated architectures.

Bangert, L. H.↗

An improved multilevel optimization approach for the design of complex engineering systems

Multilevel optimization methods are being considered for the design of complex systems on distributed networks of computers or even parallel processors. An obstacle to the use of multilevel methods is that they can be computationally expensive because of the cycling necessary to account for the coupling between the subproblems. This research effort aims at increasing the efficiency of multilevel optimization by adapting two techniques that are widely used in conventional one-level optimization: constraint approximation and temporary constraint deletion. These improvements are implemented and tested on three-, ten- and 52-bar planar truss designs. The results show that for larger problems (approximately 100 design variables and larger), the cost of analysis dominates the total cost so that multilevel optimization is no more expensive than one-level optimization. If parallel processing is used or the analysis process itself is decomposed, then multilevel optimization stands to become more economical than one-level optimization.

Barthelemy, J.-F. M.↗

Analyzing Distributed Processing For Electric Utilities

Distributed Processing Trade-Off Model for Electric Utility Operation computer program based upon study performed at California Institute of Technology for NASA's Jet Propulsion Laboratory. Study presented technique addressing question of tradeoffs between expanding communications network or expanding capacity of distributed computers in energy-management systems (EMS) of electric utility. Gives EMS planners macroscopic tool for evaluation of architectures of distributed-processing systems and major technical and economic tradeoffs as well as interactions within systems.

Klein, Stanley A.↗

Automation in the Space Station module power management and distribution Breadboard

The Space Station Module Power Management and Distribution (SSM/PMAD) Breadboard, located at NASA's Marshall Space Flight Center (MSFC) in Huntsville, Alabama, models the power distribution within a Space Station Freedom Habitation or Laboratory module. Originally designed for 20 kHz ac power, the system is now being converted to high voltage dc power with power levels on a par with those expected for a space station module. In addition to the power distribution hardware, the system includes computer control through a hierarchy of processes. The lowest level process consists of fast, simple (from a computing standpoint) switchgear, capable of quickly safing the system. The next level consists of local load center processors called Lowest Level Processors (LLP's). These LLP's execute load scheduling, perform redundant switching, and shed loads which use more than scheduled power. The level above the LLP's contains a Communication and Algorithmic Controller (CAC) which coordinates communications with the highest level. Finally, at this highest level, three cooperating Artificial Intelligence (AI) systems manage load prioritization, load scheduling, load shedding, and fault recovery and management. The system provides an excellent venue for developing and examining advanced automation techniques. The current system and the plans for its future are examined.

Walls, Bryan↗

Augmentation of the space station module power management and distribution breadboard

The space station module power management and distribution (SSM/PMAD) breadboard models power distribution and management, including scheduling, load prioritization, and a fault detection, identification, and recovery (FDIR) system within a Space Station Freedom habitation or laboratory module. This 120 VDC system is capable of distributing up to 30 kW of power among more than 25 loads. In addition to the power distribution hardware, the system includes computer control through a hierarchy of processes. The lowest level consists of fast, simple (from a computing standpoint) switchgear that is capable of quickly safing the system. At the next level are local load center processors, (LLP's) which execute load scheduling, perform redundant switching, and shed loads which use more than scheduled power. Above the LLP's are three cooperating artificial intelligence (AI) systems which manage load prioritizations, load scheduling, load shedding, and fault recovery and management. Recent upgrades to hardware and modifications to software at both the LLP and AI system levels promise a drastic increase in speed, a significant increase in functionality and reliability, and potential for further examination of advanced automation techniques. The background, SSM/PMAD, interface to the Lewis Research Center test bed, the large autonomous spacecraft electrical power system, and future plans are discussed.

Walls, Bryan↗

Telescience - Optimizing aerospace science return through geographically distributed operations

The paper examines the objectives and requirements of teleoperations, defined as the means and process for scientists, NASA operations personnel, and astronauts to conduct payload operations as if these were colocated. This process is described in terms of Space Station era platforms. Some of the enabling technologies are discussed, including open architecture workstations, distributed computing, transaction management, expert systems, and high-speed networks. Recent testbedding experiments are surveyed to highlight some of the human factors requirements.

Rasmussen, Daryl N.↗

High order parallel numerical schemes for solving incompressible flows

The use of parallel computers for numerically solving flow fields has gained much importance in recent years. This paper introduces a new high order numerical scheme for computational fluid dynamics (CFD) specifically designed for parallel computational environments. A distributed MIMD system gives the flexibility of treating different elements of the governing equations with totally different numerical schemes in different regions of the flow field. The parallel decomposition of the governing operator to be solved is the primary parallel split. The primary parallel split was studied using a hypercube like architecture having clusters of shared memory processors at each node. The approach is demonstrated using examples of simple steady state incompressible flows. Future studies should investigate the secondary split because, depending on the numerical scheme that each of the processors applies and the nature of the flow in the specific subdomain, it may be possible for a processor to seek better, or higher order, schemes for its particular subcase.

Lin, Avi↗

Computer aided reliability, availability, and safety modeling for fault-tolerant computer systems with commentary on the HARP program

Many of the most challenging reliability problems of our present decade involve complex distributed systems such as interconnected telephone switching computers, air traffic control centers, aircraft and space vehicles, and local area and wide area computer networks. In addition to the challenge of complexity, modern fault-tolerant computer systems require very high levels of reliability, e.g., avionic computers with MTTF goals of one billion hours. Most analysts find that it is too difficult to model such complex systems without computer aided design programs. In response to this need, NASA has developed a suite of computer aided reliability modeling programs beginning with CARE 3 and including a group of new programs such as: HARP, HARP-PC, Reliability Analysts Workbench (Combination of model solvers SURE, STEM, PAWS, and common front-end model ASSIST), and the Fault Tree Compiler. The HARP program is studied and how well the user can model systems using this program is investigated. One of the important objectives will be to study how user friendly this program is, e.g., how easy it is to model the system, provide the input information, and interpret the results. The experiences of the author and his graduate students who used HARP in two graduate courses are described. Some brief comparisons were made with the ARIES program which the students also used. Theoretical studies of the modeling techniques used in HARP are also included. Of course no answer can be any more accurate than the fidelity of the model, thus an Appendix is included which discusses modeling accuracy. A broad viewpoint is taken and all problems which occurred in the use of HARP are discussed. Such problems include: computer system problems, installation manual problems, user manual problems, program inconsistencies, program limitations, confusing notation, long run times, accuracy problems, etc.

Shooman, Martin L.↗

A study of fracture mechanisms in ATD roller bearing

The purpose was to investigate how microstructures, especially anisotropy, affects internal stresses and the overall mechanical response of bearings. Samples with the stress axis along the aligned carbide direction possessed high modulus values compared to those with their axis perpendicular to the carbide stringers. The difference in the modulus was found to be more than a factor of two. A series of experiments was conducted on rolled samples to further investigate this effect; the two sets of results were consistent with each other. The degree of anisotropy of the microstructure in terms of the carbide and matrix orientations was determined using x-ray diffraction. The stress state determination was conducted using neutron diffraction. It was found that there was little variation in the distribution of the internal stresses amongst different samples, indicating that small changes in the processing and geometrical conditions did not result in significant variations in the internal stress. A nominal tensile hoop stress of 39 ksi was obtained for the inner raceway. Furthermore, during the course of the investigation, it was apparent that there was a need to determine the stress state induced by the shrink fitting process. Therefore, a series of experiments was conducted using strain gages to identify the stress distribution in a shrink fitting process in three different types of geometries. Correlations were obtained to estimate the highest stress values in the outer and inner groove geometry. A finite element program based on the ANSYS system was developed to compute the stress distribution in the inner raceway geometry. This analysis indicates that the highest tensile stress in the system occurs at the ID of the ring with a stress value of over 5 times that of the applied radial stress. Results from all these facets were correlated with one another. It appears that the material does not fail as a result of any one single factor, but results from a combination of the various factors investigated.

Zee, Ralph H.↗

Kanerva's sparse distributed memory: An associative memory algorithm well-suited to the Connection Machine

The advent of the Connection Machine profoundly changes the world of supercomputers. The highly nontraditional architecture makes possible the exploration of algorithms that were impractical for standard Von Neumann architectures. Sparse distributed memory (SDM) is an example of such an algorithm. Sparse distributed memory is a particularly simple and elegant formulation for an associative memory. The foundations for sparse distributed memory are described, and some simple examples of using the memory are presented. The relationship of sparse distributed memory to three important computational systems is shown: random-access memory, neural networks, and the cerebellum of the brain. Finally, the implementation of the algorithm for sparse distributed memory on the Connection Machine is discussed.

Rogers, David↗

Ground Support for the Space-Based Range Flight Demonstration 2

The primary objective of the NASA Space-Based Range Demonstration and Certification program was to develop and demonstrate space-based range capabilities. The Flight Demonstration 2 flights at NASA Dryden Flight Research Center were conducted to support Range Safety (commanding and position reporting) and high-rate (5 Mbps) Range User (video and data) requirements. Required ground support infrastructure included a flight termination system computer, the ground-data distribution network to send range safety commands and receive range safety and range user telemetry data and video, and the ground processing systems at the Dryden Mission Control Center to process range safety and range user telemetry data and video.

Burkes, Darryl A.↗

A distributed microprocessor system for spacecraft control and data handling

The specific requirements for spacecraft computing systems are considered. These requirements are partly related to the constraints of limited resources of power, weight, and volume. Another important factor is the requirement of extremely high reliability. These reliability requirements have led to introduction of automated redundancy techniques on board the spacecraft. The various redundant computers check each other and provide recovery procedures when a computer is found to have failed. Past and future capabilities are considered along with distributed processing requirements. System considerations are discussed, taking into account suboptimum computer throughput, sensitivity to software modifications, hierarchic timing, I/O granularity, restricted communications, synchronous functions, hierarchic control, and concurrent error detection. A description is presented of the Unified Data System (UDS), which consists of a set of standard microcomputers connected by several buses. Attention is also given to synchronization and timing, the executive control structure, the programming language, and the executive program.

Rennels, D. A.↗

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↗

Remote Earth Sciences data collection using ACTS

Given the focus on global change and the attendant scope of such research, we anticipate significant growth of requirements for investigator interaction, processing system capabilities, and availability of data sets. The increased complexity of global processes requires interdisciplinary teams to address them; the investigators will need to interact on a regular basis; however, it is unlikely that a single institution will house sufficient investigators with the required breadth of skills. The complexity of the computations may also require resources beyond those located within a single institution; this lack of sufficient computational resources leads to a distributed system located at geographically dispersed institutions. Finally the combination of long term data sets like the Pathfinder datasets and the data to be gathered by new generations of satellites such as SeaWiFS and MODIS-N yield extra-ordinarily large amounts of data. All of these factors combine to increase demands on the communications facilities available; the demands are generating requirements for highly flexible, high capacity networks. We have been examining the applicability of the Advanced Communications Technology Satellite (ACTS) to address the scientific, computational, and, primarily, communications questions resulting from global change research. As part of this effort three scenarios for oceanographic use of ACTS have been developed; a full discussion of this is contained in Appendix B.

Evans, Robert H.↗

Voltage profile program for the Kennedy Space Center electric power distribution system

The Kennedy Space Center voltage profile program computes voltages at all busses greater than 1 Kv in the network under various conditions of load. The computation is based upon power flow principles and utilizes a Newton-Raphson iterative load flow algorithm. Power flow conditions throughout the network are also provided. The computer program is designed for both steady state and transient operation. In the steady state mode, automatic tap changing of primary distribution transformers is incorporated. Under transient conditions, such as motor starts etc., it is assumed that tap changing is not accomplished so that transformer secondary voltage is allowed to sag.

Source record↗

Numerical Modeling of Flow Distribution in Micro-Fluidics Systems

This paper describes an application of a general purpose computer program, GFSSP (Generalized Fluid System Simulation Program) for calculating flow distribution in a network of micro-channels. GFSSP employs a finite volume formulation of mass and momentum conservation equations in a network consisting of nodes and branches. Mass conservation equation is solved for pressures at the nodes while the momentum conservation equation is solved at the branches to calculate flowrate. The system of equations describing the fluid network is solved by a numerical method that is a combination of the Newton-Raphson and successive substitution methods. The numerical results have been compared with test data and detailed CFD (computational Fluid Dynamics) calculations. The agreement between test data and predictions is satisfactory. The discrepancies between the predictions and test data can be attributed to the frictional correlation which does not include the effect of surface tension or electro-kinetic effect.

Majumdar, Alok↗

A distributed program composition system

A graphical technique for creating distributed computer programs is investigated and a prototype implementation is described which serves as a testbed for the concepts. The type of programs under examination is restricted to those comprising relatively heavyweight parts that intercommunicate by passing messages of typed objects. Such programs are often presented visually as a directed graph with computer program parts as the nodes and communication channels as the edges. This class of programs, called parts-based programs, is not well supported by existing computer systems; much manual work is required to describe the program to the system, establish the communication paths, accommodate the heterogeneity of data types, and to locate the parts of the program on the various systems involved. The work described solves most of these problems by providing an interface for describing parts-based programs in this class in a way that closely models the way programmers think about them: using sketches of diagraphs. Program parts, the computational modes of the larger program system are categorized in libraries and are accessed with browsers. The process of programming has the programmer draw the program graph interactively. Heterogeneity is automatically accommodated by the insertion of type translators where necessary between the parts. Many decisions are necessary in the creation of a comprehensive tool for interactive creation of programs in this class. Possibilities are explored and the issues behind such decisions are presented. An approach to program composition is described, not a carefully implemented programming environment. However, a prototype implementation is described that can demonstrate the ideas presented.

Brown, Robert L.↗