Now showing items 1-4 of 4

    • Cache locality exploiting methods and models for sparse matrix-vector multiplication 

      Akbudak, Kadir (Bilkent University, 2009)
      The sparse matrix-vector multiplication (SpMxV) is an important kernel operation widely used in linear solvers. The same sparse matrix is multiplied by a dense vector repeatedly in these solvers to solve a system of ...
    • Hypergraph models for parallel sparse matrix-matrix multiplication 

      Akbudak, Kadir (Bilkent University, 2015-09)
      Multiplication of two sparse matrices (i.e., sparse matrix-matrix multiplication, which is abbreviated as SpGEMM) is a widely used kernel in many applications such as molecular dynamics simulations, graph operations, and ...
    • Parallelization of Sparse Matrix Kernels for big data applications 

      Selvitopu, Oğuz; Akbudak, Kadir; Aykanat, Cevdet (Springer, 2016)
      Analysis of big data on large-scale distributed systems often necessitates efficient parallel graph algorithms that are used to explore the relationships between individual components. Graph algorithms use the basic adjacency ...
    • Partitioning models for scaling parallel sparse matrix-matrix multiplication 

      Akbudak, Kadir; Selvitopi, Oğuz; Aykanat, Cevdet (Association for Computing Machinery, 2018)
      We investigate outer-product--parallel, inner-product--parallel, and row-by-row-product--parallel formulations of sparse matrix-matrix multiplication (SpGEMM) on distributed memory architectures. For each of these three ...