A parallel tabu search algorithm for VLSI standard-cell placement
VLSI standard-cell placement is an NP-hard problem to which various heuristics have been applied. In this work, tabu search placement algorithm is parallelized on a network of workstations using PVM. The objective of the algorithm is to achieve the best possible solution in terms of interconnection...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Format: | article |
| Published: |
2000
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/14201/1/14201_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14201/2/14201_2.doc |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | VLSI standard-cell placement is an NP-hard problem to which various heuristics have been applied. In this work, tabu search placement algorithm is parallelized on a network of workstations using PVM. The objective of the algorithm is to achieve the best possible solution in terms of interconnection length, overall area of the circuit, and critical path delay (circuit speed). Two parallelization strategies are integrated: functional decomposition strategy and multi-search threads strategy. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed |
|---|