A Classification of Scientific Visualization Algorithms for Massive Threading (slides).
Abstract not provided.
SEARCH · Search NASA
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.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
Abstract not provided.
In 2006, NVIDIA Corporation introduced the Computer Unified Device Architecture (CUDA) for C, C++, and Fortran programming languages. The CUDA parallel computing platform uses the Graphics Processing Unit (GPU) of NVIDIA graphics card, and it is designed for parallel computations. In these computations, the same algorithms are executed on the data in parallel. The GPU contains many Streaming Multiprocessors (SM) that can independently execute blocks of threads. A thread is a sequence of serial programmed instructions. The SM executes threads in groups of 32 and a group of 32 threads is called warp. The threads within a block can be synchronized and have access to a shared memory that is visible only to them. Conversely, blocks of threads cannot be synchronized and have access only to the global memory of the graphics card. This memory is called device memory and is independent of the host memory controlled by the Central Processing Unit (CPU). A single thread has access to a local memory (register) that is not visible to any other thread. The part of the program that is executed on the graphics card is called kernel. Each thread of the kernel has a unique identification index that is accessible by the in-built variable threadIdx; the latter is a 3-component vector. A threads block can contain up to 1024 threads. Blocks of threads have a unique identification index that is accessible by the in-built variable blockIdx; the latter is a 3-component vector. The in-built variable blockDim contains the number of threads per block; this variable is a 3-component vector. Threads and blocks represent different levels of parallelism; a kernel is executed as a grid of blocks of threads. Figure 1 illustrates a grid of thread blocks for a GPU with 2 SM. A SM can execute multiple blocks of threads in parallel; a block of threads is executed on a single SM. A GPU can execute multiple kernels concurrently. This work has used the Quadro M5000 graphics card with the following technical specifications: - 2048 cores with 861 MHz frequency, - 16 streaming multiprocessors, - 5.2 trillion transistors, - 8.2 Gb device memory, - 64 kb register memory (per thread), - 48 kb shared memory (per block) - 211.6 GB/s memory bandwidth, and - 3.5 GFLOPS floating point performance.
A method and a system are provided for hardware scheduling of indexed barrier instructions. Execution of a plurality of threads to process instructions of a program that includes a barrier instruction is initiated and when each thread reaches the barrier instruction, the thread pauses execution of the instructions. A first sub-group of threads in the plurality of threads is associated with a first sub-barrier index and a second sub-group of threads in the plurality of threads is associated with a second sub-barrier index. When the barrier instruction can be scheduled for execution, threads in the first sub-group are executed serially and threads in the second sub-group are executed serially and at least one thread in the first sub-group is executed in parallel with at least one thread in the second sub-group.
This report presents four concepts for packaging of radioactive waste for disposal in deep boreholes. Two of these are reference-size packages (11 inch outer diameter) and two are smaller (5 inch) for disposal of Cs/Sr capsules. All four have an assumed length of approximately 18.5 feet, which allows the internal length of the waste volume to be 16.4 feet. However, package length and volume can be scaled by changing the length of the middle, tubular section. The materials proposed for use are low-alloy steels, commonly used in the oil-and-gas industry. Threaded connections between packages, and internal threads used to seal the waste cavity, are common oilfield types. Two types of fill ports are proposed: flask-type and internal-flush. All four package design concepts would withstand hydrostatic pressure of 9,600 psi, with factor safety 2.0. The combined loading condition includes axial tension and compression from the weight of a string or stack of packages in the disposal borehole, either during lower and emplacement of a string, or after stacking of multiple packages emplaced singly. Combined loading also includes bending that may occur during emplacement, particularly for a string of packages threaded together. Flask-type packages would be fabricated and heat-treated, if necessary, before loading waste. The fill port would be narrower than the waste cavity inner diameter, so the flask type is suitable for directly loading bulk granular waste, or loading slim waste canisters (e.g., containing Cs/Sr capsules) that fit through the port. The fill port would be sealed with a tapered, threaded plug, with a welded cover plate (welded after loading). Threaded connections between packages and between packages and a drill string, would be standard drill pipe threads. The internal flush packaging concepts would use semi-flush oilfield tubing, which is internally flush but has a slight external upset at the joints. This type of tubing can be obtained with premium, low-profile threaded connections at each end. The internal-flush design would be suitable for loading waste that arrives from the originating site in weld-sealed, cylindrical canisters. Internal, tapered plugs with sealing filet welds would seal the tubing at each end. The taper would be precisely machined onto both the tubing and the plug, producing a metal-metal sealing surface that is compressed as the package is subjected to hydrostatic pressure. The lower plug would be welded in place before loading, while the upper plug would be placed and welded after loading. Conceptual Waste Packaging Options for Deep Borehole Disposal July 30, 2015 iv Threaded connections between packages would allow emplacement singly or in strings screwed together at the disposal site. For emplacement on a drill string the drill pipe would be connected directly into the top package of a string (using an adapter sub to mate with premium semi-flush tubing threads). Alternatively, for wireline emplacement the same package designs could be emplaced singly using a sub with wireline latch, on the upper end. Threaded connections on the bottom of the lowermost package would allow attachment of a crush box, instrumentation, etc.
In 2015, CMS was the first LHC experiment to begin using a multi-threaded framework for doing event processing. This new framework utilizes Intel’s Thread Building Block library to manage concurrency via a task based processing model. During the 2015 LHC run period, CMS only ran reconstruction jobs using multiple threads because only those jobs were sufficiently thread efficient. Recent work now allows simulation and digitization to be thread efficient. In addition, during 2015 the multi-threaded framework could run events in parallel but could only use one thread per event. Work done in 2016 now allows multiple threads to be used while processing one event. In this presentation we will show how these recent changes have improved CMS’s overall threading and memory efficiency and we will discuss work to be done to further increase those efficiencies.
Extending an Internet subnet by connecting resource-constrained nodes (e.g., embedded sensors and actuators) over multiple wireless hops is necessary to support the future Internet of Things (IoT). RPL, the IPv6 routing standard for low-power and lossy networks, tried to achieve this goal but has not seen wide adoption in practice. As an alternative, Thread is a recently standardized low-power network protocol for IoT, driven by the Thread group, an industry consortium led by Google/Nest. Here, we provide a comparative analysis of the technical aspects of RPL and Thread based on their specifications, explaining why using Thread, as opposed to RPL, may make sense for the future Internet. Specifically, the fundamental differences between RPL and Thread are their respective scopes and multihop network architectures, which result in Thread's unique design and advantages over RPL. Lastly, we evaluate Thread in an indoor multihop wireless testbed using OpenThread, an official open source implementation of Thread. This work serves as the first analysis of the Thread protocol in academia.
Large-amplitude longitudinal oscillations of solar filaments have been observed and explored for more than ten years. Previous studies are mainly based on the one-dimensional rigid flux tube model with a single magnetic dip. However, it has been noted that there might be two magnetic dips, and hence two threads, along one magnetic field line. Following previous work, we intend to investigate the kinematics of the filament longitudinal oscillations when two threads are magnetically connected, which is done by solving one-dimensional radiative hydrodynamic equations with the numerical code MPI-AMRVAC. Two different types of perturbations are considered, and the difference from previous works resulting from the interaction of the two filament threads is investigated. We find that even with the inclusion of the thread–thread interaction, the oscillation period is modified weakly, by at most 20% compared to the traditional pendulum model with one thread. However, the damping timescale is significantly affected by the thread–thread interaction. Hence, we should take it into account when applying the consistent seismology to the filaments where two threads are magnetically connected.
A method and a system are provided for hardware scheduling of barrier instructions. Execution of a plurality of threads to process instructions of a program that includes a barrier instruction is initiated, and when each thread reaches the barrier instruction during execution of program, it is determined whether the thread participates in the barrier instruction. The threads that participate in the barrier instruction are then serially executed to process one or more instructions of the program that follow the barrier instruction. A method and system are also provided for impatient scheduling of barrier instructions. When a portion of the threads that is greater than a minimum number of threads and less than all of the threads in the plurality of threads reaches the barrier instruction each of the threads in the portion is serially executed to process one or more instructions of the program that follow the barrier instruction.
Highlights: {yields} Molecular Dynamics codes implemented on GPUs have achieved two-order of magnitude computational accelerations. {yields} Brownian Dynamics and Dissipative Particle Dynamics simulations require a large number of random numbers per time step. {yields} We introduce a method for generating small batches of pseudorandom numbers distributed over many threads of calculations. {yields} With this method, Dissipative Particle Dynamics is implemented on a GPU device without requiring thread-to-thread communication. - Abstract: Brownian Dynamics (BD), also known as Langevin Dynamics, and Dissipative Particle Dynamics (DPD) are implicit solvent methods commonly used in models of soft matter and biomolecular systems. The interaction of the numerous solvent particles with larger particles is coarse-grained as a Langevin thermostat is applied to individual particles or to particle pairs. The Langevin thermostat requires a pseudo-random number generator (PRNG) to generate the stochastic force applied to each particle or pair of neighboring particles during each time step in the integration of Newton's equations of motion. In a Single-Instruction-Multiple-Thread (SIMT) GPU parallel computing environment, small batches of random numbers must be generated over thousands of threads and millions of kernel calls. In this communication we introduce a one-PRNG-per-kernel-call-per-thread scheme, in which a micro-stream of pseudorandom numbers is generated in each thread and kernel call. These high quality, statistically robust micro-streams require no global memory for state storage, are more computationally efficient than other PRNG schemes in memory-bound kernels, and uniquely enable the DPD simulation method without requiring communication between threads.