A stable multi-level partitioning algorithm using adaptive connectivity threshold

Jin Kuk Kim, Jong Wha Chong, Satoshi Goto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

This paper presents a new efficient and stable multi-level partitioning algorithm for VLSI circuit design. As the most previous multi-level partitioning algorithms force experimental constraints on the process of hierarchy construction, the stability of their performance goes down. In this paper, we minimize the use of experimental constraints and propose a new method for constructing partition hierarchy. The proposed method clusters the cells with the connection status of the circuit. In addition, we indicate the weakness of previous algorithms where they used a uniform method for choice of cells during the improvement. To solve the problem, we propose a new IIP(Iterative Improvement Partitioning) technique that selects the method to choose cells according to the improvement status. The experimental result on ACM/SIGDA benchmark circuits show improvement up to 2-56% in minimum cutsize over previous algorithm and our technique outperforms hMetis by 2-9% in minimum cutsize.

Original languageEnglish
Title of host publicationIEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS
Pages1-4
Number of pages4
Volume1
Publication statusPublished - 2004
Event2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology - Tainan
Duration: 2004 Dec 62004 Dec 9

Other

Other2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology
CityTainan
Period04/12/604/12/9

Fingerprint

Adaptive algorithms
Networks (circuits)
VLSI circuits

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Kim, J. K., Chong, J. W., & Goto, S. (2004). A stable multi-level partitioning algorithm using adaptive connectivity threshold. In IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS (Vol. 1, pp. 1-4)

A stable multi-level partitioning algorithm using adaptive connectivity threshold. / Kim, Jin Kuk; Chong, Jong Wha; Goto, Satoshi.

IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS. Vol. 1 2004. p. 1-4.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kim, JK, Chong, JW & Goto, S 2004, A stable multi-level partitioning algorithm using adaptive connectivity threshold. in IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS. vol. 1, pp. 1-4, 2004 IEEE Asia-Pacific Conference on Circuits and Systems, APCCAS 2004: SoC Design for Ubiquitous Information Technology, Tainan, 04/12/6.
Kim JK, Chong JW, Goto S. A stable multi-level partitioning algorithm using adaptive connectivity threshold. In IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS. Vol. 1. 2004. p. 1-4
Kim, Jin Kuk ; Chong, Jong Wha ; Goto, Satoshi. / A stable multi-level partitioning algorithm using adaptive connectivity threshold. IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS. Vol. 1 2004. pp. 1-4
@inproceedings{58e39b82aca64c9a94712a79c621cb87,
title = "A stable multi-level partitioning algorithm using adaptive connectivity threshold",
abstract = "This paper presents a new efficient and stable multi-level partitioning algorithm for VLSI circuit design. As the most previous multi-level partitioning algorithms force experimental constraints on the process of hierarchy construction, the stability of their performance goes down. In this paper, we minimize the use of experimental constraints and propose a new method for constructing partition hierarchy. The proposed method clusters the cells with the connection status of the circuit. In addition, we indicate the weakness of previous algorithms where they used a uniform method for choice of cells during the improvement. To solve the problem, we propose a new IIP(Iterative Improvement Partitioning) technique that selects the method to choose cells according to the improvement status. The experimental result on ACM/SIGDA benchmark circuits show improvement up to 2-56{\%} in minimum cutsize over previous algorithm and our technique outperforms hMetis by 2-9{\%} in minimum cutsize.",
author = "Kim, {Jin Kuk} and Chong, {Jong Wha} and Satoshi Goto",
year = "2004",
language = "English",
volume = "1",
pages = "1--4",
booktitle = "IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS",

}

TY - GEN

T1 - A stable multi-level partitioning algorithm using adaptive connectivity threshold

AU - Kim, Jin Kuk

AU - Chong, Jong Wha

AU - Goto, Satoshi

PY - 2004

Y1 - 2004

N2 - This paper presents a new efficient and stable multi-level partitioning algorithm for VLSI circuit design. As the most previous multi-level partitioning algorithms force experimental constraints on the process of hierarchy construction, the stability of their performance goes down. In this paper, we minimize the use of experimental constraints and propose a new method for constructing partition hierarchy. The proposed method clusters the cells with the connection status of the circuit. In addition, we indicate the weakness of previous algorithms where they used a uniform method for choice of cells during the improvement. To solve the problem, we propose a new IIP(Iterative Improvement Partitioning) technique that selects the method to choose cells according to the improvement status. The experimental result on ACM/SIGDA benchmark circuits show improvement up to 2-56% in minimum cutsize over previous algorithm and our technique outperforms hMetis by 2-9% in minimum cutsize.

AB - This paper presents a new efficient and stable multi-level partitioning algorithm for VLSI circuit design. As the most previous multi-level partitioning algorithms force experimental constraints on the process of hierarchy construction, the stability of their performance goes down. In this paper, we minimize the use of experimental constraints and propose a new method for constructing partition hierarchy. The proposed method clusters the cells with the connection status of the circuit. In addition, we indicate the weakness of previous algorithms where they used a uniform method for choice of cells during the improvement. To solve the problem, we propose a new IIP(Iterative Improvement Partitioning) technique that selects the method to choose cells according to the improvement status. The experimental result on ACM/SIGDA benchmark circuits show improvement up to 2-56% in minimum cutsize over previous algorithm and our technique outperforms hMetis by 2-9% in minimum cutsize.

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

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

M3 - Conference contribution

VL - 1

SP - 1

EP - 4

BT - IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS

ER -