Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

ISPD

2009

ACM

2009

ACM

As VLSI technology moves to the 65nm node and beyond, interconnect delay greatly limits the circuit performance. As a critical component in interconnect synthesis, layer assignment manifests enormous potential in drastically reducing wire delay. This is due the fact that wires on thick metals are much less resistive than those on thin metals. Nevertheless, it is not desired to assign all wires to thick metals and the right strategy is to only use minimal thick-metal routing resources for meeting the timing constraints. This timing driven minimum cost layer assignment problem is NP-Complete, and a fast algorithm with provable approximation bound is highly desired. In this paper, a new fully polynomial time approximation scheme is proposed. It is based on a linear-time dynamic programming algorithm for bounded-cost layer assignment and eﬃcient oracle queries. The proposed algorithm can approximate the optimal layer assignment solution in O(mn2 / ) time within a factor of 1+ for any &g...

Related Content

Added |
19 May 2010 |

Updated |
19 May 2010 |

Type |
Conference |

Year |
2009 |

Where |
ISPD |

Authors |
Shiyan Hu, Zhuo Li, Charles J. Alpert |

Comments (0)