| Summary: | 碩士 === 中原大學 === 資訊工程學系 === 85 ===
In this thesis, we study the over-the-cell channel routing problem for the new cell model in which all the pins are positioned along a horizontal line inside the corresponding cells. We present a three-step approach to this problem under the assumption that two metal layers are available for routing in the two over-the-cell regiongs and three metal layers are available for routing in the channel. The first step is to consider the three routing regions ( i.e, the channel and the two over-the-cell regions ) as an expended channel. and to apply any existing two-layer channel router to generate a routing solution that consists of a set of tracks. The second step is to assign each track to exactly one of the three routing regions, and to re-arrange under the three-layer environment the set of tracks that are assigned tothe channel in such a way that without violating any constraints, the resulting channel has as less number of tracks as possible. The problem to be solved in the second step can be formulated as a constrained two-processor scheduling problem, for which we develop an optimal algorithm of polynomial time. The last step of our approach is to generate the final over-the-cell channel routing solution by connecting each vertical wire to its corresponding track(s).
Our approach has been implemented in C language, and expenimented reaults are also provided to support it.
|
|---|
