Timing driven genetic algorithm for standard-cell placement
In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. At early generations, the search is biased toward solutions with superior timing characteristics. As the algorithm starts converging toward generations with acceptable d...
محفوظ في:
| المؤلف الرئيسي: | |
|---|---|
| مؤلفون آخرون: | , , , |
| التنسيق: | article |
| منشور في: |
1995
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://eprints.kfupm.edu.sa/id/eprint/14553/1/14553_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14553/2/14553_2.doc |
| الوسوم: |
إضافة وسم
لا توجد وسوم, كن أول من يضع وسما على هذه التسجيلة!
|
| _version_ | 1864513394203164672 |
|---|---|
| author | Sait, Sadiq M. |
| author2 | Youssef, H. Nassar, K. Benton, M.S.T. unknown |
| author2_role | author author author author |
| author_facet | Sait, Sadiq M. Youssef, H. Nassar, K. Benton, M.S.T. unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Sait, Sadiq M. Youssef, H. Nassar, K. Benton, M.S.T. unknown |
| dc.date.none.fl_str_mv | 1995-03 2020 |
| dc.format.none.fl_str_mv | application/pdf application/msword |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14553/1/14553_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14553/2/14553_2.doc (1995) Timing driven genetic algorithm for standard-cell placement. Computers and Communications, 1995. Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix conference, 1. |
| dc.language.none.fl_str_mv | en en |
| dc.publisher.none.fl_str_mv | IEEE |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/14553/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | Timing driven genetic algorithm for standard-cell placement |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | In this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. At early generations, the search is biased toward solutions with superior timing characteristics. As the algorithm starts converging toward generations with acceptable delay properties, the objective is dynamically adjusted toward optimizing area and routability. Experiments with test circuits demonstrate delay performance improvement by up to 20%. Without any noticeable loss in solution quality, sizable reduction in runtime is obtained when population size is allowed to decrease in a controlled manner whenever the search hits a plateau |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_774b18ff68581fa73c13cedc997bd5de |
| identifier_str_mv | (1995) Timing driven genetic algorithm for standard-cell placement. Computers and Communications, 1995. Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix conference, 1. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::14553 |
| publishDate | 1995 |
| publisher.none.fl_str_mv | IEEE |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | Timing driven genetic algorithm for standard-cell placementSait, Sadiq M.Youssef, H.Nassar, K.Benton, M.S.T.unknownComputerIn this paper we present a timing-driven placer for standard-cell IC design. The placement algorithm follows the genetic paradigm. At early generations, the search is biased toward solutions with superior timing characteristics. As the algorithm starts converging toward generations with acceptable delay properties, the objective is dynamically adjusted toward optimizing area and routability. Experiments with test circuits demonstrate delay performance improvement by up to 20%. Without any noticeable loss in solution quality, sizable reduction in runtime is obtained when population size is allowed to decrease in a controlled manner whenever the search hits a plateauIEEE1995-032020ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfapplication/mswordhttps://eprints.kfupm.edu.sa/id/eprint/14553/1/14553_1.pdfhttps://eprints.kfupm.edu.sa/id/eprint/14553/2/14553_2.doc (1995) Timing driven genetic algorithm for standard-cell placement. Computers and Communications, 1995. Conference Proceedings of the 1995 IEEE Fourteenth Annual International Phoenix conference, 1. enenhttps://eprints.kfupm.edu.sa/id/eprint/14553/info:eu-repo/semantics/openAccessoai::145532019-11-01T14:06:21Z |
| spellingShingle | Timing driven genetic algorithm for standard-cell placement Sait, Sadiq M. Computer |
| status_str | publishedVersion |
| title | Timing driven genetic algorithm for standard-cell placement |
| title_full | Timing driven genetic algorithm for standard-cell placement |
| title_fullStr | Timing driven genetic algorithm for standard-cell placement |
| title_full_unstemmed | Timing driven genetic algorithm for standard-cell placement |
| title_short | Timing driven genetic algorithm for standard-cell placement |
| title_sort | Timing driven genetic algorithm for standard-cell placement |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/14553/1/14553_1.pdf https://eprints.kfupm.edu.sa/id/eprint/14553/2/14553_2.doc |