Minhas, Mahmood R. and Sait, Sadiq M. (2005) A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement. LECTURE NOTES IN COMPUTER SCIENCE 3483: 587-595 2005.
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.
|Divisions:||College Of Computer Sciences and Engineering > Computer Engineering Dept|
|Creators:||Minhas, Mahmood R. and Sait, Sadiq M.|
|Deposited On:||09 Mar 2008 14:53|
|Last Modified:||12 Apr 2011 13:06|
Repository Staff Only: item control page