Search NASA⌕ Search

SEARCH · Search NASA

Results for “vector programs”

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 19 records

Towards Resiliency Evaluation of Vector Programs

The systems resilience research community has developed methods to manually insert additional source-program level assertions to trap errors, and also devised tools to conduct fault injection studies for scalar program codes. In this work, we contribute the first vector oriented LLVM-level fault injector VULFI to help study the effects of faults in vector architectures that are of growing importance, especially for vectorizing loops. Using VULFI, we conduct a resiliency study of nine real-world vector benchmarks using Intel’s AVX and SSE extensions as the target vector instruction sets, and offer the first reported understanding of how faults affect vector instruction sets. We take this work further toward automating the insertion of resilience assertions during compilation. This is based on our observation that during intermediate (e.g., LLVM-level) code generation to handle full and partial vectorization, modern compilers exploit (and explicate in their code-documentation) critical invariants. These invariants are turned into error-checking code. We confirm the efficacy of these automatically inserted low-overhead error detectors for vectorized for-loops.

fault injection↗

Discovering Blind Geothermal Systems in the Great Basin Region: An Integrated Geologic and Geophysical Approach for Establishing Geothermal Play Fairways: All Phases

Most geothermal resources in the Great Basin region of the western USA are blind, and thus the discovery of new commercial-grade systems requires synthesis of favorable characteristics for geothermal activity. The geothermal play fairway concept involves integration of multiple parameters indicative of geothermal activity to identify promising areas for new development. This project integrated multiple datasets to apply the play fairway concept and assess geothermal potential in a large region of the Great Basin in Nevada. It is therefore referred to as the Nevada play fairway project. This project was a strong collaborative effort between several organizations, led by the Nevada Bureau of Mines and Geology at the University of Nevada, Reno, but with key support from the U.S. Geological Survey, ATLAS Geosciences, Inc,, Hi-Q Geophysical, Inc., Lawrence Berkeley National Laboratory, Utah Geological Survey, and Innovative Geothermal Ltd. In Budget Period 1 of this project, available data for nine geologic, geochemical, and geophysical parameters were initially synthesized to produce a new detailed geothermal potential map of 96,000 km2 from west-central to eastern Nevada. These parameters were grouped into subsets and individually weighted to delineate rankings for local permeability, intermediate permeability, regional permeability, and thermal potential, which collectively defined geothermal play fairways (i.e., most likely locations for significant geothermal fluid flow). This initial work was aimed at reducing the risks in regional exploration and therefore facilitating discovery of new commercial-grade systems in blind settings, as well as in areas with surface expressions of geothermal activity. Budget Period 2 of the project involved detailed analysis of some of the most promising areas identified in Phase 1. Twenty-four highly prospective areas, including both known undeveloped systems and previously undiscovered potential blind systems, were identified for further analysis. After reconnaissance of these areas, five of the most promising sites were selected for detailed studies. Multiple techniques were employed in the detailed studies, including geologic mapping, shallow temperature surveys, gravity surveys, Lidar, geochemical studies, seismic reflection analysis, and 3D modeling. The goal of the detailed studies was to identify specific areas with the highest likelihood for high permeability and thermal fluids, such that drill sites could be targeted. Three main sets of predictive maps were generated for each detailed study area: 1) play fairway maps, 2) play fairway error maps, and 3) direct evidence maps. Local- and intermediate-scale permeability models were revised to reflect results of the detailed geologic, geophysical, and geochemical analyses. Budget Period 3 of the project involved more detailed geophysical analyses and temperature-gradient (TG) drilling in southeastern Gabbs Valley and northern Granite Springs Valley, deemed the two most promising sites, with the goal of providing preliminary validation of the play fairway methodology. In southeastern Gabbs Valley, the collocation of a favorable structural setting (displacement transfer zone and fault intersections), Quaternary faults, intersecting and terminating gravity gradients, magnetic low, shallow (2 m) temperature anomaly, low resistivity anomaly, and promising geothermometry from nearby water wells provided evidence for a blind system. Drilling of six TG holes defines an apparent geothermal system at this locality with temperatures as high as 124°C at 152 m. This system is blind, with no surface hot springs, fumaroles, or paleo-geothermal deposits. For northern Granite Springs Valley, a favorable structural setting (termination of a major Quaternary normal fault), terminating gravity gradient, magnetic gradient, newly discovered sinter deposits, nearby warm water wells, previously drilled TG holes in the vicinity, and promising geothermometry suggest a hidden system. Drilling of six new TG holes yields temperatures of ~96°C at ~250 m, suggesting the presence of a geothermal system. Major lessons learned in the course of this project include: 1) initially identified sites commonly include multiple favorable structural settings at a finer scale; 2) promising sites in Cenozoic basins cannot be recognized without detailed geophysical surveys; and 3) play fairway analysis should be refined as the exploration program vectors into the most promising sites and finer-scale data are acquired. In addition to producing copious amounts of data, this project resulted in 16 published papers, 10 abstracts, more than 40 presentations across the U.S. and abroad (including several keynote addresses), 2 Masters theses, and 7 media reports.

15 GEOTHERMAL ENERGY↗

Efficient Execution of Recursive Programs on Commodity Vector Hardware

The pursuit of computational efficiency has led to the proliferation of throughput-oriented hardware, from GPUs to increasingly-wide vector units on commodity processors and accelerators. This hardware is designed to efficiently execute data-parallel computations in a vectorized manner. However, many algorithms are more naturally expressed as divide-and-conquer, recursive, task-parallel computations; in the absence of data parallelism, it seems that such algorithms are not well-suited to throughput-oriented architectures. This paper presents a set of novel code transformations that expose the data-parallelism latent in recursive, task-parallel programs. These transformations facilitate straightforward vectorization of task-parallel programs on commodity hardware. We also present scheduling policies that maintain high utilization of vector resources while limiting space usage. Across several task-parallel benchmarks, we demonstrate both efficient vector resource utilization and substantial speedup on chips using Intel's SSE4.2 vector units as well as accelerators using Intel's AVX512 units.

resursion↗

Index Sets and Vectorization

Vectorization is data parallelism (SIMD, SIMT, etc.) - extension of ISA enabling the same instruction to be performed on multiple data items simultaeously. Many/most CPUs support vectorization in some form. Vectorization is difficult to enable, but can yield large efficiency gains. Extra programmer effort is required because: (1) not all algorithms can be vectorized (regular algorithm structure and fine-grain parallelism must be used); (2) most CPUs have data alignment restrictions for load/store operations (obey or risk incorrect code); (3) special directives are often needed to enable vectorization; and (4) vector instructions are architecture-specific. Vectorization is the best way to optimize for power and performance due to reduced clock cycles. When data is organized properly, a vector load instruction (i.e. movaps) can replace 'normal' load instructions (i.e. movsd). Vector operations can potentially have a smaller footprint in the instruction cache when fewer instructions need to be executed. Hybrid index sets insulate users from architecture specific details. We have applied hybrid index sets to achieve optimal vectorization. We can extend this concept to handle other programming models.

97 MATHEMATICS AND COMPUTING↗

The interatomic vector's method, algorithms, and programs for the solution of atomic structure of nanoclusters in crystal

A calculation technique and corresponding algorithms have been developed using the formalism of Fourier transform of finite functions. A software package for obtaining distributions of cluster interatomic vectors from diffuse X-ray scattering has been written and debugged. The programs were checked on a 30-atom cluster [CdTb{sub 3}F{sub 26}]. The attempts to obtain experimental data on a single crystal with nanoclusters using an Xcalibur S diffractometer (Oxford Diffraction) with a coordinate CCD detector were no success. The standard diffractometer software contains errors that lead to incorrect results upon the reconstruction of the distribution of diffuse scattering from different runs. These errors are of little importance when Bragg peaks are processed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

A communication-avoiding, hybrid-parallel, rank-revealing orthogonalization method.

Orthogonalization consumes much of the run time of many iterative methods for solving sparse linear systems and eigenvalue problems. Commonly used algorithms, such as variants of Gram-Schmidt or Householder QR, have performance dominated by communication. Here, 'communication' includes both data movement between the CPU and memory, and messages between processors in parallel. Our Tall Skinny QR (TSQR) family of algorithms requires asymptotically fewer messages between processors and data movement between CPU and memory than typical orthogonalization methods, yet achieves the same accuracy as Householder QR factorization. Furthermore, in block orthogonalizations, TSQR is faster and more accurate than existing approaches for orthogonalizing the vectors within each block ('normalization'). TSQR's rank-revealing capability also makes it useful for detecting deflation in block iterative methods, for which existing approaches sacrifice performance, accuracy, or both. We have implemented a version of TSQR that exploits both distributed-memory and shared-memory parallelism, and supports real and complex arithmetic. Our implementation is optimized for the case of orthogonalizing a small number (5-20) of very long vectors. The shared-memory parallel component uses Intel's Threading Building Blocks, though its modular design supports other shared-memory programming models as well, including computation on the GPU. Our implementation achieves speedups of 2 times or more over competing orthogonalizations. It is available now in the development branch of the Trilinos software package, and will be included in the 10.8 release.

99 GENERAL AND MISCELLANEOUS↗

Measurements of vector boson plus jets at the Tevatron

We present preliminary measurements of Z/{gamma}* + jets, W + c and Z + b + X at the Tevatron, and review recent measurements of vector boson plus inclusive and heavy-flavor jets production. All measurements are in agreement with next-to-leading-order QCD calculations within the experimental and theoretical uncertainties. We also point to comparisons of the production rate and kinematics of the data with several Monte Carlo simulation programs of vector boson + jets processes.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The Eco-Bio-Social Factors That Modulate Aedes aegypti Abundance in South Texas Border Communities

Aedes aegypti control requires dedicated resources that are usually scarce, limiting the reach and sustainability of vector control programs. This generates a need to focus on areas at risk of disease transmission and also understand the factors that might modulate local mosquito abundance. We evaluated the eco-bio-social factors that modulate indoor and outdoor relative abundance of female Ae. aegypti in communities of South Texas. We conducted housing quality and Knowledge Attitudes and Practices surveys in households that were part of a weekly mosquito surveillance program in November of 2017 and 2018. Our results showed widespread knowledge of mosquitoes and Zika virus by our participants. However, less than 35% considered them as serious problems in this region. The presence of window-mounted air conditioning units increased the risk of female mosquito relative abundance indoors. An increase in outdoor relative abundance was associated with larger properties and a higher number of children between 6 to 17 years of age. Interestingly, we observed that an increasing number of children <5 years of age modulated both indoor and outdoor relative abundance, with a 52% increase indoors and 30% decrease outdoors. The low perception of mosquito and disease risk highlights engagement needs for vector-borne disease prevention in this region. The identified risk factors can help guide public health officials in their efforts to reduce human and vector contact.

54 ENVIRONMENTAL SCIENCES↗

Multithreading in vector processors

In one embodiment, a system includes a processor having a vector processing mode and a multithreading mode. The processor is configured to operate on one thread per cycle in the multithreading mode. The processor includes a program counter register having a plurality of program counters, and the program counter register is vectorized. Each program counter in the program counter register represents a distinct corresponding thread of a plurality of threads. The processor is configured to execute the plurality of threads by activating the plurality of program counters in a round robin cycle.

97 MATHEMATICS AND COMPUTING↗

RELAP5-3D Developer Guidelines and Programming Practices

Our ultimate goal is to create and maintain RELAP5-3D as the best software tool available to analyze nuclear power plants. This begins with writing excellent programming and requires thorough testing. This document covers development of RELAP5-3D software, the behavior of the RELAP5-3D program that must be maintained, and code testing. RELAP5-3D must perform in a manner consistent with previous code versions with backward compatibility for the sake of the users. Thus file operations, code termination, input and output must remain consistent in form and content while adding appropriate new files, input and output as new features are developed. As computer hardware, operating systems, and other software change, RELAP5-3D must adapt and maintain performance. The code must be thoroughly tested to ensure that it continues to perform robustly on the supported platforms. The coding must be written in a consistent manner that makes the program easy to read to reduce the time and cost of development, maintenance and error resolution. The programming guidelines presented her are intended to institutionalize a consistent way of writing FORTRAN code for the RELAP5-3D computer program that will minimize errors and rework. A common format and organization of program units creates a unifying look and feel to the code. This in turn increases readability and reduces time required for maintenance, development and debugging. It also aids new programmers in reading and understanding the program. Therefore, when undertaking development of the RELAP5-3D computer program, the programmer must write computer code that follows these guidelines. This set of programming guidelines creates a framework of good programming practices, such as initialization, structured programming, and vector-friendly coding. It sets out formatting rules for lines of code, such as indentation, capitalization, spacing, etc. It creates limits on program units, such as subprograms, functions, and modules. It establishes documentation guidance on internal comments. The guidelines apply to both existing and new subprograms. They are written for both FORTRAN 77 and FORTRAN 95. The guidelines are not so rigorous as to inhibit a programmer’s unique style, but do restrict the variations in acceptable coding to create sufficient commonality that new readers will find the coding in each new subroutine familiar. It is recognized that this is a “living” document and must be updated as languages, compilers, and computer hardware and software evolve.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Circuit arrangement and technique for setting matrix values in three-terminal memory cells

A method for programming substantially simultaneously more than one of the three-terminal memory cells that represent the values of a matrix to be multiplied by a vector is disclosed. Programming may be achieved by controlling the gate-drain voltage for more than one cell simultaneously to change each such cell's physical state and hence its effective resistance. Illustratively, the gates of each row of the cells corresponding to the matrix are coupled together and each coupled row is coupled to a respective controllable voltage source while the drains of each column of the cells of the matrix are coupled together and each coupled column is coupled to a respective controllable voltage source. The controllable voltage sources are arranged so that at the intersection of a row and a column, a cell experiences one of three conditions: increase effective resistance, decrease effective resistance, or substantially no change.

97 MATHEMATICS AND COMPUTING↗

Analog vector-matrix multiplication by capacitive elements with resistive state storage

An array circuit includes a plurality of vector-matrix multiplication (VMM) elements arranged in rows and columns. The VMM elements are configured to collectively perform multiplication of an input vector by a programmed input matrix to generate a plurality of output values that are representative of a result matrix that is the result of multiplication of the input vector and the input matrix. The VMM elements store states of the input matrix. Input voltages to the array are representative of elements of the input vector. A VMM element draws charge from a column read line based upon charging of a capacitor in the VMM. An integrator circuit connected to the column read line outputs a voltage that is indicative of a total charge drawn from the column read line by elements connected to the read line, which voltage is further indicative of an element of a result matrix.

Agarwal, Sapan↗

Measurement of polarization observables in vector meson photoproduction using a transversely-polarized frozen-spin target and polarized photons at CLAS, Jefferson Lab

The study of baryon resonances provides a deeper understanding of the strong interaction because the dynamics and relevant degrees of freedom hidden within them are re ected by the properties of the excited states of baryons. Higher-lying excited states at and above 1.7 GeV/c 2 are generally predicted to have strong couplings to final states involving a heavier meson, e. g. one of the vector mesons, ρ, ω φ, as compared to a lighter pseudoscalar meson, e. g. π and η. Decays to the ππΝ final states via πΔ also become more important through the population of intermediate resonances. We observe that nature invests in mass rather than momentum. The excited states of the nucleon are usually found as broadly overlapping resonances which may decay into a multitude of final states involving mesons and baryons. Polarization observables make it possible to isolate single resonance contributions from other interference terms. The CLAS g9 (FROST) experiment, as part of the N* spectroscopy program at Jefferson Laboratory, accumulated photoproduction data using circularly- & linearly-polarized photons incident on a transversely-polarized butanol target (g9b experiment) in the photon energy range 0:3-2:4 GeV & 0:7-2:1 GeV, respectively. In this work, the analysis of reactions and polarization observables which involve two charged pions, either in the fully exclusive reaction γρ -> ρπ+π- or in the semi-exclusive reaction with a missing neutral pion, γρ -> ρπ + π - (π 0 ) will be presented. For the reaction ρπ + π - , eight polarization observables (I s , I c , P x , P y , $P^s_{x;y}$, $P^c_{x; y}$) have been extracted. The high statistics data rendered it possible to extract these observables in three dimensions. All of them are first-time measurements. The fairly good agreement of Is, Ic obtained from this analysis with the experimental results from a previous CLAS experiment provides support for the first-time measurements. For the reaction γρ -> ρω -> ρπ + π(π 0 , five polarization observables (T, Σ, F, H, P) have been extracted, four of which are first-time measurements at all energies. This analysis thus represents a comprehensive program on vector-meson photoproduction: The ω is observed and studied directly from the data and the polarization observables for the (broad) ω can be extracted from the double-pion reaction in a partial-wave analysis. The 13 polarization observables extracted in this analysis substantially augment the world database of polarization observables for these reactions and are expected to play a crucial role in identifying the contributing baryon resonances.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

The effects of realistic pancake solenoids on particle transport

Solenoids are widely used to transport or focus particle beams. Usually, they are assumed as being ideal solenoids with a high axial-symmetry magnetic field. Using the Vector Fields Opera program, we modeled asymmetrical solenoids with realistic geometry defects, caused by finite conductor and current jumpers. Their multipole magnetic components were analyzed with the Fourier fit method; we present some possible optimized methods for them. We also discuss the effects of 'realistic' solenoids on low energy particle transport. The findings in this paper may be applicable to the lower energy particle transport system design.

43 PARTICLE ACCELERATORS↗

The effects of realistic pancake solenoids on particle transport

Solenoids are widely used to transport or focus particle beams. Usually, they are assumed as being ideal solenoids with a high axial-symmetry magnetic field. Using the Vector Field Opera program, we modeled asymmetrical solenoids with realistic geometry defects, caused by finite conductor and current jumpers. Their multipole magnetic components were analyzed with the Fourier fit method; we present some possible optimized methods for them. We also discuss the effects of 'realistic' solenoids on low energy particle transport. The finding in this paper may be applicable to some lower energy particle transport system design.

43 PARTICLE ACCELERATORS↗

Benders Cut Classification via Support Vector Machines for Solving Two-Stage Stochastic Programs

In this work, we consider Benders decomposition for solving two-stage stochastic programs with complete recourse based on finite samples of the uncertain parameters. We define the Benders cuts binding at the final optimal solution or the ones significantly improving bounds over iterations as valuable cuts. We propose a learning-enhanced Benders decomposition (LearnBD) algorithm, which adds a cut classification step in each iteration to selectively generate cuts that are more likely to be valuable cuts. The LearnBD algorithm includes two phases: (i) sampling cuts and collecting information from training problems and (ii) solving testing problems with a support vector machine (SVM) cut classifier. We run the LearnBD algorithm on instances of capacitated facility location and multicommodity network design under uncertain demand. Our results show that SVM cut classifier works effectively for identifying valuable cuts, and the LearnBD algorithm reduces the total solving time of all instances for different problems with various sizes and complexities.

97 MATHEMATICS AND COMPUTING↗

Exploiting Vector and Multicore Parallelsim for Recursive, Data- and Task-Parallel Programs

Modern hardware contains parallel execution resources that are well-suited for data-parallelism-vector units-and task parallelism-multicores. However, most work on parallel scheduling focuses on one type of hardware or the other. In this work, we present a scheduling framework that allows for a unified treatment of task- and data-parallelism. Our key insight is an abstraction, task blocks, that uniformly handles data-parallel iterations and task-parallel tasks, allowing them to be scheduled on vector units or executed independently as multicores. Our framework allows us to define schedulers that can dynamically select between executing task- blocks on vector units or multicores. We show that these schedulers are asymptotically optimal, and deliver the maximum amount of parallelism available in computation trees. To evaluate our schedulers, we develop program transformations that can convert mixed data- and task-parallel pro- grams into task block-based programs. Using a prototype instantiation of our scheduling framework, we show that, on an 8-core system, we can simultaneously exploit vector and multicore parallelism to achieve 14×-108× speedup over sequential baselines.

Ren, Bin↗

TH-AB-207A-07: Radiation Dose Simulation for a Newly Proposed Dynamic Bowtie Filters for CT Using Fast Monte Carlo Methods

Purpose: Dynamic bowtie filter is an innovative design capable of modulating the X-ray and balancing the flux in the detectors, and it introduces a new way of patient-specific CT scan optimizations. This study demonstrates the feasibility of performing fast Monte Carlo dose calculation for a type of dynamic bowtie filter for cone-beam CT (Liu et al. 2014 9(7) PloS one) using MIC coprocessors. Methods: The dynamic bowtie filter in question consists of a highly attenuating bowtie component (HB) and a weakly attenuating bowtie (WB). The HB is filled with CeCl3 solution and its surface is defined by a transcendental equation. The WB is an elliptical cylinder filled with air and immersed in the HB. As the scanner rotates, the orientation of WB remains the same with the static patient. In our Monte Carlo simulation, the HB was approximated by 576 boxes. The phantom was a voxelized elliptical cylinder composed of PMMA and surrounded by air (44cm×44cm×40cm, 1000×1000×1 voxels). The dose to the PMMA phantom was tallied with 0.15% statistical uncertainty under 100 kVp source. Two Monte Carlo codes ARCHER and MCNP-6.1 were compared. Both used double-precision. Compiler flags that may trade accuracy for speed were avoided. Results: The wall time of the simulation was 25.4 seconds by ARCHER on a 5110P MIC, 40 seconds on a X5650 CPU, and 523 seconds by the multithreaded MCNP on the same CPU. The high performance of ARCHER is attributed to the parameterized geometry and vectorization of the program hotspots. Conclusion: The dynamic bowtie filter modeled in this study is able to effectively reduce the dynamic range of the detected signals for the photon-counting detectors. With appropriate software optimization methods, the accelerator-based (MIC and GPU) Monte Carlo dose engines have shown good performance and can contribute to patient-specific CT scan optimizations.

60 APPLIED LIFE SCIENCES↗