In this paper, we present a new graph model of sparse matrix decomposition for parallel sparse matrix-vector multiplication. Our model differs from previous graph-based approaches in two main respects. Firstly, our model is based on edge colouring rather than vertex partitioning. Secondly, our model is able to correctly quantify and minimise the total communication volume of the parallel sparse matrix-vector multiplication while maintaining the computational load balance across the processors. We show that our graph edge colouring model is equivalent to the fine-grained hypergraph partitioning-based sparse matrix decomposition model. We conjecture that the existence of such a graph model should lead to faster serial and parallel sparse matrix decomposition heuristics and associated tools. © Springer-Verlag Berlin Heidelberg 2006.
CITATION STYLE
Trifunović, A., & Knottenbelt, W. (2006). A general graph model for representing exact communication volume in parallel sparse matrix-vector multiplication. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4263 LNCS, pp. 813–824). Springer Verlag. https://doi.org/10.1007/11902140_85
Mendeley helps you to discover research relevant for your work.