A new routing algorithm and its hardware implementation
T. Watanabe, Yoshi Sugiyama · 1986
Presented is a new parallel processing wire routing algorithm that can control path quality in two point connections and find a quasi-minimum Steiner tree for multi-point connections. A parallel rip-up technique for finding a candidate path which blocks an unconnected net is also presented. These routing algorithms are implemented on a two-dimensional array processor, the AAP-1. It is experimentally shown that the average AAP-1 execution time per net using the routing algorithm is 100 msec in a 256X256 grid.