Timing driven routing tree construction
Refereed conference paper presented and published in conference proceedings


Times Cited
Web of Science0WOS source URL (as at 30/07/2020) Click here for the latest count
Altmetrics Information
.

Other information
AbstractAs technology scales down quickly, timing becomes more and more critical in modern designs. During placement and routing, a lot of techniques are applied to reduce circuit delay. A good timing driven routing tree construction can influence placement and routing significantly. As circuits become more and more complex, previous algorithms may not be efficient enough to be applied in modern designs. In this paper, we propose a new algorithm to construct timing-driven routing trees to trade off wirelength and timing. Our tree construction is based on properties of shortest path tree and minimum spanning tree. Experimental results show that our algorithm can obtain a smaller delay while keeping the wirelength short.
All Author(s) ListPeishan Tu, Wing-Kai Chow, Evangeline F. Y. Young
Name of ConferenceSystem Level Interconnect Prediction (SLIP), 2017 ACM/IEEE International Workshop on
Start Date of Conference17/06/2017
End Date of Conference17/06/2017
Place of ConferenceAustin, TX
Country/Region of ConferenceUnited States of America
Year2017
Month6
PublisherIEEE
Pages1 - 8
ISBN978-1-5386-1537-9
eISBN978-1-5386-1536-2
LanguagesEnglish-United States
Keywordsnetwork routing, network synthesis, timing, trees (mathematics)

Last updated on 2020-31-07 at 03:06