A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2007; you can also visit the original URL.
The file type is application/pdf
.
Parallel multilevel k-way partitioning scheme for irregular graphs
1996
Proceedings of the 1996 ACM/IEEE conference on Supercomputing (CDROM) - Supercomputing '96
In this paper we present a parallel formulation of a multilevel k-way graph partitioning algorithm. A key feature of this parallel formulation is that it is able to achieve a high degree of concurrency while maintaining the high quality of the partitions produced by the serial multilevel k-way partitioning algorithm. In particular, the time taken by our parallel graph partitioning algorithm is only slightly longer than the time taken for rearrangement of the graph among processors according to
doi:10.1145/369028.369103
fatcat:fs6spatx6vbcpcvsg5jibkl3my