Sait, Sadiq M. and Youssef, H. and Barada, Hassan and Al-Yamani, Ahmad (2000) A Parallel Tabu Search Algorithm for VLSI Standard-Cell Placement. In: IEEE International Symposium on Circuits and Systems'', Geneva.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF 699Kb |
Abstract
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 alogorithm is to achieve the best possible solution in terms of interconnection length, overall area of the circuit, and critical path delay
| Item Type: | Conference or Workshop Item (Other) |
|---|---|
| Date: | May 2000 |
| Subjects: | Computer |
| Divisions: | College Of Computer Sciences and Engineering > Computer Engineering Dept |
| Creators: | Sait, Sadiq M. and Youssef, H. and Barada, Hassan and Al-Yamani, Ahmad |
| Email: | sadiq@kfupm.edu.sa, youssef@kfupm.edu.sa, UNSPECIFIED, UNSPECIFIED |
| ID Code: | 146 |
| Deposited By: | AbdulRahman |
| Deposited On: | 27 Feb 2008 10:10 |
| Last Modified: | 12 Apr 2011 13:06 |
Repository Staff Only: item control page