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 469 records · Page 26

Field-Programmable Gate Array Computer in Structural Analysis: An Initial Exploration

This paper reports on an initial assessment of using a Field-Programmable Gate Array (FPGA) computational device as a new tool for solving structural mechanics problems. A FPGA is an assemblage of binary gates arranged in logical blocks that are interconnected via software in a manner dependent on the algorithm being implemented and can be reprogrammed thousands of times per second. In effect, this creates a computer specialized for the problem that automatically exploits all the potential for parallel computing intrinsic in an algorithm. This inherent parallelism is the most important feature of the FPGA computational environment. It is therefore important that if a problem offers a choice of different solution algorithms, an algorithm of a higher degree of inherent parallelism should be selected. It is found that in structural analysis, an 'analog computer' style of programming, which solves problems by direct simulation of the terms in the governing differential equations, yields a more favorable solution algorithm than current solution methods. This style of programming is facilitated by a 'drag-and-drop' graphic programming language that is supplied with the particular type of FPGA computer reported in this paper. Simple examples in structural dynamics and statics illustrate the solution approach used. The FPGA system also allows linear scalability in computing capability. As the problem grows, the number of FPGA chips can be increased with no loss of computing efficiency due to data flow or algorithmic latency that occurs when a single problem is distributed among many conventional processors that operate in parallel. This initial assessment finds the FPGA hardware and software to be in their infancy in regard to the user conveniences; however, they have enormous potential for shrinking the elapsed time of structural analysis solutions if programmed with algorithms that exhibit inherent parallelism and linear scalability. This potential warrants further development of FPGA-tailored algorithms for structural analysis.

Singleterry, Robert C., Jr.↗

Investigation of Neural Strategies of Visual Search

The goal of this project was to measure how neurons in the superior colliculus (SC) change their activity during a visual search task. Specifically, we proposed to measure how the activity of these neurons was altered by the discriminability of visual targets and to test how these changes might predict the changes in the subjects performance. The primary rationale for this study was that understanding how the information encoded by these neurons constrains overall search performance would foster the development of better models of human performance. Work performed during the period supported by this grant has achieved these aims. First, we have recorded from neurons in the superior colliculus (SC) during a visual search task in which the difficulty of the task and the performance of the subject was systematically varied. The results from these single-neuron physiology experiments shows that prior to eye movement onset, the difference in activity across the ensemble of neurons reaches a fixed threshold value, reflecting the operation of a winner-take-all mechanism. Second, we have developed a model of eye movement decisions based on the principle of winner-take-all . The model incorporates the idea that the overt saccade choice reflects only one of the multiple saccades prepared during visual discrimination, consistent with our physiological data. The value of the model is that, unlike previous models, it is able to account for both the latency and the percent correct of saccade choices.

Krauzlis, Richard J.↗

Performance of a Heterogeneous Grid Partitioner for N-body Applications

An important characteristic of distributed grids is that they allow geographically separated multicomputers to be tied together in a transparent virtual environment to solve large-scale computational problems. However, many of these applications require effective runtime load balancing for the resulting solutions to be viable. Recently, we developed a latency tolerant partitioner, called MinEX, specifically for use in distributed grid environments. This paper compares the performance of MinEX to that of METIS, a popular multilevel family of partitioners, using simulated heterogeneous grid configurations. A solver for the classical N-body problem is implemented to provide a framework for the comparisons. Experimental results show that MinEX provides superior quality partitions while being competitive to METIS in speed of execution.

Harvey, Daniel J.↗

Performance Enhancement Strategies for Multi-Block Overset Grid CFD Applications

The overset grid methodology has significantly reduced time-to-solution of highfidelity computational fluid dynamics (CFD) simulations about complex aerospace configurations. The solution process resolves the geometrical complexity of the problem domain by using separately generated but overlapping structured discretization grids that periodically exchange information through interpolation. However, high performance computations of such large-scale realistic applications must be handled efficiently on state-of-the-art parallel supercomputers. This paper analyzes the effects of various performance enhancement strategies on the parallel efficiency of an overset grid Navier-Stokes CFD application running on an SGI Origin2000 machinc. Specifically, the role of asynchronous communication, grid splitting, and grid grouping strategies are presented and discussed. Details of a sophisticated graph partitioning technique for grid grouping are also provided. Results indicate that performance depends critically on the level of latency hiding and the quality of load balancing across the processors.

Djomehri, M. Jahed↗

Validation of Variations in Mental Workload as a Function of Scenario Difficulty: Traffic Density and Visibility

Fluctuations in mental workload can be expected as a function of traffic density and visibility. The aim of the current investigation was to establish simulation scenarios that differed in attentional processing requirements. Four scenarios were created and tested representing two levels of traffic density (urban versus freeway) and two levels of visibility (clear versus foggy). An array of mental workload assessment measures were used to exam changes in attentional processing requirements in each scenario. The assessment array consisted of physiological (P300 amplitude and latency) and behavioral (RT and accuracy) indices. Preliminary results indicate that workload differs significantly as a function of traffic density in rural versus freeway scenarios. Workload also differs significantly in rural versus freeway scenarios as a function of visibility as observed by a significant interaction between the two variables of interest. Results are discussed in terms of their application for validating the difficulty level of simulation scenarios as a format for examining mental workload.

Source record↗

Understanding and Improving High-Performance I/O Subsystems

This research program has been conducted in the framework of the NASA Earth and Space Science (ESS) evaluations led by Dr. Thomas Sterling. In addition to the many important research findings for NASA and the prestigious publications, the program has helped orienting the doctoral research program of two students towards parallel input/output in high-performance computing. Further, the experimental results in the case of the MasPar were very useful and helpful to MasPar with which the P.I. has had many interactions with the technical management. The contributions of this program are drawn from three experimental studies conducted on different high-performance computing testbeds/platforms, and therefore presented in 3 different segments as follows: 1. Evaluating the parallel input/output subsystem of a NASA high-performance computing testbeds, namely the MasPar MP- 1 and MP-2; 2. Characterizing the physical input/output request patterns for NASA ESS applications, which used the Beowulf platform; and 3. Dynamic scheduling techniques for hiding I/O latency in parallel applications such as sparse matrix computations. This study also has been conducted on the Intel Paragon and has also provided an experimental evaluation for the Parallel File System (PFS) and parallel input/output on the Paragon. This report is organized as follows. The summary of findings discusses the results of each of the aforementioned 3 studies. Three appendices, each containing a key scholarly research paper that details the work in one of the studies are included.

El-Ghazawi, Tarek A.↗

Differentially Variable Component Analysis (dVCA): Identifying Multiple Evoked Components using Trial-to-Trial Variability

Electric potentials and magnetic fields generated by ensembles of synchronously active neurons in response to external stimuli provide information essential to understanding the processes underlying cognitive and sensorimotor activity. Interpreting recordings of these potentials and fields is difficult as each detector records signals simultaneously generated by various regions throughout the brain. We introduce the differentially Variable Component Analysis (dVCA) algorithm, which relies on trial-to-trial variability in response amplitude and latency to identify multiple components. Using simulations we evaluate the importance of response variability to component identification, the robustness of dVCA to noise, and its ability to characterize single-trial data. Finally, we evaluate the technique using visually evoked field potentials recorded at incremental depths across the layers of cortical area VI, in an awake, behaving macaque monkey.

Knuth, Kevin H.↗

Fast Transformation of Temporal Plans for Efficient Execution

Temporal plans permit significant flexibility in specifying the occurrence time of events. Plan execution can make good use of that flexibility. However, the advantage of execution flexibility is counterbalanced by the cost during execution of propagating the time of occurrence of events throughout the flexible plan. To minimize execution latency, this propagation needs to be very efficient. Previous work showed that every temporal plan can be reformulated as a dispatchable plan, i.e., one for which propagation to immediate neighbors is sufficient. A simple algorithm was given that finds a dispatchable plan with a minimum number of edges in cubic time and quadratic space. In this paper, we focus on the efficiency of the reformulation process, and improve on that result. A new algorithm is presented that uses linear space and has time complexity equivalent to Johnson s algorithm for all-pairs shortest-path problems. Experimental evidence confirms the practical effectiveness of the new algorithm. For example, on a large commercial application, the performance is improved by at least two orders of magnitude. We further show that the dispatchable plan, already minimal in the total number of edges, can also be made minimal in the maximum number of edges incoming or outgoing at any node.

Tsamardinos, Ioannis↗

Solving Large Problems Quickly: Progress in 2001-2003

This document describes the progress we have made and the lessons we have learned in 2001 through 2003 under the NASA grant entitled "Solving Important Problems Faster". The long-term goal of this research is to accelerate large, irregular scientific applications which have enormous data sets and which are difficult to parallelize. To accomplish this goal, we are exploring two complementary techniques: (i) using compiler-inserted prefetching to automatically hide the I/O latency of accessing these large data sets from disk; and (ii) using thread-level data speculation to enable the optimistic parallelization of applications despite uncertainty as to whether data dependences exist between the resulting threads which would normally make them unsafe to execute in parallel. Overall, we made significant progress in 2001 through 2003, and the project has gone well.

Mowry, Todd C.↗

Morphology of the Vestibular Utricule in Toadfish, Opsanus Tau

The uticle is an otolith organ in the vertebrate inner ear that provides gravitoinertial acceleration information into the vestibular reflex pathways. The aim of the present study was to provide an anatomical description of this structure in the adult oyster toadfish, and establish a morphological basis for interpretation of subsequent functional studies. Light, scanning electron and transmission electron microscopy were applied to visualize the sensory epithelium and its neural innervation. Electrophysiological techniques were used to identify utricular afferents by their response to translation stimuli. Similar to nerve afferents supplying the semicircular canals and lagena, utricular afferents commonly exhibit a short-latency increase of firing rate in response to electrical activation of the central efferent pathway. Afferents were labeled with biocytin either intraaxonally or with extracellular bulk deposits. Light microscope images of serial thick sections were used to make three-dimensional reconstructions of individual labeled afferents to identify the dendritic morphology with respect to epithelial location. Scanning electron microscopy was used to visualize the surface of the otolith mass facing the otolith membrane, and the hair cell polarization patterns of strioler and extrastriolar regions. Transmission electron micrographs of serial thin sections were compiled to create a three-dimensional reconstruction of the labeled afferent over a segment of its dendritic field and to examine the hair cell-afferent synaptic contacts.

Bass, L.↗

Overview of GPM Missions's Ground Validation Program

An important element of the internationally structured Global Precipitation Measurement (GPM) mission will be its ground validation research program. Within the last year, the initial architecture of this program has taken shape. This talk will describe that architecture, both in terms of the international program and in terms of the separate regional programs of the principle participating space agencies, i.e., ESA, JAXA, and NASA. There are three overriding goals being addressed in the planning of this program; (1) establishing various new, challenging and important scientific research goals vis-a-vis current ground validation programs supporting satellite retrieval of precipitation; (2) designing the program as an international partnership which operates, out of necessity, heterogeneous sites in terms of their respective observational foci and science thrusts, but anneals itself in terms of achieving a few overarching scientific objectives; and (3) developing a well-designed protocol that allows specific sites or site networks, at their choosing, to operate in a 'supersite' mode - defined as the capability to routinely transmit GV information at low latency to GPM's Precipitation Processing System (PPS). (The PPS is being designed as GPM's data information system, a distributed data system with main centers at the Goddard Space Flight Center (GSFC) within NASA, the Earth Observation Research Center (EORC) within JAXA, and a TBD facility to be identified by the ESA s ESTEC facility in Noordwijk.)

Smith, Eric A.↗

Enhancing the IGS Data and Products Infrastructure: A Data Center Perspective

The Data Transfer and Data Centers session will present papers on current data center activities as well as various topics geared towards enhancing the availability and acquisition of International Global Positions System Service (IGS) data and products. These topics include: strategies for reducing data file latency at IGS Data Centers, standardization of data file replacement notification methods, improving the efficiency of data file transfer among IGS Data Centers, and defining a network topology for GPS data files for use in applications.

Scharber, Michael↗

NASA/BAE SYSTEMS SpaceWire Effort

This paper discusses the state of the NASA and BAE SYSTEMS developments of SpaceWire. NASA has developed intellectual property that implements SpaceWire in Register Transfer Level (RTL) VHDL for a SpaceWire link and router. This design has been extensively verified using directed tests from the SpaceWire Standard and design specification, as well as being randomly tested to flush out hard to find bugs in the code. The high level features of the design will be discussed, including the support for multiple time code masters, which will be useful for the James Webb Space Telescope electrical architecture. This design is now ready to be targeted to FPGA's and ASICs. Target utilization and performance information will be presented for Spaceflight worthy FPGA's and a discussion of the ASIC implementations will be addressed. In particular, the BAE SYSTEMS ASIC will be highlighted which will be implemented on their .25micron rad-hard line. The chip will implement a 4-port router with the ability to tie chips together to make larger routers without external glue logic. This part will have integrated LVDS drivers/receivers, include a PLL and include skew control logic. It will be targeted to run at greater than 300 MHz and include the implementation for the proposed SpaceWire transport layer. The need to provide a reliable transport mechanism for SpaceWire has been identified by both NASA And ESA, who are attempting to define a transport layer standard that utilizes a low overhead, low latency connection oriented approach that works end-to-end. This layer needs to be implemented in hardware to prevent bottlenecks.

Rakow, Glenn Parker↗

NASA/BAE Systems SpaceWire Efforts

This paper discusses the state of the NASA and BAE SYSTEMS developments using Spacewire. NASA has developed intellectual property that implements Spacewire in Register Transfer Level VHDL for a Spacewire link and router. This design has been extensively verified using directed tests from the Spacewire Standard and design specification, as well as being randomly tested to flush out hard to find bugs in the code. The high level features of the design will be discussed, including the support for multiple time code masters, which will be useful for the James Webb Space Telescope electrical architecture. This design is now ready to be targeted to FPGA's and ASICs. Target utilization and performance information will be presented for some spaceflight qualified FPGA's and a discussion of the ASIC implementations will be addressed. In particular, the BAE SYSTEMS ASIC will be highlighted which will be implemented in their 0.25 micron rad-hard line. The chip will implement a 4-port router with the ability to tie chips together to make larger routers without external glue logic. This part will have integrated LVDS driver/receivers, include a PLL and include skew control logic. It will be targeted to run at greater than 300 MHz and include the implementation for the proposed Spacewire transport layer. The need to provide a reliable transport mechanism for Spacewire has been identified by both NASA and ESA, who are attempting to define a transport layer standard that utilizes a low overhead, low latency connection oriented approach. The Transport layer needs to be implemented in hardware-to prevent bottlenecks.

Rakow, Glenn Parker↗

Kernel PLS Estimation of Single-trial Event-related Potentials

Nonlinear kernel partial least squaes (KPLS) regressior, is a novel smoothing approach to nonparametric regression curve fitting. We have developed a KPLS approach to the estimation of single-trial event related potentials (ERPs). For improved accuracy of estimation, we also developed a local KPLS method for situations in which there exists prior knowledge about the approximate latency of individual ERP components. To assess the utility of the KPLS approach, we compared non-local KPLS and local KPLS smoothing with other nonparametric signal processing and smoothing methods. In particular, we examined wavelet denoising, smoothing splines, and localized smoothing splines. We applied these methods to the estimation of simulated mixtures of human ERPs and ongoing electroencephalogram (EEG) activity using a dipole simulator (BESA). In this scenario we considered ongoing EEG to represent spatially and temporally correlated noise added to the ERPs. This simulation provided a reasonable but simplified model of real-world ERP measurements. For estimation of the simulated single-trial ERPs, local KPLS provided a level of accuracy that was comparable with or better than the other methods. We also applied the local KPLS method to the estimation of human ERPs recorded in an experiment on co,onitive fatigue. For these data, the local KPLS method provided a clear improvement in visualization of single-trial ERPs as well as their averages. The local KPLS method may serve as a new alternative to the estimation of single-trial ERPs and improvement of ERP averages.

Rosipal, Roman↗

Dynamics of the spatial scale of visual attention revealed by brain event-related potentials

The temporal dynamics of the spatial scaling of attention during visual search were examined by recording event-related potentials (ERPs). A total of 16 young participants performed a search task in which the search array was preceded by valid cues that varied in size and hence in precision of target localization. The effects of cue size on short-latency (P1 and N1) ERP components, and the time course of these effects with variation in cue-target stimulus onset asynchrony (SOA), were examined. Reaction time (RT) to discriminate a target was prolonged as cue size increased. The amplitudes of the posterior P1 and N1 components of the ERP evoked by the search array were affected in opposite ways by the size of the precue: P1 amplitude increased whereas N1 amplitude decreased as cue size increased, particularly following the shortest SOA. The results show that when top-down information about the region to be searched is less precise (larger cues), RT is slowed and the neural generators of P1 become more active, reflecting the additional computations required in changing the spatial scale of attention to the appropriate element size to facilitate target discrimination. In contrast, the decrease in N1 amplitude with cue size may reflect a broadening of the spatial gradient of attention. The results provide electrophysiological evidence that changes in the spatial scale of attention modulate neural activity in early visual cortical areas and activate at least two temporally overlapping component processes during visual search.

Non-NASA Center↗

Horizontal vestibuloocular reflex evoked by high-acceleration rotations in the squirrel monkey. IV. Responses after spectacle-induced adaptation

The horizontal angular vestibuloocular reflex (VOR) evoked by sinusoidal rotations from 0.5 to 15 Hz and acceleration steps up to 3,000 degrees /s(2) to 150 degrees /s was studied in six squirrel monkeys following adaptation with x2.2 magnifying and x0.45 minimizing spectacles. For sinusoidal rotations with peak velocities of 20 degrees /s, there were significant changes in gain at all frequencies; however, the greatest gain changes occurred at the lower frequencies. The frequency- and velocity-dependent gain enhancement seen in normal monkeys was accentuated following adaptation to magnifying spectacles and diminished with adaptation to minimizing spectacles. A differential increase in gain for the steps of acceleration was noted after adaptation to the magnifying spectacles. The gain during the acceleration portion, G(A), of a step of acceleration (3,000 degrees /s(2) to 150 degrees /s) increased from preadaptation values of 1.05 +/- 0.08 to 1.96 +/- 0.16, while the gain during the velocity plateau, G(V), only increased from 0.93 +/- 0.04 to 1.36 +/- 0.08. Polynomial fits to the trajectory of the response during the acceleration step revealed a greater increase in the cubic than the linear term following adaptation with the magnifying lenses. Following adaptation to the minimizing lenses, the value of G(A) decreased to 0.61 +/- 0.08, and the value of G(V) decreased to 0.59 +/- 0.09 for the 3,000 degrees /s(2) steps of acceleration. Polynomial fits to the trajectory of the response during the acceleration step revealed that there was a significantly greater reduction in the cubic term than in the linear term following adaptation with the minimizing lenses. These findings indicate that there is greater modification of the nonlinear as compared with the linear component of the VOR with spectacle-induced adaptation. In addition, the latency to the onset of the adapted response varied with the dynamics of the stimulus. The findings were modeled with a bilateral model of the VOR containing linear and nonlinear pathways that describe the normal behavior and adaptive processes. Adaptation for the linear pathway is described by a transfer function that shows the dependence of adaptation on the frequency of the head movement. The adaptive process for the nonlinear pathway is a gain enhancement element that provides for the accentuated gain with rising head velocity and the increased cubic component of the responses to steps of acceleration. While this model is substantially different from earlier models of VOR adaptation, it accounts for the data in the present experiments and also predicts the findings observed in the earlier studies.

NASA Discipline Neuroscience↗