Name
Abstract | ||
|---|---|---|
Partitioning graphs into blocks of roughly equal size such that few edges run between blocks is a frequently needed operation in processing graphs. Recently, size, variety, and structural complexity of these networks has grown dramatically. Unfortunately, previous approaches to parallel graph partitioning have problems in this context since they often show a negative trade-off between speed and quality. We present an approach to multi-level shared-memory parallel graph partitioning that guarantees balanced solutions, shows high speed-ups for a variety of large graphs and yields very good quality independently of the number of cores used. For example, on 31 cores, our algorithm partitions our largest test instance into 16 blocks cutting less than half the number of edges than our main competitor when both algorithms are given the same amount of time. Important ingredients include parallel label propagation, parallel initial partitioning, a simple yet effective approach to parallel localized local search, and cache-aware hash tables. |
Year | DOI | Venue |
|---|---|---|
2018 | 10.1007/978-3-319-96983-1_47 | european conference on parallel processing |
DocType | Volume | Citations |
Conference | abs/1710.08231 | 4 |
PageRank | References | Authors |
0.38 | 20 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yaroslav Akhremtsev | 1 | 14 | 2.04 |
| peter sanders | 2 | 361 | 29.35 |
| Christian Schulz | 3 | 240 | 24.10 |