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 10 of 10 for “"Sparse Tensor Algebra"”.

  1. Sparse tensor algebra compilation

    This dissertation shows how to compile any sparse tensor algebra expression to CPU and GPU code that matches the performance of hand-optimized implementations. A tensor algebra expression is sparse if at least one of its tensor operands is sparse, and a tensor is sparse if most of its values are …

    mit Repository record for Sparse tensor algebra compilation (opens in a new tab)

  2. GSTACO: A Generalized Sparse Tensor Algebra Compiler

    … and computer science are characterized by sparse multi-dimensional data. Therefore, optimizations for sparse tensor algebra have received a lot of attention lately. Several hardware and software solutions have emerged in order to speed up the computation of certain tensor expressions, but …

    mit Repository record for GSTACO: A Generalized Sparse Tensor Algebra Compiler (opens in a new tab)

  3. Format Abstractions for the Compilation of Sparse Tensor Algebra

    Tensors are commonly used to represent data in many domains, including data analytics, machine learning, science, and engineering. Many highly-optimized libraries and compilers have been developed for efficiently computing on dense tensors. However, existing libraries and compilers are limited in …

    mit Repository record for Format Abstractions for the Compilation of Sparse Tensor Algebra (opens in a new tab)

  4. Tailors: Accelerating Sparse Tensor Algebra by Overbooking Buffer Capacity

    Sparse tensor algebra is a challenging class of workloads to accelerate due to few opportunities for data reuse and varying sparsity patterns. Prior sparse tensor algebra accelerators have explored tiling sparse tensors to increase exploitable data reuse and improve throughput, but typically …

    mit Repository record for Tailors: Accelerating Sparse Tensor Algebra by Overbooking Buffer Capacity (opens in a new tab)

  5. A unified iteration space transformation framework for sparse and dense tensor algebra

    … work addresses the problem of optimizing mixed sparse and dense tensor algebra in a compiler. I show that standard loop transformations, such as strip-mining, tiling, collapsing, parallelization and vectorization, can be applied to irregular loops over sparse iteration spaces. I also show how …

    mit Repository record for A unified iteration space transformation framework for sparse and dense tensor algebra (opens in a new tab)

  6. Unified Compilation for Lossless Compression and Sparse Computing

    Achieving high performance for computations on tensors depends heavily on the formats used to store them. While sparse tensors are very common, there are more general patterns in data which can sometimes be better captured using lossless compression. We show how to extend sparse tensor algebra

    mit Repository record for Unified Compilation for Lossless Compression and Sparse Computing (opens in a new tab)

  7. SuperTaco : Taco Tensor Algebra kernels on distributed systems using Legion

    Tensor algebra is a powerful language for expressing computation on multidimensional data. While many tensor datasets are sparse, most tensor algebra libraries have limited support for handling sparsity. The Tensor Algebra Compiler (Taco) has introduced a taxonomy for sparse tensor formats that has …

    mit Repository record for SuperTaco : Taco Tensor Algebra kernels on distributed systems using Legion (opens in a new tab)

  8. Automated Implementation of Advanced Electronic Structure Methods

    … bottleneck. As the rank of the associated tensors increases, the governing equations explode in complexity, rendering manual implementation labor-intensive, error-prone, and difficult to optimize for modern hardware. To address this challenge, this dissertation presents SeQuant, a …

    vt Repository record for Automated Implementation of Advanced Electronic Structure Methods (opens in a new tab)

  9. Toward Practical Quantum Computing Systems with Intelligent Cross-Stack Co-Design

    … decoding, and SpArch accelerator, designed for sparse tensor algebra for efficient quantum control signals generations.

    mit Repository record for Toward Practical Quantum Computing Systems with Intelligent Cross-Stack Co-Design (opens in a new tab)

  10. Efficient memory access in modern accelerators

    Submission published under a 24 month embargo labeled 'Closed Access', the embargo will last until 2024-05-01

    uiuc Repository record for Efficient memory access in modern accelerators (opens in a new tab)