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 6 of 6 for “"Compressed sparse row (CSR)"”.

  1. Enhancing Sparse Data Processing through Energy-Efficient Heterogeneous Architectures

    Efficiently processing sparse data is a significant challenge in many high-impact domains, including machine learning, graph analytics, and scientific computing. Sparse data representations, such as compressed sparse row (CSR), often suffer from substantial overheads during indexing and irregular …

    unt Repository record for Enhancing Sparse Data Processing through Energy-Efficient Heterogeneous Architectures (opens in a new tab)

  2. Design of complex multiply-accumulate RISC-V extension for accelerating quantum simulations

    … but its computational and memory requirements grow exponentially with the number of qubits. A significant part of the computational workload consists of complex-valued matrix–vector operations. Depending on the circuit, the corresponding unitary matrices may contain many zero-valued coefficients …

    chalmers Repository record for Design of complex multiply-accumulate RISC-V extension for accelerating quantum simulations (opens in a new tab)

  3. Proton Computed Tomography: Matrix Data Generation Through General Purpose Graphics Processing Unit Reconstruction

    … are reconstructed in pCT by solving a large and sparse system of linear equations. The size of the system necessitates matrix-partitioning and parallel reconstruction algorithms to be implemented across some sort of cluster computing architecture. The prototypical algorithm to solve the pCT …

    csusb Repository record for Proton Computed Tomography: Matrix Data Generation Through General Purpose Graphics Processing Unit Reconstruction (opens in a new tab)

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

    … and 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. …

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

  5. Compression techniques for extreme-scale graphs and matrices: sequential and parallel algorithms

    … in the states of the edges over time. With the growing popularity of social networks and the massive influx of users, it is becoming a challenging task to store the network/graph and process them as fast as possible before the property of the graph changes with the graph evolution. Graphs or …

    oklahoma-thes Repository record for Compression techniques for extreme-scale graphs and matrices: sequential and parallel algorithms (opens in a new tab)

  6. Essays on the Economic Analysis of Transportation Systems

    … In the third chapter, we develop a parallel sparse matrix-transpose-matrix multiplication algorithm using the outer product of row vectors. The outer product algorithm works with the compressed sparse row (CSR) form matrix, and as such it does not require a transposition operation prior to …

    cuny-grad Repository record for Essays on the Economic Analysis of Transportation Systems (opens in a new tab)