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. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Minhas, M. R., & Sait, S. M. (2005). A parallel tabu search algorithm for optimizing multiobjective VLSI placement. In Lecture Notes in Computer Science (Vol. 3483, pp. 587–595). Springer Verlag. https://doi.org/10.1007/11424925_62
Mendeley helps you to discover research relevant for your work.