A parallel tabu search algorithm for optimizing multiobjective VLSI placement

Authors:
Mahmood R. Minhas;Sadiq M. Sait
Affiliations:
College of Computer Sciences & Engineering, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia;College of Computer Sciences & Engineering, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia
Venue:
ICCSA'05 Proceedings of the 2005 international conference on Computational Science and Its Applications - Volume Part IV
Year:
2005

Citing 7
Cited 3

On ordered weighted averaging aggregation operators in multicriteria decisionmaking

IEEE Transactions on Systems, Man and Cybernetics
Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem

Annals of Operations Research
Massively parallel tabu search for the quadratic assignment problem

Annals of Operations Research - Special issue on Tabu search
Parallel algorithms for VLSI computer-aided design

Parallel algorithms for VLSI computer-aided design
A parallel implementation of the tabu search heuristic for vehicle routing problems with time window constraints

Computers and Operations Research
VISI Physical Design Automation: Theory and Practice

VISI Physical Design Automation: Theory and Practice
Paper: Robust taboo search for the quadratic assignment problem

Parallel Computing

A new fuzzy operator and its application to topology design of distributed local area networks

Information Sciences: an International Journal
Evaluating parallel simulated evolution strategies for VLSI cell placement

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Cell assignment in hybrid CMOS/nanodevices architecture using Tabu Search

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.