Almost linear time optimization for single-row floorplanning

Almost linear time optimization for single-row floorplanning

Given n cells with their areas and aspect ratio constraints, we present an O(n+d log d) time algorithm to obtain the optimal floorplan of placing these n cells into a single-row, where d is related to the total number of distinct cell classes. Since d is much smaller than n in practical design, our...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Teng-Sheng Moh, Hakimi, S.L., Moh, W.M.
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Polynomials
Shape
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page 362 vol.1
container_issue
container_start_page 359
container_title
container_volume 1
creator Teng-Sheng Moh
Hakimi, S.L.
Moh, W.M.
description Given n cells with their areas and aspect ratio constraints, we present an O(n+d log d) time algorithm to obtain the optimal floorplan of placing these n cells into a single-row, where d is related to the total number of distinct cell classes. Since d is much smaller than n in practical design, our algorithm runs in almost linear time for practical problems.
doi_str_mv 10.1109/MWSCAS.1994.519256
format Conference Proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_519256</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>519256</ieee_id><sourcerecordid>519256</sourcerecordid><originalsourceid>FETCH-LOGICAL-i104t-c6968a8e211af1fec273f78f0468b830a36beaaf4bd228e276328db3a0b965693</originalsourceid><addsrcrecordid>eNotj91KxDAUhAMiKGtfYK_yAq05SZom4E0p_sGKF6t4uZzsJhJJm5IWRJ_ewDoMfDAMA0PIFlgDwMzty8d-6PcNGCObFgxv1QWpTKdZseCSa35FqmX5YkWyBRDsmtz1cUzLSmOYHGa6htHRNBeEX1xDmqhPmS5h-oyuzumb-phSniNOU8luyKXHuLjqnxvy_nD_NjzVu9fH56Hf1QGYXOujMkqjdhwAPXh35J3wnfZMKm21YCiUdYhe2hPnpdYpwfXJCmTWqFYZsSHb825wzh3mHEbMP4fzRfEH0MpHuQ</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Almost linear time optimization for single-row floorplanning</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Teng-Sheng Moh ; Hakimi, S.L. ; Moh, W.M.</creator><creatorcontrib>Teng-Sheng Moh ; Hakimi, S.L. ; Moh, W.M.</creatorcontrib><description>Given n cells with their areas and aspect ratio constraints, we present an O(n+d log d) time algorithm to obtain the optimal floorplan of placing these n cells into a single-row, where d is related to the total number of distinct cell classes. Since d is much smaller than n in practical design, our algorithm runs in almost linear time for practical problems.</description><identifier>ISBN: 9780780324282</identifier><identifier>ISBN: 0780324285</identifier><identifier>DOI: 10.1109/MWSCAS.1994.519256</identifier><language>eng</language><publisher>IEEE</publisher><subject>Polynomials ; Shape</subject><ispartof>Proceedings of 1994 37th Midwest Symposium on Circuits and Systems, 1994, Vol.1, p.359-362 vol.1</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/519256$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,776,780,785,786,2052,4036,4037,27902,54895</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/519256$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Teng-Sheng Moh</creatorcontrib><creatorcontrib>Hakimi, S.L.</creatorcontrib><creatorcontrib>Moh, W.M.</creatorcontrib><title>Almost linear time optimization for single-row floorplanning</title><title>Proceedings of 1994 37th Midwest Symposium on Circuits and Systems</title><addtitle>MWSCAS</addtitle><description>Given n cells with their areas and aspect ratio constraints, we present an O(n+d log d) time algorithm to obtain the optimal floorplan of placing these n cells into a single-row, where d is related to the total number of distinct cell classes. Since d is much smaller than n in practical design, our algorithm runs in almost linear time for practical problems.</description><subject>Polynomials</subject><subject>Shape</subject><isbn>9780780324282</isbn><isbn>0780324285</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>1994</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNotj91KxDAUhAMiKGtfYK_yAq05SZom4E0p_sGKF6t4uZzsJhJJm5IWRJ_ewDoMfDAMA0PIFlgDwMzty8d-6PcNGCObFgxv1QWpTKdZseCSa35FqmX5YkWyBRDsmtz1cUzLSmOYHGa6htHRNBeEX1xDmqhPmS5h-oyuzumb-phSniNOU8luyKXHuLjqnxvy_nD_NjzVu9fH56Hf1QGYXOujMkqjdhwAPXh35J3wnfZMKm21YCiUdYhe2hPnpdYpwfXJCmTWqFYZsSHb825wzh3mHEbMP4fzRfEH0MpHuQ</recordid><startdate>1994</startdate><enddate>1994</enddate><creator>Teng-Sheng Moh</creator><creator>Hakimi, S.L.</creator><creator>Moh, W.M.</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>1994</creationdate><title>Almost linear time optimization for single-row floorplanning</title><author>Teng-Sheng Moh ; Hakimi, S.L. ; Moh, W.M.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i104t-c6968a8e211af1fec273f78f0468b830a36beaaf4bd228e276328db3a0b965693</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>1994</creationdate><topic>Polynomials</topic><topic>Shape</topic><toplevel>online_resources</toplevel><creatorcontrib>Teng-Sheng Moh</creatorcontrib><creatorcontrib>Hakimi, S.L.</creatorcontrib><creatorcontrib>Moh, W.M.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP All) 1998-Present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Teng-Sheng Moh</au><au>Hakimi, S.L.</au><au>Moh, W.M.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Almost linear time optimization for single-row floorplanning</atitle><btitle>Proceedings of 1994 37th Midwest Symposium on Circuits and Systems</btitle><stitle>MWSCAS</stitle><date>1994</date><risdate>1994</risdate><volume>1</volume><spage>359</spage><epage>362 vol.1</epage><pages>359-362 vol.1</pages><isbn>9780780324282</isbn><isbn>0780324285</isbn><abstract>Given n cells with their areas and aspect ratio constraints, we present an O(n+d log d) time algorithm to obtain the optimal floorplan of placing these n cells into a single-row, where d is related to the total number of distinct cell classes. Since d is much smaller than n in practical design, our algorithm runs in almost linear time for practical problems.</abstract><pub>IEEE</pub><doi>10.1109/MWSCAS.1994.519256</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISBN: 9780780324282
ispartof Proceedings of 1994 37th Midwest Symposium on Circuits and Systems, 1994, Vol.1, p.359-362 vol.1
issn
language eng
recordid cdi_ieee_primary_519256
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Polynomials
Shape
title Almost linear time optimization for single-row floorplanning
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-29T20%3A41%3A27IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Almost%20linear%20time%20optimization%20for%20single-row%20floorplanning&rft.btitle=Proceedings%20of%201994%2037th%20Midwest%20Symposium%20on%20Circuits%20and%20Systems&rft.au=Teng-Sheng%20Moh&rft.date=1994&rft.volume=1&rft.spage=359&rft.epage=362%20vol.1&rft.pages=359-362%20vol.1&rft.isbn=9780780324282&rft.isbn_list=0780324285&rft_id=info:doi/10.1109/MWSCAS.1994.519256&rft_dat=%3Cieee_6IE%3E519256%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=519256&rfr_iscdi=true