Flip-flop clustering by weighted K-means algorithm
Authors:
Open Access
- 5 June 2016
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 1-6
Abstract
This paper presents a novel flip-flop clustering and relocation framework to help reduce the overall chip power consumption. Given an initial legalized placement, our goal is to reduce the wirelength of the clock network by reducing distance between flip-flops and their drivers, while minimize the disturbance of original placement result. The idea is to form flip-flops into clusters, such that all flip-flops within each cluster can be placed near a single clock buffer and connected by a simple routing structure. Therefore, overall clock network wirelength can be greatly reduced and significant power savings can be achieved. In particular, we propose a modified K-means algorithm which effectively assigns flops into clusters at the clustering step. Then, at the relocation step, flops are actually relocated and regularly structured clusters are formed. Our framework is evaluated on real industrial benchmarks. We compare our framework with a flow without flop clustering and an industrial window based flop clustering flow. Experimental results show our framework can achieve significant dynamic power savings while has less disturbance of the original placement.Keywords
This publication has 16 references indexed in Scilit:
- Analytical Clustering Score with Application to Post-Placement Multi-Bit Flip-Flop Merging2015
- Clock power minimization using structured latch templates and decision tree induction2013
- Obstacle-Aware Clock-Tree Shaping During PlacementIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2012
- INTEGRA: Fast Multibit Flip-Flop Clustering for Clock Power SavingIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, 2012
- Physical Synthesis with Clock-Network Optimization for Large Systems on ChipsIEEE Micro, 2011
- Data clustering: 50 years beyond K-meansPattern Recognition Letters, 2010
- How Fast Is the k-Means Method?Algorithmica, 2004
- Combined dynamic voltage scaling and adaptive body biasing for lower power microprocessors under dynamic workloads2006 IEEE/ACM International Conference on Computer Aided Design, 2002
- Clock-gating and its application to low power design of sequential circuitsIEEE Transactions on Circuits and Systems I: Regular Papers, 2000
- Least squares quantization in PCMIEEE Transactions on Information Theory, 1982