Now showing items 1-4 of 4

    • 1.5D parallel sparse matrix-vector multiply 

      Kayaaslan, E.; Aykanat, Cevdet; Uçar, B. (Society for Industrial and Applied Mathematics, 2018)
      There are three common parallel sparse matrix-vector multiply algorithms: 1D row-parallel, 1D column-parallel, and 2D row-column-parallel. The 1D parallel algorithms offer the advantage of having only one communication ...
    • ON two-dimensional sparse matrix partitioning: models, methods, and a recipe 

      Çatalyürek, U. V.; Aykanat, Cevdet; Uçar, A. (Society for Industrial and Applied Mathematics, 2010)
      We consider two-dimensional partitioning of general sparse matrices for parallel sparse matrix-vector multiply operation. We present three hypergraph-partitioning-based methods, each having unique advantages. The first one ...
    • Reducing latency cost in 2D sparse matrix partitioning models 

      Selvitopi, O.; Aykanat, Cevdet (Elsevier BV, 2016)
      Sparse matrix partitioning is a common technique used for improving performance of parallel linear iterative solvers. Compared to solvers used for symmetric linear systems, solvers for nonsymmetric systems offer more ...
    • Site-based partitioning and repartitioning techniques for parallel pagerank computation 

      Cevahir, A.; Aykanat, Cevdet; Turk, A.; Cambazoglu, B. B. (Institute of Electrical and Electronics Engineers, 2011-05)
      The PageRank algorithm is an important component in effective web search. At the core of this algorithm are repeated sparse matrix-vector multiplications where the involved web matrices grow in parallel with the growth of ...