Multilevel cooperative search for the circuit/hypergraph partitioning problem

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

Research output: Contribution to journalArticle

19 Citations (Scopus)

Abstract

The objectives in this paper are twofold: design an approach for the netlist partitioning problem using the cooperative multilevel search paradigm introduced by Toulouse et al. and study the effectiveness of this paradigm for solving combinatorial optimization problems, in particular, those arising in the very large scale integration (VLSI) computer-aided design (CAD) area. The authors present a cooperative multilevel search algorithm CoMHP and describe a parallel implementation on the SGI O2000 system. Experiments on ISPD98 benchmark suite of circuits show, for four-way and eight-way partitioning, a reduction of 3% to 15% in the size of hyperedge cuts compared to those obtained by hMETIS. Bisections of hypergraphs based on the algorithm also outperform hMETIS, although more modestly. The authors present experimental results to demonstrate that the cooperation scheme plays a key role in the performance of CoMHP. In fact, the improvement in the quality of the solutions produced by CoMHP is to a large extent independent of the partitioners used in the implementation of CoMHP. The experimental results also demonstrate the effectiveness of the cooperative multilevel search paradigm for solving the netlist partitioning problem and show that the cooperative multilevel search strategy can be used as a paradigm for designing effective solution techniques for combinatorial optimization problems such as those arising in the VLSI CAD area.

Original languageEnglish (US)
Pages (from-to)685-693
Number of pages9
JournalIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Volume21
Issue number6
DOIs
StatePublished - Jun 1 2002

Fingerprint

VLSI circuits
Combinatorial optimization
Computer aided design
Networks (circuits)
Experiments

Keywords

  • Combinatorial optimization
  • Cooperative search
  • Graph partitioning
  • Multilevel algorithms
  • VLSI physical design

ASJC Scopus subject areas

  • Software
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering

Cite this

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

In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol. 21, No. 6, 01.06.2002, p. 685-693.

Research output: Contribution to journalArticle

Ouyang, Min ; Toulouse, Michel ; Thulasiraman, Krishnaiyan ; Glover, Fred ; Deogun, Jitender S. / Multilevel cooperative search for the circuit/hypergraph partitioning problem. In: IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. 2002 ; Vol. 21, No. 6. pp. 685-693.
@article{f2301e8ef599417aa8c555129dc6e3b3,
title = "Multilevel cooperative search for the circuit/hypergraph partitioning problem",
abstract = "The objectives in this paper are twofold: design an approach for the netlist partitioning problem using the cooperative multilevel search paradigm introduced by Toulouse et al. and study the effectiveness of this paradigm for solving combinatorial optimization problems, in particular, those arising in the very large scale integration (VLSI) computer-aided design (CAD) area. The authors present a cooperative multilevel search algorithm CoMHP and describe a parallel implementation on the SGI O2000 system. Experiments on ISPD98 benchmark suite of circuits show, for four-way and eight-way partitioning, a reduction of 3{\%} to 15{\%} in the size of hyperedge cuts compared to those obtained by hMETIS. Bisections of hypergraphs based on the algorithm also outperform hMETIS, although more modestly. The authors present experimental results to demonstrate that the cooperation scheme plays a key role in the performance of CoMHP. In fact, the improvement in the quality of the solutions produced by CoMHP is to a large extent independent of the partitioners used in the implementation of CoMHP. The experimental results also demonstrate the effectiveness of the cooperative multilevel search paradigm for solving the netlist partitioning problem and show that the cooperative multilevel search strategy can be used as a paradigm for designing effective solution techniques for combinatorial optimization problems such as those arising in the VLSI CAD area.",
keywords = "Combinatorial optimization, Cooperative search, Graph partitioning, Multilevel algorithms, VLSI physical design",
author = "Min Ouyang and Michel Toulouse and Krishnaiyan Thulasiraman and Fred Glover and Deogun, {Jitender S}",
year = "2002",
month = "6",
day = "1",
doi = "10.1109/TCAD.2002.1004312",
language = "English (US)",
volume = "21",
pages = "685--693",
journal = "IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems",
issn = "0278-0070",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "6",

}

TY - JOUR

T1 - Multilevel cooperative search for the circuit/hypergraph partitioning problem

AU - Ouyang, Min

AU - Toulouse, Michel

AU - Thulasiraman, Krishnaiyan

AU - Glover, Fred

AU - Deogun, Jitender S

PY - 2002/6/1

Y1 - 2002/6/1

N2 - The objectives in this paper are twofold: design an approach for the netlist partitioning problem using the cooperative multilevel search paradigm introduced by Toulouse et al. and study the effectiveness of this paradigm for solving combinatorial optimization problems, in particular, those arising in the very large scale integration (VLSI) computer-aided design (CAD) area. The authors present a cooperative multilevel search algorithm CoMHP and describe a parallel implementation on the SGI O2000 system. Experiments on ISPD98 benchmark suite of circuits show, for four-way and eight-way partitioning, a reduction of 3% to 15% in the size of hyperedge cuts compared to those obtained by hMETIS. Bisections of hypergraphs based on the algorithm also outperform hMETIS, although more modestly. The authors present experimental results to demonstrate that the cooperation scheme plays a key role in the performance of CoMHP. In fact, the improvement in the quality of the solutions produced by CoMHP is to a large extent independent of the partitioners used in the implementation of CoMHP. The experimental results also demonstrate the effectiveness of the cooperative multilevel search paradigm for solving the netlist partitioning problem and show that the cooperative multilevel search strategy can be used as a paradigm for designing effective solution techniques for combinatorial optimization problems such as those arising in the VLSI CAD area.

AB - The objectives in this paper are twofold: design an approach for the netlist partitioning problem using the cooperative multilevel search paradigm introduced by Toulouse et al. and study the effectiveness of this paradigm for solving combinatorial optimization problems, in particular, those arising in the very large scale integration (VLSI) computer-aided design (CAD) area. The authors present a cooperative multilevel search algorithm CoMHP and describe a parallel implementation on the SGI O2000 system. Experiments on ISPD98 benchmark suite of circuits show, for four-way and eight-way partitioning, a reduction of 3% to 15% in the size of hyperedge cuts compared to those obtained by hMETIS. Bisections of hypergraphs based on the algorithm also outperform hMETIS, although more modestly. The authors present experimental results to demonstrate that the cooperation scheme plays a key role in the performance of CoMHP. In fact, the improvement in the quality of the solutions produced by CoMHP is to a large extent independent of the partitioners used in the implementation of CoMHP. The experimental results also demonstrate the effectiveness of the cooperative multilevel search paradigm for solving the netlist partitioning problem and show that the cooperative multilevel search strategy can be used as a paradigm for designing effective solution techniques for combinatorial optimization problems such as those arising in the VLSI CAD area.

KW - Combinatorial optimization

KW - Cooperative search

KW - Graph partitioning

KW - Multilevel algorithms

KW - VLSI physical design

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

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

U2 - 10.1109/TCAD.2002.1004312

DO - 10.1109/TCAD.2002.1004312

M3 - Article

VL - 21

SP - 685

EP - 693

JO - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

JF - IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

SN - 0278-0070

IS - 6

ER -