A Parallel Tabu Search Algorithm for VLSI Standard-Cell Placement

(2000) A Parallel Tabu Search Algorithm for VLSI Standard-Cell Placement. In: IEEE International Symposium on Circuits and Systems'', Geneva.

[img]
Preview
PDF
Sait_Yamani_ISCAS_2000.pdf

Download (716kB) | Preview

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)
Subjects: Computer
Divisions: College Of Computer Sciences and Engineering > Computer Engineering Dept
Depositing User: AbdulRahman
Date Deposited: 27 Feb 2008 10:10
Last Modified: 01 Nov 2019 16:22
URI: http://eprints.kfupm.edu.sa/id/eprint/146