A Multithreaded Initial Detailed Routing Algorithm Considering Global Routing Guides

Detailed routing is the most complicated and time-consuming stage in VLSI design and has become a critical process for advanced node enablement. To handle the high complexity of modern detailed routing, initial detailed routing is often employed to minimize design-rule violations to facilitate final...

Full description

Saved in:
Bibliographic Details
Published in:2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD) pp. 1 - 7
Main Authors: Sun, Fan-Keng, Chen, Hao, Chen, Ching-Yu, Hsu, Chen-Hao, Chang, Yao-Wen
Format: Conference Proceeding
Language:English
Published: ACM 01.11.2018
Subjects:
Advance Technologies
Complexity theory
Detailed Routing
Lead
Multithread
Physical Design
Pins
Routing
Timing
Wires
ISSN:1558-2434
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Detailed routing is the most complicated and time-consuming stage in VLSI design and has become a critical process for advanced node enablement. To handle the high complexity of modern detailed routing, initial detailed routing is often employed to minimize design-rule violations to facilitate final detailed routing, even though it is still not violation-free after initial routing. This paper presents a novel initial detailed routing algorithm to consider industrial design-rule constraints and optimize the total wirelength and via count. Our algorithm consists of three major stages: (1) an effective pin-access point generation method to identify valid points to model a complex pin shape, (2) a via-aware track assignment method to minimize the overlaps between assigned wire segments, and (3) a detailed routing algorithm with a novel negotiation-based rip-up and re-route scheme that enables multithreading and honors global routing information while minimizing design-rule violations. Experimental results show that our router outperforms all the winning teams of the 2018 ACM ISPD Initial Detailed Routing Contest, where the top-3 routers result in 23%, 52%, and 1224% higher costs than ours.
AbstractList Detailed routing is the most complicated and time-consuming stage in VLSI design and has become a critical process for advanced node enablement. To handle the high complexity of modern detailed routing, initial detailed routing is often employed to minimize design-rule violations to facilitate final detailed routing, even though it is still not violation-free after initial routing. This paper presents a novel initial detailed routing algorithm to consider industrial design-rule constraints and optimize the total wirelength and via count. Our algorithm consists of three major stages: (1) an effective pin-access point generation method to identify valid points to model a complex pin shape, (2) a via-aware track assignment method to minimize the overlaps between assigned wire segments, and (3) a detailed routing algorithm with a novel negotiation-based rip-up and re-route scheme that enables multithreading and honors global routing information while minimizing design-rule violations. Experimental results show that our router outperforms all the winning teams of the 2018 ACM ISPD Initial Detailed Routing Contest, where the top-3 routers result in 23%, 52%, and 1224% higher costs than ours.
Author Sun, Fan-Keng
Chang, Yao-Wen
Hsu, Chen-Hao
Chen, Hao
Chen, Ching-Yu
Author_xml – sequence: 1
  givenname: Fan-Keng
  surname: Sun
  fullname: Sun, Fan-Keng
  organization: Department of Electrical Engineering, National Taiwan University, Taipei, 10617, Taiwan
– sequence: 2
  givenname: Hao
  surname: Chen
  fullname: Chen, Hao
  organization: Department of Electrical Engineering, National Taiwan University, Taipei, 10617, Taiwan
– sequence: 3
  givenname: Ching-Yu
  surname: Chen
  fullname: Chen, Ching-Yu
  organization: Department of Electrical Engineering, National Taiwan University, Taipei, 10617, Taiwan
– sequence: 4
  givenname: Chen-Hao
  surname: Hsu
  fullname: Hsu, Chen-Hao
  organization: Department of Electrical Engineering, National Taiwan University, Taipei, 10617, Taiwan
– sequence: 5
  givenname: Yao-Wen
  surname: Chang
  fullname: Chang, Yao-Wen
  organization: Department of Electrical Engineering, National Taiwan University, Taipei, 10617, Taiwan
BookMark eNo1jktLw0AUhUdRsK1du3CTP5A6z9yZZYi2FiqC1HWZzKOOTBNJJgv_veNrcTnwnY_DnaOLru8cQjcErwjh4o5RjqESq58EOEPzTDETSmA4RzMihCwpZ_wKLcfxHWNMJZBcz9C-Lp6mmEJ6G5y2zhbbLqSgY3Hvkg4xg5d-SqE7FnU89kP2TkXTd2Owbvimm9i32f6XNlMuxmt06XUc3fIvF-h1_bBvHsvd82bb1LtSUw6pBOI5F5oRZQSz4KUHq41uSavyL_mUr4zhhhjZcqI8psBbJ6gxWFvrOVug29_d4Jw7fAzhpIfPgxQSoFLsC0IkUz4
ContentType Conference Proceeding
DBID 6IE
6IH
CBEJK
RIE
RIO
DOI 10.1145/3240765.3240777
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan (POP) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE Electronic Library (IEL)
IEEE Proceedings Order Plans (POP) 1998-present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISBN 1450359507
9781450359504
EISSN 1558-2434
EndPage 7
ExternalDocumentID 8587769
Genre orig-research
GroupedDBID 123
6IE
6IF
6IH
6IL
6IN
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
APO
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
FEDTE
IEGSK
IJVOP
M43
OCL
RIE
RIL
RIO
ID FETCH-LOGICAL-a247t-71f445a319c53d7f8f7dacab1b9ead9ea9f6cc4c1c8b419f0274be52cc0addf43
IEDL.DBID RIE
ISICitedReferencesCount 22
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000494640800080&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
IngestDate Wed Aug 27 02:56:50 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-a247t-71f445a319c53d7f8f7dacab1b9ead9ea9f6cc4c1c8b419f0274be52cc0addf43
PageCount 7
ParticipantIDs ieee_primary_8587769
PublicationCentury 2000
PublicationDate 2018-Nov.
PublicationDateYYYYMMDD 2018-11-01
PublicationDate_xml – month: 11
  year: 2018
  text: 2018-Nov.
PublicationDecade 2010
PublicationTitle 2018 IEEE/ACM International Conference on Computer-Aided Design (ICCAD)
PublicationTitleAbbrev ICCAD
PublicationYear 2018
Publisher ACM
Publisher_xml – name: ACM
SSID ssj0002871359
ssj0020286
Score 2.2357483
Snippet Detailed routing is the most complicated and time-consuming stage in VLSI design and has become a critical process for advanced node enablement. To handle the...
SourceID ieee
SourceType Publisher
StartPage 1
SubjectTerms Advance Technologies
Complexity theory
Detailed Routing
Lead
Multithread
Physical Design
Pins
Routing
Timing
Wires
Title A Multithreaded Initial Detailed Routing Algorithm Considering Global Routing Guides
URI https://ieeexplore.ieee.org/document/8587769
WOSCitedRecordID wos000494640800080&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
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LS8NAEB7a4kEvPlrxzR48mjaPfSTHola9lB4q9Fb2KUJtpU39_c5uYlTw4iFsmAwk7JDMI_N9A3AtDNrScRblWSwjqjIeKcNdpDgT2teTZezCsAkxHuezWTFpwU2DhbHWhuYz2_en4V--WemtL5UNcpYLwYs2tHGpsFpNPcVH_pl3zXWyhQJeU_kklA0875zgrB9W8XuWSnAlo_3_PcQB9L4xeWTSeJtDaNnlEez9oBPswnRIKjwt2kcaa8iT7wySC3IX-kRR4Pt_UJUMFy-rNeq9ka-BnV5a8f83Sg9bvLDpwfPofnr7GNVTEyKZUlFGInGUMomvlmaZES53wkgtVaIKvDceheNaU53oXNGkcD4vVZalWsf4rXM0O4bOcrW0J0BiLqlOZVxgFkvReBgMKuW4MwnT0sbpKXT9_szfK2KMeb01Z3-Lz2EXo428AvJdQKdcb-0l7OiP8nWzvgrW_AQDGaE-
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1JS8NQEB5qFdSLSyvu5uDRtFnekhyLWluspYcKvZW3ilAb6eLvd14So4IXDyFhMpDwhmSWN998ANdcoy0to34SB8InMma-1Mz6klGuXD1ZBDYnm-DDYTKZpKMa3FRYGGNM3nxmWu4y38vXmVq7Ulk7oQnnLN2ATUpIFBRoraqi4mL_2DnnMt1CASuH-YSEtt3kOc5oKz_z32wquTPp7v3vNfah-Y3K80aVvzmAmpkfwu6PgYINGHe8AlGLFhLaaK_veoPEzLvLO0VR4DqAUNXrzF6yBeq9eV-UnU5aMABUSg9rvLFswnP3fnzb80veBF9EhK98HlpCqMCPS9FYc5tYroUSMpQpPhuP1DKliApVIkmYWpeZSkMjpQL821kSH0F9ns3NMXgBE0RFIkgxjyVoPgwHpbTM6pAqYYLoBBpufabvxWiMabk0p3-Lr2C7N34aTAf94eMZ7GDskRSwvnOorxZrcwFb6mP1ulxc5pb9BJR5pIU
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=proceeding&rft.title=2018+IEEE%2FACM+International+Conference+on+Computer-Aided+Design+%28ICCAD%29&rft.atitle=A+Multithreaded+Initial+Detailed+Routing+Algorithm+Considering+Global+Routing+Guides&rft.au=Sun%2C+Fan-Keng&rft.au=Chen%2C+Hao&rft.au=Chen%2C+Ching-Yu&rft.au=Hsu%2C+Chen-Hao&rft.date=2018-11-01&rft.pub=ACM&rft.eissn=1558-2434&rft.spage=1&rft.epage=7&rft_id=info:doi/10.1145%2F3240765.3240777&rft.externalDocID=8587769