%0 Journal Article %1 chevalier2008ptscotch %A Chevalier, C. %A Pellegrini, F. %D 2008 %J Parallel Computing %K 05c70-factorization-matching-partitioning %N 6 %P 318 - 331 %R 10.1016/j.parco.2007.12.001 %T PT-Scotch: A tool for efficient parallel graph ordering %U http://www.sciencedirect.com/science/article/pii/S0167819107001342 %V 34 %X The parallel ordering of large graphs is a difficult problem, because on the one hand minimum degree algorithms do not parallelize well, and on the other hand the obtainment of high quality orderings with the nested dissection algorithm requires efficient graph bipartitioning heuristics, the best sequential implementations of which are also hard to parallelize. This paper presents a set of algorithms, implemented in the PT-Scotch software package, which allows one to order large graphs in parallel, yielding orderings the quality of which is only slightly worse than the one of state-of-the-art sequential algorithms. Our implementation uses the classical nested dissection approach but relies on several novel features to solve the parallel graph bipartitioning problem. Thanks to these improvements, PT-Scotch produces consistently better orderings than ParMeTiS on large numbers of processors.

@article{chevalier2008ptscotch, abstract = {The parallel ordering of large graphs is a difficult problem, because on the one hand minimum degree algorithms do not parallelize well, and on the other hand the obtainment of high quality orderings with the nested dissection algorithm requires efficient graph bipartitioning heuristics, the best sequential implementations of which are also hard to parallelize. This paper presents a set of algorithms, implemented in the PT-Scotch software package, which allows one to order large graphs in parallel, yielding orderings the quality of which is only slightly worse than the one of state-of-the-art sequential algorithms. Our implementation uses the classical nested dissection approach but relies on several novel features to solve the parallel graph bipartitioning problem. Thanks to these improvements, PT-Scotch produces consistently better orderings than ParMeTiS on large numbers of processors.}, added-at = {2019-10-31T01:15:53.000+0100}, author = {Chevalier, C. and Pellegrini, F.}, biburl = {https://www.bibsonomy.org/bibtex/2ec96d06618e9dfba8e6aa63a0b8b969a/gdmcbain}, doi = {10.1016/j.parco.2007.12.001}, interhash = {b03bbbfe382e0a6170dacaa29577ed1a}, intrahash = {ec96d06618e9dfba8e6aa63a0b8b969a}, issn = {0167-8191}, journal = {Parallel Computing}, keywords = {05c70-factorization-matching-partitioning}, number = 6, pages = {318 - 331}, timestamp = {2019-10-31T01:15:53.000+0100}, title = {PT-Scotch: A tool for efficient parallel graph ordering}, url = {http://www.sciencedirect.com/science/article/pii/S0167819107001342}, volume = 34, year = 2008 }