Search NASA⌕ Search

SEARCH · Search NASA

Results for “Threading”

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 505 records · Page 28

Spline screw multiple rotations mechanism

A system for coupling two bodies together and for transmitting torque from one body to another with mechanical timing and sequencing is reported. The mechanical timing and sequencing is handled so that the following criteria are met: (1) the bodies are handled in a safe manner and nothing floats loose in space, (2) electrical connectors are engaged as long as possible so that the internal processes can be monitored throughout by sensors, and (3) electrical and mechanical power and signals are coupled. The first body has a splined driver for providing the input torque. The second body has a threaded drive member capable of rotation and limited translation. The embedded drive member will mate with and fasten to the splined driver. The second body has an embedded bevel gear member capable of rotation and limited translation. This bevel gear member is coaxial with the threaded drive member. A compression spring provides a preload on the rotating threaded member, and a thrust bearing is used for limiting the translation of the bevel gear member so that when the bevel gear member reaches the upward limit of its translation the two bodies are fully coupled and the bevel gear member then rotates due to the input torque transmitted from the splined driver through the threaded drive member to the bevel gear member. An output bevel gear with an attached output drive shaft is embedded in the second body and meshes with the threaded rotating bevel gear member to transmit the input torque to the output drive shaft.

Vranish, John M.↗

Manual adjustable probe tool for friction stir welding

A friction stir welding tool is provided generally comprising three parts: a rotatable welding tool body (22) that has an outer threaded surface (32) and a probe (24) extending from a distal end of the body, a shoulder (26), which has a threaded inner surface (40) and a bore (36) at a distal end of the shoulder, and a jam nut (28), which has a threaded inner surface (42). The shoulder is threaded onto the tool body such that the probe extends from the shoulder through the bore by a preferred length. The jam nut is then threaded onto the tool body to secure the shoulder. The tool is operatively connected to a drive motor for rotating the tool body. The shoulder may include a knife edge projecting from the distal end (38) thereof adjacent the bore. The knife edge inhibits the weld material from migrating along the probe to intrude inside the shoulder, where it may prevent separation of the tool body and the shoulder when readjustment of the tool is necessary.

Oelgoetz, Peter A.↗

Software Defined Radio with Parallelized Software Architecture

This software implements software-defined radio procession over multicore, multi-CPU systems in a way that maximizes the use of CPU resources in the system. The software treats each processing step in either a communications or navigation modulator or demodulator system as an independent, threaded block. Each threaded block is defined with a programmable number of input or output buffers; these buffers are implemented using POSIX pipes. In addition, each threaded block is assigned a unique thread upon block installation. A modulator or demodulator system is built by assembly of the threaded blocks into a flow graph, which assembles the processing blocks to accomplish the desired signal processing. This software architecture allows the software to scale effortlessly between single CPU/single-core computers or multi-CPU/multi-core computers without recompilation. NASA spaceflight and ground communications systems currently rely exclusively on ASICs or FPGAs. This software allows low- and medium-bandwidth (100 bps to approx.50 Mbps) software defined radios to be designed and implemented solely in C/C++ software, while lowering development costs and facilitating reuse and extensibility.

Heckler, Greg↗

Software Defined Radio with Parallelized Software Architecture

This software implements software-defined radio procession over multi-core, multi-CPU systems in a way that maximizes the use of CPU resources in the system. The software treats each processing step in either a communications or navigation modulator or demodulator system as an independent, threaded block. Each threaded block is defined with a programmable number of input or output buffers; these buffers are implemented using POSIX pipes. In addition, each threaded block is assigned a unique thread upon block installation. A modulator or demodulator system is built by assembly of the threaded blocks into a flow graph, which assembles the processing blocks to accomplish the desired signal processing. This software architecture allows the software to scale effortlessly between single CPU/single-core computers or multi-CPU/multi-core computers without recompilation. NASA spaceflight and ground communications systems currently rely exclusively on ASICs or FPGAs. This software allows low- and medium-bandwidth (100 bps to .50 Mbps) software defined radios to be designed and implemented solely in C/C++ software, while lowering development costs and facilitating reuse and extensibility.

Heckler, Greg↗

Large-Amplitude Longitudinal Oscillations in a Solar Filament

We have developed the first self-consistent model for the observed large-amplitude oscillations along filament axes that explains the restoring force and damping mechanism. We have investigated the oscillations of multiple threads formed in long, dipped flux tubes through the thermal nonequilibrium process, and found that the oscillation properties predicted by our simulations agree with the observed behavior. We then constructed a model for the large-amplitude longitudinal oscillations that demonstrates that the restoring force is the projected gravity in the tube where the threads oscillate. Although the period is independent of the tube length and the constantly growing mass, the motions are strongly damped by the steady accretion of mass onto the threads by thermal nonequilibrium. The observations and our model suggest that a nearby impulsive event drives the existing prominence threads along their supporting tubes, away from the heating deposition site, without destroying them. The subsequent oscillations occur because the displaced threads reside in magnetic concavities with large radii of curvature. Our model yields a powerful seismological method for constraining the coronal magnetic field and radius of curvature of dips. Furthermore, these results indicate that the magnetic structure is most consistent with the sheared-arcade model for filament channels.

lament axes↗

iHarmonizer: improving the disk efficiency of I/O-intensive multithreaded codes

Challenged by serious power and thermal constraints, and limited by available instruction-level parallelism, processor designs have evolved to multi-core architectures. These architectures, many augmented with native simultaneous multithreading, are driving software developers to use multithreaded programs to exploit thread-level parallelism. While multithreading is well-known to introduce concerns of data dependency and CPU load balance, less known is that the uncertainty of relative progress of thread execution can cause patterns of I/O requests, issued by different threads, to be effectively random and so significantly degrade hard-disk efficiency. This effect can severely offset the performance gains from parallel execution, especially for I/O-intensive programs. Retaining the benefits of multithreading while not reducing I/O efficiency is an urgent and challenging problem. We propose a user-level scheme, iHarmonizer, to streamline the servicing of I/O requests from multiple threads in OpenMP programs. Specifically, we use the compiler to insert code into OpenMP programs so that data usage can be transmitted at run time to a supporting run-time library; this library in turn prefetches data in a disk-friendly way and coordinates threads execution according to the availability of their requested data. Transparently to the programmer, iHarmonizer makes a multithreaded program I/O efficient while maintaining the benefits of parallelism. Our experiments show that iHarmonizer can significantly speed up the execution of a representative set of I/O-intensive scientific benchmarks.

97 MATHEMATICS AND COMPUTING↗

Implementing a Gaussian Process Learning Algorithm in Mixed Parallel Environment

In this paper, we present a scalability analysis of a parallel Gaussian process training algorithm to simultaneously analyze a massive number of time series. We study three different parallel implementations: using threads, MPI, and a hybrid implementation using threads and MPI. We compare the scalability for the multi-threaded implementation on three different hardware platforms: a Mac desktop with two quad-core Intel Xeon processors (16 virtual cores), a Linux cluster node with four quad-core 2.3 GHz AMD Opteron processors, and SGI Altix ICE 8200 cluster node with two quad-core Intel Xeon processors (16 virtual cores). We also study the scalability of the MPI based and the hybrid MPI and thread based implementations on the SGI cluster with 128 nodes (2048 cores). Experimental results show that the hybrid implementation scales better than the multi-threaded and MPI based implementations. The hybrid implementation, using 1536 cores, can analyze a remote sensing data set with over 4 million time series in nearly 5 seconds while the serial algorithm takes nearly 12 hours to process the same data set.

99 GENERAL AND MISCELLANEOUS↗

Message passing with queues and channels

In an embodiment, a send thread receives an identifier that identifies a destination node and a pointer to data. The send thread creates a first send request in response to the receipt of the identifier and the data pointer. The send thread selects a selected channel from among a plurality of channels. The selected channel comprises a selected hand-off queue and an identification of a selected message unit. Each of the channels identifies a different message unit. The selected hand-off queue is randomly accessible. If the selected hand-off queue contains an available entry, the send thread adds the first send request to the selected hand-off queue. If the selected hand-off queue does not contain an available entry, the send thread removes a second send request from the selected hand-off queue and sends the second send request to the selected message unit.

97 MATHEMATICS AND COMPUTING↗

Processor power monitoring and control with dynamic load balancing

Apparatus and methods may provide for subscribing a thread to a resource monitor through a machine specific register and subscribing the thread to a class of service through the machine specific register. The resource monitor or the class of service for the thread may be changed without interrupting the thread. The power allocated to the processor core may be changed based on the selected class of service for the thread.

97 MATHEMATICS AND COMPUTING↗

Cache utilization and eviction based on allocated priority tokens

A system, method, and computer program product are provided for providing prioritized access for multithreaded processing. The method includes the steps of allocating threads to process a workload and assigning a set of priority tokens to at least a portion of the threads. Access to a resource, by each one of the threads, is based on the priority token assigned to the thread and the threads are executed by a multithreaded processor to process the workload.

Johnson, Daniel Robert↗

Data Parallel Bin-Based Indexing for Answering Queries on Multi-Core Architectures

The multi-core trend in CPUs and general purpose graphics processing units (GPUs) offers new opportunities for the database community. The increase of cores at exponential rates is likely to affect virtually every server and client in the coming decade, and presents database management systems with a huge, compelling disruption that will radically change how processing is done. This paper presents a new parallel indexing data structure for answering queries that takes full advantage of the increasing thread-level parallelism emerging in multi-core architectures. In our approach, our Data Parallel Bin-based Index Strategy (DP-BIS) first bins the base data, and then partitions and stores the values in each bin as a separate, bin-based data cluster. In answering a query, the procedures for examining the bin numbers and the bin-based data clusters offer the maximum possible level of concurrency; each record is evaluated by a single thread and all threads are processed simultaneously in parallel. We implement and demonstrate the effectiveness of DP-BIS on two multi-core architectures: a multi-core CPU and a GPU. The concurrency afforded by DP-BIS allows us to fully utilize the thread-level parallelism provided by each architecture--for example, our GPU-based DP-BIS implementation simultaneously evaluates over 12,000 records with an equivalent number of concurrently executing threads. In comparing DP-BIS's performance across these architectures, we show that the GPU-based DP-BIS implementation requires significantly less computation time to answer a query than the CPU-based implementation. We also demonstrate in our analysis that DP-BIS provides better overall performance than the commonly utilized CPU and GPU-based projection index. Finally, due to data encoding, we show that DP-BIS accesses significantly smaller amounts of data than index strategies that operate solely on a column's base data; this smaller data footprint is critical for parallel processors that possess limited memory resources (e.g., GPUs).

97 MATHEMATICS AND COMPUTING↗

Implementing and Evaluating Multithreaded Triad Census Algorithms on the Cray XMT

Commonly represented as directed graphs, social networks depict relationships and behaviors among social entities such as people, groups, and organizations. Social network analysis denotes a class of mathematical and statistical methods designed to study and measure social networks. Beyond sociolo-gy, social network analysis methods are being applied to other types of data in other domains such as bioinformatics, computer networks, national security, and economics. For particular problems, the size of a social network can grow to millions of nodes and tens of millions of edges or more. In such cases, researchers could benefit from the application of social network analysis algorithms on high-performance architectures and systems. The Cray XMT is a third generation multithreaded system based on the Cray XT-3/4 platform. Like most other multithreaded architectures, the Cray XMT is designed to tolerate memory access latencies by switching context between threads. The processors maintain multiple threads of execution and util-ize hardware-based context switching to overlap the memory latency incurred by any thread with the computations from other threads. Due to its memory latency tolerance, the Cray XMT has the poten-tial of significantly improving the execution speed of irregular data-intensive applications such as those found in social network analysis. In this paper, we describe our experiences in developing and optimizing three implementations of a social network analysis method known as triadic analysis to execute on the Cray XMT. The three im-plementations possess different execution complexities, qualities, and characteristics. We evaluate how the various attributes of the codes affect their performance on the Cray XMT. We also explore the effects of different compiler options and execution strategies on the different triadic analysis im-plementations and identify general XMT programming issues and lessons learned.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗

Power/Performance Trade-offs of Small Batched LU Based Solvers on GPUs

In this paper we propose and analyze a set of batched linear solvers for small matrices on Graphic Processing Units (GPUs), evaluating the various alternatives depending on the size of the systems to solve. We discuss three different solutions that operate with different level of parallelization and GPU features. The first, exploiting the CUBLAS library, manages matrices of size up to 32x32 and employs Warp level (one matrix, one Warp) parallelism and shared memory. The second works at Thread-block level parallelism (one matrix, one Thread-block), still exploiting shared memory but managing matrices up to 76x76. The third is Thread level parallel (one matrix, one thread) and can reach sizes up to 128x128, but it does not exploit shared memory and only relies on the high memory bandwidth of the GPU. The first and second solution only support partial pivoting, the third one easily supports partial and full pivoting, making it attractive to problems that require greater numerical stability. We analyze the trade-offs in terms of performance and power consumption as function of the size of the linear systems that are simultaneously solved. We execute the three implementations on a Tesla M2090 (Fermi) and on a Tesla K20 (Kepler).

GPGPU↗

Joining AA7099 to Ni-Cr-Mo Steel Using Single Pass Friction Stir Dovetailing and AA6061 Butter Layer

A novel single pass friction stir dovetailing (FSD) was developed to join thick plate AA7099 to Ni-Cr-Mo steel in a lap configuration through the use of an AA6061 butter layer. The butter layer approach can be shown to significantly reduce interfacial failures by inhibiting the formation of brittle Fe–Al intermetallic compounds (IMCs) which are typically formed during conventional friction stir welding (FSW) of AA7099 directly to steel. This study evaluates the strength and microstructural evolution of the aluminum/steel joint interface between single pass FSD of AA7099/AA6061(butter)/steel fabricated using three different FSD tool configurations. The butter layer was achieved by placement of a free-floating strip of AA6061 within the dovetail groove that was pre-machined in the steel substrate. Friction stir welding was then used to simultaneously join the thick plate AA7099, the AA6061 strip and the AA7099 in a single weld pass. To optimize the joining process, three different pin geometries (full thread, half smooth/half thread, no thread) were evaluated; it was demonstrated that the half smooth/half thread tool produced the strongest weld joint due to the absence of a Zn rich layer at the Al/steel interface. The efficacy of this unique processing technique was tested using lap shear tensile testing as well as high resolution transmission electron microscopy (TEM). A discussion of the new FSD technique, joint configurations, and process parameters are provided along with joint microstructural analyses and mechanical performance.

Olszta, Matthew J.↗

X-ray topography characterization of gallium nitride substrates for power device development

Gallium nitride substrates grown by the hydride vapor phase epitaxy (HVPE) method using a patterned growth process have been characterized by synchrotron monochromatic beam X-ray topography in the grazing incidence geometry. Images reveal a starkly heterogeneous distribution of dislocations with areas as large as 0 3 mm 2 containing threading dislocation densities below 10 3 cm -2 in between a grid of strain centers with higher threading dislocation densities (> 10 4 cm -2 ). Basal plane dislocation densities in these areas are as low as 104 cm -2 . By comparing the recorded images of dislocations with ray tracing simulations of expected dislocations in GaN, the Burgers vectors of the dislocations have been determined. The distribution of threading screw/mixed dislocations (TSDs/TMDs), threading edge dislocations (TEDs) and basal plane dislocations (BPDs) is discussed with implications for fabrication of power devices.

36 MATERIALS SCIENCE↗

Cataloging the visible universe through Bayesian inference in Julia at petascale

A key task in astronomy is to locate astronomical objects in images and to characterize them according to physical parameters such as brightness, color, and morphology. This task, known as cataloging, is challenging for several reasons: many astronomical objects are much dimmer than the sky background, labeled data is generally unavailable, overlapping astronomical objects must be resolved collectively, and the datasets are enormous – terabytes now, petabytes soon. In this work, we infer an astronomical catalog from 55 TB of imaging data using Celeste, a Bayesian variational inference code written entirely in the high-productivity programming language Julia. Using over 1.3 million threads on 650,000 Intel Xeon Phi cores of the Cori Phase II supercomputer, Celeste achieves a peak rate of 1.54 DP PFLOP/s. Celeste is able to jointly optimize parameters for 188 M stars and galaxies, loading and processing 178 TB across 8192 nodes in 14.6 min. To achieve this, Celeste exploits parallelism at multiple levels (cluster, node, and thread) and accelerates I/O through Cori’s burst buffer. Julia’s native performance enables Celeste to employ high-level constructs without resorting to hand-written or generated low-level code (C/C++/Fortran) while still achieving petascale performance.

Regier, Jeffrey↗

OBSERVATIONS AND MAGNETIC FIELD MODELING OF A SOLAR POLAR CROWN PROMINENCE

We present observations and magnetic field modeling of the large polar crown prominence that erupted on 2010 December 6. Combination of Solar Dynamics Observatory (SDO)/Atmospheric Imaging Assembly (AIA) and STEREO{sub B}ehind/EUVI allows us to see the fine structures of this prominence both at the limb and on the disk. We focus on the structures and dynamics of this prominence before the eruption. This prominence contains two parts: an active region part containing mainly horizontal threads and a quiet-Sun part containing mainly vertical threads. On the northern side of the prominence channel, both AIA and EUVI observe bright features which appear to be the lower legs of loops that go above then join in the filament. Filament materials are observed to frequently eject horizontally from the active region part to the quiet-Sun part. This ejection results in the formation of a dense-column structure (concentration of dark vertical threads) near the border between the active region and the quiet Sun. Using the flux rope insertion method, we create nonlinear force-free field models based on SDO/Helioseismic and Magnetic Imager line-of-sight magnetograms. A key feature of these models is that the flux rope has connections with the surroundings photosphere, so its axial flux varies along the filament path. The height and location of the dips of field lines in our models roughly replicate those of the observed prominence. Comparison between model and observations suggests that the bright features on the northern side of the channel are the lower legs of the field lines that turn into the flux rope. We suggest that plasma may be injected into the prominence along these field lines. Although the models fit the observations quiet well, there are also some interesting differences. For example, the models do not reproduce the observed vertical threads and cannot explain the formation of the dense-column structure.

79 ASTRONOMY AND ASTROPHYSICS↗

Structure and energetics of the elbows in the Au(111) herringbone reconstruction

We study the structure of the threading edge dislocations, or “elbows,” which are an essential component of the well-known herringbone reconstruction of the (111) surface of Au. Previous work had shown that these dislocations can be stabilized by long-range elastic relaxations into the bulk. However, the validity of the harmonic spring model that had been used to estimate the energies of the dislocations is uncertain. To enable a more refined model of the dislocation energetics, we have imaged the atomic structure of these dislocations using scanning tunneling microscopy. We find that the harmonic spring model does not adequately reproduce the observed structure. We are able to reproduce the structure, however, with a two-dimensional Frenkel-Kontorova (FK) model that uses a pairwise Morse potential to describe the interactions between the top layer Au atoms on a rigid substrate. The parameters of the potential were obtained by fitting the energy of uniaxially compressed phases, or “stripes”, computed with density functional theory, as a function of surface Au density. Within this model, the formation of the threading dislocations remains unfavorable. However, the large forces on the substrate atoms near the threading-dislocation cores, render the assumption of a completely rigid substrate questionable. Indeed, if the FK parameters are modified to account for the relaxation of just one more atomic layer, threading dislocations can, in principle, become favorable, even without bulk elastic relaxations. Additional evidence for a small elbow energy is that our computed change in the Au(111) surface stress tensor caused by the (√ 3 × 22) reconstruction is considerably smaller than previous estimates.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗