Global ETD Search

Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.

Results

Showing 1 to 13 of 13 for “"Sparse Computations"”.

  1. Optimizing sparse computations using union of Z-polyhedra

    Sparse matrices play a central role in a wide range of modern computational problems. They are especially common in domains such as scientific simulations, numerical methods, graph analytics, machine learning, and high-performance computing workloads, where data is often structured in a way that …

    colostate Repository record for Optimizing sparse computations using union of Z-polyhedra (opens in a new tab)

  2. Program Transformations and Sparse Computations in Performance Portability Libraries

    … do so portably. Similarly, for codes using sparse data structures, the limited available abstractions require code to be format-dependent. Thus, the performance improvements of changing sparse formats come at the cost of rewriting entire kernels for the new format. This dissertation remedies …

    arizona-thes Repository record for Program Transformations and Sparse Computations in Performance Portability Libraries (opens in a new tab)

  3. Automatic Sparse Computation Parallelization by Utilizing Domain-Specific Knowledge in Data Dependence Analysis

    Sparse vectors, matrices, and tensors are commonly used to compress nonzero values of big data manipulated in data analytics, scientific simulations, and machine learning computations. As with general computations, parallelization of loops in sparse computations, codes manipulating sparse …

    arizona-thes Repository record for Automatic Sparse Computation Parallelization by Utilizing Domain-Specific Knowledge in Data Dependence Analysis (opens in a new tab)

  4. Optimizing Irregular Computations on Parallel Processors

    … computing demands. However, the underlying computations in these applications have irregularities in both their memory access and their control flow. Irregular computations make performance optimization challenging on parallel processors due to their data-dependent memory accesses, e.g. the …

    toronto-retro Repository record for Optimizing Irregular Computations on Parallel Processors (opens in a new tab)

  5. Exploring Sparse Inference with SuiteSparse:GraphBLAS

    … the resource demands are also growing. Sparse inference is an approach to take advantage of sparsity in large AI models to make them run faster thereby lowering the resource requirements. SuiteSparse:GraphBLAS, an open-source implementation of GraphBLAS, offers a robust framework …

    tamu Repository record for Exploring Sparse Inference with SuiteSparse:GraphBLAS (opens in a new tab)

  6. Sparse Format Conversion and Code Synthesis

    Sparse computations are important in scientific computing. Many scientific applications compute on sparse data. Data is said to be sparse if it has a relatively small number of non-zeros. Sparse formats use auxiliary arrays to store non-zeros, as a result, the contents of auxiliary arrays are not …

    boise Repository record for Sparse Format Conversion and Code Synthesis (opens in a new tab)

  7. A model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality

    Sparse matrix vector multiply (SpMV) is an important computation that is used in many scientific and structural engineering applications. Sparse computations like SpMV require the use of special sparse data structures that efficiently store and access non-zeros. However, sparse data structures can …

    colostate Repository record for A model for predicting the performance of sparse matrix vector multiply (SpMV) using memory bandwidth requirements and data locality (opens in a new tab)

  8. Sparse Attention Mechanisms in Vision Transformers: from Spatiotemporal Transformers to Instance-Dependent Attention Patterns

    … The hypothesis was that structured and dynamic sparse computation improves latency and memory footprint compared to existing approaches with equal algorithm effectiveness. To show this, we built on the state of the art in sparse computations. This dissertation fills in previously unexplored …

    toronto-retro Repository record for Sparse Attention Mechanisms in Vision Transformers: from Spatiotemporal Transformers to Instance-Dependent Attention Patterns (opens in a new tab)

  9. Silicon photonic hardware accelerators for transformers and graph neural networks

    … challenges are due to their dense and very sparse computations. Additionally, the wide variety of possible input graphs structure and algorithms dictate the need for a system capable of efficiently adapting their execution and operations to the specific graph structure and effectively …

    colostate Repository record for Silicon photonic hardware accelerators for transformers and graph neural networks (opens in a new tab)

  10. Bridging the Gap between Sparse Matrix Computation and Graph Models

    … network analytics, and scientific computing. In sparse matrices, the majority of values are zeros. Traditional methods of storing and processing dense data are unsuitable for the new nature of sparse data, as they end up wasting storage and compute on zeros. Hence, a variety of sparse data …

    oklahoma-thes Repository record for Bridging the Gap between Sparse Matrix Computation and Graph Models (opens in a new tab)

  11. Tuning Sparse Matrix Kernel Performance via Lightweight Signatures

    This dissertation introduces lightweight sparse-matrix pattern and occupancy signatures for automatic input-dependent tiling of sparse kernels such as sparse-dense matrix multiplication (SpMM), sampled dense-dense matrix multiplication (SDDMM), etc. Sparse matrix kernels are typically bandwidth …

    gatech Repository record for Tuning Sparse Matrix Kernel Performance via Lightweight Signatures (opens in a new tab)