Search NASA⌕ Search

SEARCH · Search NASA

Results for “Time parallelization”

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 793 records · Page 44

HARP: A Dynamic Inertial Spectral Partitioner

Partitioning unstructured graphs is central to the parallel solution of computational science and engineering problems. Spectral partitioners, such recursive spectral bisection (RSB), have proven effecfive in generating high-quality partitions of realistically-sized meshes. The major problem which hindered their wide-spread use was their long execution times. This paper presents a new inertial spectral partitioner, called HARP. The main objective of the proposed approach is to quickly partition the meshes at runtime in a manner that works efficiently for real applications in the context of distributed-memory machines. The underlying principle of HARP is to find the eigenvectors of the unpartitioned vertices and then project them onto the eigerivectors of the original mesh. Results for various meshes ranging in size from 1000 to 100,000 vertices indicate that HARP can indeed partition meshes rapidly at runtime. Experimental results show that our largest mesh can be partitioned sequentially in only a few seconds on an SP2 which is several times faster than other spectral partitioners while maintaining the solution quality of the proven RSB method. A parallel WI version of HARP has also been implemented on IBM SP2 and Cray T3E. Parallel HARP, running on 64 processors SP2 and T3E, can partition a mesh containing more than 100,000 vertices into 64 subgrids in about half a second. These results indicate that graph partitioning can now be truly embedded in dynamically-changing real-world applications.

Simon, Horst D.↗

Implementing Access to Data Distributed on Many Processors

A reference architecture is defined for an object-oriented implementation of domains, arrays, and distributions written in the programming language Chapel. This technology primarily addresses domains that contain arrays that have regular index sets with the low-level implementation details being beyond the scope of this discussion. What is defined is a complete set of object-oriented operators that allows one to perform data distributions for domain arrays involving regular arithmetic index sets. What is unique is that these operators allow for the arbitrary regions of the arrays to be fragmented and distributed across multiple processors with a single point of access giving the programmer the illusion that all the elements are collocated on a single processor. Today's massively parallel High Productivity Computing Systems (HPCS) are characterized by a modular structure, with a large number of processing and memory units connected by a high-speed network. Locality of access as well as load balancing are primary concerns in these systems that are typically used for high-performance scientific computation. Data distributions address these issues by providing a range of methods for spreading large data sets across the components of a system. Over the past two decades, many languages, systems, tools, and libraries have been developed for the support of distributions. Since the performance of data parallel applications is directly influenced by the distribution strategy, users often resort to low-level programming models that allow fine-tuning of the distribution aspects affecting performance, but, at the same time, are tedious and error-prone. This technology presents a reusable design of a data-distribution framework for data parallel high-performance applications. Distributions are a means to express locality in systems composed of large numbers of processor and memory components connected by a network. Since distributions have a great effect on the performance of applications, it is important that the distribution strategy is flexible, so its behavior can change depending on the needs of the application. At the same time, high productivity concerns require that the user be shielded from error-prone, tedious details such as communication and synchronization.

James, Mark↗

Operations automation using the Link Monitor and Control Operator Assistant

The Link Monitor and Control Operator Assistant (LMC OA) is a knowledge-based prototype system which uses AI techniques to provide semiautomated monitor and control functions to support operations of the Deep Space Network (DSN) 70-m antenna at the Goldstone Deep Space Communications Complex (DSCC). The manual and time-consuming process of configuring the 70-m antenna and its associated communications and processing equipment, known as precalibration, is an overhead activity; the time spent in precalibration is time which cannot be spent supporting actual mission operations. Therefore, the major goal of the LMC OA task is to demonstrate techniques that reduce precalibration time, decrease operations overhead, and increase the availability of this valuable and oversubscribed NASA resource. The LMC OA prototype was tested in a parallel, experimental mode at the Goldstone DSCC performing semiautomated precalibration using the actual operational equipment. This test demonstrated that a reduction of 40 percent in precalibration time can be achieved with the LMC OA prototype.

Lee, Lorrine F.↗

Maximizing TDRS Command Load Lifetime

The GNC software onboard ISS utilizes TORS command loads, and a simplistic model of TORS orbital motion to generate onboard TORS state vectors. Each TORS command load contains five "invariant" orbital elements which serve as inputs to the onboard propagation algorithm. These elements include semi-major axis, inclination, time of last ascending node crossing, right ascension of ascending node, and mean motion. Running parallel to the onboard software is the TORS Command Builder Tool application, located in the JSC Mission Control Center. The TORS Command Builder Tool is responsible for building the TORS command loads using a ground TORS state vector, mirroring the onboard propagation algorithm, and assessing the fidelity of current TORS command loads onboard ISS. The tool works by extracting a ground state vector at a given time from a current TORS ephemeris, and then calculating the corresponding "onboard" TORS state vector at the same time using the current onboard TORS command load. The tool then performs a comparison between these two vectors and displays the relative differences in the command builder tool GUI. If the RSS position difference between these two vectors exceeds the tolerable lim its, a new command load is built using the ground state vector and uplinked to ISS. A command load's lifetime is therefore defined as the time from when a command load is built to the time the RSS position difference exceeds the tolerable limit. From the outset of TORS command load operations (STS-98), command load lifetime was limited to approximately one week due to the simplicity of both the onboard propagation algorithm, and the algorithm used by the command builder tool to generate the invariant orbital elements. It was soon desired to extend command load lifetime in order to minimize potential risk due to frequent ISS commanding. Initial studies indicated that command load lifetime was most sensitive to changes in mean motion. Finding a suitable value for mean motion was therefore the key to achieving this goal. This goal was eventually realized through development of an Excel spreadsheet tool called EMMIE (Excel Mean Motion Interactive Estimation). EMMIE utilizes ground ephemeris nodal data to perform a least-squares fit to inferred mean anomaly as a function of time, thus generating an initial estimate for mean motion. This mean motion in turn drives a plot of estimated downtrack position difference versus time. The user can then manually iterate the mean motion, and determine an optimal value that will maximize command load lifetime. Once this optimal value is determined, the mean motion initially calculated by the command builder tool is overwritten with the new optimal value, and the command load is built for uplink to ISS. EMMIE also provides the capability for command load lifetime to be tracked through multiple TORS ephemeris updates. Using EMMIE, TORS command load lifetimes of approximately 30 days have been achieved.

Brown, Aaron J.↗

Numerical Simulation of Illumination and Thermal Conditions at the Lunar Poles Using LOLA DTMs

We are interested in illumination conditions and the temperature distribution within the upper two meters of regolith near the lunar poles. Here, areas exist receiving almost constant illumination near areas in permanent shadow, which were identified as potential exploration sites for future missions. For our study a numerical simulation of the illumination and thermal environment for lunar near-polar regions is needed. Our study is based on high-resolution, twenty meters per pixel and 400 x 400 km large polar Digital Terrain Models (DTMs), which were derived from Lunar Orbiter Laser Altimeter (LOLA) data. Illumination conditions were simulated by synthetically illuminating the LOLA DTMs using the horizon method considering the Sun as an extended source. We model polar illumination for the central 50 x 50 km subset and use it as an input at each time-step (2 h) to evaluate the heating of the lunar surface and subsequent conduction in the sub-surface. At surface level we balance the incoming insolation with the subsurface conduction and radiation into space, whereas in the sub-surface we consider conduction with an additional constant radiogenic heat source at the bottom of our two-meter layer. Density is modeled as depth-dependent, the specific heat parameter as temperature-dependent and the thermal conductivity as depth- and temperature-dependent. We implemented a fully implicit finite-volume method in space and backward Euler scheme in time to solve the one-dimensional heat equation at each pixel in our 50 x 50 km DTM. Due to the non-linear dependencies of the parameters mentioned above, Newton's method is employed as the non-linear solver together with the Gauss-Seidel method as the iterative linear solver in each Newton iteration. The software is written in OpenCL and runs in parallel on the GPU cores, which allows for fast computation of large areas and long time scales.

Glaser, P.↗

Hidden-line removal at 20 pictures/second through hybrid techniques.

A real-time computer image generation method is presented that is designed to operate in a parallel-computing environment. It can provide good quality pictures of limited complexity if implemented on a general purpose hybrid computing system. Such a hybrid approach can generate a new image every 50 milliseconds. These results have been demonstrated by a feasibility test program which impelements the hybrid concepts described. This hybrid-picture generation capability is shown to represent a significant contribution to the area of real-time hidden-line removal.

Brown, R. M.↗

Parallel-vector computation for linear structural analysis and non-linear unconstrained optimization problems

Several parallel-vector computational improvements to the unconstrained optimization procedure are described which speed up the structural analysis-synthesis process. A fast parallel-vector Choleski-based equation solver, pvsolve, is incorporated into the well-known SAP-4 general-purpose finite-element code. The new code, denoted PV-SAP, is tested for static structural analysis. Initial results on a four processor CRAY 2 show that using pvsolve reduces the equation solution time by a factor of 14-16 over the original SAP-4 code. In addition, parallel-vector procedures for the Golden Block Search technique and the BFGS method are developed and tested for nonlinear unconstrained optimization. A parallel version of an iterative solver and the pvsolve direct solver are incorporated into the BFGS method. Preliminary results on nonlinear unconstrained optimization test problems, using pvsolve in the analysis, show excellent parallel-vector performance indicating that these parallel-vector algorithms can be used in a new generation of finite-element based structural design/analysis-synthesis codes.

Nguyen, D. T.↗

Severe storm initiation and development from satellite infrared imagery and Rawinsonde data

The geographical distribution of potential temperatures, mixing ratio, and streamlines of flow patterns at 850, 700, and 500 mb heights are used to understand the prestorm convection and the horizontal convergence of moisture. From the analysis of 21 tornadoes the following conclusions are reached: (1) Strong horizontal convergence of moisture appeared at the 850, 700, and 500 mb levels in the area 12 hours before the storm formation; (2) An abundantly moist atmosphere below 3 km (700 mb) becomes convectively unstable during the time period between 12 and 24 hours before the initiation of the severe storms; (3) Strong winds veering with height with direction parallel to the movement of a dryline, surface fronts, etc; (4) During a 36-hour period, a tropopause height in the areas of interest is lowest at the time of tornadic cloud formation; (5) A train of gravity waves is detected before and during the cloud formation period. Rapid-scan infrared imagery provides near real-time information on the life cycle of the storm which can be summarized as follows: (1) Enhanced convection produced an overshooting cloud top penetrating above the tropopause, making the mass density of the overshooting cloud much greater than the mass density of the surrounding air; (2) The overshooting cloud top collapsed at the end of the mature stage of the cloud development; (3) The tornado touchdown followed the collapse of the overshooting cloud top.

Hung, R. J.↗

Parallel-vector out-of-core equation solver for computational mechanics

A parallel/vector out-of-core equation solver is developed for shared-memory computers, such as the Cray Y-MP machine. The input/ output (I/O) time is reduced by using the a synchronous BUFFER IN and BUFFER OUT, which can be executed simultaneously with the CPU instructions. The parallel and vector capability provided by the supercomputers is also exploited to enhance the performance. Numerical applications in large-scale structural analysis are given to demonstrate the efficiency of the present out-of-core solver.

Qin, J.↗

Real-time synthetic aperture radar data processing for space applications

Range and azimuth correlation in the time domain using current state-of-the-art CCD LSI technology provides a potentially practical means of achieving real-time pipeline processing of SAR images for future space missions. The proposed range correlator approach, using already demonstrated CCD transversal filtering techniques, will require very little power: less than 10 watts per Seasat-type 20-km processing module. The azimuth correlator architecture is considerably more demanding since it requires a large number of parallel chips (1020 for a Seasat-type 20-km module) to achieve a real-time processing capability.

Arens, W. E.↗

Evolutionary Computing for Low-thrust Navigation

The development of new mission concepts requires efficient methodologies to analyze, design and simulate the concepts before implementation. New mission concepts are increasingly considering the use of ion thrusters for fuel-efficient navigation in deep space. This paper presents parallel, evolutionary computing methods to design trajectories of spacecraft propelled by ion thrusters and to assess the trade-off between delivered payload mass and required flight time. The developed methods utilize a distributed computing environment in order to speed up computation, and use evolutionary algorithms to find globally Pareto-optimal solutions. The methods are coupled with two main traditional trajectory design approaches, which are called direct and indirect. In the direct approach, thrust control is discretized in either arc time or arc length, and the resulting discrete thrust vectors are optimized. In the indirect approach, a thrust control problem is transformed into a costate control problem, and the initial values of the costate vector are optimized. The developed methods are applied to two problems: 1) an orbit transfer around the Earth and 2) a transfer between two distance retrograde orbits around Europa, the closest to Jupiter of the icy Galilean moons. The optimal solutions found with the present methods are comparable to other state-of-the-art trajectory optimizers and to analytical approximations for optimal transfers, while the required computational time is several orders of magnitude shorter than other optimizers thanks to an intelligent design of control vector discretization, advanced algorithmic parameterization, and parallel computing.

optimization↗

A multicomputer and real time Ada environment

A multicomputer is defined as a set of tightly-coupled yet autonomous computers capable of synchronizing and communicating in parallel but also of operating independently. The architectural concepts and requirements for executing the Ada programs in a multicomputer system are discussed. Synchronization, commmunication, and protection of shared data between the Ada program entities are addressed. Decomposition or partitioning of the Ada program in a multicomputer system is also studied. Finally, a multicomputer and real time Ada environment is described using FLEX/32 multicomputer system.

Naeini, Ray↗

Dual Cryogenic Capacitive Density Sensor

A dual cryogenic capacitive density sensor has been developed. The device contains capacitive sensors that monitor two-phase cryogenic flow density to within 1% accuracy, which, if temperature were known, could be used to determine the ratio of liquid to gas in the line. Two of these density sensors, located a known distance apart, comprise the sensor, providing some information on the velocity of the flow. This sensor was constructed as a proposed mass flowmeter with high data acquisition rates. Without moving parts, this device is capable of detecting the density change within a two-phase cryogenic flow more than 100 times a second. Detection is enabled by a series of two sets of five parallel plates with stainless steel, cryogenically rated tubing. The parallel plates form the two capacitive sensors, which are measured by electrically isolated digital electronics. These capacitors monitor the dielectric of the flow essentially the density of the flow and can be used to determine (along with temperature) the ratio of cryogenic liquid to gas. Combining this information with the velocity of the flow can, with care, be used to approximate the total two-phase mass flow. The sensor can be operated at moderately high pressures and can be lowered into a cryogenic bath. The electronics have been substantially improved over the older sensors, incorporating a better microprocessor, elaborate ground loop protection and noise limiting circuitry, and reduced temperature sensitivity. At the time of this writing, this design has been bench tested at room temperature, but actual cryogenic tests are pending

Youngquist, Robert↗

In-Situ Three-Dimensional Shape Rendering from Strain Values Obtained Through Optical Fiber Sensors

A method and system for rendering the shape of a multi-core optical fiber or multi-fiber bundle in three-dimensional space in real time based on measured fiber strain data. Three optical fiber cores arc arranged in parallel at 120.degree. intervals about a central axis. A series of longitudinally co-located strain sensor triplets, typically fiber Bragg gratings, are positioned along the length of each fiber at known intervals. A tunable laser interrogates the sensors to detect strain on the fiber cores. Software determines the strain magnitude (.DELTA.L/L) for each fiber at a given triplet, but then applies beam theory to calculate curvature, beading angle and torsion of the fiber bundle, and from there it determines the shape of the fiber in s Cartesian coordinate system by solving a series of ordinary differential equations expanded from the Frenet-Serrat equations. This approach eliminates the need for computationally time-intensive curve-tilting and allows the three-dimensional shape of the optical fiber assembly to be displayed in real-time.

Chan, Hon Man↗

Between a Map and a Data Rod

A Digital Divide has long stood between how NASA and other satellite-derived data are typically archived (time-step arrays or maps) and how hydrology and other point-time series oriented communities prefer to access those data. In essence, the desired method of data access is orthogonal to the way the data are archived. Our approach to bridging the Divide is part of a larger NASA-supported data rods project to enhance access to and use of NASA and other data by the Consortium of Universities for the Advancement of Hydrologic Science, Inc. (CUAHSI) Hydrologic Information System (HIS) and the larger hydrology community. Our main objective was to determine a way to reorganize data that is optimal for these communities. Two related objectives were to optimally reorganize data in a way that (1) is operational and fits in and leverages the existing Goddard Earth Sciences Data and Information Services Center (GES DISC) operational environment and (2) addresses the scaling up of data sets available as time series from those archived at the GES DISC to potentially include those from other Earth Observing System Data and Information System (EOSDIS) data archives. Through several prototype efforts and lessons learned, we arrived at a non-database solution that satisfied our objectivesconstraints. We describe, in this presentation, how we implemented the operational production of pre-generated data rods and, considering the tradeoffs between length of time series (or number of time steps), resources needed, and performance, how we implemented the operational production of on-the-fly (virtual) data rods. For the virtual data rods, we leveraged a number of existing resources, including the NASA Giovanni Cache and NetCDF Operators (NCO) and used data cubes processed in parallel. Our current benchmark performance for virtual generation of data rods is about a years worth of time series for hourly data (9,000 time steps) in 90 seconds. Our approach is a specific implementation of the general optimal strategy of reorganizing data to match the desired means of access. Results from our project have already significantly extended NASA data to the large and important hydrology user community that has been, heretofore, mostly unable to easily access and use NASA data.

machine learning↗

Real time identification of large space structures

Identification of frequencies, damping ratios, and mode shapes of large space structures (LSSs) are examined in real time. Real time processing allows for quick updates of model processing after a reconfiguration of structural failure. Recursive lattice least squares (RLLS) was selected as the baseline algorithm for the identification. Simulation results on a one dimensional LSS demonstrated that it provides good estimates, was not ill-conditioned in the presence of under-excited modes, allowed activity by a supervisory control system which prevented damage to the LSS or excessive drift, and was capable of real-time processing for typical LSS models. A suboptimal version of RLLS, which is equivalent to simulated parallel processing, was derived. A NASTRAN model of the dual keel U.S. space station was used to demonstrate the input/identification algorithm package in a more realistic simulation. Because the first eight flexible modes were very close together, the identification was much more difficult than in the simple examples. Even so, the model was accurately identified in real time.

Voss, Janice E.↗

Solving very large, sparse linear systems on mesh-connected parallel computers

The implementation of Pan and Reif's Parallel Nested Dissection (PND) algorithm on mesh connected parallel computers is described. This is the first known algorithm that allows very large, sparse linear systems of equations to be solved efficiently in polylog time using a small number of processors. How the processor bound of PND can be matched to the number of processors available on a given parallel computer by slowing down the algorithm by constant factors is described. Also, for the important class of problems where G(A) is a grid graph, a unique memory mapping that reduces the inter-processor communication requirements of PND to those that can be executed on mesh connected parallel machines is detailed. A description of an implementation on the Goodyear Massively Parallel Processor (MPP), located at Goddard is given. Also, a detailed discussion of data mappings and performance issues is given.

Opsahl, Torstein↗

Adaptation of primate vestibuloocular reflex to altered peripheral vestibular inputs. II Spatiotemporal properties of the adapted slow-phase eye velocity

1. The ability of the vestibuloocular reflex (VOR) to undergo adaptive modification after selective changes in the peripheral vestibular system was investigated in rhesus monkeys by recording three-dimensional eye movements before and after inactivation of selective semicircular canals. In the preceding paper we showed that the horizontal VOR gain evoked by passive yaw oscillations after lateral semicircular canal inactivation recovers gradually over time in a frequency-specific manner. Here we present the spatial tuning of the adapted slow-phase eye velocity and describe its spatiotemporal properties as a function of time after canal inactivation. 2. The spatial organization of the VOR was investigated during oscillations at different head positions in the pitch, roll, and yaw planes, as well as in the right anterior/left posterior and left anterior/right posterior canal planes. Acutely after bilateral inactivation of the lateral semicircular canals, a small horizontal response could still be elicited that peaked during rotations in pitched head positions that would maximally stimulate vertical semicircular canals. In addition, the phase of horizontal slow-phase velocity abruptly reversed through 180 degrees at positions close to upright, similarly to torsional slow-phase velocity. These spatial response properties suggest that the small, residual horizontal response components that are present acutely after plugging of both lateral canals originate from vertical semicircular canal signals. 3. As the horizontal response amplitude increased over time, consistent changes were also observed in the spatiotemporal tuning of horizontal slow-phase velocity. 1) The spatiotemporal response properties of horizontal slow-phase velocity acquired noncosine tuning characteristics, primarily in the pitch plane, in the right anterior/left posterior and left anterior/right posterior canal planes. Accordingly, horizontal response amplitude was nonzero during rotation in any head position in these planes and response phase varied significantly as a function of head orientation. 2) The peak horizontal response amplitude shifted spatially over time, such that 5-10 mo after plugging it was maximal during rotations at head positions close to upright. 4. In parallel to these unique spatiotemporal response properties characterizing the adapted horizontal VOR, torsional slow-phase velocity also exhibited small spatiotemporal changes after lateral canal inactivation that tended to precede in time the changes associated with the horizontal response components. In contrast, vertical slow-phase velocity in the plugged animals was unaltered and continued to be characterized by cosine-tuned spatial properties in three dimensions. 5. Recovery of the horizontal response gain during yaw oscillations in upright position, as well as the unique, noncosine spatiotemporal characteristics of the adapted horizontal VOR, were also observed in an animal with all but one vertical semicircular canals inactivated. There was, however, no sign of VOR gain recovery up to 2 mo after all semicircular canals were inactivated. These results suggest that the observed recovery of horizontal VOR is at least partly due to signals originating from the remaining intact vertical canal(s). Even in the presence of a single intact vertical canal, the improvement in horizontal gaze stability is at least partly restored through spatiotemporal changes in the processing of vestibuloocular signals that improve the gain and spatial tuning of horizontal VOR at the expense of temporal response properties.

NASA Discipline Number 16-10↗