Abstract
In this thesis, we study a global routing problem that considers buses. If a router routes a design that contains buses without considering the length-matching issue of buses, the result may cause worse timing mismatch for a bus. To tackle this problem, we present a bus-aware global router that handles the length-matching issue of buses by modifying a well-known global router, NTHU-Route 2.0, with the following enhancements: (1) a new net ordering determination method for rip-up and reroute, and (2) a length-bounded hybrid unilateral monotonic routing method. The experimental results show that our router can successfully solve 9 of 11 benchmarks without causing any overflow. In particular, for one of the 9 benchmarks, NTHU-Route 2.0 cannot completely eliminate its total overflow. In addition, our global router can produce a high quality solution in terms of total bus wirelength deviation, while maintaining comparable total wirelength and runtime efficiency.