(2003) Parallel Tabu Search in a Heterogeneous Environment. In: Proceedings of 17th International Parallel & Distributed Processing Symposium.
|
PDF
Yamani_PDPS_April2003.pdf Download (989kB) | Preview |
Abstract
Abstract In this paper, we discuss a parallel tabu search algorithm with implementation in a heterogeneous environment. Two parallelization strategies are integrated: functional decomposition and multi-search threads. In addition, domain decomposition strategy is implemented probabilistically. The performance of each strategy is observed and analyzed in terms of speeding up the search and finding better quality solutions. Experiments were conducted for the VLSI cell placement. 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.
| Item Type: | Conference or Workshop Item (Other) |
|---|---|
| Subjects: | Computer |
| Department: | College of Computing and Mathematics > Computer Engineering |
| Depositing User: | AbdulRahman |
| Date Deposited: | 25 Feb 2008 07:04 |
| Last Modified: | 01 Nov 2019 13:22 |
| URI: | http://eprints.kfupm.edu.sa/id/eprint/101 |