PT-SCOTCH: A tool for efficient parallel graph ordering

被引：230

作者：

Chevalier, C. ^{[1
]}

Pellegrini, F. ^{[1
]}

机构：

[1] LaBRI & Project ScAlApplix INRIA Futurs, ENSEIRB, F-33400 Talence, France

来源：

PARALLEL COMPUTING | 2008年 / 34卷 / 6-8期

关键词：

parallel graph ordering; parallel nested dissection; distributed-memory computer; multi-threading;

D O I：

10.1016/j.parco.2007.12.001

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

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 arc 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. (C) 2007 Elsevier B.V. All rights reserved.

引用

页码：318 / 331

页数：14