Engineering a Scalable High Quality Graph Partitioner

Details Engineering a Scalable High Quality Graph Partitioner Engineering a Scalable High Quality Graph Partitioner

2009-10-11

arxiv.org/abs/0910.2004v2

Computer Science

Distributed, Parallel, and Cluster Computing

Scientific paper

We describe an approach to parallel graph partitioning that scales to hundreds of processors and produces a high solution quality. For example, for many instances from Walshaw's benchmark collection we improve the best known partitioning. We use the well known framework of multi-level graph partitioning. All components are implemented by scalable parallel algorithms. Quality improvements compared to previous systems are due to better prioritization of edges to be contracted, better approximation algorithms for identifying matchings, better local search heuristics, and perhaps most notably, a parallelization of the FM local search algorithm that works more locally than previous approaches.

Affiliated with

Also associated with

No associations

Rating

Engineering a Scalable High Quality Graph Partitioner does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Engineering a Scalable High Quality Graph Partitioner, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Engineering a Scalable High Quality Graph Partitioner will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-99100