Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “time synchronization”

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 631 records · Page 35
All sourcesNASA NTRSDOE OSTI
NASA NTRS1982

Random digital encryption secure communication system

The design of a secure communication system is described. A product code, formed from two pseudorandom sequences of digital bits, is used to encipher or scramble data prior to transmission. The two pseudorandom sequences are periodically changed at intervals before they have had time to repeat. One of the two sequences is transmitted continuously with the scrambled data for synchronization. In the receiver portion of the system, the incoming signal is compared with one of two locally generated pseudorandom sequences until correspondence between the sequences is obtained. At this time, the two locally generated sequences are formed into a product code which deciphers the data from the incoming signal. Provision is made to ensure synchronization of the transmitting and receiving portions of the system.

Doland, G. D.↗
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 NTRS1990

Fault-tolerant clock synchronization in distributed systems

Existing fault-tolerant clock synchronization algorithms are compared and contrasted. These include the following: software synchronization algorithms, such as convergence-averaging, convergence-nonaveraging, and consistency algorithms, as well as probabilistic synchronization; hardware synchronization algorithms; and hybrid synchronization. The worst-case clock skews guaranteed by representative algorithms are compared, along with other important aspects such as time, message, and cost overhead imposed by the algorithms. More recent developments such as hardware-assisted software synchronization and algorithms for synchronizing large, partially connected distributed systems are especially emphasized.

Ramanathan, Parameswaran↗
NASA NTRS1986

A multicomputer and real time Ada environment

A multicomputer is defined as a set of tightly-coupled yet autonomous computers capable of synchronizing and communicating in parallel but also of operating independently. The architectural concepts and requirements for executing the Ada programs in a multicomputer system are discussed. Synchronization, commmunication, and protection of shared data between the Ada program entities are addressed. Decomposition or partitioning of the Ada program in a multicomputer system is also studied. Finally, a multicomputer and real time Ada environment is described using FLEX/32 multicomputer system.

Naeini, Ray↗
NASA NTRS1991

Timing system for firing widely spaced test nuclear detonations

The national weapons design laboratories (Los Alamos National Laboratory and Lawrence Livermore National Laboratory) test fire nuclear devices at the Nevada Test Site (NTS), which is spread over an area of over 1200 square miles (a bit larger than the state of Rhode island). On each test there are hundreds of high time resolution recordings made of nuclear output waveforms and other phenomena. In order to synchronize these recordings with each other, with the nuclear device, and with offsite recordings, there is a requirement that the permanent command center and the outlying temporary firing sites be time tied to each other and to UTC to permit firing the shot at a predetermined time with an accuracy of about a microsecond. The system is so designed that this can reduce to about 100 nanoseconds if it should prove necessary in the future.

Ralph E. Partridge↗
NASA NTRS1990

Performance bounds on parallel self-initiating discrete-event

The use is considered of massively parallel architectures to execute discrete-event simulations of what is termed self-initiating models. A logical process in a self-initiating model schedules its own state re-evaluation times, independently of any other logical process, and sends its new state to other logical processes following the re-evaluation. The interest is in the effects of that communication on synchronization. The performance is considered of various synchronization protocols by deriving upper and lower bounds on optimal performance, upper bounds on Time Warp's performance, and lower bounds on the performance of a new conservative protocol. The analysis of Time Warp includes the overhead costs of state-saving and rollback. The analysis points out sufficient conditions for the conservative protocol to outperform Time Warp. The analysis also quantifies the sensitivity of performance to message fan-out, lookahead ability, and the probability distributions underlying the simulation.

Nicol, David M.↗
NASA NTRS1988

Transmission delays in hardware clock synchronization

Various methods, both with software and hardware, have been proposed to synchronize a set of physical clocks in a system. Software methods are very flexible and economical but suffer an excessive time overhead, whereas hardware methods require no time overhead but are unable to handle transmission delays in clock signals. The effects of nonzero transmission delays in synchronization have been studied extensively in the communication area in the absence of malicious or Byzantine faults. The authors show that it is easy to incorporate the ideas from the communication area into the existing hardware clock synchronization algorithms to take into account the presence of both malicious faults and nonzero transmission delays.

Shin, Kang G.↗
NASA NTRS2001

Data Synchronization Discrepancies in a Formation Flight Control System

Aircraft hardware-in-the-loop simulation is an invaluable tool to flight test engineers; it reveals design and implementation flaws while operating in a controlled environment. Engineers, however, must always be skeptical of the results and analyze them within their proper context. Engineers must carefully ascertain whether an anomaly that occurs in the simulation will also occur in flight. This report presents a chronology illustrating how misleading simulation timing problems led to the implementation of an overly complex position data synchronization guidance algorithm in place of a simpler one. The report illustrates problems caused by the complex algorithm and how the simpler algorithm was chosen in the end. Brief descriptions of the project objectives, approach, and simulation are presented. The misleading simulation results and the conclusions then drawn are presented. The complex and simple guidance algorithms are presented with flight data illustrating their relative success.

Ryan, Jack↗
NASA NTRS2019

Telecommand/Telemetry Ranging for Deep-Space Applications

Conventional two-way pseudonoise (PN) ranging relies on measuring the time delay between a PN signal transmitted to the spacecraft, and a corresponding synchronized PN signal transmitted from the spacecraft and received on the ground. Recently, we introduced a two-way ranging method ([1], [2], [3]) which eliminates the need for the downlink PN ranging signal. In this telemetry ranging scheme, the requisite timing measurements are obtained from a databearing downlink telemetry signal. In the present paper, we extend the telemetry ranging concept by also eliminating the uplink PN signal, which is replaced by a data-bearing telecommand signal. We describe the architecture and concept of such a system, and describe the fundamental limitations of tracking the timing of such uplink telecommand signals when tracking loops or demod-remod correlation techniques are employed. An end-to-end performance analysis shows that in typical scenarios, ranging performance comparable to conventional PN ranging is possible.

Hamkins, Jon↗
NASA NTRS2009

Photometric Studies of GEO Orbital Debris

The photometric signature of a debris object can be useful in determining what the physical characteristics of a piece of debris are. We report on optical observations in multiple filters of debris at geosynchronous Earth orbit (GEO). Our sample is taken from GEO objects discovered in a survey with the University of Michigan's 0.6-m aperture Schmidt telescope MODEST (for Michigan Orbital DEbris Survey Telescope), and then followed up in real-time with the Cerro Tololo Inter- American Observatory (CTIO) 0.9-m for orbits and photometry. Our goal is to determine 6 parameter orbits and measure colors for all objects fainter than R=15th magnitude that are discovered in the MODEST survey. At this magnitude the distribution of observed angular rates changes significantly from that of brighter objects. There are two objectives: 1. Estimate the orbital distribution of objects selected on the basis of two observational criteria: brightness (magnitude) and angular rates. 2. Obtain magnitudes and colors in standard astronomical filters (BVRI) for comparison with reflectance spectra of likely spacecraft materials. What is the faint debris likely to be? More than 90 calibrated sequences of R-B-V-I-R magnitudes for a sample of 50 objects have been obtained with the CTIO 0.9-m. For objects that do not show large brightness variations, the colors are largely redder than solar in both B-R and R-I. The width of the color distribution may be intrinsic to the nature of the surfaces, but also could be that we are seeing irregularly shaped objects and measuring the colors at different times with just one telescope. For a smaller sample of objects we have observed with synchronized CCD cameras on the two telescopes. The CTIO 0.9-m observes in B, and MODEST in R. The CCD cameras are electronically linked together so that the start time and duration of observations are the same to better than 50 milliseconds. Thus the B-R color is a true measure of the surface of the debris piece facing the telescopes for that observation. Any change in color reflects a real change in the debris surface. We will compare our observations with models and laboratory measurements of selected surfaces.

Seitzer, Patrick↗
NASA NTRS2009

Photometric Studies of GEO Debris

The photometric signature of a debris object can be useful in determining what the physical characteristics of a piece of debris are. We report on optical observations in multiple filters of debris at geosynchronous Earth orbit (GEO). Our sample is taken from GEO objects discovered in a survey with the University of Michigan's 0.6-m aperture Schmidt telescope MODEST (for Michigan Orbital DEbris Survey Telescope), and then followed up in real-time with the SMARTS (Small and Medium Aperture Research Telescope System) 0.9-m at CTIO for orbits and photometry. Our goal is to determine 6 parameter orbits and measure colors for all objects fainter than R = 15 th magnitude that are discovered in the MODEST survey. At this magnitude the distribution of observed angular rates changes significantly from that of brighter objects. There are two objectives: 1. Estimate the orbital distribution of objects selected on the basis of two observational criteria: brightness (magnitude) and angular rates. 2. Obtain magnitudes and colors in standard astronomical filters (BVRI) for comparison with reflectance spectra of likely spacecraft materials. What is the faint debris likely to be? In this paper we report on the photometric results. For a sample of 50 objects, more than 90 calibrated sequences of R-B-V-I-R magnitudes have been obtained with the CTIO 0.9-m. For objects that do not show large brightness variations, the colors are largely redder than solar in both B-R and R-I. The width of the color distribution may be intrinsic to the nature of the surfaces, but also could be that we are seeing irregularly shaped objects and measuring the colors at different times with just one telescope. For a smaller sample of objects we have observed with synchronized CCD cameras on the two telescopes. The CTIO 0.9-m observes in B, and MODEST in R. The CCD cameras are electronically linked together so that the start time and duration of observations are the same to better than 50 milliseconds. Thus the B-R color is a true measure of the surface of the debris piece facing the telescopes for that observation. Any change in color reflects a real change in the debris surface.

Seitzer, Patrick↗
NASA NTRS1988

Analysis of FDDI synchronous traffic delays

The Fiber Distributed Data Interface (FDDI) high-speed token-ring protocol provides support for two classes of service: synchronous, to support applications which require deterministic access to the channel, and asynchronous, to support applications which do not have such stringent response-time requirements. The purpose of this paper is to determine how to set ring parameters to support synchronous traffic most efficiently. Both theoretical results and results obtained from a simulation study are presented.

Johnson, Marjory J.↗
NASA NTRS1982

Power-Factor Controller With Regenerative Braking

Modified power-factor motor-control circuit operates motor as a phase-controlled generator when load attempts to turn at higher than synchronous speed. An induction motor is required to act at times as a brake. Circuit modification allows power-factor controller to save energy in motoring mode and convert automatically to an induction-generator controller in generating, or braking, mode.

Nola, F. J.↗
NASA NTRS1985

Fast Clock Recovery for Digital Communications

Circuit extracts clock signal from random non-return-to-zero data stream, locking onto clock within one bit period at 1-gigabitper-second data rate. Circuit used for synchronization in opticalfiber communications. Derives speed from very short response time of gallium arsenide metal/semiconductor field-effect transistors (MESFET's).

Tell, R. G.↗
NASA NTRS1986

Dynamic remapping of parallel computations with varying resource demands

A large class of computational problems is characterized by frequent synchronization, and computational requirements which change as a function of time. When such a problem must be solved on a message passing multiprocessor machine, the combination of these characteristics lead to system performance which decreases in time. Performance can be improved with periodic redistribution of computational load; however, redistribution can exact a sometimes large delay cost. We study the issue of deciding when to invoke a global load remapping mechanism. Such a decision policy must effectively weigh the costs of remapping against the performance benefits. We treat this problem by constructing two analytic models which exhibit stochastically decreasing performance. One model is quite tractable; we are able to describe the optimal remapping algorithm, and the optimal decision policy governing when to invoke that algorithm. However, computational complexity prohibits the use of the optimal remapping decision policy. We then study the performance of a general remapping policy on both analytic models. This policy attempts to minimize a statistic W(n) which measures the system degradation (including the cost of remapping) per computation step over a period of n steps. We show that as a function of time, the expected value of W(n) has at most one minimum, and that when this minimum exists it defines the optimal fixed-interval remapping policy. Our decision policy appeals to this result by remapping when it estimates that W(n) is minimized. Our performance data suggests that this policy effectively finds the natural frequency of remapping. We also use the analytic models to express the relationship between performance and remapping cost, number of processors, and the computation's stochastic activity.

Nicol, D. M.↗
NASA NTRS1988

Parallel discrete event simulation using shared memory

With traditional event-list techniques, evaluating a detailed discrete-event simulation-model can often require hours or even days of computation time. By eliminating the event list and maintaining only sufficient synchronization to ensure causality, parallel simulation can potentially provide speedups that are linear in the numbers of processors. A set of shared-memory experiments, using the Chandy-Misra distributed-simulation algorithm, to simulate networks of queues is presented. Parameters of the study include queueing network topology and routing probabilities, number of processors, and assignment of network nodes to processors. These experiments show that Chandy-Misra distributed simulation is a questionable alternative to sequential-simulation of most queueing network models.

Reed, Daniel A.↗
NASA NTRS1990

Carrying Synchronous Voice Data On Asynchronous Networks

Buffers restore synchronism for internal use and permit asynchronism in external transmission. Proposed asynchronous local-area digital communication network (LAN) carries synchronous voice, data, or video signals, or non-real-time asynchronous data signals. Network uses double buffering scheme that reestablishes phase and frequency references at each node in network. Concept demonstrated in token-ring network operating at 80 Mb/s, pending development of equipment operating at planned data rate of 200 Mb/s. Technique generic and used with any LAN as long as protocol offers deterministic (or bonded) access delays and sufficient capacity.

Bergman, Larry A.↗
NASA NTRS1991

Plots of ground coverage achieveable by global change monitoring instruments and spacecraft

Low Earth Orbit (LEO) and Geosynchronous Earth Orbit (GEO) satellite plots are given. All satellites are in an 800 km circular orbit at an inclination of 98.6 deg (sun synchronous). Specifics of the instrument package are given. Additionally, the time period of the plot and the percentage of the Earth covered during the time period are listed.

Knight, Heather R.↗