Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “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 1,207 records · Page 67
All sourcesNASA NTRSDOE OSTI
NASA NTRS1972

Parallel operation of two Brayton-cycle alternators with parasitic speed controllers.

The experimental paralleling characteristics of two 1200-Hz Brayton-cycle alternators are presented. Since the Brayton power conversion system uses electric speed controllers, the paralleling requirements are somewhat different from those for conventional ground-based power systems. Results include the transient effects of synchronizing the two alternators with various phase-angle, voltage, and frequency differences. Based on these results, the effects of synchronizing differences can be defined, and adjustment requirements of the parasitic speed controllers during synchronizing can be established. Data indicate that parasitically loaded alternators are able to parallel over a wide range of synchronizing differences.

Perz, D. A.↗
NASA NTRS1972

Precision time distribution within a deep space communications complex

The Precision Time Distribution System (PTDS) at the Golstone Deep Space Communications Complex is a practical application of existing technology to the solution of a local problem. The problem was to synchronize four station timing systems to a master source with a relative accuracy consistently and significantly better than 10 microseconds. The solution involved combining a precision timing source, an automatic error detection assembly and a microwave distribution network into an operational system. Upon activation of the completed PTDS two years ago, synchronization accuracy at Goldstone (two station relative) was improved by an order of magnitude. It is felt that the validation of the PTDS mechanization is now completed. Other facilities which have site dispersion and synchronization accuracy requirements similar to Goldstone may find the PTDS mechanization useful in solving their problem. At present, the two station relative synchronization accuracy at Goldstone is better than one microsecond.

Curtright, J. B.↗
NASA NTRS1975

Motor run-up system

A starting system is described for bringing a large synchronous motor up to speed to prevent large power line disturbances at the moment the motor is connected to the power line. The system includes (1) a digital counter which generates a count determined by the difference in frequency between the power line and a small current generated by the synchronous motor; (2) a latch which stores the count; and (3) a comparator which compares the stored count with a newly generated count to determine whether the synchronous motor is accelerating or decelerating. Signals generated by the counter and comparator control the current to a clutch that couples a starting motor to the large synchronous motor.

Daeges, J. J.↗
NASA NTRS1981

Comparison between variable and fixed dwell-time PN acquisition algorithms

Pseudo noise (PN) spread spectrum systems require a very accurate alignment between the PN code epochs at the transmitter and receiver. This synchronism is typically established through a two-step algorithm, including a coarse synchronization procedure and a fine synchronization procedure. A standard approach for the coarse synchronization is a sequential search over all code phases. The measurement of the power in the filtered signal is used to either accept or reject the code phase under test as the phase of the received PN code. This acquisition strategy, called a single dwell-time system, has been analyzed by Holmes and Chen (1977). A synopsis of the field of sequential analysis as it applies to the PN acquisition problem is provided. From this, the implementation of the variable dwell time algorithm as a sequential probability ratio test is developed. The performance of this algorithm is compared to the optimum detection algorithm and to the fixed dwell-time system.

Braun, W. R.↗
NASA NTRS1985

Ensuring fault tolerance of phase-locked clocks

Processors within a real-time multiprocessor system must be synchronized with as little overhead as possible. Although synchronization can be achieved via both software (e.g., interactive convergence and interactive consistency algorithms) and hardware (e.g., multistage synchronizers and phase-locked clocks), phase-locked clocks are most attractive due to their small overheads. Despite the fact that synchronization of the multiprocessor system with phase-locked clocks is totally different in nature from the interactive consistency algorithm, it is presently proven that it must satisfy the same condition, N equal to or greater than 3m + 1, where N is the total number of clocks in the multiprocessor system and m is the maximum number of faults tolerable. Also presented are results showing how to design phase-locked clocks so as to be impervious up to a given arbitrary number of malicious failures.

Krishna, C. M.↗
NASA NTRS1986

Fairness of channel access for non-time-critical traffic using the FDDI token ring protocol

The Fiber Distributed Data Interface (FDDI) is an ANSI draft proposed standard for a 100 megabit per second fiber optic token ring. FDDI supports two types of traffic, synchronous and asynchronous. Synchronous traffic is time critical traffic; stations are assigned guaranteed bandwidth to support their synchronous needs. Asynchronous traffic is lower priority and is sent only if time permits. It is proved analytically that the FDDI access protocol provides all stations on the ring with equal access to the channel to transmit asynchronous frames, regardless of the relative sizes of synchronous bandwidth allocations for individual stations. Analytic results are supported with data from simulation runs.

Johnson, M. J.↗
NASA NTRS1987

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum-likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds derived on the symbol error probability as well as the probability of false synchronization indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗
NASA NTRS1987

Throughput analysis of the IEEE 802.4 token bus standard under heavy load

It has become clear in the last few years that there is a trend towards integrated digital services. Parallel to the development of public Integrated Services Digital Network (ISDN) is service integration in the local area (e.g., a campus, a building, an aircraft). The types of services to be integrated depend very much on the specific local environment. However, applications tend to generate data traffic belonging to one of two classes. According to IEEE 802.4 terminology, the first major class of traffic is termed synchronous, such as packetized voice and data generated from other applications with real-time constraints, and the second class is called asynchronous which includes most computer data traffic such as file transfer or facsimile. The IEEE 802.4 token bus protocol which was designed to support both synchronous and asynchronous traffic is examined. The protocol is basically a timer-controlled token bus access scheme. By a suitable choice of the design parameters, it can be shown that access delay is bounded for synchronous traffic. As well, the bandwidth allocated to asynchronous traffic can be controlled. A throughput analysis of the protocol under heavy load with constant channel occupation of synchronous traffic and constant token-passing times is presented.

Pang, Joseph↗
NASA NTRS1987

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position-modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based both on soft as well as hard data; these algorithms are seen to be easily implementable. Bounds were derived on the symbol error probability as well as the probability of false synchronization that indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗
NASA NTRS1988

Parallel discrete-event simulation of FCFS stochastic queueing networks

Physical systems are inherently parallel. Intuition suggests that simulations of these systems may be amenable to parallel execution. The parallel execution of a discrete-event simulation requires careful synchronization of processes in order to ensure the execution's correctness; this synchronization can degrade performance. Largely negative results were recently reported in a study which used a well-known synchronization method on queueing network simulations. Discussed here is a synchronization method (appointments), which has proven itself to be effective on simulations of FCFS queueing networks. The key concept behind appointments is the provision of lookahead. Lookahead is a prediction on a processor's future behavior, based on an analysis of the processor's simulation state. It is shown how lookahead can be computed for FCFS queueing network simulations, give performance data that demonstrates the method's effectiveness under moderate to heavy loads, and discuss performance tradeoffs between the quality of lookahead, and the cost of computing lookahead.

Nicol, David M.↗
NASA NTRS1988

Laser Doppler velocimeter multiplexer interface for simultaneous measured events

An Laser Doppler Velocimeter multiplexer interface (20) includes an event pulse synchronizer (162), which synchronizes data pulses from events A, B and C. Clock control (164) is connected to receive timing information on the data pushes from the synchronizer (162). Displays (24, 26, 28) are connected to receive clock signals from the clock control (164) for indicating a data rate for each of the measured events A, B and C. Display (3) is connected to receive clock signals form the clock control (164) to indicate a coincidence rate between data pulses for any selected combination of the measured events A, B and C. A multiplexer (156) receives the data pulses from the events A, B and C and rate data from the clock control (164). Multiplexer (156) has output (180) for supplying the data pulses and rate data to a single input of a data processing system. A multiplexer control (158) is connected to supply control signals to the multiplexer (156) for selecting the event data pulses and the rate data for output from the multiplexer (156). Multiplexer control (158) receives start signals from the pulse synchronizer (162) and user selected inputs for desired outputs from the multiplexer (156).

Dean R Harrison↗
NASA NTRS1989

Alternative majority-voting methods for real-time computing systems

Two techniques that provide a compromise between the high time overhead in maintaining synchronous voting and the difficulty of combining results in asynchronous voting are proposed. These techniques are specifically suited for real-time applications with a single-source/single-sink structure that need instantaneous error masking. They provide a compromise between a tightly synchronized system in which the synchronization overhead can be quite high, and an asynchronous system which lacks suitable algorithms for combining the output data. Both quorum-majority voting (QMV) and compare-majority voting (CMV) are most applicable to distributed real-time systems with single-source/single-sink tasks. All real-time systems eventually have to resolve their outputs into a single action at some stage. The development of the advanced information processing system (AIPS) and other similar systems serve to emphasize the importance of these techniques. Time bounds suggest that it is possible to reduce the overhead for quorum-majority voting to below that for synchronous voting. All the bounds assume that the computation phase is nonpreemptive and that there is no multitasking.

Shin, Kang G.↗
NASA NTRS1989

On the synchronizability and detectability of random PPM sequences

The problem of synchronization and detection of random pulse-position modulation (PPM) sequences is investigated under the assumption of perfect slot synchronization. Maximum-likelihood PPM symbol synchronization and receiver algorithms are derived that make decisions based on both soft as well as hard data; these algorithms are seen to be easily implementable. Bounds were derived on the symbol error probability as well as the probability of false synchronization that indicate the existence of a rather severe performance floor, which can easily be the limiting factor in the overall system performance. The performance floor is inherent in the PPM format and random data and becomes more serious as the PPM alphabet size Q is increased. A way to eliminate the performance floor is suggested by inserting special PPM symbols in the random data stream.

Georghiades, Costas N.↗
NASA NTRS1987

Exploiting virtual synchrony in distributed systems

Applications of a virtually synchronous environment are described for distributed programming, which underlies a collection of distributed programming tools in the ISIS2 system. A virtually synchronous environment allows processes to be structured into process groups, and makes events like broadcasts to the group as an entity, group membership changes, and even migration of an activity from one place to another appear to occur instantaneously, in other words, synchronously. A major advantage to this approach is that many aspects of a distributed application can be treated independently without compromising correctness. Moreover, user code that is designed as if the system were synchronous can often be executed concurrently. It is argued that this approach to building distributed and fault tolerant software is more straightforward, more flexible, and more likely to yield correct solutions than alternative approaches.

Birman, Kenneth P.↗
NASA NTRS1990

Experiment K-6-06. Morphometric and EM analyses of tibial epiphyseal plates from Cosmos 1887 rats

Light and electron microscopy studies were carried out on decalcified tibial epiphyseal plates of rats flown aboard Cosmos 1887 (12.5d flight plus 53.5h recovery). Analysis of variance showed that the proliferative zone of flight animals was significantly higher than that of synchronous controls, while the hypertrophic/calcification zone was significantly reduced. Flight animals had more cells than synchronous controls in the proliferative zone, and less in the hypertrophic/calcification region. The total number of cells, however, was significantly higher in flight animals. No differences were found for perimeter or shape factor of growth plates, but area was significantly lower in flight animals in comparison to synchronous controls. Collagen fibrils in flight animals were shorter and wider than in synchronous controls. The time required for a cell to cycle through the growth plate is 2 to 3 days, so most of the cells and matrix present were formed after the animals had returned to 1 g, and probably represent stages of recovery from microgravity exposure, which in itself is an interesting question.

Duke, P. J.↗
NASA NTRS1988

Evolution of magnetic cataclysmic binaries

The evolution of magnetic cataclysmic binaries is reviewed, with emphasis on the synchronization process by which DQ Herculis stars become AM Herculis stars. The various mechanisms that are thought to drive the evolution of cataclysmic binaries are discussed, and the criterion for stream versus disk accretion, the physics of the accretion and synchronization torques, and the conditions required for synchronization are described. The different physical regimes to which magnetic cataclysmic binaries belong are summarized, and how synchronization may be achieved, and how it may be broken, are considered.

Lamb, Don Q.↗
NASA NTRS1991

Asynchronous and corrected-asynchronous numerical solutions of parabolic PDES on MIMD multiprocessors

A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent process. Removing the synchronization constraint has the potential of speeding up the computation. The authors present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although the discussion concentrates on the Euler scheme for the solution of the heat equation, it has the potential for being extended to other schemes and other parabolic partial differential equations (PDEs). These schemes are analyzed and implemented on the shared memory multi-user Sequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that the synchronization penalty can be about 50 percent of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time level, and with the problem dimension. The efficiency of the AS may reach 90 percent and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient, but provides more accurate results for intermediate (non steady-state) values.

Amitai, Dganit↗
NASA NTRS1991

Precise time and time interval applications to electric power systems

There are many applications of precise time and time interval (frequency) in operating modern electric power systems. Many generators and customer loads are operated in parallel. The reliable transfer of electrical power to the consumer partly depends on measuring power system frequency consistently in many locations. The internal oscillators in the widely dispersed frequency measuring units must be syntonized. Elaborate protection and control systems guard the high voltage equipment from short and open circuits. For the highest reliability of electric service, engineers need to study all control system operations. Precise timekeeping networks aid in the analysis of power system operations by synchronizing the clocks on recording instruments. Utility engineers want to reproduce events that caused loss of service to customers. Precise timekeeping networks can synchronize protective relay test-sets. For dependable electrical service, all generators and large motors must remain close to speed synchronism. The stable response of a power system to perturbations is critical to continuity of electrical service. Research shows that measurement of the power system state vector can aid in the monitoring and control of system stability. If power system operators know that a lightning storm is approaching a critical transmission line or transformer, they can modify operating strategies. Knowledge of the location of a short circuit fault can speed the re-energizing of a transmission line. One fault location technique requires clocks synchronized to one microsecond. Current research seeks to find out if one microsecond timekeeping can aid and improve power system control and operation.

Robert E. Wilson↗