Department of Computer Engineering
S E M I N A R
Hypergraph partitioning on Parallel Systems
Hypergraph partitioning is a process that is being used to find solutions for optimization problems in areas such as volume rendering, information retrieval and VLSI circuit design. Since realizing this task is an NP-complete problem, several heuristic algorithms that seek sub-optimal, polynomial-time solutions are used. As the problem size gets large, both time and memory limitations become apparent, rendering sequential heuristics inadequate and forcing us to seek parallel solutions. We will discuss the design and implementation of such a solution to this problem, partially based on existing parallel graph partitioning methods.
DATE: April 18, 2005, Monday @ 15:40
PLACE: EA 409