research-article

Power-driven flip-flop merging and relocation

Authors:

Shao-Huan Wang,

Wai-Kei MakAuthors Info & Claims

ISPD '11: Proceedings of the 2011 international symposium on Physical design

Pages 107 - 114

https://doi.org/10.1145/1960397.1960423

Published: 27 March 2011 Publication History

Abstract

We propose a power-driven flip-flop merging and relocation approach that can be applied after conventional timing-driven placement and before clock network synthesis. It targets to reduce the clock network size and thus the clock power consumption, as well as the switching power of the nets connected to the flip-flops by selectively merging flip-flops into multi-bit flip-flops and relocating them under timing and placement density constraints. The experimental results are very encouraging. For a set of benchmarks, our approach reduced the clock wirelength by 30 to 50%. Meanwhile, the switching power of signal nets connected to the flip-flops were reduced by 2 to 43%.

References

[1]

D. Liu and C. Svensson. Power consumption estimation in cmos vlsi circuits. IEEE Solid-State Circuits, 29:663--670, 1994.

[2]

K. Wang and M. Marek-Sadowska. Buffer sizing for clock power minimization subject to general skew constraints. In Design Automation Conference, pages 153--156, 2004.

Digital Library

[3]

G. Wilke and R. Reis. A new clock mesh buffer sizing methodology for skew and power reduction. In IEEE Computer Society Annual Symposium on VLSI, pages 227--232, 2008.

Digital Library

[4]

A.S. Seyedi, S.H. Rasouli, A. Amirabadi, and A. Afzali-Kusha. Low power low leakage clock gated static pulsed flip-flop. In IEEE International Symposium on Circuits and Systems, pages 3658--3611, 2006.

[5]

S. Naik and R. Chandel. Design of a low power flip-flop using cmos deep sub micron technology. In International Conference on Recent Trends in Information, Telecommunication and Computing, pages 253--256, 2010.

Digital Library

[6]

C.C. Yu. Design of low-power double edge-triggered flip-flop circuit. In IEEE Conference on Industrial Electronics and Applications, pages 2054--2057, 2007.

[7]

S.K. Teng and N. Soin. Low power clock gates optimization for clock tree distribution. In International Symposium on Quality Electronic Design, pages 488--492, 2010.

[8]

M. Donno, A. Ivaldi, L. Benini, and E. Macii. Clock-tree power optimization based on RTL clock-gating. In Design Automation Conference, pages 622--627, 2003.

Digital Library

[9]

Q. Wu, M. Pedram, and X. Wu. Clock-gating and its application to low power design of sequential circuits. IEEE Transactions on Circuits Systems I, 47(3):415--420, 2000.

[10]

Y. Cheon, P.H. Ho, A.B. Kahng, S. Reda, and Q. Wang. Power-aware placement. In Design Automation Conference, pages 227--232, 2008.

Digital Library

[11]

Y. Lua, C.N. Sze, X. Hong, Q. Zhou, Y. Cai, L. Huang, and J. Hu. Navigating registers in placement for clock network minimization. In Design Automation Conference, pages 176--181, 2005.

Digital Library

[12]

W. Hou, D. Liu, and P.H. Ho. Automatic register banking for low-power clock trees. In International Symposium on Quality Electronic Design, pages 647--652, 2009.

Digital Library

[13]

R.P. Pokala, R.A. Feretich, and R.W. McGuffin. Physical synthesis for performance optimization. In IEEE International ASIC Conference and Exhibit, 1992.

[14]

Y. Kretchmer. Using multi-bit register inference to save area and power: the good, the bad, and the ugly. In EE Times Asia, 2001.

[15]

Y.T. Chang, C.C. Hsu, P.H. Lin, Y.W. Tsai, and S.F. Chen. Post-placement power optimization with multi-bit flip-flops. In IEEE/ACM International Conference on Computer-Aided Design, 2010.

Digital Library

[16]

G. Chabert, L. Jaulin, and X. Lorca. A constraint on the number of distinct vectors with application to localization. Technical report, Small workshop on Interval Methods, 2009.

[17]

U. Brenner and J. Vygen. Legalizing a placement with minimum total movement. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, pages 1597--1613, 2004.

Digital Library

[18]

S. Chou and T.Y. Ho. OAL: An obstacle-aware legalization in standard cell placement with displacement minimization. In IEEE International SOC Conference, pages 329--332, 2009.

[19]

M.I. Shamos and D. Hoey. Geometric intersection problems. In IEEE Symposium on Foundations of Computer Science, 1991.

[20]

H. Abelson, J. Sussman, and J. Sussman. Structure and Interpretation of Computer Programs. MIT, 1984.

Digital Library

[21]

CAD contest of taiwan. http://cad\_contest.ee.ntu.edu.tw/cad10/Problems/B1\_Faraday\_091223\_MultiBitFF.pdf.

[22]

R.S. Tsay. Exact zero skew. In IEEE International Conference on Computer-Aided Design, pages 336--339, 1991.

[23]

A.B. Kahng and C.W. Tsao. Bounded-skew clock tree routing - version 1.0. http://vlsicad.ucsd.edu/GSRC/bookshelf/Slots/BST/.

Cited By

Cai YZhu LGuo XNakamura YWang Y(2025)Revisit MBFF: Efficient Early-Stage Multi-bit Flip-Flops Clustering with Physical and Timing AwarenessProceedings of the 30th Asia and South Pacific Design Automation Conference10.1145/3658617.3697725(1230-1236)Online publication date: 20-Jan-2025
https://dl.acm.org/doi/10.1145/3658617.3697725
Hyun DKoh SJung YKim TShin Y(2023)Routability Optimization of Extreme Aspect Ratio Design through Non-uniform Placement Utilization and Selective Flip-flop StackingACM Transactions on Design Automation of Electronic Systems10.1145/357338728:4(1-19)Online publication date: 17-May-2023
https://dl.acm.org/doi/10.1145/3573387
Chang YLin TJiang INam GBustany ISwartz W(2019)Graceful Register Clustering by Effective Mean Shift Algorithm for Power and Timing BalancingProceedings of the 2019 International Symposium on Physical Design10.1145/3299902.3309753(11-18)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3299902.3309753
Show More Cited By

Index Terms

Power-driven flip-flop merging and relocation
1. Applied computing
  1. Arts and humanities
    1. Architecture (buildings)
      1. Computer-aided design
  2. Physical sciences and engineering
    1. Engineering
      1. Computer-aided design

Recommendations

Power optimization for clock network with clock gate cloning and flip-flop merging
ISPD '14: Proceedings of the 2014 on International symposium on physical design

Applying clock gates (CGs) and multi-bit flip-flops (MBFFs) are two of the most effective techniques for low power clock network design. Some previous works had proposed to optimize clock network with either CGs or MBFFs, but none of them simultaneously ...
Slack budgeting and slack to length converting for multi-bit flip-flop merging
DATE '13: Proceedings of the Conference on Design, Automation and Test in Europe

In this paper we propose a flexible slack budgeting approach for post-placement multi-bit flip-flop (MBFF) merging. Our approach considers existing wiring topology and flip-flop delay changes for achieving more accurate slack budgeting. Besides, we ...
Agglomerative-based flip-flop merging and relocation for signal wirelength and clock tree optimization

In this article, we propose a flip-flop merging algorithm based on agglomerative clustering. Compared to previous state-of-the-art on flip-flop merging, our proposed algorithm outperforms that of Chang et al. [2010] and Wang et al. [2011] in all aspects,...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

ISPD '11: Proceedings of the 2011 international symposium on Physical design

March 2011

192 pages

ISBN:9781450305501

DOI:10.1145/1960397

General Chair:
Yao-Wen Chang
National Taiwan University
,
Program Chair:
Jiang Hu
Texas A&M University

Copyright © 2011 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

SIGDA: ACM Special Interest Group on Design Automation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 27 March 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

ISPD'11

Sponsor:

SIGDA

ISPD'11: International Symposium on Physical Design

March 27 - 30, 2011

CA, Santa Barbara, USA

Acceptance Rates

Overall Acceptance Rate 62 of 172 submissions, 36%

Upcoming Conference

ISPD '25

Sponsor:
sigda

International Symposium on Physical Design

March 16 - 19, 2025

Austin , TX , USA

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

18
Total Citations
View Citations
280
Total Downloads

Downloads (Last 12 months)21
Downloads (Last 6 weeks)0

Reflects downloads up to 07 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

Cai YZhu LGuo XNakamura YWang Y(2025)Revisit MBFF: Efficient Early-Stage Multi-bit Flip-Flops Clustering with Physical and Timing AwarenessProceedings of the 30th Asia and South Pacific Design Automation Conference10.1145/3658617.3697725(1230-1236)Online publication date: 20-Jan-2025
https://dl.acm.org/doi/10.1145/3658617.3697725
Hyun DKoh SJung YKim TShin Y(2023)Routability Optimization of Extreme Aspect Ratio Design through Non-uniform Placement Utilization and Selective Flip-flop StackingACM Transactions on Design Automation of Electronic Systems10.1145/357338728:4(1-19)Online publication date: 17-May-2023
https://dl.acm.org/doi/10.1145/3573387
Chang YLin TJiang INam GBustany ISwartz W(2019)Graceful Register Clustering by Effective Mean Shift Algorithm for Power and Timing BalancingProceedings of the 2019 International Symposium on Physical Design10.1145/3299902.3309753(11-18)Online publication date: 4-Apr-2019
https://dl.acm.org/doi/10.1145/3299902.3309753
Lin MHsu CChang Y(2019)Post-Placement Power Optimization With Multi-Bit Flip-FlopsIEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems10.1109/TCAD.2011.216571630:12(1870-1882)Online publication date: 3-Jan-2019
https://dl.acm.org/doi/10.1109/TCAD.2011.2165716
Nirmaladevi VPrabha A(2018)Design Of Modified Data Driven Clock Gating And Look Ahead Clock Gating For Low PowerInternational Journal of Electrical and Electronics Research10.37391/IJEER.0602046:2(32-36)Online publication date: 25-May-2018
https://doi.org/10.37391/IJEER.060204
Arun Prasath RDivona Priscilla IGanesh Kumar P(2014)A high speed proficient power reduction method using clustering based flip flop merging2014 International Conference on Communication and Signal Processing10.1109/ICCSP.2014.6950084(1424-1429)Online publication date: Apr-2014
https://doi.org/10.1109/ICCSP.2014.6950084
Lu CLin RMacii E(2013)Slack budgeting and slack to length converting for multi-bit flip-flop mergingProceedings of the Conference on Design, Automation and Test in Europe10.5555/2485288.2485721(1837-1842)Online publication date: 18-Mar-2013
https://dl.acm.org/doi/10.5555/2485288.2485721
Karthick MVijayakumar S(2013)Reduced Wirelength-Based Low Power Performance of Multibit Flip-Flopi-manager's Journal on Circuits and Systems10.26634/jcir.1.4.25931:4(22-26)Online publication date: 15-Nov-2013
https://doi.org/10.26634/jcir.1.4.2593
Liu SLo WLee CChen H(2013)Agglomerative-based flip-flop merging and relocation for signal wirelength and clock tree optimizationACM Transactions on Design Automation of Electronic Systems10.1145/2491477.249148418:3(1-20)Online publication date: 29-Jul-2013
https://dl.acm.org/doi/10.1145/2491477.2491484
Tsai CShi YLuo GJiang IKoh CSze C(2013)FF-bondProceedings of the 2013 ACM International symposium on Physical Design10.1145/2451916.2451955(147-153)Online publication date: 24-Mar-2013
https://dl.acm.org/doi/10.1145/2451916.2451955
Show More Cited By

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten