SEARCH · Search NASA

Results for “threads”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 559 records · Page 31

All sources NASA NTRS DOE OSTI

NASA NTRS2017

Fiber Optic Temperature Sensor Insert for High Temperature Environments

A thermal protection system (TPS) test plug has optical fibers with FBGs embedded in the optical fiber arranged in a helix, an axial fiber, and a combination of the two. Optionally, one of the optical fibers is a sapphire FBG for measurement of the highest temperatures in the TPS plug. The test plug may include an ablating surface and a non-ablating surface, with an engagement surface with threads formed, the threads having a groove for placement of the optical fiber. The test plug may also include an optical connector positioned at the non-ablating surface for protection of the optical fiber during insertion and removal.

Black, Richard James↗

NASA NTRS2018

Preload Loss in a Spacecraft Fastener via Vibration-Induced Unwinding

Sound engineering practice requires that fasteners and bolted joints maintain preload in service. NASA recently concluded a series of vibration tests of a multicomponent structure intended to simulate an upper stage section of a launch vehicle. The stacked components were joined through six circumferentially placed bolted cup-cone-style pyrotechnic joint mechanisms designed to share spacecraft structural loads and then enable separation during ascent. Over the course of the vibration test campaign, all six bolted cup-cone mechanisms experienced some degree of preload loss with two mechanisms losing half of their original bolt preload. A subsequent forensic anomaly investigation concluded that vibration-induced unwinding of the preload nut-and-bolt assemblies occurred despite the use of safety wire and high levels of thread friction. A series of experiments were done to better understand how large, heavily preloaded fasteners could unwind. Additionally, thread friction torque was measured and the fastener locking capability of safety wire was evaluated. The friction coefficient between the clamped cup-cone components was characterized and finally a highly instrumented mechanism-level vibration test was done to reproduce the unwinding phenomenon to better understand the mechanism's behavior. The conclusion drawn was that vibration and structural forces led to relative motion (sliding) of the clamped components, resulting in self-loosening and unwinding effects on the nut-and-bolt assembly. To counter this phenomenon, more effective fastener locking methodologies were recommended and a follow-on effort was initiated to quantify the relationship between preload, component motion, and resulting unwinding forces. It is hoped that elucidation of these effects can be used to design more effective fastener locking features.

fasteners↗

NASA NTRSDate not supplied

Network Jets as the Driver of Counter-streaming Flows in a Solar Filament

We investigate the driving mechanism of counter-streaming flows in a solar filament, using EUV images from SDO/AIA, line of sight magnetograms from SDO/HMI, IRIS SJ images, and H-alpha data from GONG. We find that: (i) persistent counter-streaming flows along adjacent threads of a small (100” long) solar filament is present; (ii) both ends of the solar filament are rooted at the edges of magnetic network flux lanes; (iii) recurrent small-scale jets (also known as network jets) occur at both ends of the filament; (iv) some of the network jets occur at the sites of flux cancelation between the majority-polarity flux and merging minority-polarity flux patches; (v) these multiple network jets clearly drive the counter-streaming flows along the adjacent threads of the solar filament for ~2 hours with an average speed of 70 km/s; (vi) some the network jets show base brightenings, analogous to the base brightenings of coronal jets; and (vii) the filament appears wider (4”) in EUV images than in H-alpha images (2.5”), consistent with previous studies. Thus, our observations show that counter-streaming flows in the filament are driven by network jets and possibly these driving network jet eruptions are triggered by flux cancelation.

Navdeep K Panesar↗

NASA NTRS2020

Fitting Leak Test Report

Many Human Landing System flight elements are anticipated to implement mechanically connected joints in cryogenic fluid lines to simplify system assembly. These joints will need to survive launch vibration, while cold, and remain as leak‐free as possible to minimize commodity loss. Threaded fluid fittings should be qualified for use in their expected environments to reduce risk and ensure mission success. A new ground‐based test apparatus was developed and validated to obtain quantifiable low leak rate test data for a small component, such as a pressurized threaded fluid fitting, while in the temperature range of liquid hydrogen. A cryocooler is used to attain the cold test temperature and helium leakage from a pressurized fitting mounted within a vacuum test chamber is measured using a mass spectrometer leak detector. Two different sizes of Swagelok VCR fittings with three different types of seal rings were selected as the test articles for the initial proof of concept testing. Each fitting configuration was subjected to two consecutive cryogenic thermal cycles and cold leak measurement tests, followed by exposure to a high vibration test profile at ambient temperature on a shaker table, and then two additional cold leak measurement tests. Very low leak rates, below the acceptable leak rate threshold, were measured at the pressures tested. Several enhancements to the test hardware are discussed that would facilitate a comprehensive fitting qualification test campaign by enabling a higher test throughput rate and ensuring a repeatable test profile.

Cryogenic Fluid Management↗

DOE OSTI2018

Dynamic wavefront creation for processing units using a hybrid compactor

A method, a non-transitory computer readable medium, and a processor for repacking dynamic wavefronts during program code execution on a processing unit, each dynamic wavefront including multiple threads are presented. If a branch instruction is detected, a determination is made whether all wavefronts following a same control path in the program code have reached a compaction point, which is the branch instruction. If no branch instruction is detected in executing the program code, a determination is made whether all wavefronts following the same control path have reached a reconvergence point, which is a beginning of a program code segment to be executed by both a taken branch and a not taken branch from a previous branch instruction. The dynamic wavefronts are repacked with all threads that follow the same control path, if all wavefronts following the same control path have reached the branch instruction or the reconvergence point.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2018

Graphics processing unit management system for computed tomography

A method and apparatus for managing operation of graphics processing units in a computer system. A processing thread in the computer system controls processing of a set of sinogram data by a graphics processing unit to form a set of graphics data. An output thread in the computer system controls writing of the set of graphics data to a storage system. The graphics processing unit is available to perform processing of another set of sonogram data while the set of graphics data is written to the storage system such that the increased availability of a plurality of graphics processing units is present.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2017

Parallel Asynchronous Distributed-Memory Maximal Independent Set Algorithm with Work Ordering

The maximal independent set (MIS) graph problem arises in many applications such as computer vision, information theory, molecular biology, and process scheduling. The growing scale of graph data suggests the use of distributed memory hardware as a cost-effective approach to providing necessary compute and memory resources. Existing distributed memory parallel MIS algorithms rely on synchronous communication and use techniques such as subgraph computations. In this paper, we present an asynchronous distributed-memory parallel graph algorithm that relies on a virtual directed acyclic graph (DAG) that is created during the algorithm execution. We introduce two additional algorithms that save computations by ordering generated work. The first algorithm applies ordering globally to reduce computations, and the second algorithm applies ordering locally at the level of threads to minimize the synchronization overhead. We use two different implementations of Luby’s algorithm variants as baseline to compare the performance of the presented algorithms: (1) vertex-centric Luby A and Luby B implementations, and (2) the CombBLAS linear-algebra Luby A implementation. Results show that proposed algorithms outperform both implementations of Luby algorithms, especially in distributed execution. Furthermore, we show that for low-diameter graphs the algorithm that applies global ordering scales better than other algorithms and for high diameter graphs the original asynchronous algorithm and thread-level ordering algorithm show better performance.

maximal independent set (MIS), distributed memory ↗

DOE OSTI2019

Concurrent Conditions Access across Validity Intervals in CMSSW

The CMS software system, known as CMSSW, has a generalized conditions, calibration, and geometry data products system called the EventSetup. The EventSetup caches results of reading or calculating data products based on the 'interval of validity', IOV, which is based on the time period for which that data product is appropriate. With the original single threaded CMSSW framework, updating only on an IOV boundary meant we only required memory for a single data product of a given type at any time during the program execution. In 2016 CMS transitioned to using a multithreaded framework as a way to save on memory during processing. This was accomplished by amortizing the memory cost of EventSetup data products across multiple concurrent events. To initially accomplish that goal required synchronizing event processing across IOV boundaries, thereby decreasing the scalability of the system. In this presentation we will explain how we used 'limited concurrent task queues' to allow co ncurrent IOVs while still being able to limit the memory utilized. In addition, we will present performance measurements for both threading scalability of event throughtput and memory utilization.

Dagenhart, W.David↗

DOE OSTI2018

Implementing Concurrent Non-Event Transitionsin CMS

Available on CMS information serverCMS CR -2018/277The Compact Muon Solenoid ExperimentMailing address: CMS CERN, CH-1211 GENEVA 23, SwitzerlandConference Report15 October 2018 (v2, 21 November 2018)Implementing Concurrent Non-Event Transitionsin CMSChristopher Jones for the CMS CollaborationAbstractSince the beginning of the LHC Run 2 in 2016 the CMS data processing framework, CMSSW, hasbeen running with multiple threads during production of data and simulation via the use of IntelsThread Building Blocks (TBB) library. The TBB library utilizes tasks as concurrent units of work.CMS used these tasks to allow both concurrent processing of events as well as concurrent running ofmodules processing the same event. This design has served CMS well and has allowed jobs to utilizeless memory per core as well as reduce the number of jobs that must be tracked by CMSs worflowmanagement system. As CMS has begun to utilize greater number of threads in a job, the effect ofserialization points in the framework has decreased jobs CPU efficiency. One major serialization pointoccurs when the framework processes a non-Event transition. These transitions occur when a new Runor LuminosityBlock is to be processed. In this talk we will discuss how the different transitions definethe processing model for CMSSW and how we were able to successfully allow concurrent process-ing of those transitions using TBB via task queues. We will also show CPU efficiency comparisonsbetween the same work being done with and without the additional concurrency.

Jones, Christopher↗

DOE OSTI2020

Concurrent conditions access across validity intervals in CMSSW

The CMS software system, known as CMSSW, has a generalized conditions, calibration, and geometry data products system called the EventSetup. The EventSetup caches results of reading or calculating data products based on the 'interval of validity', IOV, which is based on the time period for which that data product is appropriate. With the original single threaded CMSSW framework, updating only on an IOV boundary meant we only required memory for a single data product of a given type at any time during the program execution. In 2016 CMS transitioned to using a multi-threaded framework as away to save on memory during processing. This was accomplished by amortizing the memory cost of EventSetup data products across multiple concurrent events. To initially accomplish that goal required synchronizing event processing across IOV boundaries, thereby decreasing the scalability of the system. In this presentation we will explain how we used 'limited concurrent task queues' to allow concurrent IOVs while still being able to limit the memory utilized.

Dagenhart, David↗

DOE OSTI2020

Tracking transactions using extended memory features

An approach is disclosed that tracks memory transactions by a node. The approach establishes a transaction processing state corresponding to common virtual addresses accessed by a processing threads. Transactions are executed by the threads. A selected transaction is allowed to complete. In response to detecting a conflict in the transaction processing state, completion of a non-selected transaction is inhibited.

Kahle, James Allan↗

DOE OSTI2021

Tamper-resistant fastener

A tamper-resistant threaded fastener including a circular head having a slot formed in the head transverse to the longitudinal axis, the slot having an enlarged region intermediate an apex and a base of the slot. A cap member includes a head having a drive feature formed therein, the head extending to a first shank portion, extending to an enlarged second shank portion, extending to a foot. The cap member is insertable in the slot only from a direction transverse to the longitudinal axis. During rotational installation of the fastener and cap member in a threaded counterbored opening for securing a barrier for protecting an asset, the foot shears inside the slot at a predetermined rotational drive force, the cap member being rotatable in the opening and protectively covering the fastener head.

Neidigk, Stephen↗

DOE OSTI2021

Dynamic voltage and frequency scaling based on memory channel slack

A processing system scales power to memory and memory channels based on identifying causes of stalls of threads of a wavefront. If the cause is other than an outstanding memory request, the processing system throttles power to the memory to save power. If the stall is due to memory stalls for a subset of the memory channels servicing memory access requests for threads of a wavefront, the processing system adjusts power of the memory channels servicing memory access request for the wavefront based on the subset. By boosting power to the subset of channels, the processing system enables the wavefront to complete processing more quickly, resulting in increased processing speed. Conversely, by throttling power to the remainder of channels, the processing system saves power without affecting processing speed.

Das, Shomit N.↗

DOE OSTI2022

Coalescence of GaP on V-Groove Si

With an increase of control over crystalline defects, metallorganic vapor phase epitaxy (MOVPE)-grown III-V-on-Si multijunction solar cells have seen rapid increases in efficiency in recent years, pointing to a promising path to lower cost III-V solar cells. However, the cost of chemo-mechanical polishing the Si wafers to prepare them for epitaxy is high. The use of V-groove nanopatterns enables similar defect reduction to that achieved on planar wafers, but the nanopatterns can be fabricated with a low-cost process. While V-grooves offer advantages over planar Si, they add complexity to the growth process. In particular, coalescence can cause the formation of threading dislocations, and the highly-directional growth conditions required for coalescence are unusual for MOVPE. We have studied the coalescence of GaP films nucleated directly on V-groove Si by MOVPE. We observed that for optimized growth conditions (V/III=5,000 and T=800 C) two growth modes were possible, and the resulting morphology depended on the exact geometry of the SiNx cap used to cover the (0 0 1)-oriented Si at the tops of the grooves. For caps with a width >100 nm, noncoalescing, nano ridge-like growth terminating in f1 1 1g facets was observed. For narrower caps, coalescence with an RMS roughness of 0.2 nm as measured by atomic force microscopy was observed. We will discuss mechanisms responsible for this phenomenon, including the role of Si from the substrate surface. The dislocation dynamics of this system were studied with electron channeling contrast imaging (ECCI) and transmission electron microscopy (TEM). We find that V-grooves do not block dislocation glide; ECCI measurements show misfit dislocations greater than 10 micrometers long observed to continue perpendicularly across neighboring V-grooves. In addition, all threading dislocations appear to lie on f1 1 1g planes, consistent with the GaP relaxing via glided-in glissile dislocations. The dislocation dynamics and morphological evolution of the coalescence of GaP on Si, possible mechanisms behind the observed phenomenons, and further dislocation mitigation strategies for these materials will be presented.

dislocation dynamics↗

DOE OSTI2023

Tooling assembly and method for explosively forming features in a thin-walled cylinder

The present invention provides a method of explosively forming a helical tube from at least one thin-walled cylinder using a tooling assembly. The method includes inserting the at least one thin-walled cylinder into a die of the tooling assembly. The die surrounds the at least one thin-walled cylinder and includes an interior surface that defines a helical thread pattern. The method further includes surrounding the at least one thin-walled cylinder and the die with a casing of the tooling assembly. A cavity is defined by the casing and the thin-walled cylinder. The method further includes positioning an explosive charge within the cavity. The method additionally includes at least partially submerging the tooling assembly. The method further includes detonating the explosive charge. As a result, the at least one thin-walled cylinder is formed into a helical tube that corresponds with helical thread pattern of the interior surface of the die.

Eberl, Kurt R.↗

DOE OSTI2017

Preparing NERSC users for Cori, a Cray XC40 system with Intel many integrated cores

The newest NERSC supercomputer Cori is a Cray XC40 system consisting of 2,388 Intel Xeon Haswell nodes and 9,688 Intel Xeon-Phi “Knights Landing” (KNL) nodes. Compared to the Xeon-based clusters NERSC users are familiar with, optimal performance on Cori requires consideration of KNL mode settings; process, thread, and memory affinity; fine-grain parallelization; vectorization; and use of the high-bandwidth MCDRAM memory. This paper describes our efforts preparing NERSC users for KNL through the NERSC Exascale Science Application Program, Web documentation, and user training. We discuss how we configured the Cori system for usability and productivity, addressing programming concerns, batch system configurations, and default KNL cluster and memory modes. Here, system usage data, job completion analysis, programming and running jobs issues, and a few successful user stories on KNL are presented.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2023

Exploring temporal community evolution: algorithmic approaches and parallel optimization for dynamic community detection

Abstract Dynamic (temporal) graphs are a convenient mathematical abstraction for many practical complex systems including social contacts, business transactions, and computer communications. Community discovery is an extensively used graph analysis kernel with rich literature for static graphs. However, community discovery in a dynamic setting is challenging for two specific reasons. Firstly, the notion of temporal community lacks a widely accepted formalization, and only limited work exists on understanding how communities emerge over time. Secondly, the added temporal dimension along with the sheer size of modern graph data necessitates new scalable algorithms. In this paper, we investigate how communities evolve over time based on several graph metrics under a temporal formalization. We compare six different algorithmic approaches for dynamic community detection for their quality and runtime. We identify that a vertex-centric (local) optimization method works as efficiently as the classical modularity-based methods. To its advantage, such local computation allows for the efficient design of parallel algorithms without incurring a significant parallel overhead. Based on this insight, we design a shared-memory parallel algorithm DyComPar , which demonstrates between 4 and 18 fold speed-up on a multi-core machine with 20 threads, for several real-world and synthetic graphs from different domains.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2025

Developing a digital twin framework for remotely monitoring nuclear reactor facilities

A digital twin must seek to represent all applicable functional components of the system of interest. Different expertise is required for understanding the physical system being modeled than the skills needed for transforming those models into a functional digital twin through physics modeling, machine learning analysis, and visualization. The diversity of knowledge requires a multi-disciplinary team to ensure all system details are captured. Team members also need a method to verify that the data they generate within their domain can be effectively communicated to professionals in other fields. To address this challenge, this work provides an approach for developing a digital twin framework to remotely monitoring nuclear facilities. Through this, general knowledge of the framework is presented along with two examples to solidify the process. The AGN-201 digital twin and microreactor digital twins provide varying levels of complexity in a potential nuclear facility, where common threads are identified and lessons learned are provided. The goal of this research is to aid future researchers by providing a formula for a successful digital twin and in turn reducing the development time of nuclear system digital twins, specifically for remote monitoring.

22 - GENERAL STUDIES OF NUCLEAR REACTORS↗