HPTS: Heterogeneous Parallel Tabu Search for VLSI Placement

Parallelizing any algorithm on cluster of heterogenous workstations is presented using PVM. Two paralleliztion strategies,i.e., functional decomposition and multisearch thread strategies are integrated. THe proposed algorithm is testen on VLSI standard cell placement problem, however, the same algorithm can be used on any combinatorial optimization problem. The results are compared ignoring heterogeneity and are found to be superior in terms of execution time