Multilevel cooperative search: Application to the circuit/hypergraph partitioning problem

Min Ouyang, Michel Toulouse, Krishnaiyan Thulasiraman, Fred Glover, Jitender S. Deogun

Research output: Contribution to conferencePaper

9 Citations (Scopus)

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 languageEnglish (US)
Pages192-198
Number of pages7
StatePublished - Jan 1 2000
EventISPD-2000: International Symposium on Physical Design - San Diego, CA, USA
Duration: Apr 9 2000Apr 12 2000

Other

OtherISPD-2000: International Symposium on Physical Design
CitySan Diego, CA, USA
Period4/9/004/12/00

Fingerprint

Networks (circuits)
Coarsening
Experiments

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Cite this

Ouyang, M., Toulouse, M., Thulasiraman, K., Glover, F., & Deogun, J. S. (2000). Multilevel cooperative search: Application to the circuit/hypergraph partitioning problem. 192-198. Paper presented at ISPD-2000: International Symposium on Physical Design, San Diego, CA, USA, .

Multilevel cooperative search : Application to the circuit/hypergraph partitioning problem. / Ouyang, Min; Toulouse, Michel; Thulasiraman, Krishnaiyan; Glover, Fred; Deogun, Jitender S.

2000. 192-198 Paper presented at ISPD-2000: International Symposium on Physical Design, San Diego, CA, USA, .

Research output: Contribution to conferencePaper

Ouyang, M, Toulouse, M, Thulasiraman, K, Glover, F & Deogun, JS 2000, 'Multilevel cooperative search: Application to the circuit/hypergraph partitioning problem', Paper presented at ISPD-2000: International Symposium on Physical Design, San Diego, CA, USA, 4/9/00 - 4/12/00 pp. 192-198.
Ouyang M, Toulouse M, Thulasiraman K, Glover F, Deogun JS. Multilevel cooperative search: Application to the circuit/hypergraph partitioning problem. 2000. Paper presented at ISPD-2000: International Symposium on Physical Design, San Diego, CA, USA, .
Ouyang, Min ; Toulouse, Michel ; Thulasiraman, Krishnaiyan ; Glover, Fred ; Deogun, Jitender S. / Multilevel cooperative search : Application to the circuit/hypergraph partitioning problem. Paper presented at ISPD-2000: International Symposium on Physical Design, San Diego, CA, USA, .7 p.
@conference{f52001704c1a48c68e9127ffc6246ee6,
title = "Multilevel cooperative search: Application to the circuit/hypergraph partitioning problem",
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.",
author = "Min Ouyang and Michel Toulouse and Krishnaiyan Thulasiraman and Fred Glover and Deogun, {Jitender S.}",
year = "2000",
month = "1",
day = "1",
language = "English (US)",
pages = "192--198",
note = "ISPD-2000: International Symposium on Physical Design ; Conference date: 09-04-2000 Through 12-04-2000",

}

TY - CONF

T1 - Multilevel cooperative search

T2 - Application to the circuit/hypergraph partitioning problem

AU - Ouyang, Min

AU - Toulouse, Michel

AU - Thulasiraman, Krishnaiyan

AU - Glover, Fred

AU - Deogun, Jitender S.

PY - 2000/1/1

Y1 - 2000/1/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=0033692222&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033692222&partnerID=8YFLogxK

M3 - Paper

AN - SCOPUS:0033692222

SP - 192

EP - 198

ER -