Search NASA⌕ Search

SEARCH · Search NASA

Results for “Graphics”

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 325 records · Page 18

A Case Study on the HACCmk Routine in SYCL on Integrated Graphics

As opposed to the Open Computing Language (OpenCL) programming model in which host and device codes are generally written in different languages, the SYCL programming model can combine host and device codes for an application in a type-safe way to improve development productivity. In this paper, we chose the HACCmk routine, a representative compute-bound kernel, as a case study on the performance of the SYCL programming model targeting a heterogeneous computing device. More specifically, we introduced the SYCL programming model, presented the OpenCL and SYCL implementations of the routine, and compared the performance of the two implementations using the offline and online compilation on Intel (R) Iris (TM) Pro integrated GPUs. We found that the overhead of online compilation may become significant compared to the execution time of a kernel. Compared to the performance of OpenCL implementations, the SYCL implementation can maintain the performance using the offline compilation. The number of execution units in a GPU are critical to improving the raw performance of a compute-bound kernel.

Compilation modes↗

Hardware accelerated dynamic work creation on a graphics processing unit

A processor core is configured to execute a parent task that is described by a data structure stored in a memory. A coprocessor is configured to dispatch a child task to the at least one processor core in response to the coprocessor receiving a request from the parent task concurrently with the parent task executing on the at least one processor core. In some cases, the parent task registers the child task in a task pool and the child task is a future task that is configured to monitor a completion object and enqueue another task associated with the future task in response to detecting the completion object. The future task is configured to self-enqueue by adding a continuation future task to a continuation queue for subsequent execution in response to the future task failing to detect the completion object.

Gutierrez, Anthony↗

Hardware accelerated dynamic work creation on a graphics processing unit

A processor core is configured to execute a parent task that is described by a data structure stored in a memory. A coprocessor is configured to dispatch a child task to the at least one processor core in response to the coprocessor receiving a request from the parent task concurrently with the parent task executing on the at least one processor core. In some cases, the parent task registers the child task in a task pool and the child task is a future task that is configured to monitor a completion object and enqueue another task associated with the future task in response to detecting the completion object. The future task is configured to self-enqueue by adding a continuation future task to a continuation queue for subsequent execution in response to the future task failing to detect the completion object.

Gutierrez, Anthony T.↗

Lattice QCD and Graphical Processing Units

New heavy vector bosons, also known as ``heavy photons'', ``dark photons'', or ``hidden sector photons'', are expected on very general theoretical grounds. Recent astrophysical evidence motivates the direct search for a heavy photon $A'$ in the mass range $m_{A'} \sim 20$ to 1000 MeV/c$^{2}$, with coupling to ordinary photons {\it via} a kinetic mixing term $\propto\epsilon$, expected around $10^{-5}$ to $10^{-2}$. Such a new dark force gauge boson below the GeV range would naturally mediate TeV range dark matter annihilation, and interaction with ordinary matter. Existing constraints from collider searches and beam dump experiments leave much of this preferred $(m_{A'},\epsilon)$ phase space unexplored. The detection of electroproduced $A'$ on a heavy target from their decay into $e^{+}e^{-}$ pairs comes with a copious QED trident background. Using the high luminosity and precision beam available from Jlab, and combining a silicon microstrip vertex tracker with a lead-tungstate calorimeter for triggering, the HPS experiment will hunt for the $A'$ in a large $\epsilon$ range, with unique sensitivity in the lower coupling range using vertexing to suppress the trident background. In this talk, the experimental setup and goals of the HPS experiment will be presented.

Joo, Balint↗

An R shiny graphical user interface for highprecision mass spectrometric data analysis

• There is currently a lack of software that meets the needs for the analysis of raw data produced by modern isotope ratio mass spectrometers for both R&D and routine use at SRNL and other US national labs • Needs to accommodate multiple isotope systems, instruments, and manufacturers • Include modern statistical methods and handling/visualization of uncertainty • Flexible software with transparent (no “black box”) and reproducible methods • This project is inspired by existing discipline-specific data analysis software (e.g., Tripoli1 , ET_Redux2, IsoplotR3) used in the geochemical community • Our goal is to build an open source data analysis software package that focuses on flexibility, transparency, and reproducibility

LABONE, ELIZABETH↗

Mercury + VisIt: Integration of a Real-Time Graphical Analysis Capability into a Monte Carlo Transport Code

Validation of the problem definition and analysis of the results (tallies) produced during a Monte Carlo particle transport calculation can be a complicated, time-intensive processes. The time required for a person to create an accurate, validated combinatorial geometry (CG) or mesh-based representation of a complex problem, free of common errors such as gaps and overlapping cells, can range from days to weeks. The ability to interrogate the internal structure of a complex, three-dimensional (3-D) geometry, prior to running the transport calculation, can improve the user's confidence in the validity of the problem definition. With regard to the analysis of results, the process of extracting tally data from printed tables within a file is laborious and not an intuitive approach to understanding the results. The ability to display tally information overlaid on top of the problem geometry can decrease the time required for analysis and increase the user's understanding of the results. To this end, our team has integrated VisIt, a parallel, production-quality visualization and data analysis tool into Mercury, a massively-parallel Monte Carlo particle transport code. VisIt provides an API for real time visualization of a simulation as it is running. The user may select which plots to display from the VisIt GUI, or by sending VisIt a Python script from Mercury. The frequency at which plots are updated can be set and the user can visualize the simulation results as it is running.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

A tracking system to calculate patient skin dose in real-time during neurointerventional procedures using a biplane x-ray imaging system

Purpose: Neurovascular interventional procedures using biplane fluoroscopic imaging systems can lead to increased risk of radiation-induced skin injuries. The authors developed a biplane dose tracking system (Biplane-DTS) to calculate the cumulative skin dose distribution from the frontal and lateral x-ray tubes and display it in real-time as a color-coded map on a 3D graphic of the patient for immediate feedback to the physician. The agreement of the calculated values with the dose measured on phantoms was evaluated. Methods: The Biplane-DTS consists of multiple components including 3D graphic models of the imaging system and patient, an interactive graphical user interface, a data acquisition module to collect geometry and exposure parameters, the computer graphics processing unit, and functions for determining which parts of the patient graphic skin surface are within the beam and for calculating dose. The dose is calculated to individual points on the patient graphic using premeasured calibration files of entrance skin dose per mAs including backscatter; corrections are applied for field area, distance from the focal spot and patient table and pad attenuation when appropriate. The agreement of the calculated patient skin dose and its spatial distribution with measured values was evaluated in 2D and 3D for simulated procedure conditions using a PMMA block phantom and an SK-150 head phantom, respectively. Dose values calculated by the Biplane-DTS were compared to the measurements made on the phantom surface with radiochromic film and a calibrated ionization chamber, which was also used to calibrate the DTS. The agreement with measurements was specifically evaluated with variation in kVp, gantry angle, and field size. Results: The dose tracking system that was developed is able to acquire data from the two x-ray gantries on a biplane imaging system and calculate the skin dose for each exposure pulse to those vertices of a patient graphic that are determined to be in the beam. The calculations are done in real-time with a typical graphic update time of 30 ms and an average vertex separation of 3 mm. With appropriate corrections applied, the Biplane-DTS was able to determine the entrance dose within 6% and the spatial distribution of the dose within 4% compared to the measurements with the ionization chamber and film for the SK150 head phantom. The cumulative dose for overlapping fields from both gantries showed similar agreement. Conclusions: The Biplane-DTS can provide a good estimate of the peak skin dose and cumulative skin dose distribution during biplane neurointerventional procedures. Real-time display of this information should help the physician manage patient dose to reduce the risk of radiation-induced skin injuries.

60 APPLIED LIFE SCIENCES↗

WE-A-17A-05: Differences in Applicator Configuration and Dwell Loading Between Standard and Image-Guided Tandem and Ring (T and R) HDR Brachytherapy

Purpose: To investigate differences in: (i) relative location of the tandem and the ring compared to a rigid standard applicator model; and (ii) relative loading and changes in loading pattern between standard and image-guided planning. Methods: All T and R insertions performed in 2013 in our institution under CT- or MR-guidance were analyzed. Standard plans were generated using library applicator models with a fixed relationship between ring and tandem, standardized uniform dwell loading and normalization to point A. The graphic plans and the associated standard-plan dwell configurations were compared: the rings were rigidly registered, and the residual tandem shift, rotation and maximum distance between plan tandem dwell and corresponding model tandem dwell were calculated. The normalization ratio (NR = the ratio of graphic versus standard-plan total reference air kerma [TRAK]), the general loading difference (GLD = the difference between graphic and standard ratios of the tandem versus the ring TRAK), and the percent standard deviation (SD% = SD/mean) of the tandem and the ring TRAK for the graphic plan (all standard-plans SD% = 0) were calculated. Results: 71 T and R were analyzed. Residual tandem shift, rotation and maximum corresponding dwell distance were 1.2±0.8mm (0.4±0.4mm lateral, 0.9±0.8mm craniocaudal, 0.4±0.3mm anterior-posterior), 2.3±1.9deg and 3.4±2.3mm. NR was 0.86±0.11 indicating a lower overall loading of the graphic compared to the standard plans. GLD was -0.12±0.16 indicating a modest increased ring loading relative to the tandem in the graphic plans. SD% was 2.1±1.6% for tandem and 2.8±1.9% for ring, indicating small deviations from uniform loading. Conclusion: Variability in the relative locations of the tandem and the ring necessitates the independent registration of each component model for accurate digitization. Our clinical experience suggests that graphically planned T and R results on average in a lower total dose to the patient, and in an increased relative loading of the ring component.

60 APPLIED LIFE SCIENCES↗

Chroma Shift and Gamut Shape: Going Beyond Average Color Fidelity and Gamut Area

Though sometimes referred to as a two-measure system for evaluating color rendition, IES TM-30-15 includes other key components that go beyond the high-level average values IES Rf and IES Rg. This article focuses on the Color Vector Graphic and Local Chroma Shift (IES Rcs,hj), discussing the calculation methods for these evaluation tools and providing context for the interpretation of the values. It also presents alternatives for quantifying the same characteristics, which can inform the development of future measures. The Color Vector Graphic (CVG) is a visual representation of hue and chroma shifts across different hues. It quickly communicates complex information about how object colors will be rendered by a light source, although it is difficult or impossible to use for writing a specification. CVGs demonstrate that increases in chroma for certain hues sometimes means a decrease in chroma for other hues, and illustrates hue shifts for intermediate colors. The combination of shifts over different hues can be referred to as gamut shape. Complementing this information are the IES Rcs,hj values, which quantify the average relative chroma shift for samples in each of the 16 hue-angle bins (j) specified in IES TM-30-15. Unlike measures of average color fidelity and gamut area, gamut shape and hue-specific chroma shift are new concepts with no directly-comparable historical references. It will be critical to incorporate the Color Vector Graphic and Local Chroma Shift values into practice because they capture information about color rendition that is impossible to describe with average measures (such as CIE Ra, IES Rf, or IES Rg), but that is critical to understanding human evaluations of color quality in architectural environments.

Chroma Shift↗

Acceleration of GPU-based Krylov solvers via data transfer reduction

Krylov subspace iterative solvers are often the method of choice when solving large sparse linear systems. At the same time, hardware accelerators such as graphics processing units continue to offer significant floating point performance gains for matrix and vector computations through easy-to-use libraries of computational kernels. However, as these libraries are usually composed of a well optimized but limited set of linear algebra operations, applications that use them often fail to reduce certain data communications, and hence fail to leverage the full potential of the accelerator. In this study, we target the acceleration of Krylov subspace iterative methods for graphics processing units, and in particular the Biconjugate Gradient Stabilized solver that significant improvement can be achieved by reformulating the method to reduce data-communications through application-specific kernels instead of using the generic BLAS kernels, e.g. as provided by NVIDIA’s cuBLAS library, and by designing a graphics processing unit specific sparse matrix-vector product kernel that is able to more efficiently use the graphics processing unit’s computing power. Furthermore, we derive a model estimating the performance improvement, and use experimental data to validate the expected runtime savings. Finally, considering that the derived implementation achieves significantly higher performance, we assert that similar optimizations addressing algorithm structure, as well as sparse matrix-vector, are crucial for the subsequent development of high-performance graphics processing units accelerated Krylov subspace iterative methods.

97 MATHEMATICS AND COMPUTING↗

An MCNP6 Version of the Visual Editor - Paper 2

The Visual Editor is a graphical user interface for working with the MCNP computer code developed at Los Alamos National Laboratory. It consists of a graphical user interface written in C++ that is linked directory to the MCNP Fortran code. Work on the original Visual Editor started in 1992 and was first published in 1993. The original version of the Visual Editor was created on Unix/Linux operating systems and was linked to the MCNP computer code. The Visual Editor was adapted to the Windows operating system in 1999. In 2008 the Visual Editor was adapted to work with the MCNPX computer code. This paper discusses the latest upgrade of the Visual Editor to be compatible with the MCNP6 computer code. Two graphical user interfaces have been created, the Visual MCNP6 Plotter and the Visual MCNP6 Editor. The Visual MCNP6 Plotter includes all of the standard plotting features available in the default MCNP6 plotting package including geometry plotting, tally plotting, cross section plotting, mesh tally plotting and weight window mesh plotting. The Visual MNCP6 Editor has additional capabilities to allow for the creation of MCNP input files with graphical tools. The Visual MCNP6 Editor allows user to create and modify the input file within the Editor. Modifications are not allowed in the Visual MCNP6 Plotter. Both graphical user interfaces allow for advanced plotting features including 3D geometry plots and particle track plotting. Complete details on these tools along with their current status can be found at the Visual Editor website (www.mcnpvised.com). (author)

61 RADIATION PROTECTION AND DOSIMETRY↗

Recovery Act: Advanced Interaction, Computation, and Visualization Tools for Sustainable Building Design

Current building energy simulation technology requires excessive labor, time and expertise to create building energy models, excessive computational time for accurate simulations and difficulties with the interpretation of the results. These deficiencies can be ameliorated using modern graphical user interfaces and algorithms which take advantage of modern computer architectures and display capabilities. To prove this hypothesis, we developed an experimental test bed for building energy simulation. This novel test bed environment offers an easy-to-use interactive graphical interface, provides access to innovative simulation modules that run at accelerated computational speeds, and presents new graphics visualization methods to interpret simulation results. Our system offers the promise of dramatic ease of use in comparison with currently available building energy simulation tools. Its modular structure makes it suitable for early stage building design, as a research platform for the investigation of new simulation methods, and as a tool for teaching concepts of sustainable design. Improvements in the accuracy and execution speed of many of the simulation modules are based on the modification of advanced computer graphics rendering algorithms. Significant performance improvements are demonstrated in several computationally expensive energy simulation modules. The incorporation of these modern graphical techniques should advance the state of the art in the domain of whole building energy analysis and building performance simulation, particularly at the conceptual design stage when decisions have the greatest impact. More importantly, these better simulation tools will enable the transition from prescriptive to performative energy codes, resulting in better, more efficient designs for our future built environment.

99 GENERAL AND MISCELLANEOUS↗

Sustain

Current building energy simulation technology requires excessive labor, time and expertise to create building energy models, excessive computational time for accurate simulations and difficulties with the interpretation of the results. These deficiencies can be ameliorated using modern graphical user interfaces and algorithms which take advantage of modern computer architectures and display capabilities. To prove this hypothesis, we developed an experimental test bed for building energy simulation. This novel test bed environment offers an easy-to-use interactive graphical interface, provides access to innovative simulation modules that run at accelerated computational speeds, and presents new graphics visualization methods to interpret simulation results. Our system offers the promise of dramatic ease of use in comparison with currently available building energy simulation tools. Its modular structure makes it suitable for early stage building design, as a research platform for the investigation of new simulation methods, and as a tool for teaching concepts of sustainable design. Improvements in the accuracy and execution speed of many of the simulation modules are based on the modification of advanced computer graphics rendering algorithms. Significant performance improvements are demonstrated in several computationally expensive energy simulation modules. The incorporation of these modern graphical techniques should advance the state of the art in the domain of whole building energy analysis and building performance simulation, particularly at the conceptual design stage when decisions have the greatest impact. More importantly, these better simulation tools will enable the transition from prescriptive to performative energy codes, resulting in better, more efficient designs for our future built environment.

Source record↗

CUDA Computation of the Feynman Distribution

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.

97 MATHEMATICS AND COMPUTING↗

Multiple response optimization for higher dimensions in factors and responses

When optimizing a product or process with multiple responses, a two-stage Pareto front approach is a useful strategy to evaluate and balance trade-offs between different estimated responses to seek optimum input locations for achieving the best outcomes. After objectively eliminating non-contenders in the first stage by looking for a Pareto front of superior solutions, graphical tools can be used to identify a final solution in the second subjective stage to compare options and match with user priorities. Until now, there have been limitations on the number of response variables and input factors that could effectively be visualized with existing graphical summaries. We present novel graphical tools that can be more easily scaled to higher dimensions, in both the input and response spaces, to facilitate informed decision making when simultaneously optimizing multiple responses. A key aspect of these graphics is that the potential solutions can be flexibly sorted to investigate specific queries, and that multiple aspects of the solutions can be simultaneously considered. As a result, recommendations are made about how to evaluate the impact of the uncertainty associated with the estimated response surfaces on decision making with higher dimensions.

97 MATHEMATICS AND COMPUTING↗

Sustain: An experimental test bed for building energy simulation

Current building energy simulation technology requires extensive labor, time and expertise to create building energy models, substantial computational time for accurate simulations, and generates data in formats that make results difficult to interpret. These deficiencies can be ameliorated using modern graphical user interfaces and algorithms which take advantage of modern computer architectures and display capabilities. This paper describes a novel test bed environment which offers an interactive graphical interface, provides access to simulation modules that run at accelerated computational speeds, and presents new graphic visualization methods for the interpretation of simulation results. Its modular structure makes it suitable for use in early stage building design, for use as a research platform for the investigation of new simulation methods, and for use as a tool for teaching concepts of sustainable design. Improvements in the accuracy and execution speed of many of the simulation modules are based on the modification of advanced computer graphics rendering algorithms. Significant performance improvements are illustrated in several computationally expensive energy simulation modules.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗