Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “latency”

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 217 records · Page 12

Voluntary presetting of the vestibular ocular reflex permits gaze stabilization despite perturbation of fast head movements

Normal subjects are able to change voluntarily and continuously their head-eye latency together with their compensatory eye movement gain. A continuous spectrum of intent-latency modes of the subject's coordinated gaze through verbal feedback could be demonstrated. It was also demonstrated that the intent to counteract any perturbation of head-eye movement, i.e., the mental set, permitted the subjects to manipulate consciously their vestibular ocular reflex (VOR) gain. From the data, it is inferred that the VOR is always on. It may be, however, variably suppressed by higher cortical control. With appropriate training, head-mounted displays should permit an easy VOR presetting that leads to image stabilization, perhaps together with a decrease of possible misjudgements.

Zangemeister, Wolfgang H.↗

Computational dynamics for robotics systems using a non-strict computational approach

A Non-Strict computational approach for real-time robotics control computations is proposed. In contrast to the traditional approach to scheduling such computations, based strictly on task dependence relations, the proposed approach relaxes precedence constraints and scheduling is guided instead by the relative sensitivity of the outputs with respect to the various paths in the task graph. An example of the computation of the Inverse Dynamics of a simple inverted pendulum is used to demonstrate the reduction in effective computational latency through use of the Non-Strict approach. A speedup of 5 has been obtained when the processes of the task graph are scheduled to reduce the latency along the crucial path of the computation. While error is introduced by the relaxation of precedence constraints, the Non-Strict approach has a smaller error than the conventional Strict approach for a wide range of input conditions.

Orin, David E.↗

Oculomotor function during space flight and susceptibility to space motion sickness

Horizontal vestibulo-ocular reflex (VOR) and saccadic eye movements (SEM) were studied in 18 subjects before and during five Space Shuttle missions to evaluate the effects of weightlessness and correlations between results and susceptibility to and actual presence of space motion sickness (SMS). Active sinusoidal head oscillation was the stimulus for VOR tests with vision (VVOR), with eyes shaded (VOR-ES), and VOR suppression (VOR-S). Eye movements were recorded by electrooculography and head position by a potentiometer. No pathological nystagmus or other abnormal eye movements were seen. No significant in-flight changes were seen in the gain, phase shift or waveform of VVOR, VOR-ES or VOR-S. Statistically significant increases in saccadic latency and decreases in saccadic velocity were seen, with no change in saccadic accuracy. Preflight differences between SMS susceptible and nonsusceptible subjects were noted only in VOR-S, with less complete suppression in susceptible subjects, a finding also seen in flight. During flight, VVOR gain was significantly increased in three nonaffected subjects. Saccades of SMS-affected subjects showed increased latency and velocity and decreased accuracy compared to saccades of unaffected subjects.

Thornton, William E.↗

An open, parallel I/O computer as the platform for high-performance, high-capacity mass storage systems

APTEC Computer Systems is a Portland, Oregon based manufacturer of I/O computers. APTEC's work in the context of high density storage media is on programs requiring real-time data capture with low latency processing and storage requirements. An example of APTEC's work in this area is the Loral/Space Telescope-Data Archival and Distribution System. This is an existing Loral AeroSys designed system, which utilizes an APTEC I/O computer. The key attributes of a system architecture that is suitable for this environment are as follows: (1) data acquisition alternatives; (2) a wide range of supported mass storage devices; (3) data processing options; (4) data availability through standard network connections; and (5) an overall system architecture (hardware and software designed for high bandwidth and low latency). APTEC's approach is outlined in this document.

Abineri, Adrian↗

Striped tertiary storage arrays

Data stripping is a technique for increasing the throughput and reducing the response time of large access to a storage system. In striped magnetic or optical disk arrays, a single file is striped or interleaved across several disks; in a striped tape system, files are interleaved across tape cartridges. Because a striped file can be accessed by several disk drives or tape recorders in parallel, the sustained bandwidth to the file is greater than in non-striped systems, where access to the file are restricted to a single device. It is argued that applying striping to tertiary storage systems will provide needed performance and reliability benefits. The performance benefits of striping for applications using large tertiary storage systems is discussed. It will introduce commonly available tape drives and libraries, and discuss their performance limitations, especially focusing on the long latency of tape accesses. This section will also describe an event-driven tertiary storage array simulator that is being used to understand the best ways of configuring these storage arrays. The reliability problems of magnetic tape devices are discussed, and plans for modeling the overall reliability of striped tertiary storage arrays to identify the amount of error correction required are described. Finally, work being done by other members of the Sequoia group to address latency of accesses, optimizing tertiary storage arrays that perform mostly writes, and compression is discussed.

Drapeau, Ann L.↗

Relaxing consistency in recoverable distributed shared memory

Relaxed memory consistency models have recently been proposed to tolerate memory access latency in both hardware and software distributed shared memory systems. In recoverable shared memory multiprocessors, relaxing consistency has the added benefit of reducing the number of checkpoints needed to avoid rollback propagation. In this paper, we introduce new checkpointing algorithms that take advantage of relaxed consistency to reduce the performance overhead of checkpointing. We also introduce a scheme based on lazy relaxed consistency, that reduces both checkpointing overhead and the overhead of avoiding error propagation in systems with error latency. Multiprocessor address traces are used to evaluate the relaxed consistency approach to checkpointing with distributed shared memory.

Janssens, Bob↗

A simple modern correctness condition for a space-based high-performance multiprocessor

A number of U.S. national programs, including space-based detection of ballistic missile launches, envisage putting significant computing power into space. Given sufficient progress in low-power VLSI, multichip-module packaging and liquid-cooling technologies, we will see design of high-performance multiprocessors for individual satellites. In very high speed implementations, performance depends critically on tolerating large latencies in interprocessor communication; without latency tolerance, performance is limited by the vastly differing time scales in processor and data-memory modules, including interconnect times. The modern approach to tolerating remote-communication cost in scalable, shared-memory multiprocessors is to use a multithreaded architecture, and alter the semantics of shared memory slightly, at the price of forcing the programmer either to reason about program correctness in a relaxed consistency model or to agree to program in a constrained style. The literature on multiprocessor correctness conditions has become increasingly complex, and sometimes confusing, which may hinder its practical application. We propose a simple modern correctness condition for a high-performance, shared-memory multiprocessor; the correctness condition is based on a simple interface between the multiprocessor architecture and a high-performance, shared-memory multiprocessor; the correctness condition is based on a simple interface between the multiprocessor architecture and the parallel programming system.

Probst, David K.↗

Quality metrics for sensor images

Methods are needed for evaluating the quality of augmented visual displays (AVID). Computational quality metrics will help summarize, interpolate, and extrapolate the results of human performance tests with displays. The FLM Vision group at NASA Ames has been developing computational models of visual processing and using them to develop computational metrics for similar problems. For example, display modeling systems use metrics for comparing proposed displays, halftoning optimizing methods use metrics to evaluate the difference between the halftone and the original, and image compression methods minimize the predicted visibility of compression artifacts. The visual discrimination models take as input two arbitrary images A and B and compute an estimate of the probability that a human observer will report that A is different from B. If A is an image that one desires to display and B is the actual displayed image, such an estimate can be regarded as an image quality metric reflecting how well B approximates A. There are additional complexities associated with the problem of evaluating the quality of radar and IR enhanced displays for AVID tasks. One important problem is the question of whether intruding obstacles are detectable in such displays. Although the discrimination model can handle detection situations by making B the original image A plus the intrusion, this detection model makes the inappropriate assumption that the observer knows where the intrusion will be. Effects of signal uncertainty need to be added to our models. A pilot needs to make decisions rapidly. The models need to predict not just the probability of a correct decision, but the probability of a correct decision by the time the decision needs to be made. That is, the models need to predict latency as well as accuracy. Luce and Green have generated models for auditory detection latencies. Similar models are needed for visual detection. Most image quality models are designed for static imagery. Watson has been developing a general spatial-temporal vision model to optimize video compression techniques. These models need to be adapted and calibrated for AVID applications.

Ahumada, AL↗

Relaxing consistency in recoverable distributed shared memory

Relaxed memory consistency models tolerate increased memory access latency in both hardware and software distributed shared memory systems. In recoverable systems, relaxing consistency has the added benefit of reducing the number of checkpoints needed to avoid rollback propagation. In this paper, we introduce new checkpointing algorithms that take advantage of relaxed consistency to reduce the performance overhead of checkpointing. We also introduce a scheme based on lazy relaxed consistency, that reduces both checkpointing overhead and the overhead of avoiding error propagation in systems with error latency. We use multiprocessor address traces to evaluate the relaxed consistency approach to checkpointing with distributed shared memory.

Janssens, Bob↗

Virtual reality and telerobotics applications of an Address Recalculation Pipeline

The technology described in this paper was designed to reduce latency to user interactions in immersive virtual reality environments. It is also ideally suited to telerobotic applications such as interaction with remote robotic manipulators in space or in deep sea operations. in such circumstances the significant latency is observed response to user stimulus which is due to communications delays, and the disturbing jerkiness due to low and unpredictable frame rates on compressed video user feedback or computationally limited virtual worlds, can be masked by our techniques. The user is provided with highly responsive visual feedback independent of communication or computational delays in providing physical video feedback or in rendering virtual world images. Virtual and physical environments can be combined seamlessly using these techniques.

Regan, Matthew↗

STRIPE: Remote Driving Using Limited Image Data

Driving a vehicle, either directly or remotely, is an inherently visual task. When heavy fog limits visibility, we reduce our car's speed to a slow crawl, even along very familiar roads. In teleoperation systems, an operator's view is limited to images provided by one or more cameras mounted on the remote vehicle. Traditional methods of vehicle teleoperation require that a real time stream of images is transmitted from the vehicle camera to the operator control station, and the operator steers the vehicle accordingly. For this type of teleoperation, the transmission link between the vehicle and operator workstation must be very high bandwidth (because of the high volume of images required) and very low latency (because delayed images can cause operators to steer incorrectly). In many situations, such a high-bandwidth, low-latency communication link is unavailable or even technically impossible to provide. Supervised TeleRobotics using Incremental Polyhedral Earth geometry, or STRIPE, is a teleoperation system for a robot vehicle that allows a human operator to accurately control the remote vehicle across very low bandwidth communication links, and communication links with large delays. In STRIPE, a single image from a camera mounted on the vehicle is transmitted to the operator workstation. The operator uses a mouse to pick a series of 'waypoints' in the image that define a path that the vehicle should follow. These 2D waypoints are then transmitted back to the vehicle, where they are used to compute the appropriate steering commands while the next image is being transmitted. STRIPE requires no advance knowledge of the terrain to be traversed, and can be used by novice operators with only minimal training. STRIPE is a unique combination of computer and human control. The computer must determine the 3D world path designated by the 2D waypoints and then accurately control the vehicle over rugged terrain. The human issues involve accurate path selection, and the prevention of disorientation, a common problem across all types of teleoperation systems. STRIPE is the only semi-autonomous teleoperation system that can accurately follow paths designated in monocular images on varying terrain. The thesis describes the STRIPE algorithm for tracking points using the incremental geometry model, insight into the design and redesign of the interface, an analysis of the effects of potential errors, details of the user studies, and hints on how to improve both the algorithm and interface for future designs.

REMOTE CONTROL↗

A Reevaluation of the Vestibulo-Ocular Reflex: New Ideas of its Purpose, Properties, Neural Substrate, and Disorders

Conventional views of the Vestibulo-Ocular Reflex (VOR) have emphasized testing with caloric stimuli and by passively rotating patients at low frequencies in a chair. The properties of the VOR tested under these conditions differ from the performance of this reflex during the natural function for which it evolved-locomotion. Only the VOR (and not visually mediated eye movements) can cope with the high-frequency angular and linear perturbations of the head that occur during locomotion; this is achieved by generating eye movements at short latency (less than 16 msec). Interpretation of vestibular testing is enhanced by the realization that, although the di- and trisynaptic components of the VOR are essential for this short-latency response, the overall accuracy and plasticity of the VOR depend upon a distributed, parallel network of neurons involving the vestibular nuclei. Neurons in this network variously encode inputs from the labyrinthine semicircular canals and otoliths, as well as from the visual and somatosensory systems. The central vestibular pathways branch to contact vestibular cortex (for perception) and the spinal cord (for control of posture). Thus, the vestibular nuclei basically coordinate the stabilization of gaze and posture, and contribute to the perception of verticality and self-motion. Consequently, brainstem disorders that disrupt the VOR cause not just only nystagmus, but also instability of posture (eg, increased fore-aft sway in patients with downbeat nystagmus) and disturbance of spatial orientation (eg, tilt of the subjective visual vertical in Wallenberg's syndrome).

Leigh, R. John↗

Helmet-Mounted Display Design Guide

Helmet Mounted Displays (HMDs) present flight, navigation, and weapon information in the pilot's line of sight. The HMD was developed to allow the pilot to retain aircraft and weapon information while looking off boresight. This document reviews current state of the art in HMDs and presents a design guide for the HMD engineer in identifying several critical HMD issues: symbol stabilization, inadequate definitions, undefined symbol drive laws, helmet considerations, and Field Of View (FOV) vs. resolution tradeoff requirements. In particular, display latency is a key issue for HMDs. In addition to requiring further experimental studies, it impacts the definition and control law issues. Symbol stabilization is also critical. In the case of the Apache helicopter, the lack of compensation for pilot head motion creates excessive workload during hovering and Nap Of the Earth (NOE) flight. This translates into excessive training requirements. There is no agreed upon set of definitions or descriptions for how HMD symbols are driven to compensate for pilot head motion. A set of definitions is proposed to address this. There are several specific areas where simulation and flight experiments are needed: development of hover and NOE symbologies which compensate for pilot head movement; display latency and sampling, and the tradeoff between FOV, sensor resolution and symbology.

HEAD UP DISPLAYS↗

Traffic Management in ATM Networks Over Satellite Links

This report presents a survey of the traffic management Issues in the design and implementation of satellite Asynchronous Transfer Mode (ATM) networks. The report focuses on the efficient transport of Transmission Control Protocol (TCP) traffic over satellite ATM. First, a reference satellite ATM network architecture is presented along with an overview of the service categories available in ATM networks. A delay model for satellite networks and the major components of delay and delay variation are described. A survey of design options for TCP over Unspecified Bit Rate (UBR), Guaranteed Frame Rate (GFR) and Available Bit Rate (ABR) services in ATM is presented. The main focus is on traffic management issues. Several recommendations on the design options for efficiently carrying data services over satellite ATM networks are presented. Most of the results are based on experiments performed on Geosynchronous (GEO) latencies. Some results for Low Earth Orbits (LEO) and Medium Earth Orbit (MEO) latencies are also provided.

Goyal, Rohit↗

MLP: A Parallel Programming Alternative to MPI for New Shared Memory Parallel Systems

Recent developments at the NASA AMES Research Center's NAS Division have demonstrated that the new generation of NUMA based Symmetric Multi-Processing systems (SMPs), such as the Silicon Graphics Origin 2000, can successfully execute legacy vector oriented CFD production codes at sustained rates far exceeding processing rates possible on dedicated 16 CPU Cray C90 systems. This high level of performance is achieved via shared memory based Multi-Level Parallelism (MLP). This programming approach, developed at NAS and outlined below, is distinct from the message passing paradigm of MPI. It offers parallelism at both the fine and coarse grained level, with communication latencies that are approximately 50-100 times lower than typical MPI implementations on the same platform. Such latency reductions offer the promise of performance scaling to very large CPU counts. The method draws on, but is also distinct from, the newly defined OpenMP specification, which uses compiler directives to support a limited subset of multi-level parallel operations. The NAS MLP method is general, and applicable to a large class of NASA CFD codes.

Taft, James R.↗

TT and C - First TDRSS, Then Commercial GEO and Big LEO and Now through LEO

The advent of low earth orbit (LEO) commercial communications satellites provides an opportunity to dramatically reduce Telemetry Tracking and Control (TT&C) costs of launch vehicles and Unpiloted Aerial Vehicles (UAVs) by reducing or eliminating ground infrastructure. Personnel from the Goddard Space Flight Center Wallops Flight Facility (GSFC/WFF) in Virginia have successfully used commercial GEO & Big LEO communications satellites for Long Duration Balloon flight TT&C. In addition, TDRSS capability for these balloons has been developed by WFF for the Ultra Long Duration Balloons with the first test flight launch in January 2001 for one global circumnavigation at 120,000 feet altitude launched from Alice Springs. Australia. Numerous other low cost applications can new utilize the commercial LEO satellites for TT&C. The Flight Modern became a GSFC/WFF Advanced Range Technology Initiative (ARTI) in an effort to streamline TT&C capability to the user community at low cost. Phase I ground tests of The Flight Modem verified downlink communications quality of service and measured transmission latencies. These tests were completed last year, Phase II consisting of aircraft flight tests provide much of the data presented in this paper. Phase III of the Flight Modern baseline test program is a demonstration of the ruggedized version of the WFF Flight Modem flown on one sounding rocket launched from Sweden. Flights of opportunity have been and are being actively pursued with other centers, ranges and users at universities. The WFF goal is to reduce TT&C costs by providing a low cost COTS Flight Modem with a User Handbook containing system capability and limitation descriptions. Additionally, since data transmission is by packetized Internet Protocol (IP), data can be received and commands initialed from practically any location with no infrastructure. The WFF, like most ranges, has been using GPS receivers on sounding rockets and long duration balloons for several years, The WFF Flight Modem contains a GPS receiver to provide vehicle position for tracking and vehicle recovery. The system architecture which integrates antennas, GPS receiver, commercial satellite packet data modem. and a single board computer with custom software is described and a number of technical challenges are discussed along with the plan for their resolution. These include antenna development, high Doppler rates, reliability, environmental ruggedness, hand over between satellites and data security. An aggressive test plan is included which in addition to environmental Testing measures bit error rate latency and antenna patterns. Additional flight tests are planned far the near future on aircraft, long duration balloons and sounding rockets and these results as well as the current status of the project arc reported. Use of the WFF Flight Modem on small satellites is also being pursued. The LEO satellite constellation altitude above 1400 km is not an obstacle because most spacecraft do not require continuous Communications. The challenge is scheduling where store and forward techniques for command are required and downlink when the communications link allows connection (above 60 percent of the time depending on the satellite altitude). Sophisticated scheduling techniques utilizing 2-line orbital element sets available on the NASA/NORAD Internet site could be implemented for rare special cases. The current 9600 baud rate of the LEO communications link may be increased With special techniques that are planned for development in the WFF Flight Modem project.

Morgan, Dwayne↗

CSMA Versus Prioritized CSMA for Air-Traffic-Control Improvement

OPNET version 7.0 simulations are presented involving an important application of the Aeronautical Telecommunications Network (ATN), Controller Pilot Data Link Communications (CPDLC) over the Very High Frequency Data Link, Mode 2 (VDL-2). Communication is modeled for essentially all incoming and outgoing nonstop air-traffic for just three United States cities: Cleveland, Cincinnati, and Detroit. There are 32 airports in the simulation, 29 of which are either sources or destinations for the air-traffic of the aforementioned three airports. The simulation involves 111 Air Traffic Control (ATC) ground stations, and 1,235 equally equipped aircraft-taking off, flying realistic free-flight trajectories, and landing in a 24-hr period. Collisionless, Prioritized Carrier Sense Multiple Access (CSMA) is successfully tested and compared with the traditional CSMA typically associated with VDL-2. The performance measures include latency, throughput, and packet loss. As expected, Prioritized CSMA is much quicker and more efficient than traditional CSMA. These simulation results show the potency of Prioritized CSMA for implementing low latency, high throughput, and efficient connectivity.

Robinson, Daryl C.↗

Cooperative Data Sharing: Simple Support for Clusters of SMP Nodes

Libraries like PVM and MPI send typed messages to allow for heterogeneous cluster computing. Lower-level libraries, such as GAM, provide more efficient access to communication by removing the need to copy messages between the interface and user space in some cases. still lower-level interfaces, such as UNET, get right down to the hardware level to provide maximum performance. However, these are all still interfaces for passing messages from one process to another, and have limited utility in a shared-memory environment, due primarily to the fact that message passing is just another term for copying. This drawback is made more pertinent by today's hybrid architectures (e.g. clusters of SMPs), where it is difficult to know beforehand whether two communicating processes will share memory. As a result, even portable language tools (like HPF compilers) must either map all interprocess communication, into message passing with the accompanying performance degradation in shared memory environments, or they must check each communication at run-time and implement the shared-memory case separately for efficiency. Cooperative Data Sharing (CDS) is a single user-level API which abstracts all communication between processes into the sharing and access coordination of memory regions, in a model which might be described as "distributed shared messages" or "large-grain distributed shared memory". As a result, the user programs to a simple latency-tolerant abstract communication specification which can be mapped efficiently to either a shared-memory or message-passing based run-time system, depending upon the available architecture. Unlike some distributed shared memory interfaces, the user still has complete control over the assignment of data to processors, the forwarding of data to its next likely destination, and the queuing of data until it is needed, so even the relatively high latency present in clusters can be accomodated. CDS does not require special use of an MMU, which can add overhead to some DSM systems, and does not require an SPMD programming model. unlike some message-passing interfaces, CDS allows the user to implement efficient demand-driven applications where processes must "fight" over data, and does not perform copying if processes share memory and do not attempt concurrent writes. CDS also supports heterogeneous computing, dynamic process creation, handlers, and a very simple thread-arbitration mechanism. Additional support for array subsections is currently being considered. The CDS1 API, which forms the kernel of CDS, is built primarily upon only 2 communication primitives, one process initiation primitive, and some data translation (and marshalling) routines, memory allocation routines, and priority control routines. The entire current collection of 28 routines provides enough functionality to implement most (or all) of MPI 1 and 2, which has a much larger interface consisting of hundreds of routines. still, the API is small enough to consider integrating into standard os interfaces for handling inter-process communication in a network-independent way. This approach would also help to solve many of the problems plaguing other higher-level standards such as MPI and PVM which must, in some cases, "play OS" to adequately address progress and process control issues. The CDS2 API, a higher level of interface roughly equivalent in functionality to MPI and to be built entirely upon CDS1, is still being designed. It is intended to add support for the equivalent of communicators, reduction and other collective operations, process topologies, additional support for process creation, and some automatic memory management. CDS2 will not exactly match MPI, because the copy-free semantics of communication from CDS1 will be supported. CDS2 application programs will be free to carefully also use CDS1. CDS1 has been implemented on networks of workstations running unmodified Unix-based operating systems, using UDP/IP and vendor-supplied high- performance locks. Although its inter-node performance is currently unimpressive due to rudimentary implementation technique, it even now outperforms highly-optimized MPI implementation on intra-node communication due to its support for non-copy communication. The similarity of the CDS1 architecture to that of other projects such as UNET and TRAP suggests that the inter-node performance can be increased significantly to surpass MPI or PVM, and it may be possible to migrate some of its functionality to communication controllers.

DiNucci, David C.↗