抄録
A bucket algorithm is proposed for zero-skew routing with linear time complexity on the average. Our algorithm is much simpler and more efficient than the best known algorithm which uses Delaunay triangulations for segments on Manhattan distance. Experimental results show that the linearity of our algorithm is accomplished. Our algorithm generates a zero-skew routing for 3000-pin benchmark data within 5 seconds on a 90MIPS RISC workstation.
| 本文言語 | English |
|---|---|
| ページ（範囲） | 375-380 |
| ページ数 | 6 |
| ジャーナル | Proceedings - Design Automation Conference |
| 出版ステータス | Published - 1994 |
| 外部発表 | はい |
| イベント | Proceedings of the 31st Design Automation Conference - San Diego, CA, USA 継続期間: 1994 6月 6 → 1994 6月 10 |
ASJC Scopus subject areas
- ハードウェアとアーキテクチャ
- 制御およびシステム工学