A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement
Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed tech...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , |
| Format: | article |
| Published: |
2005
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/260/1/J_Minhas_ICCSA_2005.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513379805167616 |
|---|---|
| author | Minhas, Mahmood R. |
| author2 | Sait, Sadiq M. unknown |
| author2_role | author author |
| author_facet | Minhas, Mahmood R. Sait, Sadiq M. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Minhas, Mahmood R. Sait, Sadiq M. unknown |
| dc.date.none.fl_str_mv | 2005 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/260/1/J_Minhas_ICCSA_2005.pdf (2005) A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement. LECTURE NOTES IN COMPUTER SCIENCE 3483: 587-595 2005. |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/260/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | Abstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed technique employs a candidate list partitioning strategy based on distribution of mutually disjoint set of moves among the slave processes. The implementation is carried out on a dedicated cluster of workstations. Experimental results using ISCAS-85/89 benchmark circuits illustrating quality and speedup trends are presented. A comparison of the obtained results is made with the results of a parallel genetic algorithm (GA) implementation. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_c314542e5ca4ed2250a2477bb603f959 |
| identifier_str_mv | (2005) A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement. LECTURE NOTES IN COMPUTER SCIENCE 3483: 587-595 2005. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::260 |
| publishDate | 2005 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI PlacementMinhas, Mahmood R.Sait, Sadiq M.unknownComputerAbstract. In this paper, we present a parallel tabu search (TS) algorithm for efficient optimization of a constrained multiobjective VLSI standard cell placement problem. The primary purpose is to accelerate TS algorithm to reach near optimal placement solutions for large circuits. The proposed technique employs a candidate list partitioning strategy based on distribution of mutually disjoint set of moves among the slave processes. The implementation is carried out on a dedicated cluster of workstations. Experimental results using ISCAS-85/89 benchmark circuits illustrating quality and speedup trends are presented. A comparison of the obtained results is made with the results of a parallel genetic algorithm (GA) implementation.20052020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/260/1/J_Minhas_ICCSA_2005.pdf (2005) A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement. LECTURE NOTES IN COMPUTER SCIENCE 3483: 587-595 2005. enhttps://eprints.kfupm.edu.sa/id/eprint/260/info:eu-repo/semantics/openAccessoai::2602019-11-01T13:23:16Z |
| spellingShingle | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement Minhas, Mahmood R. Computer |
| status_str | publishedVersion |
| title | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement |
| title_full | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement |
| title_fullStr | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement |
| title_full_unstemmed | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement |
| title_short | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement |
| title_sort | A Parallel Tabu Search Algorithm for Optimizing Multiobjective VLSI Placement |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/260/1/J_Minhas_ICCSA_2005.pdf |