Efficient octilinear steiner tree construction based on spanning graphs

ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753) Pub Date : 2004-01-27 DOI:10.1109/ASPDAC.2004.1337680

Qiming Zhu, H. Zhou, Tong Jing, Xianlong Hong, Yang Yang

引用次数: 17

Abstract

0ctilinear interconnect is a promising technique to shorten wire lengths. We present two practical heuristic octilinear Steiner tree (OSMT) algorithms in the paper. They are both based on octilinear spanning graphs. The one by edge substitution (OST-E) has a worst case running time of O(nlogn) and similar performance as the batched greedy algorithm[9]. The other one by triangle contraction (OST-T) has a small increase in running time and better performance. Experiments on both industry and random test cases are conducted.

查看原文本刊更多论文

基于生成图的高效八线性steiner树构造

线性互连是一种很有前途的缩短导线长度的技术。本文提出了两种实用的启发式八线性斯坦纳树(OSMT)算法。它们都是基于八线性生成图的。边缘替换算法(OST-E)的最坏情况运行时间为0 (nlogn)，性能与批处理贪婪算法相似[9]。另一种是三角收缩(OST-T)，运行时间增加较少，性能更好。在工业和随机测试用例上进行了实验。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

ASP-DAC 2004: Asia and South Pacific Design Automation Conference 2004 (IEEE Cat. No.04EX753)

自引率

0.00%

发文量