Placement with Boundary Constraints Using B*-trees
碩士 === 國立交通大學 === 資訊科學系 === 89 === In this thesis, we study the placement problem with boundary constraints and develop a simulated annealing based algorithm using the B*-tree representation for non-slicing structure. The B*-tree has been shown a flexible and efficie...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2001
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/05506361375595845648 |
| Summary: | 碩士 === 國立交通大學 === 資訊科學系 === 89 === In this thesis, we study the placement problem with boundary constraints
and develop a simulated annealing based algorithm using the
B*-tree representation for non-slicing structure.
The B*-tree has been shown a flexible and efficient representation
conveying geometric information well in the binary tree structure.
By restricting boundary-constrained modules in some particular positions
in a B*-tree, an appropriate B*-tree is generated to get a
feasible placement with all its boundary-constrained modules
being placed along the boundaries.
The experimental results show that our algorithm can obtain
superior outcomes in contrast to the method using
the sequence-pair representation.
|
|---|