Search NASA⌕ Search

SEARCH · Search NASA

Results for “static graph”

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.

118 records · Page 7

NASA Tech Briefs, May 2010

Topics covered include: Instrument for Analysis of Greenland's Glacier Mills Cryogenic Moisture Apparatus; A Transportable Gravity Gradiometer Based on Atom Interferometry; Three Methods of Detection of Hydrazines; Crossed, Small-Deflection Energy Analyzer for Wind/Temperature Spectrometer; Wavefront Correction for Large, Flexible Antenna Reflector; Novel Micro Strip-to-Waveguide Feed Employing a Double-Y Junction; Thin-Film Ferro Electric-Coupled Microstripline Phase Shifters With Reduced Device Hysteresis; Two-Stage, 90-GHz, Low-Noise Amplifier; A 311-GHz Fundamental Oscillator Using InP HBT Technology; FPGA Coprocessor Design for an Onboard Multi-Angle Spectro-Polarimetric Imager; Serrating Nozzle Surfaces for Complete Transfer of Droplets; Turbomolecular Pumps for Holding Gases in Open Containers; Triaxial Swirl Injector Element for Liquid-Fueled Engines; Integrated Budget Office Toolbox; PLOT3D Export Tool for Tecplot; Math Description Engine Software Development Kit; Astronaut Office Scheduling System Software; ISS Solar Array Management; Probabilistic Structural Analysis Program; SPOT Program; Integrated Hybrid System Architecture for Risk Analysis; System for Packaging Planetary Samples for Return to Earth; Offset Compound Gear Drive; Low-Dead-Volume Inlet for Vacuum Chamber; Simple Check Valves for Microfluidic Devices; A Capillary-Based Static Phase Separator for Highly Variable Wetting Conditions; Gimballing Spacecraft Thruster; Finned Carbon-Carbon Heat Pipe with Potassium Working Fluid; Lightweight Heat Pipes Made from Magnesium; Ceramic Rail-Race Ball Bearings; Improved OTEC System for a Submarine Robot; Reflector Surface Error Compensation in Dual-Reflector Antennas; Enriched Storable Oxidizers for Rocket Engines; Planar Submillimeter-Wave Mixer Technology with Integrated Antenna; Widely Tunable Mode-Hop-Free External-Cavity Quantum Cascade Laser; Non-Geiger-Mode Single-Photon Avalanche Detector with Low Excess Noise; Using Whispering-Gallery-Mode Resonators for Refractometry; RF Device for Acquiring Images of the Human Body; Reactive Collision Avoidance Algorithm; Fast Solution in Sparse LDA for Binary Classification; Modeling Common-Sense Decisions in Artificial Intelligence; Graph-Based Path-Planning for Titan Balloons; Nanolaminate Membranes as Cylindrical Telescope Reflectors; Air-Sea Spray Airborne Radar Profiler Characterizes Energy Fluxes in Hurricanes; Large Telescope Segmented Primary Mirror Alignment; and Simplified Night Sky Display System.

Source record↗

Self-force on an electric dipole in the spacetime of a cosmic string

We calculate the electrostatic self-force on an electric dipole in the spacetime generated by a static, thin, infinite and straight cosmic string. The electric dipole is held fixed in different configurations, namely, parallel, perpendicular to the cosmic string and oriented along the azimuthal direction around this topological defect, which is stretched along the z axis. We show that the self-force is equivalent to an interaction of the electric dipole with an effective dipole moment which depends on the linear mass density of the cosmic string and on the configuration. The plots of the self-forces as functions of the parameter which determines the angular deficit of the cosmic string are shown for those different configurations. -- Highlights: •Review of regularized Green’s function applied to the problem. •Self-force on an electric dipole in the string spacetime for some orientations. •Representation via graphs of the self-forces versus angular parameter of the cosmic string. •Self-force induced by the string seen as an interaction between two dipoles. •Discussion about the superposition principle in this non-trivial background.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Sampling-Based Motion Planning Algorithms for Replanning and Spatial Load Balancing

The common theme of this dissertation is sampling-based motion planning with the two key contributions being in the area of replanning and spatial load balancing for robotic systems. Here, we begin by recalling two sampling-based motion planners: the asymptotically optimal rapidly-exploring random tree (RRT*), and the asymptotically optimal probabilistic roadmap (PRM*). We also provide a brief background on collision cones and the Distributed Reactive Collision Avoidance (DRCA) algorithm. The next four chapters detail novel contributions for motion replanning in environments with unexpected static obstacles, for multi-agent collision avoidance, and spatial load balancing. First, we show improved performance of the RRT* when using the proposed Grandparent-Connection (GP) or Focused-Refinement (FR) algorithms. Next, the Goal Tree algorithm for replanning with unexpected static obstacles is detailed and proven to be asymptotically optimal. A multi-agent collision avoidance problem in obstacle environments is approached via the RRT*, leading to the novel Sampling-Based Collision Avoidance (SBCA) algorithm. The SBCA algorithm is proven to guarantee collision free trajectories for all of the agents, even when subject to uncertainties in the knowledge of the other agents’ positions and velocities. Given that a solution exists, we prove that livelocks and deadlock will lead to the cost to the goal being decreased. We introduce a new deconfliction maneuver that decreases the cost-to-come at each step. This new maneuver removes the possibility of livelocks and allows a result to be formed that proves convergence to the goal configurations. Finally, we present a limited range Graph-based Spatial Load Balancing (GSLB) algorithm which fairly divides a non-convex space among multiple agents that are subject to differential constraints and have a limited travel distance. The GSLB is proven to converge to a solution when maximizing the area covered by the agents. The analysis for each of the above mentioned algorithms is confirmed in simulations.

97 MATHEMATICS AND COMPUTING↗

The numerical simulation of subsonic flutter

The present paper describes a numerical simulation of unsteady, subsonic aeroelastic responses. The technique accounts for aerodynamic nonlinearities associated with angles of attack, vortex-dominated flow, static deformations, and unsteady behavior. The fluid and the wing together are treated as a single dynamic system, and the equations of motion for the structure and flowfield are integrated simultaneously and interactively in the time domain. The method employs an iterative scheme based on a predictor-corrector technique. The aerodynamic loads are computed by the general unsteady vortex-lattice method and are determined simultaneously with the motion of the wing. Two models are used to demonstrate the technique: a rigid wing on an elastic support experiencing plunge and pitch about the elastic axis, and a continuous wing rigidly supported at the root chord experiencing spanwise bending and twisting. The time domain solution coupled with the unsteady vortex-lattice method provides the capability of graphically depicting wing and wake motion. Several graphs that illustrate the time domain behavior of the wing and wake are presented.

Strganac, Thomas W.↗

Reducing False Positives in Runtime Analysis of Deadlocks

This paper presents an improvement of a standard algorithm for detecting dead-lock potentials in multi-threaded programs, in that it reduces the number of false positives. The standard algorithm works as follows. The multi-threaded program under observation is executed, while lock and unlock events are observed. A graph of locks is built, with edges between locks symbolizing locking orders. Any cycle in the graph signifies a potential for a deadlock. The typical standard example is the group of dining philosophers sharing forks. The algorithm is interesting because it can catch deadlock potentials even though no deadlocks occur in the examined trace, and at the same time it scales very well in contrast t o more formal approaches to deadlock detection. The algorithm, however, can yield false positives (as well as false negatives). The extension of the algorithm described in this paper reduces the amount of false positives for three particular cases: when a gate lock protects a cycle, when a single thread introduces a cycle, and when the code segments in different threads that cause the cycle can actually not execute in parallel. The paper formalizes a theory for dynamic deadlock detection and compares it to model checking and static analysis techniques. It furthermore describes an implementation for analyzing Java programs and its application to two case studies: a planetary rover and a space craft altitude control system.

Bensalem, Saddek↗

Inter-Procedural Resource Sharing in High Level Synthesis through Function Proxies

Modular design is becoming increasingly important in High Level Synthesis (HLS) flows. Current HLS flows generate hierarchical and modular designs that mimic the structure and call graph of input specification translating functions into modules. Function calls are translated instantiating the callee module in the data-path of its caller, allowing for resource sharing when the same function is called multiple times. However, if two different callers invoke the same function, current HLS flows cannot share the instance of the module between the two callers, even if they invoke the function in a mutually exclusive way. In this paper, we propose a methodology that enables sharing of (sub)modules across modules boundaries. Sharing is obtained through function proxies, which act as forwarders of function calls in the original specification to shared modules without adding performance penalties. Building on the concept of function proxies, we propose a methodology and the related components to perform HLS of function calls through function pointers, without requiring complete static knowledge of the alias set (point-to set). We show that module sharing through function proxies provides valuable area savings without significant impacts on the execution delays, and that our synthesis approach for function pointers enables dynamic polymorphism.

HLS, function proxy, FPGA, modular HLS,↗

Protein conformational switch discerned via network centrality properties

Network analysis has emerged as a powerful tool for examining structural biology systems. The spatial organization of the components of a biomolecular structure has been rendered as a graph representation and analyses have been performed to deduce the biophysical and mechanistic properties of these components. For proteins, the analysis of protein structure networks (PSNs), especially via network centrality measurements and cluster coefficients, has led to identifying amino acid residues that play key functional roles and classifying amino acid residues in general. Whether these network properties examined in various studies are sensitive to subtle (yet biologically significant) conformational changes remained to be addressed. Here, we focused on four types of network centrality properties (betweenness, closeness, degree, and eigenvector centralities) for conformational changes upon ligand binding of a sensor protein (constitutive androstane receptor) and an allosteric enzyme (ribonucleotide reductase). We found that eigenvector centrality is sensitive and can distinguish salient structural features between protein conformational states while other centrality measures, especially closeness centrality, are less sensitive and rather generic with respect to the structural specificity. We also demonstrated that an ensembleinformed, modified PSN with static edges removed (which we term PSN*) has enhanced sensitivity at discerning structural changes.

59 BASIC BIOLOGICAL SCIENCES↗

Static and transient performance of YF-102 engine with up to 14 percent core airbleed for the quiet short-haul research aircraft

An outdoor static test stand was used to measure the steady-state and transient performance of the YF-102 turbofan engine with core airbleed. The test configuration included a bellmouth inlet and a confluent-flow exhaust system similar in size to the quiet short-haul research aircraft (QSRA) exhaust system. For the steady-state tests, the engine operated satisfactorily with core bleed up to 14 percent of the core inlet flow. For the transient tests the engine accelerated and decelerated satisfactorily with no core bleed and with core bleed up to 11 percent of the core inlet flow (maximum tested). For some of the tests the core-bleed flow rate was scheduled to vary with fan discharge pressure, to simulate the QSRA bleed requirements. No stability, surge, stall, overtemperature, combustor flameout, or other operating problems were encountered in any of the tests. Steady-state and transient engine performance data are presented in graphs, and fuel-control trajectories for typical transient tests are shown.

Mcardle, J. G.↗

Development and Testing of Pulse Guns for Combustion Instability Testing

To test liquid rocket engines (LREs) for combustion instabilities, devices such as bombs are often used to create pressure wave disturbances. Bombs, while effective, are inherently dangerous, expensive, and difficult to procure. Over the years, pulse guns have been used as a safer and more cost-effective way to generate controlled pressure disturbances in engine chambers. In anticipation of the need for stability testing of prototype LREs at NASA Marshall Space Flight Center (MSFC), a set of pulse guns have been designed, fabricated, tested, and characterized. The pulse gun program is funded by the RS-25 Engine Program managed out of MSFC and funded by NASA’s Space Launch System (SLS) through the MSFC Liquid Engines Office (LEO). A pulse gun is a simple device – like a traditional gun, it has a breech and barrel section. However, unlike a traditional gun, there is no bullet, as the purpose of the pulse gun is strictly to fire a high pressure pulse. Instead of a firing pin and primer that would normally be used in a traditional gun, an initiator is used to activate the gun powder. The initiator is a highly reliable pyrotechnic initiator. For this study, clone versions of the NASA Standard Initiator (NSI) were used. The initiator is used to ignite a pre-measured amount of gun powder loaded into the breech. When the pressure of the burnt gun powder exceeds the set point of a downstream burst disk, the disk ruptures, allowing the high pressure pulse to travel downstream through the barrel section. A ballistic pressure transducer located in the breech section is used to measure the short duration, high pressure pulse. Some configurations of the pulse gun have barrel sections that include one or more additional ballistic pressure transducers. These additional pressure measurements help track the degradation and damping of the pulse as it travels out of the barrel section. The measurements may also be used to determine the velocity of pulse. The objective of this paper is to present the different variants of this newly-developed pulse gun and characterize performance over a range of parameters. The parameters include breech diameter, barrel length, amount of gun powder used, the way the gun powder is packed, and the pressure setting of the burst disk. There are a total of six pulse guns: three with the 0.25 inch breech and three different length barrels, and three with the 0.40 inch breech and three different length barrels. For both breech sizes, the associated barrels are referred to as standard, one-port, and two-port barrels. The standard barrel has no instrumentation and is likely the barrel that will be used for engine stability testing. The one- and two-port barrels were designed specifically for pulse gun component testing to allow measurements of the magnitude and timing of the high pressure pulse as it makes its way through the pulse gun. The burst disks tested were commercially-available burst disks designed to rupture at 8,000, 16,000, and 24,000 psid. Testing was accomplished by firing the pulse gun into a test chamber pressurized with nitrogen at about 2300 psig. A total of four Model 113B23 High frequency ICP® pressure sensors (10k psi) were mounted in the test chamber, in the same plane as the pulse gun. Two of the sensors had “trimmed” adapters, and two did not. Given the symmetrical configuration of the sensors within the test chamber, different amplitudes of pressure measurements are attributed to the use of trimmed versus untrimmed adapters. The untrimmed adapters, with their narrower passages, tended to amplify the pressure amplitudes by as much as 50%. In total, 41 pulse gun tests have been conducted.Data are still being analyzed, but some trends are apparent. For example, measurements taken within the pulse gun are shown in Figures 3 and 4 for Hot-fires (HFs) # 11 and 39, respectively. Both tests were identical in that the 0.40 inch ID breech, two-port barrel, 8,000 psid burst disk, and same amount of gunpowder (6.639 grains for HF# 11, and 6.576 grains for HF# 39) were used, and the back pressure in the nitrogen test chamber was ~2300 psig. Despite keeping all these variables constant, the results from these two tests look quite different. For both tests, the first pressure peak shown in the P2111 trace within the breech is the firing of the initiator. The second peak and any subsequent peaks are from the combustion of the gunpowder. It should be noted that because the sensors are dynamic, the ~2300 psig baseline static pressure is not shown in the figures. For HF# 11, the burst disk clearly ruptured in a little over 0.1 ms from the time the initiator was fired. This is evident from the abrupt rise in pressure for P2112 followed by another abrupt rise in pressure for P2113. The sensors track the movement of the high pressure pulse through the pulse gun. For HF# 39, however, there was nearly 1 ms delay between the initiator firing and the burst disk rupturing. The only difference between these two tests was the way in which the gunpowder was packed within the breech. For HF# 11, the gunpowder was poured directly into the breech, atop the initiator, and held in place with a vegetable fiber wad appropriately sized for the barrel diameter. Once in place, the wad firmly held the gunpowder in place. For HF# 39, the gunpowder was rolled within cigarette paper with the ends of the paper twisted. The rolled gunpowder was gently pushed down into the breech, toward the initiator, and no wad was used. This method of loading the gunpowder consistently produced longer delays in the rupture of the burst disk, presumably because there was a steady, fuller burning of the gunpowder. The burst disk was rated for 8,000 psid, which means that the burst disk should not have opened until the pressure in the breech reached ~10,300 since there was ~2300 psig back pressure in the test chamber. In the case of HF# 11, the breech pressure only reached roughly 4200 psi before there was leakage either through or past the burst disk, but for HF#39, the breech pressure reached 10,600 psi prior to the burst disk opening. The temperature of the burst disk is certainly a factor in determining when the burst disk will rupture. A sharp rise in the burst disk temperature could weaken it and cause it to stray from the designed set point burst pressure. The burst disks are manufactured of Inconel to try to reduce their sensitivity to temperature, but how the burst disks perform above 900°F is not documented. All burst disks were engineered and tested by the manufacturer for ambient temperature conditions. One theory for why rolling the gunpowder in cigarette paper may produce better results is related to a more controlled temperature environment. The cigarette paper may act as a sheath that protects the burst disk from excessive temperatures during the rapid buildup of pressure in the breech. The ultimate benefit of not breeching the burst disk prematurely is shown in Figures 5 and 6, which graphs the resultant pressure pulse produced in the test chamber. For HF #11, the peak pressure on the P2123 trimmed adapter is about 270 psi, while for HF# 39 it is 343 psi, which is about 1.27 times greater in magnitude. In either case, the pressure pulse is ~20 μs in width once it reaches the test chamber. Another pressure rise about 100 μs later can be seen on the sensors located across from the pulse gun port, P2124 and P2121. These pressures are lower due to attenuation of the pressure wave as it moves across the test chamber. After the wave encounters the wall, it reflects back and forth within the chamber until it completely dissipates.

Pulse Gun↗

Data Locality Enhancement of Dynamic Simulations for Exascale Computing (Final Report)

The development of modern processors exhibits two trends that complicate the optimizations of modern software. The first is the increasing sensitivity of processors' throughput to irregularities in computation. With more processors produced through a massive integration of simple cores, future systems will increasingly favor regular data-level parallel computations, but deviate from the needs of applications with complex patterns. Some evidences are already shown on Graphic Processing Units (GPU): Irregular data accesses (e.g., indirect references A[D[i]]) and conditional branches are limiting many GPU applications' performance at a level an order of magnitude lower than the peak of GPU. The second hardware trend is the growing gap between memory bandwidth and the aggregate speed—that is, the sum of all cores' computing power—of a Chip Multiprocessor (CMP). Despite the capped growth of the peak CPU speed, the aggregate speed of a CMP keeps increasing as more cores get into a single chip. It is expected that by 2018, node concurrency in an exascale system will increase by hundreds of times, whereas, memory bandwidth will expand by only 10 to 20 times. Consequently, data movement and storage is expected to consume more than 70% of the total system power. Bridging this gap is difficult; the complexities of modern CMP memory hierarchy make it even harder: Data cache becomes shared among computing units, and the sharing is often non-uniform—whether two computing units share a cache depends on their proximity and the level of the cache. On the recent IBM Power7 architecture, for instance, four hardware contexts (or SMT threads) in a core share the entire memory hierarchy, all cores in one chip share an on-chip L3 cache, and cores across chips share L3 and main memory through off-chip connections. These two trends complicate the translation of computing power into performance, especially for a program with either intensive data accesses or complex patterns in data accesses or control flow paths. Unfortunately, both attributes present and will persist in a class of important applications. For instance, many scientific simulations deal with a large volume of data. And meanwhile, as most real-world processes are non-uniform and evolving (e.g., the evolution of a galaxy or the process of a drug injection), both the computations and data accesses of these programs tend to be irregular and dynamically changing. Currently, the lack of support to these applications on modern CMP severely limits their performance. On GPU, as our recent study shows and other studies echo, performance enhancement of a factor of integers is possible when memory accesses or control flows are streamlined for a set of GPU applications. On multicore CPU, our studies show that traditional locality enhancement, for being oblivious to the new features of multicore memory hierarchy, may even cause large slowdown to data-intensive dynamic applications. The severity of the issues is expected to worsen as the two hardware trends continue. Some recent studies try to match software with the trends, but in a limited scope or manner. For irregularities on GPU, most studies focus on irregularities analyzable through static analysis (e.g., data accesses in regular loops). Dynamic irregularities are harder to address because the needed analysis and transformations typically have to happen at run time. Some other research resorts to hardware extensions, an actual adoption of which is unclear for the entailed space cost and complexity. For data locality, recent years have seen some exploitations of the new memory hierarchy on multicore for performance, but most of them are on process or thread scheduling, rather than program transformations. Our recent study reveals that program-level transformations may magnify the scheduling benefits by a factor of seven, concluding that program-level transformation should play a central role for data locality enhancement on modern CMP. But research in this direction has been sparse, and most have focused on data layout or cache performance modeling, rather than program transformations to match with the new memory hierarchy features. Overall, it is still an open question how to bridge the gap between dynamic computations and the two prominent properties of modern processors. The goal of this project is to develop a set of techniques and software tools to enhance the matching between memory accesses in dynamic simulations and the prominent features of modern and future CMP, alleviating the memory performance issues for petascale and exascale computing. This report summarizes the discoveries and products produced throughout this project. It includes free launch, a new software approach to overcoming the shortcomings of both methods; coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution; algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Supporting dynamic parallelism is important for GPU to benefit a broad range of applications. There are currently two fundamental ways for programs to exploit dynamic parallelism on GPU: a software-based approach with software-managed worklists, and a hardware-based approach through dynamic subkernel launches. Neither is satisfactory. The former is complicated to program and is often subject to some load imbalance; the latter suffers large runtime overhead. In this work, we propose free launch, a new software approach to overcoming the shortcomings of both methods. It allows programmers to use subkernel launches to express dynamic parallelism. It employs a novel compiler-based code transformation named subkernel launch removal to replace the subkernel launches with the reuse of parent threads. Coupled with an adaptive task assignment mechanism, the transformation reassigns the tasks in the subkernels to the parent threads with a good load balance. The technique requires no hardware extensions, immediately deployable on existing GPUs. It keeps the programming convenience of the subkernel launch-based approach while avoiding its large runtime overhead. Meanwhile, its superior load balancing makes it outperform manual worklist-based techniques by 3X on average. The work was published at the 48th Annual IEEE/ACM International Symposium on Microarchitecture (Micro'2015). A Graphic Processing Unit (GPU) system is typically equipped with many types of memory (e.g., global, constant, texture, shared, cache). Data placement determines what data are placed on which type of memory, essential for GPU memory performance. Prior optimizations of data placement always require a single view of a data object on memory, which limits the optimization effectiveness. In this work, we propose coherence-free multiview, an approach that allows multiple views of a single data object to co-exist on GPU memory during a GPU kernel execution. We demonstrate that under certain conditions, the multiple views can remain incoherent while facilitating enhanced data placement. We present a theorem and some compiler support to ensure the soundness of the usage of coherence-free multiview. We further develop reference-discerning data placement, a new way to enhance data placements on GPU. It enables more flexible data placements by using coherence-free multiview to leverage the slack in coherence requirement of some GPU programs. Experiments on three types of GPU systems show that, with less than 200KB space cost, the new data placement technique can provide a 1.6X average (up to 4.27X) speedup. In addition, we have examined algorithmic optimizations to data analytics problems, especially those that involve lots of distance calculations. Computing distances among data points is an essential part of many important algorithms in data analytics, graph analysis, and other domains. In each of these domains, developers have spent significant manual effort optimizing algorithms, often through novel applications of the triangle equality, in order to minimize the number of distance computations in the algorithms. In this work, we observe that many algorithms across these domains can be generalized as an instance of a generic distance-related abstraction. Based on this abstraction, we derive seven principles for correctly applying the triangular inequality to optimize distance-related algorithms. Guided by the findings, we develop Triangular OPtimizer (TOP), the first software framework that is able to automatically produce optimized algorithms that either matches or outperforms manually designed algorithms for solving distance-related problems. TOP achieves up to 237x speedups and 2.5X on average. The work has been published at the 32nd International Conference on Machine Learning (ICML'15) and the 41st International Conference on Very Large Data Bases (VLDB'15).

42 ENGINEERING↗