skip to main content
10.5555/1326073.1326163acmconferencesArticle/Chapter ViewAbstractPublication PagesiccadConference Proceedingsconference-collections
research-article

Early planning for clock skew scheduling during register binding

Published: 05 November 2007 Publication History

Abstract

Design decisions made during high-level synthesis usually have great impacts on the later design stages. In this paper, We present a general framework, which plans for the clock skew scheduling in physical design stages during register binding in high-level synthesis. Our proposed technique pursues the optimality of the native objective functions of the register binding problem. At the same time, it ensures not invalidating the subsequent clock skew scheduling for optimizing the clock period. We use the switching power as the native objective of our register binding problem. The problem is first formulated as a MILP problem. An acceleration scheme based on the concept of weakly compatible edge set(WCES) is proposed to speed up the MILP solver to obtain the optimal solution. Then, we present our heuristic algorithm to reduce the running time further. The experimental results show that on average our acceleration scheme can speed up the solver by 8.6 times, and our heuristic is 70 times faster than the solver with a 5.25% degradation of the native objective. The minimum and maximum degradation among our benchmark set are 0.82% and 12.2% respectively.

References

[1]
R. K. Ahuja, T. L. Magnanti, and J. B. Orlin. Network Flows: Theory, Algorithms, and Applications. Prentice Hall, 1993.
[2]
J. Chang and M. Pedram. Register allocation and binding for low power. In DAC, San Francisco, CA, June 1995.
[3]
D. Chen and J. Cong. Register binding and port assignment for multiplexer optimization. In ASP-DAC, 2004.
[4]
T. H. Cormen, C. E. Leiserson, R. L. Rivest, and C. Stein. Introduction to Algorithms, Second Edition. The MIT Press, 2001.
[5]
R. B. Deokar and S. S. Sapatnekar. A graph-theoretic approach to clock skew optimization. In ISCAS, 1994.
[6]
J. P. Fishburn. Clock skew optimization. IEEE Transactions on Computers, 39(7), July 1990.
[7]
Express Group@UCSB. http://express.ece.ucsb.edu/benchamrk.
[8]
S. Huang, C. Cheng, Y. Nieh, and W. Yu. Register binding for clock period minimization. In DAC, 2006.
[9]
L. Liu, T. Chou, A. Aziz, and D. F. Wong. Zero-skew clock tree construction by simultaneous routing, wire sizing and buffer insertion. In ISPD, 2000.
[10]
K. Ravindran, A. Kuehlmann, and E. Sentovich. Multi-domain clock skew scheduling. In ICCAD, 2003.
[11]
Q. Zhao, C. A. J. van Eijk, C. A. Alba Pinto, and J. A. G. Jess. Register binding for predicated execution in dsp applications. In ISCAS, 2000.

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
ICCAD '07: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
November 2007
933 pages
ISBN:1424413826
  • General Chair:
  • Georges Gielen

Sponsors

Publisher

IEEE Press

Publication History

Published: 05 November 2007

Check for updates

Qualifiers

  • Research-article

Conference

ICCAD07
Sponsor:

Acceptance Rates

ICCAD '07 Paper Acceptance Rate 139 of 510 submissions, 27%;
Overall Acceptance Rate 457 of 1,762 submissions, 26%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • 0
    Total Citations
  • 166
    Total Downloads
  • Downloads (Last 12 months)2
  • Downloads (Last 6 weeks)0
Reflects downloads up to 17 Jan 2025

Other Metrics

Citations

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media