A unified partitioning and placement approach based on Tabu search algorithm
- Univ. of Waterloo (Canada)
Our work describes a new constructive placement algorithm based on a partitioning scheme which utilizes Tabu Search to guide the search. Interchange methods usually used for partitioning get stuck at local minima. Tabu Search guides such a heuristic to continue exploration without getting stuck at a local optimum from which it previously emerged. The initial solution to the Tabu Search partitioning algorithm is based on a quadratic model that generates a global initial solution. The optimal continuous value placement will not put modules in appropriate slots. The result will lead to modules overlapping and more or less confined to the center of the region. Our partitionning scheme is used to actually place modules more uniformly on the chip. This is achieved by minimizing the total nets cut and wire length between the rows of the chip. Good initial starting points are very important for the iterative placement procedure. The main advantage is reducing the amount of CPU time for the latter to swap modules between rows and within rows to effectively reduce wire length.
- OSTI ID:
- 35775
- Report Number(s):
- CONF-9408161--
- Country of Publication:
- United States
- Language:
- English
Similar Records
Tabu search: Improved solution alternatives
Linking search space structure, run-time dynamics, and problem difficulty : a step toward demystifying tabu search.