HPTS: Heterogeneous Parallel Tabu Search for VLSI Placement

(2002) HPTS: Heterogeneous Parallel Tabu Search for VLSI Placement. In: IEEE Congress on Evolutionary Computation'', Honolulu, Hawaii, USA.

[img]
Preview
PDF
Yamani_CEC_May2002.pdf

Download (1MB) | Preview

Abstract

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.

Item Type: Conference or Workshop Item (Other)
Subjects: Computer
Divisions: College Of Computer Sciences and Engineering > Computer Engineering Dept
Depositing User: AbdulRahman
Date Deposited: 25 Feb 2008 11:11
Last Modified: 01 Nov 2019 16:22
URI: http://eprints.kfupm.edu.sa/id/eprint/106