Abstract
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.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| ISBN (Electronic) | 0769519261, 9780769519265 |
| DOIs | |
| State | Published - 2003 |
Publication series
| Name | Proceedings - International Parallel and Distributed Processing Symposium, IPDPS 2003 |
|---|
Bibliographical note
Publisher Copyright:© 2003 IEEE.
ASJC Scopus subject areas
- Computational Theory and Mathematics
- Theoretical Computer Science
- Software
Fingerprint
Dive into the research topics of 'Parallel tabu search in a heterogeneous environment'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver