Statistical clock tree routing for robustness to process variations

Uday Padmanabhan, Meiling Wang, Jiang Hu

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

5 Citations (Scopus)

Abstract

Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufacturing performance. Process-induced skew presents an ever-growing limitation for high speed, large area clock networks. To achieve multi-GHz operation for high-end designs, clock networks must be constructed to tolerate variations in various interconnect parameters. We propose a statistical centering based clock routing algorithm built upon DME that greatly improves skew tolerance to interconnect variations. The algorithm achieves the improvement by: i) choosing the best center measure which is dynamically based on the first three moments of the skew distribution, and ii) designing for all sink pairs in the subtrees simultaneously. In addition, a variation aware abstract topology generation algorithm is proposed in this paper. Experiments on benchmark circuits demonstrate the efficiency of the proposed method in reducing the number of skew violations by 12%-37%.

Original languageEnglish (US)
Title of host publicationProceedings of the International Symposium on Physical Design
Pages149-156
Number of pages8
Volume2006
StatePublished - 2006
EventISPD'06 - 2006 International Symposium on Physical Design - San Jose, CA, United States
Duration: Apr 9 2006Apr 12 2006

Other

OtherISPD'06 - 2006 International Symposium on Physical Design
CountryUnited States
CitySan Jose, CA
Period4/9/064/12/06

Fingerprint

Clocks
Routing algorithms
Topology
Networks (circuits)
Experiments

Keywords

  • Clock Tree
  • Process Variations
  • Robustness
  • Routing

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Padmanabhan, U., Wang, M., & Hu, J. (2006). Statistical clock tree routing for robustness to process variations. In Proceedings of the International Symposium on Physical Design (Vol. 2006, pp. 149-156)

Statistical clock tree routing for robustness to process variations. / Padmanabhan, Uday; Wang, Meiling; Hu, Jiang.

Proceedings of the International Symposium on Physical Design. Vol. 2006 2006. p. 149-156.

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

Padmanabhan, U, Wang, M & Hu, J 2006, Statistical clock tree routing for robustness to process variations. in Proceedings of the International Symposium on Physical Design. vol. 2006, pp. 149-156, ISPD'06 - 2006 International Symposium on Physical Design, San Jose, CA, United States, 4/9/06.
Padmanabhan U, Wang M, Hu J. Statistical clock tree routing for robustness to process variations. In Proceedings of the International Symposium on Physical Design. Vol. 2006. 2006. p. 149-156
Padmanabhan, Uday ; Wang, Meiling ; Hu, Jiang. / Statistical clock tree routing for robustness to process variations. Proceedings of the International Symposium on Physical Design. Vol. 2006 2006. pp. 149-156
@inproceedings{3881e05214b64853a2fc05c385d27085,
title = "Statistical clock tree routing for robustness to process variations",
abstract = "Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufacturing performance. Process-induced skew presents an ever-growing limitation for high speed, large area clock networks. To achieve multi-GHz operation for high-end designs, clock networks must be constructed to tolerate variations in various interconnect parameters. We propose a statistical centering based clock routing algorithm built upon DME that greatly improves skew tolerance to interconnect variations. The algorithm achieves the improvement by: i) choosing the best center measure which is dynamically based on the first three moments of the skew distribution, and ii) designing for all sink pairs in the subtrees simultaneously. In addition, a variation aware abstract topology generation algorithm is proposed in this paper. Experiments on benchmark circuits demonstrate the efficiency of the proposed method in reducing the number of skew violations by 12{\%}-37{\%}.",
keywords = "Clock Tree, Process Variations, Robustness, Routing",
author = "Uday Padmanabhan and Meiling Wang and Jiang Hu",
year = "2006",
language = "English (US)",
isbn = "1595932992",
volume = "2006",
pages = "149--156",
booktitle = "Proceedings of the International Symposium on Physical Design",

}

TY - GEN

T1 - Statistical clock tree routing for robustness to process variations

AU - Padmanabhan, Uday

AU - Wang, Meiling

AU - Hu, Jiang

PY - 2006

Y1 - 2006

N2 - Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufacturing performance. Process-induced skew presents an ever-growing limitation for high speed, large area clock networks. To achieve multi-GHz operation for high-end designs, clock networks must be constructed to tolerate variations in various interconnect parameters. We propose a statistical centering based clock routing algorithm built upon DME that greatly improves skew tolerance to interconnect variations. The algorithm achieves the improvement by: i) choosing the best center measure which is dynamically based on the first three moments of the skew distribution, and ii) designing for all sink pairs in the subtrees simultaneously. In addition, a variation aware abstract topology generation algorithm is proposed in this paper. Experiments on benchmark circuits demonstrate the efficiency of the proposed method in reducing the number of skew violations by 12%-37%.

AB - Advances in VLSI technology make clock skew more susceptible to process variations. Notwithstanding efficient zero skew routing algorithms, clock skew still limits post-manufacturing performance. Process-induced skew presents an ever-growing limitation for high speed, large area clock networks. To achieve multi-GHz operation for high-end designs, clock networks must be constructed to tolerate variations in various interconnect parameters. We propose a statistical centering based clock routing algorithm built upon DME that greatly improves skew tolerance to interconnect variations. The algorithm achieves the improvement by: i) choosing the best center measure which is dynamically based on the first three moments of the skew distribution, and ii) designing for all sink pairs in the subtrees simultaneously. In addition, a variation aware abstract topology generation algorithm is proposed in this paper. Experiments on benchmark circuits demonstrate the efficiency of the proposed method in reducing the number of skew violations by 12%-37%.

KW - Clock Tree

KW - Process Variations

KW - Robustness

KW - Routing

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

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

M3 - Conference contribution

SN - 1595932992

SN - 9781595932990

VL - 2006

SP - 149

EP - 156

BT - Proceedings of the International Symposium on Physical Design

ER -