Acer, SeherSelvitopi, OğuzAykanat, Cevdet2018-04-122018-04-122017-08-09http://hdl.handle.net/11693/37650Date of Conference: 28 August - 1 September, 2017Conference name: Euro-Par: European Conference on Parallel Processing - Euro-Par 2017: Parallel Processing 23rd International Conference on Parallel and Distributed ComputingThe 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 matrix manifests itself as high bandwidth (total and/or maximum volume) and/or high latency (total and/or maximum message count) overhead. In this work, we propose a hypergraph partitioning model which combines two earlier models for one-dimensional partitioning, one addressing total and maximum volume, and the other one addressing total volume and total message count. Our model relies on the recursive bipartitioning paradigm and simultaneously addresses three cost metrics in a single partitioning phase in order to reduce volume and latency overheads. We demonstrate the validity of our model on a large dataset that contains more than 300 matrices. The results indicate that compared to the earlier models, our model significantly improves the scalability of SpMV. © 2017, Springer International Publishing AG.EnglishCommunication costHypergraph partitioningOne-dimensional partitioningSparse matrix-vector multiplicationConference Paper10.1007/978-3-319-64203-1_45