ATD-2 TTP Airport Information Messages
This document is the first of five documents that describe the TFDM Terminal Publication (TTP) implementation within ATD-2 including data message formats and data schemas.
message format specification↗
SEARCH · Search NASA
Results for “messages”
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.
ATD-2 TTP Flight Data Messages
This document is the second of five documents that describe the TFDM Terminal Publication (TTP) implementation within ATD-2 including data message formats and data schemas.
message format specification↗
ATD-2 TTP Traffic Management Messages
This document is the fifth of five documents that describe the TFDM Terminal Publication (TTP) implementation within ATD-2 including data message formats and data schemas.
ATD-2↗
The Use of a Univac 490 as a Real-time Message Switching Unit
Operation of UNIVAC 490 as real-time message switching unit
UNIVAC 490 COMPUTER↗
Recall of two messages presented in sequential alternate words.
Recall in processing two messages presented in sequential alternate words
INFORMATION PROCESSING↗
A digital simulation of message traffic for natural disaster warning communications satellite
Various types of weather communications are required to alert industries and the general public about the impending occurrence of tornados, hurricanes, snowstorms, floods, etc. A natural disaster warning satellite system has been proposed for meeting the communications requirements of the National Oceanic and Atmospheric Administration. Message traffic for a communications satellite was simulated with a digital computer in order to determine the number of communications channels to meet system requirements. Poisson inputs are used for arrivals and an exponential distribution is used for service.
Hein, G. F.↗
A reliable pipelining protocol for the message service of the Mobile Satellite Experiment
This paper describes and analyzes a pipelining protocol for the data message communications of MSAT-X, a proposed experimental satellite-based mobile communications network. A demand assigned multiple access protocol using pure ALOHA for making reservation requests has been developed for MSAT-X under error-free assumptions. Preliminary propagation studies indicate that the short term bit error rate of satellite channels in a mobile environment can be as high as 0.001. Therefore, error-control schemes must be developed to ensure reliable transmissions. A retransmission scheme using selective repeat to minimize the end-to-end delay is proposed. Slotted ALOHA for making reservation requests is used to increase the overall system throughput. Since the number of channels available for reservation and data channels is essentially fixed for a given voice call blocking probability and a fixed call arrival rate, the analysis presented in this paper is also applicable to the integrated voice and data services of MSAT-X. Various operational scenarios have been investigated.
Li, V. O. K.↗
Mapping a battlefield simulation onto message-passing parallel architectures
Perhaps the most critical problem in distributed simulation is that of mapping: without an effective mapping of workload to processors the speedup potential of parallel processing cannot be realized. Mapping a simulation onto a message-passing architecture is especially difficult when the computational workload dynamically changes as a function of time and space; this is exactly the situation faced by battlefield simulations. This paper studies an approach where the simulated battlefield domain is first partitioned into many regions of equal size; typically there are more regions than processors. The regions are then assigned to processors; a processor is responsible for performing all simulation activity associated with the regions. The assignment algorithm is quite simple and attempts to balance load by exploiting locality of workload intensity. The performance of this technique is studied on a simple battlefield simulation implemented on the Flex/32 multiprocessor. Measurements show that the proposed method achieves reasonable processor efficiencies. Furthermore, the method shows promise for use in dynamic remapping of the simulation.
Nicol, David M.↗
Message routing in an injured hypercube
A distributed fault-tolerant routing scheme for an injured hypercube multicomputer is described. The scheme is based on the topology of the hypercube, and it requires each node to possess only the information on the failure of its own links. A rigorous analysis of the scheme shows that it is not only capable of routing messages successfully in an injured Q(n) when the number of component failures is less than n, but can also choose a shortest path with a very high probability.
Chen, Ming-Syan↗
Message handling system concepts and services in a land mobile satellite system
A network architecture containing the capabilities offered by the Message Handling System (MHS) to the PRODAT Land Mobile Satellite System (LMSS) is described taking into account the constraints of a preexisting satellite system which is going to become operational. The mapping between MHS services and PRODAT requirements is also reported and shows that the supplied performance can be significantly enhanced to both fixed and mobile users. The impact of the insertion of additional features on the system structure, especially on the centralized control unit, are also addressed.
Barberis, S.↗
Optimal mapping of neural-network learning on message-passing multicomputers
A minimization of learning-algorithm completion time is sought in the present optimal-mapping study of the learning process in multilayer feed-forward artificial neural networks (ANNs) for message-passing multicomputers. A novel approximation algorithm for mappings of this kind is derived from observations of the dominance of a parallel ANN algorithm over its communication time. Attention is given to both static and dynamic mapping schemes for systems with static and dynamic background workloads, as well as to experimental results obtained for simulated mappings on multicomputers with dynamic background workloads.
Chu, Lon-Chan↗
Formal verification of an oral messages algorithm for interactive consistency
The formal specification and verification of an algorithm for Interactive Consistency based on the Oral Messages algorithm for Byzantine Agreement is described. We compare our treatment with that of Bevier and Young, who presented a formal specification and verification for a very similar algorithm. Unlike Bevier and Young, who observed that 'the invariant maintained in the recursive subcases of the algorithm is significantly more complicated than is suggested by the published proof' and who found its formal verification 'a fairly difficult exercise in mechanical theorem proving,' our treatment is very close to the previously published analysis of the algorithm, and our formal specification and verification are straightforward. This example illustrates how delicate choices in the formulation of the problem can have significant impact on the readability of its formal specification and on the tractability of its formal verification.
Rushby, John↗
Scheduling message processing for reducing rollback propagation
Traditional checkpointing and rollback recovery techniques for parallel systems have typically assumed the communication pattern is specified by program behavior. In this paper we exploit the property that the communication pattern can often be changed at run-time without affecting program correctness. A scheduling algorithm for message processing and its implementation for reducing rollback propagation are described. The algorithm incorporates a user-transparent prioritized scheme based upon the run-time communication and checkpointing history. Communication trace-driven simulation for several parallel programs written in the Chare Kernel language demonstrates that the probability of rollback propagation can be reduced at the cost of slight additional performance degradation.
Wang, Yi-Min↗
Using manufacturing message specification for monitor and control at Venus
The flexibility and robustness of a monitor and control (M&C) system are a direct result of the underlying interprocessor communications architecture. A new architecture for M&C at the Deep Space Communications Complexes (DSCC's) has been developed based on the Manufacturing Message Specification (MMS) process control standard of the Open System Interconnection (OSI) suite of protocols. This architecture has been tested both in a laboratory environment and under operational conditions at the Deep Space Network (DSN) experimental Venus station (DSS-13). The Venus experience in the application of OSI standards to support M&C has been extremely successful. MMS meets the functional needs of the station and provides a level of flexibility and responsiveness previously unknown in that environment. The architecture is robust enough to meet current operational needs and flexible enough to provide a migration path for new subsystems. This paper will describe the architecture of the Venus M&C system, discuss how MMS was used and the requirements this imposed on other parts of the system, and provide results from systems and operational testing at the Venus site.
Heuser, W. Randy↗
Parallelized direct execution simulation of message-passing parallel programs
As massively parallel computers proliferate, there is growing interest in findings ways by which performance of massively parallel codes can be efficiently predicted. This problem arises in diverse contexts such as parallelizing computers, parallel performance monitoring, and parallel algorithm development. In this paper we describe one solution where one directly executes the application code, but uses a discrete-event simulator to model details of the presumed parallel machine such as operating system and communication network behavior. Because this approach is computationally expensive, we are interested in its own parallelization specifically the parallelization of the discrete-event simulator. We describe methods suitable for parallelized direct execution simulation of message-passing parallel programs, and report on the performance of such a system, Large Application Parallel Simulation Environment (LAPSE), we have built on the Intel Paragon. On all codes measured to date, LAPSE predicts performance well typically within 10 percent relative error. Depending on the nature of the application code, we have observed low slowdowns (relative to natively executing code) and high relative speedups using up to 64 processors.
Dickens, Phillip M.↗
Multi-partitioning for ADI-schemes on message passing architectures
A kind of discrete-operator splitting called Alternating Direction Implicit (ADI) has been found to be useful in simulating fluid flow problems. In particular, it is being used to study the effects of hot exhaust jets from high performance aircraft on landing surfaces. Decomposition techniques that minimize load imbalance and message-passing frequency are described. Three strategies that are investigated for implementing the NAS Scalar Penta-diagonal Parallel Benchmark (SP) are transposition, pipelined Gaussian elimination, and multipartitioning. The multipartitioning strategy, which was used on Ethernet, was found to be the most efficient, although it was considered only a moderate success because of Ethernet's limited communication properties. The efficiency derived largely from the coarse granularity of the strategy, which reduced latencies and allowed overlap of communication and computation.
Vanderwijngaart, Rob F.↗
An executable specification for the message processor in a simple combining network
While the primary function of the network in a parallel computer is to communicate data between processors, it is often useful if the network can also perform rudimentary calculations. That is, some simple processing ability in the network itself, particularly for performing parallel prefix computations, can reduce both the volume of data being communicated and the computational load on the processors proper. Unfortunately, typical implementations of such networks require a large fraction of the hardware budget, and so combining networks are viewed as being impractical. The FFP Machine has such a combining network, and various characteristics of the machine allow a good deal of simplification in the network design. Despite being simple in construction however, the network relies on many subtle details to work correctly. This paper describes an executable model of the network which will serve several purposes. It provides a complete and detailed description of the network which can substantiate its ability to support necessary functions. It provides an environment in which algorithms to be run on the network can be designed and debugged more easily than they would on physical hardware. Finally, it provides the foundation for exploring the design of the message receiving facility which connects the network to the individual processors.
Middleton, David↗