A Parallel Tabu Search Strategy for Cell Placement in VLSI Circuit Design
—Tabu Search based cell placement approaches for VLSI circuit design have shown excellent results when executed on a single processor. However, they require signicant computation time. Of the various acceleration strategies attempted, parallelization has always exhibited the most potential. The para...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2020
|
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/1455/1/d2_s7_p2_1569047619.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | —Tabu Search based cell placement approaches for VLSI circuit design have shown excellent results when executed on a single processor. However, they require signicant computation time. Of the various acceleration strategies attempted, parallelization has always exhibited the most potential. The parallel Tabu Search approach presented in this work can be classied as a synchronous master-slave p-control, RS and MPSS strategy. The approach is implemented on a dedicated Linux-based cluster of workstations, using MPI libraries for communication. Experimental results for ISCAS'89 benchmark circuits show excellent performance in terms of scalability & speed-up. |
|---|