Self-reforming routing for stochastic search in VLSI interconnection layout
Self-reforming routing for stochastic search in VLSI interconnection layout
复制标题
VLSI互连布局中随机搜索的自重组布线
DOI：
10.1109/aspdac.2000.835076
复制
发表时间：
2000
期刊：
影响因子：
--
通讯作者：
Y. Kajitani
中科院分区：
文献类型：
--
作者：
Yukiko Kubo;Y. Takashima;S. Nakatake;Y. Kajitani
给定一条连接一层路由区域（斯坦纳树）上的终端的路由，翻转是使当前路由在其外围域内改变其配置的过程。翻转通过用最小的绕路替换一条路线的边来改变路线。一条路线可以翻转附近的一个障碍。如果障碍是另一条路线，一个更有组织的操作，称为双翻转，应用于一对路线。这个想法被增强为2层hv路由。利用多目标评价函数对一条路线或一组路线进行改造，在模拟退火中对翻转和双翻转的性能进行了测试。观察到一些独特和令人满意的结果。
Given a route which connects terminals on a one-layer routing area (Steiner tree), flip is a procedure that makes a current route change its configuration within its peripheral domain. A flip reforms a route by replacing one of its edges with a minimal detour. A route can flip one nearby obstacle. If the obstacle is another route, a more organized operation, called the dual flip, is applied to a pair of routes. The idea is enhanced to 2-layer hv-routing. The performance of flip and dual flip was tested in simulated annealing which reforms a route or a set of routes with respect to the evaluation function of multiple objectives. Some unique and satisfiable results were observed.