KFUPM ePrints

HPTS: heterogeneous parallel tabu search for VLSI placement

Al-Yamani, A. and Sait, Sadiq M. and Barada, H.R. (2002) HPTS: heterogeneous parallel tabu search for VLSI placement. Evolutionary Computation, 2002. CEC '02. Proceedings of the 2002 Congress on, 1.

[img]
Preview
PDF
18Kb
[img]Microsoft Word
26Kb

Abstract

Parallelizing any algorithm on a cluster of heterogeneous workstations is not easy, as each workstation requires different wall clock time to execute the same instruction set. In this work, a parallel tabu search algorithm for heterogeneous workstations is presented using PVM. Two parallelization strategies, i.e., functional decomposition and multi-search thread strategies are integrated. The proposed algorithm is tested on the 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



Item Type:Article
Date:May 2002
Date Type:Publication
Subjects:Computer
Divisions:College Of Computer Sciences and Engineering > Computer Engineering Dept
Creators:Al-Yamani, A. and Sait, Sadiq M. and Barada, H.R.
Email:UNSPECIFIED, sadiq@kfupm.edu.sa, UNSPECIFIED
ID Code:14586
Deposited By:KFUPM ePrints Admin
Deposited On:24 Jun 2008 16:41
Last Modified:12 Apr 2011 13:16

Repository Staff Only: item control page