Browsing by Keywords "One-dimensional partitioning"

Now showing items 1-4 of 4

    • Addressing volume and latency overheads in 1d-parallel sparse matrix-vector multiplication 

      Acer, Seher; Selvitopi, Oğuz; Aykanat, Cevdet (Springer, 2017-08-09)
      The scalability of sparse matrix-vector multiplication (SpMV) on distributed memory systems depends on multiple factors that involve different communication cost metrics. The irregular sparsity pattern of the coefficient ...

    • Fast optimal load balancing algorithms for 1D partitioning 

      Pınar, A.; Aykanat, Cevdet (Academic Press, 2004)
      The one-dimensional decomposition of nonuniform workload arrays with optimal load balancing is investigated. The problem has been studied in the literature as the "chains-on-chains partitioning" problem. Despite the rich ...

    • 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 ...

    • One-dimensional partitioning for heterogeneous systems: theory and practice 

      Pınar, A.; Tabak, E. K.; Aykanat, Cevdet (Academic Press, 2008-11)
      We study the problem of one-dimensional partitioning of nonuniform workload arrays, with optimal load balancing for heterogeneous systems. We look at two cases: chain-on-chain partitioning, where the order of the processors ...