A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement | Zendy

Mahmood R. Minhas | Zendy; Sadiq M. Sait | Zendy

AI Assistant Blog Pricing

Home ZAIA Blog

Open Access

A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement

Author(s) -

Mahmood R. Minhas,

Sadiq M. Sait

Publication year - 2005

Publication title -

lecture notes in computer science

Language(s) - English

Resource type - Book series

SCImago Journal Rank - 0.249

H-Index - 400

eISSN - 1611-3349

pISSN - 0302-9743

ISBN - 3-540-25863-9

DOI - 10.1007/11424925_62

Subject(s) - tabu search , computer science , benchmark (surveying) , very large scale integration , speedup , parallel computing , algorithm , workstation , genetic algorithm , electronic circuit , parallel algorithm , mathematical optimization , mathematics , geodesy , engineering , machine learning , electrical engineering , embedded system , geography , operating system

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.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research