Name
Title | ||
|---|---|---|
GDME: Grey Relational Clustering Applied to a Clock Tree Construction with Zero Skew and Minimal Delay |
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. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1093/ietfec/e91-a.1.365 | IEICE Transactions |
Keywords | Field | DocType |
grey relational clustering applied,intrinsic delay,zero skew,clock sink,clock tree construction,zero-skew rlc-based clock tree,dme approach,dme algorithm,clock tree,minimal delay,rc-or rlc-based clock tree,soc,grey relational analysis | Discrete mathematics,Zero skew,Grey relational analysis,Algorithm,Clock tree,Skew,Test case,Cluster analysis,RLC circuit,Mathematics,Gray (horse) | Journal |
Volume | Issue | ISSN |
E91-A | 1 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 12 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Chia-chun Tsai | 1 | 109 | 23.04 |
| Jan-ou Wu | 2 | 12 | 4.53 |
| Trong-yen Lee | 3 | 98 | 20.70 |