GDME: Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay

Chia-Chun TSAI; Jan-Ou WU; Trong-Yen LEE

doi:10.1093/ietfec/e91-a.1.365

GDME: Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay

Chia-Chun TSAI, Jan-Ou WU, Trong-Yen LEE

Full Text Views

0

Share
Cite this

Summary :

This study has demonstrated that the clock tree construction in an SoC should be expanded to consider the intrinsic delay and skew of each IP's clock sink. A novel algorithm, called GDME, is proposed to combine grey relational clustering and DME approach for solving the problem of clock tree construction. Grey relational analysis can cluster the best pair of clock sinks and that guide a tapping point search for a DME algorithm for constructing a clock tree with zero skew and minimal delay. Experimentally, the proposed algorithm always obtains an RC- or RLC-based clock tree with zero skew and minimal delay for all the test cases and benchmarks. Experimental results demonstrate that the GDME improves up to 3.74% for total average in terms of total wire length compared with other DME algorithms. Furthermore, our results for the zero-skew RLC-based clock trees compared with Hspice are 0.017% and 0.2% lower for absolute average in terms of skew and delay, respectively.

Publication: IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.1 pp.365-374

Publication Date: 2008/01/01

Publicized

Online ISSN: 1745-1337

DOI: 10.1093/ietfec/e91-a.1.365

Type of Manuscript: PAPER

Category: VLSI Design Technology and CAD

Cite this

Copy

Chia-Chun TSAI, Jan-Ou WU, Trong-Yen LEE, "GDME: Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay" in IEICE TRANSACTIONS on Fundamentals, vol. E91-A, no. 1, pp. 365-374, January 2008, doi: 10.1093/ietfec/e91-a.1.365.
Abstract: This study has demonstrated that the clock tree construction in an SoC should be expanded to consider the intrinsic delay and skew of each IP's clock sink. A novel algorithm, called GDME, is proposed to combine grey relational clustering and DME approach for solving the problem of clock tree construction. Grey relational analysis can cluster the best pair of clock sinks and that guide a tapping point search for a DME algorithm for constructing a clock tree with zero skew and minimal delay. Experimentally, the proposed algorithm always obtains an RC- or RLC-based clock tree with zero skew and minimal delay for all the test cases and benchmarks. Experimental results demonstrate that the GDME improves up to 3.74% for total average in terms of total wire length compared with other DME algorithms. Furthermore, our results for the zero-skew RLC-based clock trees compared with Hspice are 0.017% and 0.2% lower for absolute average in terms of skew and delay, respectively.
URL: https://globals.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.1.365/_p

Copy

@ARTICLE{e91-a_1_365,
author={Chia-Chun TSAI, Jan-Ou WU, Trong-Yen LEE, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={GDME: Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay},
year={2008},
volume={E91-A},
number={1},
pages={365-374},
abstract={This study has demonstrated that the clock tree construction in an SoC should be expanded to consider the intrinsic delay and skew of each IP's clock sink. A novel algorithm, called GDME, is proposed to combine grey relational clustering and DME approach for solving the problem of clock tree construction. Grey relational analysis can cluster the best pair of clock sinks and that guide a tapping point search for a DME algorithm for constructing a clock tree with zero skew and minimal delay. Experimentally, the proposed algorithm always obtains an RC- or RLC-based clock tree with zero skew and minimal delay for all the test cases and benchmarks. Experimental results demonstrate that the GDME improves up to 3.74% for total average in terms of total wire length compared with other DME algorithms. Furthermore, our results for the zero-skew RLC-based clock trees compared with Hspice are 0.017% and 0.2% lower for absolute average in terms of skew and delay, respectively.},
keywords={},
doi={10.1093/ietfec/e91-a.1.365},
ISSN={1745-1337},
month={January},}

Copy

TY - JOUR
TI - GDME: Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 365
EP - 374
AU - Chia-Chun TSAI
AU - Jan-Ou WU
AU - Trong-Yen LEE
PY - 2008
DO - 10.1093/ietfec/e91-a.1.365
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 1
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - January 2008
AB - This study has demonstrated that the clock tree construction in an SoC should be expanded to consider the intrinsic delay and skew of each IP's clock sink. A novel algorithm, called GDME, is proposed to combine grey relational clustering and DME approach for solving the problem of clock tree construction. Grey relational analysis can cluster the best pair of clock sinks and that guide a tapping point search for a DME algorithm for constructing a clock tree with zero skew and minimal delay. Experimentally, the proposed algorithm always obtains an RC- or RLC-based clock tree with zero skew and minimal delay for all the test cases and benchmarks. Experimental results demonstrate that the GDME improves up to 3.74% for total average in terms of total wire length compared with other DME algorithms. Furthermore, our results for the zero-skew RLC-based clock trees compared with Hspice are 0.017% and 0.2% lower for absolute average in terms of skew and delay, respectively.
ER -