Abstract
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.
| Original language | English |
|---|---|
| Pages (from-to) | 375-380 |
| Number of pages | 6 |
| Journal | Proceedings - Design Automation Conference |
| Publication status | Published - 1994 |
| Externally published | Yes |
| Event | Proceedings of the 31st Design Automation Conference - San Diego, CA, USA Duration: 1994 Jun 6 → 1994 Jun 10 |
ASJC Scopus subject areas
- Hardware and Architecture
- Control and Systems Engineering