A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment
As VLSI technology enters the nanoscale regime, the interconnect delay becomes the bottleneck of circuit performance. Compared with gate delays, wires are becoming increasingly resistive, making it more difficult to propagate signals across the chip. However, more advanced technologies (65 and 45 nm...
Uloženo v:
| Vydáno v: | IEEE transactions on circuits and systems. II, Express briefs Ročník 56; číslo 7; s. 580 - 584 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
New York
IEEE
01.07.2009
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| ISSN: | 1549-7747, 1558-3791 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | As VLSI technology enters the nanoscale regime, the interconnect delay becomes the bottleneck of circuit performance. Compared with gate delays, wires are becoming increasingly resistive, making it more difficult to propagate signals across the chip. However, more advanced technologies (65 and 45 nm) provide relief as the number of metal layers continues to increase. The wires on the upper metal layers are much less resistive and can be used to drive further and faster than on thin metals. This provides an entirely new dimension to the traditional wire-sizing problem, namely, layer assignment for efficient timing closure. Assigning all wires to thick metals improves timing; however, the routability of the design may be hurt. The challenge is to assign a minimal amount of wires to thick metals to meet timing constraints. In this brief, the minimum cost layer assignment problem is proven to be NP-complete. As a theoretical solution for NP-complete problems, a fully polynomial-time approximation scheme is proposed. The new algorithm can approximate the optimal layer assignment solution by a factor of 1 + \epsilon in O(m\,\log\, \log\, M \cdot n^{3}/\epsilon^{2}) time for 0 ≪ \epsilon ≪ 1 , where n is the number of nodes in the tree, m is the number of routing layers, and M is the maximum cost ratio among layers. This work presents the first theoretical advance for the timing-driven minimum cost layer assignment problem. In addition to its theoretical guarantee, the new algorithm is highly practical. Our experiments on 500 industrial test cases demonstrate that the new algorithm can run 2 \times faster than the optimal dynamic programming algorithm, with only 2% additional wire. |
|---|---|
| AbstractList | As VLSI technology enters the nanoscale regime, the interconnect delay becomes the bottleneck of circuit performance. Compared with gate delays, wires are becoming increasingly resistive, making it more difficult to propagate signals across the chip. However, more advanced technologies (65 and 45 nm) provide relief as the number of metal layers continues to increase. The wires on the upper metal layers are much less resistive and can be used to drive further and faster than on thin metals. This provides an entirely new dimension to the traditional wire-sizing problem, namely, layer assignment for efficient timing closure. Assigning all wires to thick metals improves timing; however, the routability of the design may be hurt. The challenge is to assign a minimal amount of wires to thick metals to meet timing constraints. In this brief, the minimum cost layer assignment problem is proven to be NP-complete. As a theoretical solution for NP-complete problems, a fully polynomial-time approximation scheme is proposed. The new algorithm can approximate the optimal layer assignment solution by a factor of 1 + \epsilon in O(m\,\log\, \log\, M \cdot n^{3}/\epsilon^{2}) time for 0 ≪ \epsilon ≪ 1 , where n is the number of nodes in the tree, m is the number of routing layers, and M is the maximum cost ratio among layers. This work presents the first theoretical advance for the timing-driven minimum cost layer assignment problem. In addition to its theoretical guarantee, the new algorithm is highly practical. Our experiments on 500 industrial test cases demonstrate that the new algorithm can run 2 \times faster than the optimal dynamic programming algorithm, with only 2% additional wire. As VLSI technology enters the nanoscale regime, the interconnect delay becomes the bottleneck of circuit performance. Compared with gate delays, wires are becoming increasingly resistive, making it more difficult to propagate signals across the chip. However, more advanced technologies (65 and 45 nm) provide relief as the number of metal layers continues to increase. The wires on the upper metal layers are much less resistive and can be used to drive further and faster than on thin metals. This provides an entirely new dimension to the traditional wire-sizing problem, namely, layer assignment for efficient timing closure. Assigning all wires to thick metals improves timing; however, the routability of the design may be hurt. The challenge is to assign a minimal amount of wires to thick metals to meet timing constraints. In this brief, the minimum cost layer assignment problem is proven to be NP-complete. As a theoretical solution for NP-complete problems, a fully polynomial-time approximation scheme is proposed. The new algorithm can approximate the optimal layer assignment solution by a factor of 1 + isin in O(m log log M ldrn super(3) isin super(2)) time for 0 <1, where n is the number of nodes in the tree, m is the number of routing layers, and M is the maximum cost ratio among layers. This work presents the first theoretical advance for the timing-driven minimum cost layer assignment problem. In addition to its theoretical guarantee, the new algorithm is highly practical. Our experiments on 500 industrial test cases demonstrate that the new algorithm can run 2times faster than the optimal dynamic programming algorithm, with only 2% additional wire. As VLSI technology enters the nanoscale regime, the interconnect delay becomes the bottleneck of circuit performance. Compared with gate delays, wires are becoming increasingly resistive, making it more difficult to propagate signals across the chip. However, more advanced technologies (65 and 45 nm) provide relief as the number of metal layers continues to increase. The wires on the upper metal layers are much less resistive and can be used to drive further and faster than on thin metals. This provides an entirely new dimension to the traditional wire-sizing problem, namely, layer assignment for efficient timing closure. Assigning all wires to thick metals improves timing; however, the routability of the design may be hurt. The challenge is to assign a minimal amount of wires to thick metals to meet timing constraints. In this brief, the minimum cost layer assignment problem is proven to be NP-complete. As a theoretical solution for NP- complete problems, a fully polynomial-time approximation scheme is proposed. The new algorithm can approximate the optimal layer assignment solution by a factor of 1 + isin in (O)((m) log log (M) ldr(n) (3) isin(2)) time for 0 < isin < 1, where (n) is the number of nodes in the tree, (m) is the number of routing layers, and (M) is the maximum cost ratio among layers. This work presents the first theoretical advance for the timing-driven minimum cost layer assignment problem. In addition to its theoretical guarantee, the new algorithm is highly practical. Our experiments on 500 industrial test cases demonstrate that the new algorithm can run 2times faster than the optimal dynamic programming algorithm, with only 2% additional wire. The new algorithm can approximate the optimal layer assignment solution by a factor of 1 + isin in O(m log log M ldrn 3 isin2) time for 0 < isin < 1, where n is the number of nodes in the tree, m is the number of routing layers, and M is the maximum cost ratio among layers. |
| Author | Hu, Shiyan Li, Zhuo Alpert, Charles J. |
| Author_xml | – sequence: 1 givenname: Shiyan surname: Hu fullname: Hu, Shiyan email: shiyan@mtu.edu organization: Dept. of Electr. & Comput. Eng., Michigan Technol. Univ., Houghton, MI, USA – sequence: 2 givenname: Zhuo surname: Li fullname: Li, Zhuo email: lizhuo@us.ibm.com – sequence: 3 givenname: Charles J. surname: Alpert fullname: Alpert, Charles J. email: alpert@us.ibm.com |
| BookMark | eNp9kUtPxCAUhYnRxOcf0A1xoavq5dFSlpPGxyRjNHFcE4ahimlhhDZx_r2MY1y4cHO5ge_A5ZxDtOuDtwidErgiBOT1vHmeTq8ogMyFUgpsBx2QsqwLJiTZ3fRcFkJwsY8OU3oHoBIYPUB6gm_Hrlvjp9Ctfeid7oq56y2erFYxfLpeDy54_GzebN5sQ8T51PnXogk-DVE7b5f4wXnXjz1uQhrwTK9txJOU3KvvrR-O0V6ru2RPftYj9HJ7M2_ui9nj3bSZzArDSjEUFEqprdWwFJQvKsGMYYbXLbRUU2YWnC9NRWRVLYQWbQ0tB2E4WbS8XNJSS3aELrf35rk_RpsG1btkbNdpb8OYVC1KoLyGMpMX_5KMy4xRlsHzP-B7GKPPv1CSUCZqqKoM0S1kYkgp2latYrYtrhUBtQlHfYejNuGon3CyqP4jMm74tnrjafe_9Gwrddba37fyyFTwmn0B8PGewQ |
| CODEN | ITCSFK |
| CitedBy_id | crossref_primary_10_1109_TCAD_2018_2846652 crossref_primary_10_1109_TCAD_2017_2697964 crossref_primary_10_1109_TCAD_2021_3100296 |
| Cites_doi | 10.1109/TCAD.2007.906477 10.1109/43.365123 10.1109/4.494206 10.1109/43.905678 10.1109/JPROC.2006.890096 10.1109/TCAD.1984.1270074 10.1109/TNET.2007.900712 10.1145/1353629.1353648 10.1287/moor.17.1.36 10.1109/81.481198 10.1109/43.771182 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2009 |
| DBID | 97E RIA RIE AAYXX CITATION 7SP 8FD L7M F28 FR3 |
| DOI | 10.1109/TCSII.2009.2022203 |
| DatabaseName | IEEE Xplore (IEEE) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Xplore CrossRef Electronics & Communications Abstracts Technology Research Database Advanced Technologies Database with Aerospace ANTE: Abstracts in New Technology & Engineering Engineering Research Database |
| DatabaseTitle | CrossRef Technology Research Database Advanced Technologies Database with Aerospace Electronics & Communications Abstracts Engineering Research Database ANTE: Abstracts in New Technology & Engineering |
| DatabaseTitleList | Engineering Research Database Engineering Research Database Technology Research Database |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Xplore url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1558-3791 |
| EndPage | 584 |
| ExternalDocumentID | 2545535581 10_1109_TCSII_2009_2022203 4982748 |
| Genre | orig-research |
| GroupedDBID | 0R~ 29I 4.4 5VS 6IK 6J9 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACIWK AETIX AGQYO AGSQL AHBIQ AIBXA AKJIK AKQYR ALMA_UNASSIGNED_HOLDINGS ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD IFIPE IPLJI JAVBF M43 OCL PZZ RIA RIE RNS RXW TAE TAF VJK AAYXX CITATION 7SP 8FD L7M F28 FR3 |
| ID | FETCH-LOGICAL-c357t-2059aeea0d724b673cc3c48f0f2a23cb44dc61966b7a7f80f407c41bf45d25a93 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000268171700012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 1549-7747 |
| IngestDate | Sun Sep 28 08:48:23 EDT 2025 Sun Sep 28 11:44:33 EDT 2025 Sun Nov 09 07:29:59 EST 2025 Tue Nov 18 22:32:14 EST 2025 Sat Nov 29 02:22:52 EST 2025 Wed Aug 27 01:53:42 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 7 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html https://doi.org/10.15223/policy-029 https://doi.org/10.15223/policy-037 |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c357t-2059aeea0d724b673cc3c48f0f2a23cb44dc61966b7a7f80f407c41bf45d25a93 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 ObjectType-Article-2 ObjectType-Feature-1 content type line 23 |
| PQID | 912378066 |
| PQPubID | 23500 |
| PageCount | 5 |
| ParticipantIDs | proquest_miscellaneous_875024805 crossref_citationtrail_10_1109_TCSII_2009_2022203 proquest_journals_912378066 proquest_miscellaneous_34980523 ieee_primary_4982748 crossref_primary_10_1109_TCSII_2009_2022203 |
| PublicationCentury | 2000 |
| PublicationDate | 2009-07-01 |
| PublicationDateYYYYMMDD | 2009-07-01 |
| PublicationDate_xml | – month: 07 year: 2009 text: 2009-07-01 day: 01 |
| PublicationDecade | 2000 |
| PublicationPlace | New York |
| PublicationPlace_xml | – name: New York |
| PublicationTitle | IEEE transactions on circuits and systems. II, Express briefs |
| PublicationTitleAbbrev | TCSII |
| PublicationYear | 2009 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 garey (ref12) 1979 shi (ref11) 2004 ref10 ref2 ref1 ref8 ref7 ref9 ref4 ref3 ref6 ref5 |
| References_xml | – ident: ref10 doi: 10.1109/TCAD.2007.906477 – ident: ref4 doi: 10.1109/43.365123 – ident: ref6 doi: 10.1109/4.494206 – ident: ref5 doi: 10.1109/43.905678 – ident: ref7 doi: 10.1109/JPROC.2006.890096 – ident: ref9 doi: 10.1109/TCAD.1984.1270074 – start-page: 609 year: 2004 ident: ref11 article-title: complexity analysis and speedup techniques for optimal buffer insertion with minimum cost publication-title: ASPDAC – ident: ref13 doi: 10.1109/TNET.2007.900712 – ident: ref1 doi: 10.1145/1353629.1353648 – ident: ref8 doi: 10.1287/moor.17.1.36 – ident: ref2 doi: 10.1109/81.481198 – ident: ref3 doi: 10.1109/43.771182 – year: 1979 ident: ref12 publication-title: Computers and Intractability A Guide to the Theory of NP-Completeness |
| SSID | ssj0029032 |
| Score | 1.8968997 |
| Snippet | As VLSI technology enters the nanoscale regime, the interconnect delay becomes the bottleneck of circuit performance. Compared with gate delays, wires are... The new algorithm can approximate the optimal layer assignment solution by a factor of 1 + isin in O(m log log M ldrn 3 isin2) time for 0 < isin < 1, where n... |
| SourceID | proquest crossref ieee |
| SourceType | Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 580 |
| SubjectTerms | Algorithms Approximation Circuit optimization Costs Delay Fully polynomial-time approximation scheme (FPTAS) Integrated circuit interconnections interconnect synthesis layer assignment Mathematical analysis Metals Minimum cost Nanostructure NP-complete NP-complete problem Polynomials Propagation delay Routing Studies Time measurements Timing Very large scale integration Wire Wires |
| Title | A Fully Polynomial-Time Approximation Scheme for Timing-Constrained Minimum Cost Layer Assignment |
| URI | https://ieeexplore.ieee.org/document/4982748 https://www.proquest.com/docview/912378066 https://www.proquest.com/docview/34980523 https://www.proquest.com/docview/875024805 |
| Volume | 56 |
| WOSCitedRecordID | wos000268171700012&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Xplore customDbUrl: eissn: 1558-3791 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0029032 issn: 1549-7747 databaseCode: RIE dateStart: 20040101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Na9wwEB2SkEN7aJumpW6aRofeEjdaS7ak47IkNJCEQLaQm9FnMGzskt0tzb_vSPaaQj-gN2NJWOhZmnmSZh7AJylDUTqmclpSmnOmcR0sGM-pocY67QIPKVD4Ulxfy7s7dbMFJ2MsjPc-XT7zn-NjOst3nV3HrbJTriSSKLkN20JUfazWSK4UTWJkMeMYeoxcbAJkqDqdz24vLvrUlEXkNxuBrMEIJVWV35biZF_OX_5fz17Bi8GPJNMe-D3Y8u1reP5LdsF90FMSCeYTuekWTzH6WC_yGPFBpjGP-I-mD1oktwgbvkTnlcyjxNd9HkU8k3SEd-SqaZuH9QOZdcsVudTooBNEtLlPlwjewNfzs_nsSz4oKuSWlWKFU6JU2ntNnSi4qQSzllkuAw2FLpg1nDuLjKqqjNAiSBqQ7lk-MYGXrii1Ym9hp-1a_w6IdYYGhUXGak6DVBNLzcRVzlVoF3WZwWQzxLUd0o3Hri_qRDuoqhMsUQZT1QMsGRyPbb71yTb-WXs_AjHWHDDI4GCDZD3Mx2Wt0EALie5VBkdjKU6keDqiW9-tlzXD9nGPPAPylxpI7WIGOFq-__OXD-BZf9YUL_N-gJ3V49ofwq79vmqWjx_T7_oTWsXozQ |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1db9MwFL0aGxLwwIANETaYH3iDMDexE_uxqjatoqsmrUh7i_w5ReoStLaI_Xt8nTRC4kPiLYptJcqJ7Xts33MAPgjhM25zmVJOacpyFcbBLGcp1VQbq6xnPiYKz8r5XNzcyKsd-DTkwjjn4uEz9xkv416-bc0Gl8pOmRSBRIlHsMdR1q7L1hrolaTRjgw1x0LMyMptigyVp4vJ9XTaiVNmyHC2Fln9NBR9VX4bjOMMc77_f-_2Ap73kSQZd9C_hB3XvIJnv-gLHoAaE6SYD-SqXT5g_rFappjzQcaoJP6j7tIWyXUALtwM4StZoMnXbYo2ntE8wllyWTf13eaOTNrVmsxUCNFJwLS-jccIDuHr-dlicpH2ngqpyXm5Dp2CS-WcorbMmC7K3JjcMOGpz1SWG82YNYFTFYUuVekF9YHwGTbSnnGbcSXz17DbtI17A8RYTb0MRdooRr2QI0P1yBbWFmFmVDyB0fYTV6YXHMdXX1aReFBZRVjQCFNWPSwJfBzafOvkNv5Z-wCBGGr2GCRwtEWy6nvkqpJhii5FCLASOBlKQ1fC_RHVuHazqvLQHlfJEyB_qRHIHWrAUf72z08-gScXi8tZNZvOvxzB027nCY_2HsPu-n7j3sFj831dr-7fx1_3J54i7BY |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=A+Fully+Polynomial-Time+Approximation+Scheme+for+Timing-Constrained+Minimum+Cost+Layer+Assignment&rft.jtitle=IEEE+transactions+on+circuits+and+systems.+II%2C+Express+briefs&rft.au=Hu%2C+Shiyan&rft.au=Li%2C+Zhuo&rft.au=Alpert%2C+C+J&rft.date=2009-07-01&rft.issn=1549-7747&rft.volume=56&rft.issue=7&rft_id=info:doi/10.1109%2FTCSII.2009.2022203&rft.externalDBID=NO_FULL_TEXT |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1549-7747&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1549-7747&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1549-7747&client=summon |