Efficient zero-skew routing algorithm

Masato Edahiro*

*Corresponding author for this work

Research output: Contribution to journalConference articlepeer-review

37 Citations (Scopus)


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 languageEnglish
Pages (from-to)375-380
Number of pages6
JournalProceedings - Design Automation Conference
Publication statusPublished - 1994
Externally publishedYes
EventProceedings of the 31st Design Automation Conference - San Diego, CA, USA
Duration: 1994 Jun 61994 Jun 10

ASJC Scopus subject areas

  • Hardware and Architecture
  • Control and Systems Engineering


Dive into the research topics of 'Efficient zero-skew routing algorithm'. Together they form a unique fingerprint.

Cite this