CSE 260 (Fall 2006): Lecture 17

Today's reading:

• Graph Partitioning, Part I, Jim Demmel, UC Berkeley. Skip section on Partitioning Graphs with Coordinate Information, but DO read the section on partitioning without Coordinate information
• Graph Partitioning, Part II, Jim Demmel, UC Berkeley.
  Read the last section on PARTI. For a more detailed discussion about the theoretical basis for spectral bisection, read the entire document.

For further reading

• "A Coarse-Grain Parallel Formulation of a Multilevel k-way Graph Partitioning Algorithm," by George Karypis and Vipin Kumar. Proc 8th SIAM Conf. on Parallel Processing for Scientific Computing (1997). This paper presents the parallel K-way partitioning algorithm used in ParMetis.

• The serial algorithm is presented here: "Multilevel k-way Partitioning Scheme for Irregular Graphs," by George Karypis and Vipin Kumar, J. Parallel and Distributed Computing 48(1):96-129 (1998).

• Also see: "A fast and high quality multilevel scheme for partitioning irregular graphs," by G. Karypis and V. Kumar.
• ``Load Balancing Fictions, Falsehoods and Falacies,'' by Bruce Hendrickson. Applied Mathematical Modelling. http://www.cs.sandia.gov/Zoltan/Zoltan_pubs.html

• Parmetis web site: http://www-users.cs.umn.edu/~karypis/metis/parmetis/

• Zoltan web site: http://www.cs.sandia.gov/Zoltan

Slides from today's lecture    pdf   POSTED