A Parallel Tabu Search Strategy for Cell Placement in VLSI Circuit Design. IEEEGCC 2007.
|
PDF
d2_s7_p2_1569047619.pdf Download (137kB) | Preview |
Abstract
—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.
| Item Type: | Article |
|---|---|
| Department: | College of Computing and Mathematics > Computer Engineering |
| Depositing User: | Users 4447 not found. |
| Date Deposited: | 02 Jun 2008 10:17 |
| Last Modified: | 01 Nov 2019 13:27 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/1455 |