Search NASA⌕ Search

SEARCH · Search NASA

Results for “partitioned operating system”

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 91 records · Page 5

Automated Instrumentation, Monitoring and Visualization of PVM Programs Using AIMS

We present views and analysis of the execution of several PVM codes for Computational Fluid Dynamics on a network of Sparcstations, including (a) NAS Parallel benchmarks CG and MG (White, Alund and Sunderam 1993); (b) a multi-partitioning algorithm for NAS Parallel Benchmark SP (Wijngaart 1993); and (c) an overset grid flowsolver (Smith 1993). These views and analysis were obtained using our Automated Instrumentation and Monitoring System (AIMS) version 3.0, a toolkit for debugging the performance of PVM programs. We will describe the architecture, operation and application of AIMS. The AIMS toolkit contains (a) Xinstrument, which can automatically instrument various computational and communication constructs in message-passing parallel programs; (b) Monitor, a library of run-time trace-collection routines; (c) VK (Visual Kernel), an execution-animation tool with source-code clickback; and (d) Tally, a tool for statistical analysis of execution profiles. Currently, Xinstrument can handle C and Fortran77 programs using PVM 3.2.x; Monitor has been implemented and tested on Sun 4 systems running SunOS 4.1.2; and VK uses X11R5 and Motif 1.2. Data and views obtained using AIMS clearly illustrate several characteristic features of executing parallel programs on networked workstations: (a) the impact of long message latencies; (b) the impact of multiprogramming overheads and associated load imbalance; (c) cache and virtual-memory effects; and (4significant skews between workstation clocks. Interestingly, AIMS can compensate for constant skew (zero drift) by calibrating the skew between a parent and its spawned children. In addition, AIMS' skew-compensation algorithm can adjust timestamps in a way that eliminates physically impossible communications (e.g., messages going backwards in time). Our current efforts are directed toward creating new views to explain the observed performance of PVM programs. Some of the features planned for the near future include: (a) ConfigView, showing the physical topology of the virtual machine, inferred using specially formatted IP (Internet Protocol) packets; and (b) LoadView, synchronous animation of PVM-program execution and resource-utilization patterns.

Mehra, Pankaj↗

Enhanced Graphics for Extended Scale Range

Enhanced Graphics for Extended Scale Range is a computer program for rendering fly-through views of scene models that include visible objects differing in size by large orders of magnitude. An example would be a scene showing a person in a park at night with the moon, stars, and galaxies in the background sky. Prior graphical computer programs exhibit arithmetic and other anomalies when rendering scenes containing objects that differ enormously in scale and distance from the viewer. The present program dynamically repartitions distance scales of objects in a scene during rendering to eliminate almost all such anomalies in a way compatible with implementation in other software and in hardware accelerators. By assigning depth ranges correspond ing to rendering precision requirements, either automatically or under program control, this program spaces out object scales to match the precision requirements of the rendering arithmetic. This action includes an intelligent partition of the depth buffer ranges to avoid known anomalies from this source. The program is written in C++, using OpenGL, GLUT, and GLUI standard libraries, and nVidia GEForce Vertex Shader extensions. The program has been shown to work on several computers running UNIX and Windows operating systems.

Hanson, Andrew J.↗

Introduction to IND and recursive partitioning, version 1.0

This manual describes the IND package for learning tree classifiers from data. The package is an integrated C and C shell re-implementation of tree learning routines such as CART, C4, and various MDL and Bayesian variations. The package includes routines for experiment control, interactive operation, and analysis of tree building. The manual introduces the system and its many options, gives a basic review of tree learning, contains a guide to the literature and a glossary, lists the manual pages for the routines, and instructions on installation.

Buntine, Wray↗

Power subsystem automation study

Generic power-system elements and their potential faults are identified. Automation functions and their resulting benefits are defined and automation functions between power subsystem, central spacecraft computer, and ground flight-support personnel are partitioned. All automation activities were categorized as data handling, monitoring, routine control, fault handling, planning and operations, or anomaly handling. Incorporation of all these classes of tasks, except for anomaly handling, in power subsystem hardware and software was concluded to be mandatory to meet the design and operational requirements of the space station. The key drivers are long mission lifetime, modular growth, high-performance flexibility, a need to accommodate different electrical user-load equipment, onorbit assembly/maintenance/servicing, and potentially large number of power subsystem components. A significant effort in algorithm development and validation is essential in meeting the 1987 technology readiness date for the space station.

Imamura, M. S.↗

Maintaining an expert system for the Hubble Space Telescope ground support

The transformation portion of the Hubble Space Telescope (HST) Proposal Entry Processor System converts astronomer-oriented description of a scientific observing program into a detailed description of the parameters needed for planning and scheduling. The transformation system is one of a very few rulebased expert systems that has ever entered an operational phase. The day to day operations of the system and its rulebase are no longer the responsibility of the original developer. As a result, software engineering properties of the rulebased approach become more important. Maintenance issues associated with the coupling of rules within a rulebased system are discussed and a method is offered for partitioning a rulebase so that the amount of knowledge needed to modify the rulebase is minimized. This method is also used to develop a measure of the coupling strength of the rulebase.

Lindenmayer, Kelly↗

Mission Operations of the Mars Exploration Rovers

A document describes a system of processes involved in planning, commanding, and monitoring operations of the rovers Spirit and Opportunity of the Mars Exploration Rover mission. The system is designed to minimize command turnaround time, given that inherent uncertainties in terrain conditions and in successful completion of planned landed spacecraft motions preclude planning of some spacecraft activities until the results of prior activities are known by the ground-based operations team. The processes are partitioned into those (designated as tactical) that must be tied to the Martian clock and those (designated strategic) that can, without loss, be completed in a more leisurely fashion. The tactical processes include assessment of downlinked data, refinement and validation of activity plans, sequencing of commands, and integration and validation of sequences. Strategic processes include communications planning and generation of long-term activity plans. The primary benefit of this partition is to enable the tactical portion of the team to focus solely on tasks that contribute directly to meeting the deadlines for commanding the rover s each sol (1 sol = 1 Martian day) - achieving a turnaround time of 18 hours or less, while facilitating strategic team interactions with other organizations that do not work on a Mars time schedule.

Bass, Deborah↗

Modeling and measurement of fault-tolerant multiprocessors

The workload effects on computer performance are addressed first for a highly reliable unibus multiprocessor used in real-time control. As an approach to studing these effects, a modified Stochastic Petri Net (SPN) is used to describe the synchronous operation of the multiprocessor system. From this model the vital components affecting performance can be determined. However, because of the complexity in solving the modified SPN, a simpler model, i.e., a closed priority queuing network, is constructed that represents the same critical aspects. The use of this model for a specific application requires the partitioning of the workload into job classes. It is shown that the steady state solution of the queuing model directly produces useful results. The use of this model in evaluating an existing system, the Fault Tolerant Multiprocessor (FTMP) at the NASA AIRLAB, is outlined with some experimental results. Also addressed is the technique of measuring fault latency, an important microscopic system parameter. Most related works have assumed no or a negligible fault latency and then performed approximate analyses. To eliminate this deficiency, a new methodology for indirectly measuring fault latency is presented.

Shin, K. G.↗

Application of an integrated flight/propulsion control design methodology to a STOVL aircraft

The application of an emerging Integrated Flight/Propulsion Control design methodology to a STOVL aircraft in transition flight is reported. The methodology steps consist of: (1) design of a centralized feedback controller to provide command tracking and stability and performance robustness considering the fully integrated airframe/propulsion model as one high-order system; (2) partition of the centralized controller into a decentralized, hierarchical form compatible with implementation requirements; and (3) design of command shaping prefilters from pilot control effectors to commanded variables to provide the overall desired response to pilot inputs. Intermediate design results using this methodology are presented, the complete point control design with the propulsion system operating schedule and limit protection logic included is evaluated for sample pilot control inputs, and the response is compared with that of an 'ideal response model' derived from Level I handling qualities requirements.

Garg, Sanjay↗

Optical system design for a Lunar Optical Interferometer

The moon offers particular advantages for interferometry, including a vacuum environment, a large stable base on which to assemble multi-kilometer baselines, and a cold nighttime temperature to allow for passive cooling of optics for high IR sensitivity. A baseline design for a Lunar Optical Interferometer (LOI) which exploits these features is presented. The instrument operates in the visible to mid-IL region, and is designed for both astrometry and synthesis imaging. The design uses a Y-shaped array of 12 siderostats, with maximum arm lengths of about 1 km. The inner siderostats are monitored in three dimensions from a central laser metrology structure to allow for high precision astrometry. The outer siderostats, used primarily for synthesis imaging, exploit the availability of bright reference stars in order to determine the instrument geometry. The path delay function is partitioned into coarse and fine components, the former accomplished with switched banks of range mirrors monitored with an absolute laser metrology system, and the latter with a short cat's eye delay line. The back end of the instrument is modular, allowing for beam combiners for astrometry, visible and IR synthesis imaging, and direct planet detection. With 1 m apertures, the instrument will have a point-source imaging sensitivity of about 29 mag; with the laser metrology system, astrometry at the microarcsecond level will be possible.

Colavita, M. M.↗

A Parallel Non-Overlapping Domain-Decomposition Algorithm for Compressible Fluid Flow Problems on Triangulated Domains

This paper considers an algebraic preconditioning algorithm for hyperbolic-elliptic fluid flow problems. The algorithm is based on a parallel non-overlapping Schur complement domain-decomposition technique for triangulated domains. In the Schur complement technique, the triangulation is first partitioned into a number of non-overlapping subdomains and interfaces. This suggests a reordering of triangulation vertices which separates subdomain and interface solution unknowns. The reordering induces a natural 2 x 2 block partitioning of the discretization matrix. Exact LU factorization of this block system yields a Schur complement matrix which couples subdomains and the interface together. The remaining sections of this paper present a family of approximate techniques for both constructing and applying the Schur complement as a domain-decomposition preconditioner. The approximate Schur complement serves as an algebraic coarse space operator, thus avoiding the known difficulties associated with the direct formation of a coarse space discretization. In developing Schur complement approximations, particular attention has been given to improving sequential and parallel efficiency of implementations without significantly degrading the quality of the preconditioner. A computer code based on these developments has been tested on the IBM SP2 using MPI message passing protocol. A number of 2-D calculations are presented for both scalar advection-diffusion equations as well as the Euler equations governing compressible fluid flow to demonstrate performance of the preconditioning algorithm.

Barth, Timothy J.↗

Automated Conduit Unloading

Large, cumbersome pipes removed from trailer by one operator. Swiveltruck trailer carries conduit and unloads it. Vertical bins interconnected by web belts that elevate conduit sections for delivery by gravity to unloading point. Trailer loaded with slurry-pipe sections 6 inches (15.2 centimeters) in diameter, but bin width readily changed to hold other sizes. Simple adjustments in bin-partition and web-belt positions needed to adapt system to different conduit cross sections.

Lewis, E. V.↗

Fast, efficient lossless data compression

This paper presents lossless data compression and decompression algorithms which can be easily implemented in software. The algorithms can be partitioned into their fundamental parts which can be implemented at various stages within a data acquisition system. This allows for efficient integration of these functions into systems at the stage where they are most applicable. The algorithms were coded in Forth to run on a Silicon Composers Single Board Computer (SBC) using the Harris RTX2000 Forth processor. The algorithms require very few system resources and operate very fast. The performance of the algorithms with the RTX enables real time data compression and decompression to be implemented for a wide range of applications.

Ross, Douglas↗

Dynamic Forms: Application to Aircraft Guidance - Part 2

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of waypoints through which the aircraft trajectory must pass. The waypoints typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory that satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multidimensional, multiaxis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordinatization, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions are required to be smooth. The proposed guidance algorithm is based on the inversion of the pure feedback approximation, followed by correction for the effects of zero dynamics. The paper describes the structure and major modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

Display system software for the integration of an ADAGE 3000 programmable display generator into the solid modeling package C.A.D. software

A software system that integrates an ADAGE 3000 Programmable Display Generator into a C.A.D. software package known as the Solid Modeling Program is described. The Solid Modeling Program (SMP) is an interactive program that is used to model complex solid object through the composition of primitive geomeentities. In addition, SMP provides extensive facilities for model editing and display. The ADAGE 3000 Programmable Display Generator (PDG) is a color, raster scan, programmable display generator with a 32-bit bit-slice, bipolar microprocessor (BPS). The modularity of the system architecture and the width and speed of the system bus allow for additional co-processors in the system. These co-processors combine to provide efficient operations on and rendering of graphics entities. The resulting software system takes advantage of the graphics capabilities of the PDG in the operation of SMP by distributing its processing modules between the host and the PDG. Initially, the target host computer was a PRIME 850, which was later substituted with a VAX-11/785. Two versions of the software system were developed, a phase 1 and a phase 2. In phase 1, the ADAGE 3000 is used as a frame buffer. In phase II, SMP was functionally partitioned and some of its functions were implemented in the ADAGE 3000 by means of ADAGE's SOLID 3000 software package.

Montoya, R. J.↗

LSI computer fabrication - SUMC/DV.

The SUMC/DV (Space Ultrareliable Modular Computer Demonstration Vehicle), which required the design and fabrication of ten different array types, was designed, partitioned, assembled, tested, and made completely operational in less than one year. This paper describes the assembly, the physical and electrical characteristics, and the basic electrical testing procedures used on SUMC/DV. The paper includes a description of the packaging concepts, the physical assembly, the fabrication and testing of the various components including the LSI/CMOS arrays, the hierarchy of the memory complement, the clock generation and distribution scheme, additional system testing techniques, and the procedure employed in the electrical checkout of the system.

Feller, A.↗

Guidance of Nonlinear Systems

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of way points through which the aircraft trajectory must pass. The way points typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory which satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multi-dimensional, multi-axis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of possible operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordination, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions must be smooth. The guidance algorithm is based on the inversion of the pure feedback approximations, which is followed by iterative corrections for the effects of zero dynamics. The paper describes the structure and modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

Guidance of Nonlinear Systems

The paper describes a method for guiding a dynamic system through a given set of points. The paradigm is a fully automatic aircraft subject to air traffic control (ATC). The ATC provides a sequence of way points through which the aircraft trajectory must pass. The way points typically specify time, position, and velocity. The guidance problem is to synthesize a system state trajectory which satisfies both the ATC and aircraft constraints. Complications arise because the controlled process is multi-dimensional, multi-axis, nonlinear, highly coupled, and the state space is not flat. In addition, there is a multitude of possible operating modes, which may number in the hundreds. Each such mode defines a distinct state space model of the process by specifying the state space coordinatization, the partition of the controls into active controls and configuration controls, and the output map. Furthermore, mode transitions must be smooth. The guidance algorithm is based on the inversion of the pure feedback approximations, which is followed by iterative corrections for the effects of zero dynamics. The paper describes the structure and modules of the algorithm, and the performance is illustrated by several example aircraft maneuvers.

Meyer, George↗

Airspace Complexity and its Application in Air Traffic Management

The United States Air Traffic Management (ATM) system provides services to enable safe, orderly and efficient aircraft operations within the airspace over the continental United States and over large portions of the Pacific and Atlantic Oceans, and the Gulf of Mexico. It consists of two components, Air Traffic Control (ATC) and Traffic Flow Management (TFM). The ATC function ensures that the aircraft within the airspace are separated at all times while the TFM function organizes the aircraft into a flow pattern to ensure their safe and efficient movement. In order to accomplish the ATC and TFM functions, the airspace over United States is organized into 22 Air Route Traffic Control Centers (ARTCCs). The Center airspace is stratified into low-altitude, high-altitude and super-high altitude groups of Sectors. Each vertical layer is further partitioned into several horizontal Sectors. A typical ARTCC airspace is partitioned into 20 to 80 Sectors. These Sectors are the basic control units within the ATM system.

Sridhar, Banavar↗