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 334 for “"matrix multiplication"”.

  1. Coded Matrix Multiplication

    Matrix multiplication is a fundamental building block in many machine learning models. As the input matrices may be too large to be multiplied on a single server, it is common to split input matrices into multiple sub-matrices and execute the multiplications on different servers. However, in a …

    cuny-grad Repository record for Coded Matrix Multiplication (opens in a new tab)

  2. Practical fast matrix multiplication algorithms

    Matrix multiplication is a core building block for numerous scientific computing and, more recently, machine learning applications. Strassen's algorithm, the original Fast Matrix Multiplication (FMM) algorithm, has long fascinated computer scientists due to its startling property of reducing the …

    texas Repository record for Practical fast matrix multiplication algorithms (opens in a new tab)

  3. FPGA Based Matrix Multiplication Accelerator

    The demand for fast matrix multiplication continues to increase due to recent advances in image processing, graphics processing, digital signal processing, and communication over the wireless network. Therefore, the development of a hardware-based matrix multiplication is essential, which is …

    texas-state Repository record for FPGA Based Matrix Multiplication Accelerator (opens in a new tab)

  4. Binary tree structures for matrix multiplication

    Thesis (M.S.)--Michigan State University. Department of Electrical Engineering and Systems Science, 1983

    msu Repository record for Binary tree structures for matrix multiplication (opens in a new tab)

  5. Second-generation polyalgorithms for parallel dense-matrix multiplication

    … and Anthony Skjellum, includes fourteen dense matrix multiplication algorithms mapped onto two-dimensional process grids using the Message Passing Interface (MPI). This thesis' goal is to achieve optimized performance of parallel, dense linear algebra algorithms by varying the algorithm as a …

    utc Repository record for Second-generation polyalgorithms for parallel dense-matrix multiplication (opens in a new tab)

  6. New Results in the Complexity of Matrix Multiplication

    Determining the complexity of matrix multiplication has been a central problem in complexity theory ever since Strassen showed, in 1969, that one can multiply matrices in O(n2.81) arithmetic operations, strictly better than with the usual algorithm. Bini reduced the problem of the complexity of …

    tamu Repository record for New Results in the Complexity of Matrix Multiplication (opens in a new tab)

  7. Max-plus matrix multiplication library for GPUs - MPMML

    … CUDA Linear Algebra Subprograms (CuBLAS) [1] for matrix operations, they implement the standard matrix-multiplication (multiply-add) for floating points. We found no standard library for Max- Plus-Matrix-Multiplication (MPMM) on integers. Hence,we developed a highly tuned parallelized MPMM library …

    colostate Repository record for Max-plus matrix multiplication library for GPUs - MPMML (opens in a new tab)

  8. Efficient GPU acceleration of Compressed Matrix Multiplication - Implementation and analysis of Pagh’s algorithm for compressed matrix multiplication on massively parallel hardware

    Compressed Matrix Multiplication (CMM), introduced by Rasmus Pagh in 2013, is an approximation algorithm for computing matrix products where the result os dominated by a small number of large entries. The algorithm decomposed the matrix product into a sum of outer products, where each outer product …

    chalmers Repository record for Efficient GPU acceleration of Compressed Matrix Multiplication - Implementation and analysis of Pagh’s algorithm for compressed matrix multiplication on massively parallel hardware (opens in a new tab)

  9. A Reconfigurable FPGA Overlay Architecture for Matrix-Matrix Multiplication

    … attempts to develop hardware accelerators for matrix-matrix multiplication. Both application-specific integrated circuits (ASICs), and field-programmable arrays (FPGAs) are used for this purpose. However, a trade-off between the two platforms is that ASICs provide little flexibility after they …

    wustl Repository record for A Reconfigurable FPGA Overlay Architecture for Matrix-Matrix Multiplication (opens in a new tab)

  10. High-performance matrix multiplication on Intel and FGPA platforms

    Matrix multiplication is at the core of high-performance numerical computation. Software methods of accelerating matrix multiplication fall into two categories. One is based on calculation simplification. The other one is based on increasing the memory access efficiency. Also matrix multiplication …

    njit Repository record for High-performance matrix multiplication on Intel and FGPA platforms (opens in a new tab)

  11. Cache-Conscious Sparse Matrix Dense Matrix Multiplication on GPUs

    … graph-structured data have established sparse matrix–dense matrix multiplication (SpMM) as a fundamental kernel—particularly in graph neural networks (GNNs). Modern GPUs, with their massive parallelism and high-bandwidth memory, offer immense potential for accelerating these workloads. While …

    lsu-thes Repository record for Cache-Conscious Sparse Matrix Dense Matrix Multiplication on GPUs (opens in a new tab)

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

  13. Reconfigurable Dataflow for Efficient Matrix-Matrix Multiplication for DNN Acceleration

    General matrix-matrix multiplication (GeMM) is a principal computational bottleneck in modern deep learning workloads where performance can be heavily impeded by frequent memory accesses. This thesis introduces a multi-dataflow aware processing element (PE) designed to perform the …

    rit Repository record for Reconfigurable Dataflow for Efficient Matrix-Matrix Multiplication for DNN Acceleration (opens in a new tab)

  14. On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication

    … tool, the canonical example being the matrix multiplication. We address both the applications that make use of bilinear maps and the computation of the bilinear maps itself, Boolean matrix multiplication in particular. In the field of similarity search, we improve on Valiant's …

    aalto Repository record for On Bilinear Techniques for Similarity Search and Boolean Matrix Multiplication (opens in a new tab)

  15. Engineering an Efficient Implementation of Pagh’s Compressed Matrix Multiplication Algorithm

    Matrix multiplication is a foundational operation in many fields of science such as machine learning, scientific computing and statistics. Simultaneously, matrix multiplication is an expensive operation to perform, with the mathematical definition requiring O(n3) arithmetic operations to compute …

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

  16. Algebraic geometry for tensor networks, matrix multiplication, and flag matroids

    … tensor networks, and more specifically: uniform matrix product states. We use methods from nonlinear algebra and algebraic geometry to answer questions about topology, defining equations, and identifiability of uniform matrix product states. By an interplay of theorems from algebra, geometry, and …

    qucosa-diss

Page 1 of 17