Abstract
In this paper, we present an adaptation for hypergraph partitioning of the multilevel cooperative search paradigm first introduced by Toulouse, Thulasiraman, and Glover. We also introduce a new approach for coarsening hypergraphs, and describe a parallel implementation of this algorithm on the SGI 02000 system. Experiments on ISPD98 benchmark suite of circuits show, for 4-way and 8-way partitioning, a reduction of 3% to 15% on hyperedge-cut compared to h-METIS. Bisections of hypergraphs based on our algorithm also outperforms hMETIS, although more modestly.
| Original language | English (US) |
|---|---|
| Pages | 192-198 |
| Number of pages | 7 |
| State | Published - 2000 |
| Event | ISPD-2000: International Symposium on Physical Design - San Diego, CA, USA Duration: Apr 9 2000 → Apr 12 2000 |
Other
| Other | ISPD-2000: International Symposium on Physical Design |
|---|---|
| City | San Diego, CA, USA |
| Period | 4/9/00 → 4/12/00 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering