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 20 of 20 for “"Sparse matrix multiplication"”.

  1. ACCELERATION OF SPARSE MATRIX MULTIPLICATION USING BIT-SERIAL ARITHMETIC

    Machine Learning inference requires the multiplication of large, sparse matrices. We argue that direct spatial implementation of these fixed matrices minimizes the work per- formed in the computation, and allows for significant reduction in latency and power through constant propagation and logic …

    gatech Repository record for ACCELERATION OF SPARSE MATRIX MULTIPLICATION USING BIT-SERIAL ARITHMETIC (opens in a new tab)

  2. Using machine learning to improve dense and sparse matrix multiplication kernels

    … about using machine learning to speed up dense matrix-matrix multiplication computations on a shared-memory computer architecture. We found that found basic loop-based matrix-matrix multiplication algorithms tied to a decision tree algorithm selector were competitive to using Intel's Math Kernel …

    iastate Repository record for Using machine learning to improve dense and sparse matrix multiplication kernels (opens in a new tab)

  3. Engineering an Efficient Implementation of Pagh’s Algorithm for Sparse Matrix Multiplication

    This thesis explores approximate matrix multiplication through the algorithm proposed by R. Pagh in Compressed Matrix Multiplication (2013) and its implementation developed by J. Andersson and M. Karppa. We identify memory bandwidth as the primary performance bottleneck and implement support for …

    chalmers Repository record for Engineering an Efficient Implementation of Pagh’s Algorithm for Sparse Matrix Multiplication (opens in a new tab)

  4. A Reconfigurable Architecture for Dense and Sparse Matrix Multiplication in Processing-in-Memory

    … (ML) and hyperdimensional computing (HDC), where matrix-vector operations dominate execution and are often memory-bound. Processing-in-Memory (PIM) architectures have emerged as a promising approach to mitigate this bottleneck by enabling computation to occur within or near memory, thereby …

    rit Repository record for A Reconfigurable Architecture for Dense and Sparse Matrix Multiplication in Processing-in-Memory (opens in a new tab)

  5. Near-memory primitive support and infratructure for sparse algorithm

    … (NDP) accelerators for primitives such as SpMV (Sparse Matrix Multiplication of Vectors) and DGEMM (Double Precision Dense Matrix Multiplication) kernels, applications can achieve a considerable performance boost. We evaluate our work for SuperLU application for the HPC community. Thesis …

    gatech Repository record for Near-memory primitive support and infratructure for sparse algorithm (opens in a new tab)

  6. Cooperative high-performance computing with FPGAs - matrix multiply case-study

    … for a few specific computing tasks: dense matrix multiplication, sparse matrix transposition and sparse matrix multiplication. In the first instance we give limits of problem size and estimates of performance that should be attainable with present-day FPGA hardware.

    bu Repository record for Cooperative high-performance computing with FPGAs - matrix multiply case-study (opens in a new tab)

  7. Nonlinear Prediction in Credit Forecasting and Cloud Computing Deployment Optimization

    … adulthood. The second problem is analysis of matrix multiplication in cloud computing.</p><p>The goal of the credit forecasting problem is to determine if there is a link between personality assessments of young adults with their propensity to develop credit in middle age. The data we use is …

    duke Repository record for Nonlinear Prediction in Credit Forecasting and Cloud Computing Deployment Optimization (opens in a new tab)

  8. QuadriSparse: RISC-V Sparse Matrix Accelerator and ISA Extension - A Tightly-Coupled Sparse-Dense Matrix Multiplication Accelerator for RISC-V

    Sparse dense matrix multiplication (SpMM) is an important operation in many applications such as inference and training of pruned large language models, graph analytics and scientific computing. These applications often operate on data that is inherently sparse. Applying dense matrix multiplication …

    chalmers Repository record for QuadriSparse: RISC-V Sparse Matrix Accelerator and ISA Extension - A Tightly-Coupled Sparse-Dense Matrix Multiplication Accelerator for RISC-V (opens in a new tab)

  9. High performance computing for irregular algorithms and applications with an emphasis on big data analytics

    … such as graph algorithms, sorting, and sparse matrix multiplication, present numerous programming challenges, including scalability, load balancing, and efficient memory utilization. In this age of Big Data we face additional challenges since the data is often streaming at a high …

    gatech Repository record for High performance computing for irregular algorithms and applications with an emphasis on big data analytics (opens in a new tab)

  10. Designing and finding very fast distributed algorithms for bounded-degree graphs

    … the setting where the communication network is sparse, i.e., it has a bounded degree. We first study a family of problems that can be characterized by a fact that their solutions can be locally checked for correctness. This rich family is called locally checkable labeling (LCL) problems and …

    aalto Repository record for Designing and finding very fast distributed algorithms for bounded-degree graphs (opens in a new tab)

  11. Data Tiling for Sparse Computation

    … others. Such relationship data is frequently sparse and analysis on it is called sparse computation. We demonstrate that the important technique of data tiling is more powerful than previously known by broadening its application space. We focus on three important sparse computation areas: …

    gatech Repository record for Data Tiling for Sparse Computation (opens in a new tab)

  12. Improving Efficiency in Deep Learning for Large Scale Visual Recognition

    … Convolutional Neural Networks (CNN) and employ sparse decomposition to significantly reduce both the amount of parameters and computational complexity. Both inter-channel and inner-channel redundancy is exploit to achieve more than 90\% sparsity with approximately 1\% drop of classification …

    ucf Repository record for Improving Efficiency in Deep Learning for Large Scale Visual Recognition (opens in a new tab)

  13. 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)

  14. Design and Generation of Efficient Hardware Accelerators for Sparse and Dense Tensor Computations

    … use tensor computations primarily in the form of matrix-matrix and matrix-vector multiplications. The tensor computations often used in many of these fields operate on sparse data where most of the elements are zeros. Traditionally, tensor computations have been performed on CPUs and GPUs, both of …

    cornell Repository record for Design and Generation of Efficient Hardware Accelerators for Sparse and Dense Tensor Computations (opens in a new tab)

  15. Three-dimensional Passive Cavitation Mapping during Laser Lithotripsy

    … architecture was developed. By optimizing sparse-matrix multiplication, the reconstruction latency was reduced to under 1 ms, enabling the spatiotemporal decoupling of complex cascading cavitation events. To further bridge the gap to clinical application, a custom 5 MHz, 256-element planar …

    duke Repository record for Three-dimensional Passive Cavitation Mapping during Laser Lithotripsy (opens in a new tab)

  16. Analytical Modeling and Efficient Implementation for Specialized Hardware Acceleration of Sparse Applications

    Sparse linear algebra (SLA) underpins a wide range of critical applications, including data analytics, graph processing, deep learning, and transformers. In light of the growing footprints of sparse processing and diminishing benefits of generalpurpose scaling, recent years have seen an active body …

    cornell Repository record for Analytical Modeling and Efficient Implementation for Specialized Hardware Acceleration of Sparse Applications (opens in a new tab) Embargoed until 2028-06-18

  17. Nonnegative matrix factorization for clustering

    This dissertation shows that nonnegative matrix factorization (NMF) can be extended to a general and efficient clustering method. Clustering is one of the fundamental tasks in machine learning. It is useful for unsupervised knowledge discovery in a variety of applications such as text mining and …

    gatech Repository record for Nonnegative matrix factorization for clustering (opens in a new tab)

  18. High-Performance Computational Kernels for Algorithm-System Co-Design in Machine Learning: Enabling Efficient GCN Training and LLM Inference Serving.

    … recommendation systems, yet their reliance on sparse general matrix–matrix multiplication (SpGEMM) makes them highly sensitive to GPU memory constraints and irregular access patterns. As graph data scales, out-of-core computation becomes inevitable, but existing systems are hindered by I/O …

    ucf Repository record for High-Performance Computational Kernels for Algorithm-System Co-Design in Machine Learning: Enabling Efficient GCN Training and LLM Inference Serving. (opens in a new tab)