Friday, March 14

9:30 AM-11:30 AM
Nicollet D3

Graph Partitioning: Parallel Algorithms and Applications

Graph partitioning is a fundamental problem in several scientific and engineering applications, such as VLSI design, task partitioning for parallel processing, and iterative and direct sparse linear solvers. Researchers have been following several approaches that vary in terms of their scope of application, computation cost, parallelizability, and partitioning quality. In this minisymposium, the speakers will discuss parallel algorithms and parallel applications of graph partitioning.

Organizer: Anshul Gupta
IBM T. J. Watson Research Center

9:30 A Local Graph Partitioning Heuristic Meeting Bisection Bounds
Burkhard Monien and Ralf Diekmann, University of Paderborn, Germany
10:00 A Coarse-Grain Parallel Formulation of Multilevel k-way Graph Partitioning Algorithm
George Karypis, University of Minnesota, Minneapolis
10:30 MLB: Multilevel Load Balancing for Structured Grid Applications
Daniel J. Quinlan and Markus Berndt, Los Alamos National Laboratory
11:00 Spreading Metric Based Graph Partitioning Algorithms
Guy Even, University des Saarlandes, Germany; Joseph (Seffi) Naor, Technion, Israel; Satish Rao, NEC Research; and Baruch Schieber, IBM T. J. Watson Research Center

PP97 Homepage | Program Updates|
Registration | Hotel Information | Transportation | Program Overview | Program-at-a-Glance

MMD, 1/25/97