Al-Yamani, Ahmad and Sait, Sadiq M. and Barada, Hassan (2002) HPTS: Heterogeneous Parallel Tabu Search for VLSI Placement. In: IEEE Congress on Evolutionary Computation'', Honolulu, Hawaii, USA.
![[img]](http://eprints.kfupm.edu.sa/style/images/fileicons/application_pdf.png)
| PDF 1036Kb |
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) |
|---|---|
| Date: | 01 May 2002 |
| Subjects: | Computer |
| Divisions: | College Of Computer Sciences and Engineering > Computer Engineering Dept |
| Creators: | Al-Yamani, Ahmad and Sait, Sadiq M. and Barada, Hassan |
| Email: | UNSPECIFIED, sadiq@kfupm.edu.sa, UNSPECIFIED |
| ID Code: | 106 |
| Deposited By: | AbdulRahman |
| Deposited On: | 25 Feb 2008 11:11 |
| Last Modified: | 12 Apr 2011 13:06 |
Repository Staff Only: item control page