A Hierarchical Circuit Clustering Algorithm with Stable Performance
スポンサーリンク
概要
- 論文の詳細を見る
Clustering is almost essential in improving the performance of iterative partitioning algorithms. In this paper, we present a clustering algorithm based on the following observation: if a group of cells is assigned to the same partition in numerous local optimum solutions, it is desirable to merge the group into a cluster. The proposed algorithm finds such a group of cells from randomly generated local optimum solutions and merges it into a cluster. We implemented a multilevel bipartitioning algorithm (MBP) based on the proposed clustering algorithm. For MCNC benchmark netlists, MBP improves the total average cut size by 9% and the total best cut size by 3-4%, compared with the previous state-of-the-art partitioners.
- 社団法人電子情報通信学会の論文
- 1999-09-25
著者
-
PARK In-Cheol
Department of Electrical Engineering and Computer Science, Korea Advanced Institute of Science and T
-
Park In-cheol
Department Of Eecs Kaist
-
KYUNG Chong-Min
Department of Electrical Engineering, Korea Advanced Institute of Science and Technology
-
Kyung Chong-min
Department Of Eecs Kaist Taejon
-
Seong K‐s
Electrical Engineering Department Yeungnam University
-
KYOUNG Seung-June
Department of Electrical Engineering, Korea Advanced Institute of Science and Technology
-
SEONG Kwang-Su
Electrical Engineering Department, YeungNam University
-
Kyoung Seung-june
Department Of Electrical Engineering Korea Advanced Institute Of Science And Technology
関連論文
- An Area-Efficient and Fully Synthesizable Bluetooth Baseband Module for Wireless Communication(Integrated Electronics)
- Improving Dictionary-Based Code Compression in VLIW Architectures (Special Section on VLSI Design and CAD Algorithms)
- Parallel Decoding of Context-Based Adaptive Binary Arithmetic Codes Based on Most Probable Symbol Prediction(Image Processing and Video Processing)
- Loop and Address Code Optimization for Digital Signal Processors
- A Hierarchical Circuit Clustering Algorithm with Stable Performance
- CLASSIC:An O(n^2)-Heuristic Algorithm for Microcode Bit Optimization Based on Incompleteness Relations
- Issues on the Interface Synthesis between Intellectual Properties Operating at Different Clock Frequencies
- A New Single-Clock Flip-Flop for Half-Swing Clocking (Special Section on VLSI Design and CAD Algorithms)
- Path-Classified Trace Cache for Improving Hit Ratio in Wide-Issue Processors
- SEWD:A Cache Architecture to Speed up the Misaligned Instruction Prefetch
- An Efficient Routing Algorithm for Symmetrical FPGAs Using Reliable Cost Metrics(VLSI Design Technology and CAD)(Regular Section)
- A Supplementary Scheme for Reducing Cache Access Time