| Summary: | 碩士 === 中原大學 === 資訊工程研究所 === 94 === In this paper, we proposed a new approach which simultaneously considers timing slack, congestion, crosstalk and the present of obstacles during global routing stage. First, we determine the net routing order by ascending slack evaluated by Elmore delay model. For each determined two-pin net, we compute the integrated cost including crosstalk and congestion of each grid assuming that the routing paths are L or Z-shaped. Then detour will be introduced when nets cross the obstacles.
During the progress of the algorithm, we dynamically update the information of slack, congestion, and crosstalk. When a global routing path with a set of horizontal and vertical segments is found, a crosstalk-driven method is used to assign the segments to the proper tracks.
Compared with results of previous methods, our algorithm can achieve 4~8% improvement on average of routability under various time constraints. Moreover, even more than 4~8% paths are routed successfully, there are still 3% of effective total coupling wire length are reduced.
|
|---|
