Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time distribution”

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 253 records · Page 14
All sourcesNASA NTRSDOE OSTI
NASA NTRS1989

Load sharing in distributed real-time systems with state-change broadcasts

A decentralized dynamic load-sharing (LS) method based on state-change broadcasts is proposed for a distributed real-time system. Whenever the state of a node changes from underloaded to fully loaded and vice versa, the node broadcasts this change to a set of nodes, called a buddy set, in the system. The performance of the method is evaluated with both analytic modeling and simulation. It is modeled first by an embedded Markov chain for which numerical solutions are derived. The model solutions are then used to calculate the distribution of queue lengths at the nodes and the probability of meeting task deadlines. The analytical results show that buddy sets of 10 nodes outperform those of less than 10 nodes, and the incremental benefit gained from increasing the buddy set size beyond 15 nodes is insignificant. These and other analytical results are verified by simulation. The proposed LS method is shown to meet task deadlines with a very high probability.

Shin, Kang G.↗
NASA NTRS1994

A performance analysis method for distributed real-time robotic systems: A case study of remote teleoperation

Robot coordination and control systems for remote teleoperation applications are by necessity implemented on distributed computers. Modeling and performance analysis of these distributed robotic systems is difficult, but important for economic system design. Performance analysis methods originally developed for conventional distributed computer systems are often unsatisfactory for evaluating real-time systems. The paper introduces a formal model of distributed robotic control systems; and a performance analysis method, based on scheduling theory, which can handle concurrent hard-real-time response specifications. Use of the method is illustrated by a case of remote teleoperation which assesses the effect of communication delays and the allocation of robot control functions on control system hardware requirements.

Lefebvre, D. R.↗
NASA NTRS1992

Software architecture for a distributed real-time system in Ada, with application to telerobotics

The architecture structure and software design methodology presented is described in the context of telerobotic application in Ada, specifically the Engineering Test Bed (ETB), which was developed to support the Flight Telerobotic Servicer (FTS) Program at GSFC. However, the nature of the architecture is such that it has applications to any multiprocessor distributed real-time system. The ETB architecture, which is a derivation of the NASA/NBS Standard Reference Model (NASREM), defines a hierarchy for representing a telerobot system. Within this hierarchy, a module is a logical entity consisting of the software associated with a set of related hardware components in the robot system. A module is comprised of submodules, which are cyclically executing processes that each perform a specific set of functions. The submodules in a module can run on separate processors. The submodules in the system communicate via command/status (C/S) interface channels, which are used to send commands down and relay status back up the system hierarchy. Submodules also communicate via setpoint data links, which are used to transfer control data from one submodule to another. A submodule invokes submodule algorithms (SMA's) to perform algorithmic operations. Data that describe or models a physical component of the system are stored as objects in the World Model (WM). The WM is a system-wide distributed database that is accessible to submodules in all modules of the system for creating, reading, and writing objects.

Olsen, Douglas R.↗
NASA NTRS1992

A real time correlator architecture using distributed arithmetic principles

A real time correlator design based on the principles of Distributed Arithmetic (DA) is described. This design is shown to be more efficient in terms of memory requirement than the direct DA implementation, especially when the number of coefficients is large. Since the proposed architecture implements the sum of product evaluation, it can be easily extended to finite and infinite response filters. Methods to further reduce the memory requirements are also discussed. A brief comparison is made between the proposed method and different DA implementations.

Premkumar, A. Benjamin↗
NASA NTRS1983

Stable feedback control of distributed parameter systems: Time and frequency domain conditions

Large space structures, or any mechanically flexible structures, are inherently distributed parameter systems (DPS) whose dynamics are modeled by partial, rather than ordinary, differential equations. Such DPS are described by operator equations on an infinite-dimensional Hilbert (or Banach) space. However, any feedback controller for such a DPS must be a finite-dimensional (and discrete-time) system in order to be implemented with on-line digital computers and a finite (small) number of actuators and sensors. There are many ways to synthesize such controllers; the Galerkin or finite-element approach is emphasized.

Balas, M. J.↗
NASA NTRS1996

Discrete Deterministic and Stochastic Petri Nets

Petri nets augmented with timing specifications gained a wide acceptance in the area of performance and reliability evaluation of complex systems exhibiting concurrency, synchronization, and conflicts. The state space of time-extended Petri nets is mapped onto its basic underlying stochastic process, which can be shown to be Markovian under the assumption of exponentially distributed firing times. The integration of exponentially and non-exponentially distributed timing is still one of the major problems for the analysis and was first attacked for continuous time Petri nets at the cost of structural or analytical restrictions. We propose a discrete deterministic and stochastic Petri net (DDSPN) formalism with no imposed structural or analytical restrictions where transitions can fire either in zero time or according to arbitrary firing times that can be represented as the time to absorption in a finite absorbing discrete time Markov chain (DTMC). Exponentially distributed firing times are then approximated arbitrarily well by geometric distributions. Deterministic firing times are a special case of the geometric distribution. The underlying stochastic process of a DDSPN is then also a DTMC, from which the transient and stationary solution can be obtained by standard techniques. A comprehensive algorithm and some state space reduction techniques for the analysis of DDSPNs are presented comprising the automatic detection of conflicts and confusions, which removes a major obstacle for the analysis of discrete time models.

MATHEMATICAL MODELS↗
NASA NTRS1976

Software techniques for a distributed real-time processing system

The paper describes software techniques developed for the Unified Data System (UDS), a distributed processor network for control and data handling onboard a planetary spacecraft. These techniques include a structured language for specifying the programs contained in each module, and a small executive program in each module which performs scheduling and implements the module task.

Lesh, F.↗
NASA NTRS2010

Towards the Formal Verification of a Distributed Real-Time Automotive System

We present the status of a project which aims at building, formally and pervasively verifying a distributed automotive system. The target system is a gate-level model which consists of several interconnected electronic control units with independent clocks. This model is verified against the specification as seen by a system programmer. The automotive system is implemented on several FPGA boards. The pervasive verification is carried out using combination of interactive theorem proving (Isabelle/HOL) and model checking (LTL).

Endres, Erik↗
NASA NTRS1988

An expert system for a distributed real-time trainer

The problem addressed by this expert system concerns the expansion of capability of a Real Time Trainer for the Spacelab flight crew. As requirements for more models or fidelity are placed upon the system, expansion is necessary. The simulator can be expanded using a larger processor or by going to a distributed system and expand by adding additional processors. The distributed system is preferable because it is more economical and can be expanded in a more incremental manner. An expert system was developed to evaluate modeling and timing capability within a real time training simulator. The expert system is based upon a distributed configuration. Components of the modeled system are control tasks, network tasks, emulator tasks, processors, displays, and a network. The distributed module expert system (DMES) allows the configuring of processors, tasks, display use, keyboard use, and selection of alternate methods to update the data buffer. Modules can be defined with execution occurring in a specific processor on a network. The system consists of a knowledge front end editor to interactively generate or update the knowledge base, an inference engine, a display module, and a recording module.

Purinton, Steven C.↗
NASA NTRS1994

Simulations of phase space distributions of storm time proton ring current

We use results of guiding-center simulations of ion transport to map phase space densities of the stormtime proton ring current. We model a storm as a sequence of substorm-associated enhancements in the convection electric field. Our pre-storm phase space distribution is an analytical solution to a steady-state transport model in which quiet-time radial diffusion balances charge exchange. This pre-storm phase space spectra at L approximately 2 to 4 reproduce many of the features found in observed quiet-time spectra. Using results from simulations of ion transport during model storms having main phases of 3, 6, and 12 hr, we map phase space distributions from the pre-storm distribution in accordance with Liouville's theorem. We find stormtime enhancements in the phase space densities at energies E approximately 30-160 keV for L approximately 2.5 to 4. These enhancements agree well with the observed stormtime ring current. For storms with shorter main phases (approximately 3 hr), the enhancements are caused mainly by the trapping of ions injected from open night side trajectories, and diffusive transport of higher-energy (greater than or approximately 160 keV) ions contributes little to the stormtime ring current. However, the stormtime ring current is augmented also by the diffusive transport of higher-energy ions (E greater than or approximately 160 keV) durinng stroms having longer main phases (greater than or approximately 6 hr). In order to account for the increase in Dst associated with the formation of the stormtime ring current, we estimate the enhancement in particle-energy content that results from stormtime ion transport in the equatorial magnetosphere. We find that transport alone cannot account for the entire increase in absolute value of Dst typical of a major storm. However, we can account for the entire increase in absolute value of Dst by realistically increasing the stormtime outer boundary value of the phase space density relative to the quiet-time value. We compute the magnetic field produced by the ring current itself and find that radial profiles of the magnetic field depression resemble those obtained from observational data.

Chen, Margaret W.↗
NASA NTRS1990

Sloppy-slotted ALOHA

Random access signaling, which allows slotted packets to spill over into adjacent slots, is investigated. It is shown that sloppy-slotted ALOHA can always provide higher throughput than conventional slotted ALOHA. The degree of improvement depends on the timing error distribution. Throughput performance is presented for Gaussian timing error distributions, modified to include timing error corrections. A general channel capacity lower bound, independent of the specific timing error distribution, is also presented.

Crozier, Stewart N.↗
NASA NTRS1974

Time-dependent polar distribution of outgassing from a spacecraft

A technique has been developed to obtain a characterization of the self-generated environment of a spacecraft and its variation with time, angular position, and distance. The density, pressure, outgassing flux, total weight loss, and other important parameters were obtained from data provided by two mass measuring crystal microbalances, mounted back to back, at distance of 1 m from the spacecraft equivalent surface. A major outgassing source existed at an angular position of 300 deg to 340 deg, near the rocket motor, while the weakest source was at the antennas. The strongest source appeared to be caused by a material diffusion process which produced a directional density at 1 m distance of about 1.6 x 10 to the 11th power molecules/cu cm after 1 hr in vacuum and decayed to 1.6 x 10 to the 9th power molecules/cu cm after 200 hr. The total average outgassing flux at the same distance and during the same time span changed from 1.2 x 10 to the minus 7th power to 1.4 x to the minus 10th power g/sq cm/s. These values are three times as large at the spacecraft surface. Total weight loss was 537 g after 10 hr and about 833 g after 200 hr. Self-contamination of the spacecraft was equivalent to that in orbit at about 300-km altitude.

Scialdone, J. J.↗
NASA NTRS1987

Timing issues in the distributed execution of Ada programs

This paper examines, in the context of distributed execution, the meaning of Ada constructs involving time. In the process, unresolved questions of interpretation and problems with the implementation of a consistent notion of time across a network are uncovered. It is observed that there are two Ada mechanisms that can involve a distributed sense of time: the conditional entry call, and the timed entry call. It is shown that a recent interpretation by the Language Maintenance Committee resolves the questions for the conditional entry calls but results in an anomaly for timed entry calls. A detailed discussion of alternative implementations for the timed entry call is made, and it is aruged that: (1) timed entry calls imply a common sense of time between the machines holding the calling and called tasks; and (2) the measurement of time for the expiration of the delay and the decision of whether or not to perform the rendezvous should be made on the machine holding the called task. The need to distinguish the unreadiness of the called task from timeouts caused by network failure is pointed out. Finally, techniques for realizing a single sense of time across the distributed system (at least to within an acceptable degree of uncertainty) are also discussed.

Volz, Richard A.↗
NASA NTRS2006

Model Predictive Optimal Control of a Time-Delay Distributed-Parameter Systems

This paper presents an optimal control method for a class of distributed-parameter systems governed by first order, quasilinear hyperbolic partial differential equations that arise in many physical systems. Such systems are characterized by time delays since information is transported from one state to another by wave propagation. A general closed-loop hyperbolic transport model is controlled by a boundary control embedded in a periodic boundary condition. The boundary control is subject to a nonlinear differential equation constraint that models actuator dynamics of the system. The hyperbolic equation is thus coupled with the ordinary differential equation via the boundary condition. Optimality of this coupled system is investigated using variational principles to seek an adjoint formulation of the optimal control problem. The results are then applied to implement a model predictive control design for a wind tunnel to eliminate a transport delay effect that causes a poor Mach number regulation.

Nguyen, Nhan↗
NASA NTRS1992

The VLBA correlator: Real-time in the distributed era

The correlator is the signal processing engine of the Very Long Baseline Array (VLBA). Radio signals are recorded on special wideband (128 Mb/s) digital recorders at the 10 telescopes, with sampling times controlled by hydrogen maser clocks. The magnetic tapes are shipped to the Array Operations Center in Socorro, New Mexico, where they are played back simultaneously into the correlator. Real-time software and firmware controls the playback drives to achieve synchronization, compute models of the wavefront delay, control the numerous modules of the correlator, and record FITS files of the fringe visibilities at the back-end of the correlator. In addition to the more than 3000 custom VLSI chips which handle the massive data flow of the signal processing, the correlator contains a total of more than 100 programmable computers, 8-, 16- and 32-bit CPUs. Code is downloaded into front-end CPU's dependent on operating mode. Low-level code is assembly language, high-level code is C running under a RT OS. We use VxWorks on Motorola MVME147 CPU's. Code development is on a complex of SPARC workstations connected to the RT CPU's by Ethernet. The overall management of the correlation process is dependent on a database management system. We use Ingres running on a Sparcstation-2. We transfer logging information from the database of the VLBA Monitor and Control System to our database using Ingres/NET. Job scripts are computed and are transferred to the real-time computers using NFS, and correlation job execution logs and status flow back by the route. Operator status and control displays use windows on workstations, interfaced to the real-time processes by network protocols. The extensive network protocol support provided by VxWorks is invaluable. The VLBA Correlator's dependence on network protocols is an example of the radical transformation of the real-time world over the past five years. Real-time is becoming more like conventional computing. Paradoxically, 'conventional' computing is also adopting practices from the real-time world: semaphores, shared memory, light-weight threads, and concurrency. This appears to be a convergence of thinking.

Wells, D. C.↗
NASA NTRS1993

The R-Shell approach - Using scheduling agents in complex distributed real-time systems

Large, complex real-time systems such as space and avionics systems are extremely demanding in their scheduling requirements. The current OS design approaches are quite limited in the capabilities they provide for task scheduling. Typically, they simply implement a particular uniprocessor scheduling strategy and do not provide any special support for network scheduling, overload handling, fault tolerance, distributed processing, etc. Our design of the R-Shell real-time environment fcilitates the implementation of a variety of sophisticated but efficient scheduling strategies, including incorporation of all these capabilities. This is accomplished by the use of scheduling agents which reside in the application run-time environment and are responsible for coordinating the scheduling of the application.

Natarajan, Swaminathan↗