Parallelizing Tabu Search on a Cluster of HeterogeneousWorkstations

Parallelizing Tabu Search on a Cluster of HeterogeneousWorkstations. JOURNAL OF HEURISTICS 8 (3): 277-304 MAY 2002.


Download (2MB) | Preview


In this paper, we present the parallelization of tabu search on a network of workstations using PVM. Two parallelization strategies are integrated: functional decomposition strategy and multi-search threads strategy. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed. The goal of parallelization is to speedup the search in finding better quality solutions. Observations support that both parallelization strategies are beneficial, with functional decomposition producing slightly better results. Experiments were conducted for the VLSI cell placement, an NP-hard problem, and the objective was to achieve the best possible solution in terms of interconnection length, timing performance (circuit speed), and area. The multiobjective nature of this problem is addressed using a fuzzy goal-based cost computation. Key Words: tabu search, parallel tabu search, metaheuristic, functional decomposition, multi-search threads, combinatorial optimization, VLSI, standard cell design, placement, fuzzy logic

Item Type: Article
Subjects: Computer
Department: College of Computing and Mathematics > Computer Engineering
Depositing User: AbdulRahman
Date Deposited: 09 Mar 2008 13:23
Last Modified: 01 Nov 2019 13:23