Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Construction of All Rectilinear Steiner Minimum Trees on the Hanan Grid and Its Applications to VLSI Design
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ( IF 2.7 ) Pub Date : 2020-06-01 , DOI: 10.1109/tcad.2019.2917896
Sheng-En David Lin , Dae Hyun Kim

A rectilinear Steiner minimum tree (RSMT) is a rectilinear Steiner tree connecting a given set of pins with the shortest wirelength. RSMT construction is one of the most frequently used algorithms in the physical design automation, including floorplanning, placement, routing, and interconnect estimation and optimization. Thus, efficient algorithms to construct RSMTs have been developed for many years in academia and industry. Unfortunately, RSMT construction is an NP-hard problem, so even a fast RSMT construction algorithm, such as GeoSteiner is too slow to use in physical design automation tools. FLUTE, a fast lookup-table-based RSMT construction algorithm, builds and uses a routing topology database to quickly construct RSMTs. In this paper, we present an algorithm to build a database (ARSMT DB) to construct all RSMTs on the Hanan grid for a given set of pins. ARSMT DB constructs all RSMTs in almost no time, so numerous applications could use it for various purposes. We apply the ARSMT DB to two applications, timing-driven RSMT construction and congestion-aware global routing, and show that the ARSMT DB can help reduce source-to-critical-sink lengths, source-to-critical-sink delays, and routing congestion significantly. Since the size of the original ARSMT DB is too large, we present techniques to reduce the database size.

中文翻译:

Hanan网格上所有直线Steiner最小树的构建及其在VLSI设计中的应用

直线 Steiner 最小树 (RSMT) 是一种直线 Steiner 树,将一组给定的引脚与最短的线长连接起来。RSMT 构造是物理设计自动化中最常用的算法之一,包括平面规划、布局、布线以及互连估计和优化。因此,学术界和工业界已经开发了构建 RSMT 的有效算法多年。不幸的是,RSMT 构造是一个 NP-hard 问题,因此即使是快速的 RSMT 构造算法,例如 GeoSteiner,在物理设计自动化工具中使用也太慢。FLUTE 是一种基于快速查找表的 RSMT 构建算法,它构建并使用路由拓扑数据库来快速构建 RSMT。在本文中,我们提出了一种构建数据库 (ARSMT DB) 的算法,以在 Hanan 网格上为给定的一组引脚构建所有 RSMT。ARSMT DB 几乎可以立即构建所有 RSMT,因此许多应用程序可以将其用于各种目的。我们将 ARSMT DB 应用于两个应用程序,时序驱动的 RSMT 构建和拥塞感知全局路由,并表明 ARSMT DB 可以帮助减少源到关键接收器的长度、源到关键接收器的延迟和路由拥堵严重。由于原始 ARSMT 数据库的大小太大,我们提出了减少数据库大小的技术。并表明 ARSMT DB 可以帮助显着减少源到关键接收器的长度、源到关键接收器的延迟和路由拥塞。由于原始 ARSMT 数据库的大小太大,我们提出了减少数据库大小的技术。并表明 ARSMT DB 可以帮助显着减少源到关键接收器的长度、源到关键接收器的延迟和路由拥塞。由于原始 ARSMT 数据库的大小太大,我们提出了减少数据库大小的技术。
更新日期:2020-06-01
down
wechat
bug