Parallel tabu search algorithm for VLSI standard-cell placement

Sadiq M. Sait, Habib Youssef, Hassan R. Barada, Ahmad Al-Yamani

Research output: Contribution to journalConference articlepeer-review

11 Scopus citations


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.

Original languageBritish English
Pages (from-to)II-581-II-584
JournalProceedings - IEEE International Symposium on Circuits and Systems
StatePublished - 2000
EventProceedings of the IEEE 2000 International Symposium on Circuits and Systems, ISCAS 2000 - Geneva, Switz, Switzerland
Duration: 28 May 200031 May 2000


Dive into the research topics of 'Parallel tabu search algorithm for VLSI standard-cell placement'. Together they form a unique fingerprint.

Cite this