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

  1. Sparse matrix-vector multiplication by specialization

    … in the very common numerical procedure of sparse matrix-vector multiplication, in the case where a single matrix is to be multiplied by many vectors, is explored. The main objective is the evaluation of the speed-ups that can be obtained with program specialization without considering the …

    uiuc Repository record for Sparse matrix-vector multiplication by specialization (opens in a new tab)

  2. Sparse matrix-vector multiplication kernels on the Cray T3D

    <p>In this thesis we examine sparse matrix-vector multiplication algorithms for massively- parallel computers such as the CRAY T3D. Performance results on a 256-processor CRAY T3D are presented along with a detailed analysis of each algorithm's computational complexity. The specific sparse …

    ut-knoxville Repository record for Sparse matrix-vector multiplication kernels on the Cray T3D (opens in a new tab)

  3. Optimization by runtime specialization for sparse matrix-vector multiplication

    … the potential for obtaining speed-ups for sparse matrix-dense vector multipli- cation using runtime specialization, in the case where a single matrix is to be multiplied by many vectors. We experiment with five methods involving run-time specialization with parallelization, comparing them …

    uiuc Repository record for Optimization by runtime specialization for sparse matrix-vector multiplication (opens in a new tab)

  4. On implementing sparse matrix-vector multiplication on intel platform

    Sparse matrix-vector multiplication, SpMV, can be a performance bottle-neck in iterative solvers and algebraic eigenvalue problems. In this thesis, we present our sparse matrix compressed chunk storage format (CCF) and SpMV CCF kernel that realizes high performance on Intel Xeon multicore and Phi …

    uiuc Repository record for On implementing sparse matrix-vector multiplication on intel platform (opens in a new tab)

  5. Developing A New Storage Format And A Warp-Based Spmv Kernel For Configuration Interaction Sparse Matrices On The Gpu

    … state as well as multiple excited states. The CI matrix is a sparse matrix, and the bigger the CI matrix, the more electron correlation can be captured. However, due to the large size of the CI sparse matrix that is involved in CI computations, a good amount of the time spent on the eigenvalue …

    nodak Repository record for Developing A New Storage Format And A Warp-Based Spmv Kernel For Configuration Interaction Sparse Matrices On The Gpu (opens in a new tab)

  6. Βελτιστοποίηση του υπολογιστικού πυρήνα πολλαπλασιασμού αραιού πίνακα με διάνυσμα σε σύγχρονες πολυπύρηνες αρχιτεκτονικές υπολογιστών

    This thesis focuses on the optimization of the Sparse Matrix-Vector Multiplication kernel (SpMV) for modern multicore architectures. We perform an in-depth performance analysis of the kernel and identified its major performance bottlenecks. This allows us to propose an advanced storage format for …

    greece Repository record for Βελτιστοποίηση του υπολογιστικού πυρήνα πολλαπλασιασμού αραιού πίνακα με διάνυσμα σε σύγχρονες πολυπύρηνες αρχιτεκτονικές υπολογιστών (opens in a new tab)

  7. Hypergraph-Based Combinatorial Optimization of Matrix -Vector Multiplication

    The second problem we address is parallel matrix-vector multiplication for large sparse matrices. Parallel sparse matrix-vector multiplication is a particularly important numerical kernel in computational science. We have focused on optimizing the parallel performance of this operation by reducing …

    uiuc Repository record for Hypergraph-Based Combinatorial Optimization of Matrix -Vector Multiplication (opens in a new tab)

  8. A parallel eigensolver for real-space pseudopotential density functional theory calculations

    … grid partitioning improves the efficiency of the sparse matrix–vector multiplication, which is the key component of CheFSI. We will show that, by computations of confined systems with 50,000 atoms or 200,000 electrons, this method effectively reduces the communication overhead and improves the …

    texas Repository record for A parallel eigensolver for real-space pseudopotential density functional theory calculations (opens in a new tab)

  9. Computing SpMV on FPGAs

    <p>There are hundreds of papers on accelerating sparse matrix vector multiplication (SpMV), however, only a handful target FPGAs. Some claim that FPGAs inherently perform inferiorly to CPUs and GPUs. FPGAs do perform inferiorly for some applications like matrix-matrix multiplication and …

    iastate Repository record for Computing SpMV on FPGAs (opens in a new tab)

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

  11. Identification of regular patterns within sparse data structures

    Sparse matrix-vector multiplication (SpMV) is an essential computation in linear algebra. There is a well-known trade-off between operating on a dense or a sparse structure when performing SpMV. In the dense version of SpMV, useless operations are performed but the computation is amenable SIMD …

    colostate Repository record for Identification of regular patterns within sparse data structures (opens in a new tab)

  12. Accelerator Architectures for Deep Learning and Graph Processing

    … operations with low hardware and energy cost. Sparse matrix-vector multiplication (SpMV), a subset of graph processing, is the key computation in iterative solvers for scientific computing. The efficiently accelerating floating-point processing in ReRAM remains a challenge. In this …

    duke Repository record for Accelerator Architectures for Deep Learning and Graph Processing (opens in a new tab)

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

    … workload consists of complex-valued matrix–vector operations. Depending on the circuit, the corresponding unitary matrices may contain many zero-valued coefficients that do not contribute to the result. This thesis investigates whether such sparsity can be exploited using specialized …

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

  14. Novel gather and scatter hardware support for microprocessors

    … in this thesis: Past Fourier Transform (FFT) and Sparse Matrix Vector Multiplication (SpMxV). The performance of the distTree is compared with a state-of-the-art implementation in each application. The experiments have shown a 100% speedup when computing an FIT and a 200% speedup when performing a …

    unsw Repository record for Novel gather and scatter hardware support for microprocessors (opens in a new tab)

  15. Reducing communication in sparse solvers

    Sparse matrix operations dominate the cost of many scientific applications. In parallel, the performance and scalability of these operations is limited by irregular point-to-point communication. Multiple methods are investigated throughout this dissertation for reducing the cost associated with …

    uiuc Repository record for Reducing communication in sparse solvers (opens in a new tab)

  16. Managing HBM’s bandwidth in Multi-Die FPGAs using Overlay NoCs

    … and two application-based benchmarks, Dense matrix-matrix multiplication (DMM) and Sparse Matrix-Vector multiplication (SPMV). Our experiments show that NoCs can improve throughput utilization by as much as ×8.6 for single-flit global accesses,×1.7 for multi-flit global accesses with burst …

    waterloo Repository record for Managing HBM’s bandwidth in Multi-Die FPGAs using Overlay NoCs (opens in a new tab)

  17. Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication

    … thesis, we will describe our work on optimizing matrix-vector multiplication using combinatorial techniques. Our research has focused on two different problems in combinatorial scientific computing, both involving matrix-vector multiplication, and both are solved using hypergraph models. For both …

    uiuc Repository record for Hypergraph-Based Combinatorial Optimization of Matrix-Vector Multiplication (opens in a new tab)

  18. Hardware-based Parallel Computing for Real-time Simulation of Soft-object Deformation

    … of deformable objects is in solving a large but sparse linear system of equations at each time step of the simulation. Depending on the mechanical properties of the object, high-fidelity stable haptic simulations require an update rate in the order of 100 − 1000 Hz. Direct software-based …

    mcmaster Repository record for Hardware-based Parallel Computing for Real-time Simulation of Soft-object Deformation (opens in a new tab)

  19. Swift : a flexible framework for runtime performance tuning

    … applications. Swift was applied to tune sparse matrix-vector multiplication kernels. Tun{u00AC}ing such kernels requires selecting a matrix storage format and the associated multiplication algorithm. The choice of format depends on the characteristics of the matrix being multiplied as …

    anu Repository record for Swift : a flexible framework for runtime performance tuning (opens in a new tab)

  20. Performance analysis and acceleration of nuclear physics application on high-performance computing platforms using GPGPUs and topology-aware mapping techniques

    … (LA), an algorithm for diagonalization of sparse matrices that is widely used in the scientific parallel computing domain. We present techniques applied to this application which enhance its performance with the utilization of general purpose graphics processing units (GPGPUs). …

    iastate Repository record for Performance analysis and acceleration of nuclear physics application on high-performance computing platforms using GPGPUs and topology-aware mapping techniques (opens in a new tab)

Page 1 of 2