(2005) A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement. LECTURE NOTES IN COMPUTER SCIENCE 3483: 587-595 2005.
|
PDF
J_Minhas_ICCSA_2005.pdf Download (180kB) | Preview |
Abstract
Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed technique employs a candidate list partitioning strategy based on distribution of mutually disjoint set of moves among the slave processes. The implementation is carried out on a dedicated cluster of workstations. Experimental results using ISCAS-85/89 benchmark circuits illustrating quality and speedup trends are presented. A comparison of the obtained results is made with the results of a parallel genetic algorithm (GA) implementation.
| Item Type: | Article |
|---|---|
| Subjects: | Computer |
| Department: | College of Computing and Mathematics > Computer Engineering |
| Depositing User: | AbdulRahman |
| Date Deposited: | 09 Mar 2008 11:53 |
| Last Modified: | 01 Nov 2019 13:23 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/260 |