Uçar, B.Aykanat, Cevdet2016-02-082016-02-0820030302-97431611-3349http://hdl.handle.net/11693/24398We show a two-phase approach for minimizing various communication-cost metrics in fine-grain partitioning of sparse matrices for parallel processing. In the first phase, we obtain a partitioning with the existing tools on the matrix to determine computational loads of the processor. In the second phase, we try to minimize the communication-cost metrics. For this purpose, we develop communication-hypergraph and partitioning models. We experimentally evaluate the contributions on a PC cluster. © Springer-Verlag Berlin Heidelberg 2003.EnglishSparse MatriceCommunication VolumeHypergraph ModelProcessor AssignmentFold PhaseMinimizing communication cost in fine-grain partitioning of sparse matricesArticle10.1007/978-3-540-39737-3_115