Search NASA⌕ Search

SEARCH · Search NASA

Results for “Data Communications”

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 37 records · Page 2

Data communications for a collective operation in a parallel active messaging interface of a parallel computer

Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and bit masks; receiving in an origin endpoint of the PAMI a collective instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint; constructing a bit mask for the received collective instruction; selecting, from among the associated algorithms and bit masks, a data communications algorithm in dependence upon the constructed bit mask; and executing the collective instruction, transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

97 MATHEMATICS AND COMPUTING↗

Data communications for a collective operation in a parallel active messaging interface of a parallel computer

Algorithm selection for data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints, each endpoint including specifications of a client, a context, and a task, endpoints coupled for data communications through the PAMI, including associating in the PAMI data communications algorithms and bit masks; receiving in an origin endpoint of the PAMI a collective instruction, the instruction specifying transmission of a data communications message from the origin endpoint to a target endpoint; constructing a bit mask for the received collective instruction; selecting, from among the associated algorithms and bit masks, a data communications algorithm in dependence upon the constructed bit mask; and executing the collective instruction, transmitting, according to the selected data communications algorithm from the origin endpoint to the target endpoint, the data communications message.

97 MATHEMATICS AND COMPUTING↗

Method of data communications with reduced latency

Data communications with reduced latency, including: writing, by a producer, a descriptor and message data into at least two descriptor slots of a descriptor buffer, the descriptor buffer comprising allocated computer memory segmented into descriptor slots, each descriptor slot having a fixed size, the descriptor buffer having a header pointer that identifies a next descriptor slot to be processed by a DMA controller, the descriptor buffer having a tail pointer that identifies a descriptor slot for entry of a next descriptor in the descriptor buffer; recording, by the producer, in the descriptor a value signifying that message data has been written into descriptor slots; and setting, by the producer, in dependence upon the recorded value, a tail pointer to point to a next open descriptor slot.

97 MATHEMATICS AND COMPUTING↗

Data communications in a parallel active messaging interface of a parallel computer

Data communications in a parallel active messaging interface ('PAMI') or a parallel computer, the parallel computer including a plurality of compute nodes that execute a parallel application, the PAMI composed of data communications endpoints, each endpoint including a specification of data communications parameters for a thread of execution of a compute node, including specification of a client, a context, and a task, the compute nodes and the endpoints coupled for data communications instruction, the instruction characterized by instruction type, the instruction specifying a transmission of transfer data from the origin endpoint to a target endpoint and transmitting, in accordance witht the instruction type, the transfer data from the origin endpoin to the target endpoint.

97 MATHEMATICS AND COMPUTING↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure-the Space Network and the Ground Network-provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft. The Space Network operates several orbiting geostationary platforms (the Tracking and Data Relay Satellite System (TDRSS)), each with its own servicedelivery antennas onboard. The Ground Network operates service-delivery antennas at ground stations located around the world. Together, these networks enable data transfer between user spacecraft and their mission control centers on Earth. Scheduling data-communications events for spacecraft that use the NASA communications infrastructure-the relay satellites and the ground stations-can be accomplished today with software having an operational heritage dating from the 1980s or earlier. An implementation of the scheduling methods and algorithms disclosed and formally specified herein will produce globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary algorithms, a class of probabilistic strategies for searching large solution spaces, is the essential technology invoked and exploited in this disclosure. Also disclosed are secondary methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithms themselves. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure within the expected range of future users and space- or ground-based service-delivery assets. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally. The generalized methods and algorithms are applicable to a very broad class of combinatorial-optimization problems that encompasses, among many others, the problem of generating optimal space-data communications schedules.

ground stations↗

Data communications in a parallel active messaging interface of a parallel computer

Eager send data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints that specify a client, a context, and a task, including receiving an eager send data communications instruction with transfer data disposed in a send buffer characterized by a read/write send buffer memory address in a read/write virtual address space of the origin endpoint; determining for the send buffer a read-only send buffer memory address in a read-only virtual address space, the read-only virtual address space shared by both the origin endpoint and the target endpoint, with all frames of physical memory mapped to pages of virtual memory in the read-only virtual address space; and communicating by the origin endpoint to the target endpoint an eager send message header that includes the read-only send buffer memory address.

97 MATHEMATICS AND COMPUTING↗

Data communications in a parallel active messaging interface of a parallel computer

Eager send data communications in a parallel active messaging interface (`PAMI`) of a parallel computer, the PAMI composed of data communications endpoints that specify a client, a context, and a task, including receiving an eager send data communications instruction with transfer data disposed in a send buffer characterized by a read/write send buffer memory address in a read/write virtual address space of the origin endpoint; determining for the send buffer a read-only send buffer memory address in a read-only virtual address space, the read-only virtual address space shared by both the origin endpoint and the target endpoint, with all frames of physical memory mapped to pages of virtual memory in the read-only virtual address space; and communicating by the origin endpoint to the target endpoint an eager send message header that includes the read-only send buffer memory address.

97 MATHEMATICS AND COMPUTING↗

The Impact of Data Communications Messages in the Terminal Area on Flight Crew Workload and Eye Scanning

This paper, to accompany a discussion panel, describes a collaborative FAA and NASA research study to determine the effect Data Communications (Data Comm) messages have on flight crew workload and eye scanning behavior in busy terminal area operations. In the Next Generation Air Transportation System Concept of Operations, for the period 2017-2022, the FAA envisions Data Comm between controllers and the flight crew to become the primary means of communicating non-time critical information. Four research conditions were defined that span current day to future equipage levels (Voice with Paper map, Data Comm with Paper map, Data Comm with Moving Map Display with ownship position displayed, Data Comm with Moving Map, ownship and taxi route displayed), and were used to create arrival and departure scenarios at Boston Logan Airport. Preliminary results for workload, situation awareness, and pilot head-up time are presented here. Questionnaire data indicated that pilot acceptability, workload, and situation awareness ratings were favorable for all of the conditions tested. Pilots did indicate that there were times during final approach and landing when they would prefer not to hear the message chime, and would not be able to make a quick response due to high priority tasks in the cockpit.

Comstock, James R., Jr.↗

An Optimizing Space Data-Communications Scheduling Method and Algorithm with Interference Mitigation, Generalized for a Broad Class of Optimization Problems

NASA's space data-communications infrastructure, the Space Network and the Ground Network, provide scheduled (as well as some limited types of unscheduled) data-communications services to user spacecraft via orbiting relay satellites and ground stations. An implementation of the methods and algorithms disclosed herein will be a system that produces globally optimized schedules with not only optimized service delivery by the space data-communications infrastructure but also optimized satisfaction of all user requirements and prescribed constraints, including radio frequency interference (RFI) constraints. Evolutionary search, a class of probabilistic strategies for searching large solution spaces, constitutes the essential technology in this disclosure. Also disclosed are methods and algorithms for optimizing the execution efficiency of the schedule-generation algorithm itself. The scheduling methods and algorithms as presented are adaptable to accommodate the complexity of scheduling the civilian and/or military data-communications infrastructure. Finally, the problem itself, and the methods and algorithms, are generalized and specified formally, with applicability to a very broad class of combinatorial optimization problems.

Rash, James L.↗

Integration of Dynamic Weather Routes Automation with Air/Ground Data Communications

The Dynamic Weather Routes (DWR) toolcontinuously and automatically analyzes airborne flights in en route airspace to identify flights where a route correction could save significant flight time and still avoid weather. A partnership between NASA, American Airlines (AA), and the FAA has enabled testing of DWR in real-world air traffic operations. En route Data Communications (Data Comm) could significantly reduce the controller and pilot workload needed to communicate DWR route changes under today’s voice-based operations and thereby enable more timely and frequent high-value corrections to weather avoidance routes. Sample data from the DWR trial at AA illustrate how Data Comm could improve DWR operations. Two operating concepts that integrate DWR with Data Comm are described:(1) route corrections are initiated by air traffic control and implemented using Airborne Reroutes and Data Comm, and (2) route corrections are initiated by the dispatcher and pilot and implemented via Data Comm. Both concepts align with Federal Aviation Administration (FAA) plans for implementation ofData Comm in en route airspace.

weather avoidance↗

Advanced orbiting systems - A standard architecture for space data communications

The standard data handling service architecture developed by the Consultative Committee for Space Data Systems is discussed. Special attention is given to the communications protocols that are recommended for the networked transfer of space mission data, with emphasis on the unique requirements of transmitting many different data types through the weak-signal noisy space channels at high rates (up to many hundreds of megabits per second). A user service model of a typical space mission data flow configuration, known as the 'pipe diagram', is described in detail.

Hooke, Adrian J.↗

Data Communications Requirements for CAS Applications

This paper discusses the long-haul data communications requirements needed to support visualization of Computational Aeroscience (CAS) simulations. A scientific computing model is presented, from which current communications requirements are derived. This model is then expanded to describe the CAS Collaborative Visualization Environment, in which scientists from multiple NASA centers will collaborate on multidisciplinary, time-accurate simulations. An analysis of this model, along with data from the TFCC Workload Model, shows that CAS data communications requirements will increase to 10-100 megabytes/second by 1996.

McCabe, James D.↗

The GEMnet (TM) global data communication

The GEMnet(TM) (Global Electronics Message network) will provide global digital data communications anywhere in the world at any time for minimum cost. GEMnet(TM) is an end-to-end Non-Voice Non-Geostationary Mobile Satellite (NVNG) (sometimes dubbed 'Little LEO') System which consists of a constellation of 38 low Earth orbiting small satellites and a ground segment. The GEMnet(TM) ground segment will consist of subscriber user terminals, gateway stations, a Network Operational Center(NOC), and a backbone network interconnecting the NOC and gateways. This paper will describe the GEMnet(TM) system concept including ground and space segments, system heritage, data communication services, and protocols.

Yi, Byung K.↗

SPP: A data base processor data communications protocol

The design and implementation of a data communications protocol for the Intel Data Base Processor (DBP) is defined. The protocol is termed SPP (Service Port Protocol) since it enables data transfer between the host computer and the DBP service port. The protocol implementation is extensible in that it is explicitly layered and the protocol functionality is hierarchically organized. Extensive trace and performance capabilities have been supplied with the protocol software to permit optional efficient monitoring of the data transfer between the host and the Intel data base processor. Machine independence was considered to be an important attribute during the design and implementation of SPP. The protocol source is fully commented and is included in Appendix A of this report.

Fishwick, P. A.↗

CCSDS Advanced Orbiting Systems - International data communications standards for the Space Station Freedom

Established in 1982, the Consultative Committee for Space Data Systems (CCSDS) is an international organization that is staffed by data-handling experts from nearly all of the world's major space agencies. Its goal is to develop standard data-communications techniques so that several agencies may cross-support each other's data flow and thus allow complex, international missions to be flown. Under the general umbrella of Advanced Orbiting Systems (AOS), an international CCSDS task force was formed in 1985 to develop standard data-communications concepts for manned missions, such as the Space Station Freedom and the Hermes space plane, and large unmanned vehicles, such as polar orbiting platforms. The history of the CCSDS and the development of the AOS recommendation are reviewed, and the user services and protocols embodied in its systems architecture are introduced.

Hooke, Adrian J.↗

An approach to effective UHF (S/L band) data communications for satellite Personal Communication Service (PCS)

Reliable signaling information transfer is fundamental in supporting the needs of data communication PCS via LMS (Land Mobile Service) SSs (satellite systems). The needs of the system designer can be satisfied only through the collection of media information that can be brought to bear on the pertinent design issues. We at ISI hope to continue our dialogue with fading media experts to address the unique data communications needs of PCS via LMS SSs.

Hayase, Joshua Y.↗

Managing internode data communications for an uninitialized process in a parallel computer

A parallel computer includes nodes, each having main memory and a messaging unit (MU). Each MU includes computer memory, which in turn includes, MU message buffers. Each MU message buffer is associated with an uninitialized process on the compute node. In the parallel computer, managing internode data communications for an uninitialized process includes: receiving, by an MU of a compute node, one or more data communications messages in an MU message buffer associated with an uninitialized process on the compute node; determining, by an application agent, that the MU message buffer associated with the uninitialized process is full prior to initialization of the uninitialized process; establishing, by the application agent, a temporary message buffer for the uninitialized process in main computer memory; and moving, by the application agent, data communications messages from the MU message buffer associated with the uninitialized process to the temporary message buffer in main computer memory.

97 MATHEMATICS AND COMPUTING↗

Managing internode data communications for an uninitialized process in a parallel computer

A parallel computer includes nodes, each having main memory and a messaging unit (MU). Each MU includes computer memory, which in turn includes, MU message buffers. Each MU message buffer is associated with an uninitialized process on the compute node. In the parallel computer, managing internode data communications for an uninitialized process includes: receiving, by an MU of a compute node, one or more data communications messages in an MU message buffer associated with an uninitialized process on the compute node; determining, by an application agent, that the MU message buffer associated with the uninitialized process is full prior to initialization of the uninitialized process; establishing, by the application agent, a temporary message buffer for the uninitialized process in main computer memory; and moving, by the application agent, data communications messages from the MU message buffer associated with the uninitialized process to the temporary message buffer in main computer memory.

97 MATHEMATICS AND COMPUTING↗