Fully Dynamic Evaluation of Sequence Pair
In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational significance of efficient updates of the criterion value after dynamic updates, instead of recomputing it from scratch each time, has attracte...
Uložené v:
| Vydané v: | IEEE transactions on computer-aided design of integrated circuits and systems Ročník 32; číslo 6; s. 894 - 904 |
|---|---|
| Hlavný autor: | |
| Médium: | Journal Article |
| Jazyk: | English |
| Vydavateľské údaje: |
IEEE
01.06.2013
|
| Predmet: | |
| ISSN: | 0278-0070, 1937-4151 |
| On-line prístup: | Získať plný text |
| Tagy: |
Pridať tag
Žiadne tagy, Buďte prvý, kto otaguje tento záznam!
|
| Abstract | In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational significance of efficient updates of the criterion value after dynamic updates, instead of recomputing it from scratch each time, has attracted a lot of research. In this paper, motivated by the significance of the sequence pair (SP) representation for floorplanning, we develop a fully dynamic algorithm of SP evaluation, that efficiently updates a criterion value after insertions and deletions of SP elements and after modifications of element weights. Our result is based on a new data structure for the predecessor problem, which maintains the whole history of its dynamic modifications, and the path-compression technique from the union-find problem, which efficiently support predecessor queries. Numerical experiments showed that our algorithm exhibits linear-time behavior and considerably reduces the time of SP evaluation, compared to other approaches. |
|---|---|
| AbstractList | In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational significance of efficient updates of the criterion value after dynamic updates, instead of recomputing it from scratch each time, has attracted a lot of research. In this paper, motivated by the significance of the sequence pair (SP) representation for floorplanning, we develop a fully dynamic algorithm of SP evaluation, that efficiently updates a criterion value after insertions and deletions of SP elements and after modifications of element weights. Our result is based on a new data structure for the predecessor problem, which maintains the whole history of its dynamic modifications, and the path-compression technique from the union-find problem, which efficiently support predecessor queries. Numerical experiments showed that our algorithm exhibits linear-time behavior and considerably reduces the time of SP evaluation, compared to other approaches. |
| Author | Kozik, A. |
| Author_xml | – sequence: 1 givenname: A. surname: Kozik fullname: Kozik, A. email: andrzej.kozik@outlook.com organization: Inst. of Comput. Eng., Control & Robot., Wroclaw Univ. of Technol., Wroclaw, Poland |
| BookMark | eNp9j0tLw0AUhQepYFr9AeImWxep984zsyx9qFBQsK7DzOQGRtJEk1Tov9fa4sKFq7M53-F8YzZq2oYYu0aYIoK928xniykHFFPOpdSSn7EErTCZRIUjlgA3eQZg4IKN-_4NAKXiNmG3q11d79PFvnHbGNLlp6t3bohtk7ZV-kIfO2oCpc8udpfsvHJ1T1ennLDX1XIzf8jWT_eP89k6C1yrIbOlc-BtwNybUlsCL3zFfUAubLDkdSWcVprnEEwpQpBE6Kx3wihJXjkxYea4G7q27zuqihCHn0tD52JdIBQH4-JgXByMi5PxN4l_yPcubl23_5e5OTKRiH77WqHWIhdfJx1jCw |
| CODEN | ITCSDI |
| CitedBy_id | crossref_primary_10_1007_s10878_015_9973_8 crossref_primary_10_1016_j_amc_2013_06_086 crossref_primary_10_1109_TCAD_2017_2748003 |
| Cites_doi | 10.1109/TCAD.2011.2114531 10.1109/43.969434 10.1016/0304-3975(91)90145-R 10.1145/370155.370522 10.1109/TVLSI.2003.816137 10.1109/43.552084 10.1109/TCAD.2010.2041850 10.1109/ICCAD.2004.1382639 10.1109/ICCAD.1995.480159 10.1109/TCAD.2006.870076 10.1016/0022-0000(78)90020-X 10.1007/s10479-008-0460-9 10.1109/TCAD.2011.2174640 10.1145/937503.937505 10.1145/2160916.2160956 10.1145/73007.73040 10.1137/10078791X 10.1007/978-3-642-02927-1_62 10.1145/1119772.1119836 10.1137/090751670 10.1145/321879.321884 10.1007/BF01786986 10.1109/TVLSI.2004.830915 10.1145/343647.343713 10.1109/TVLSI.2003.817546 10.1145/1391962.1391975 10.1145/359581.359603 10.1145/364099.364331 10.1109/TCAD.2008.927760 10.1109/TCAD.2005.859519 10.1109/TCAD.2011.2170567 10.1007/BF01683268 10.1145/332357.332395 10.1145/378239.379062 10.1145/1629911.1630028 10.1145/606603.606607 10.1145/1119772.1119835 10.1109/DAC.1999.781324 |
| ContentType | Journal Article |
| DBID | 97E RIA RIE AAYXX CITATION |
| DOI | 10.1109/TCAD.2013.2244642 |
| DatabaseName | IEEE All-Society Periodicals Package (ASPP) 2005-present IEEE All-Society Periodicals Package (ASPP) 1998-Present IEEE Electronic Library (IEL) CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| Database_xml | – sequence: 1 dbid: RIE name: IEEE Electronic Library (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1937-4151 |
| EndPage | 904 |
| ExternalDocumentID | 10_1109_TCAD_2013_2244642 6516638 |
| Genre | orig-research |
| GroupedDBID | --Z -~X 0R~ 29I 4.4 5GY 5VS 6IK 97E AAJGR AARMG AASAJ AAWTH ABAZT ABQJQ ABVLG ACGFS ACIWK ACNCT AENEX AETIX AGQYO AGSQL AHBIQ AI. AIBXA AKJIK AKQYR ALLEH ALMA_UNASSIGNED_HOLDINGS ASUFR ATWAV BEFXN BFFAM BGNUA BKEBE BPEOZ CS3 DU5 EBS EJD HZ~ H~9 IBMZZ ICLAB IFIPE IFJZH IPLJI JAVBF LAI M43 O9- OCL P2P PZZ RIA RIE RNS TN5 VH1 VJK AAYXX CITATION |
| ID | FETCH-LOGICAL-c265t-9daa0b9c18b7d69e0b3bf2bc1239c9eb6f3a656280c7d3cc4ee1a9ba3754eb5a3 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 5 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000319187100008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0278-0070 |
| IngestDate | Sat Nov 29 01:40:38 EST 2025 Tue Nov 18 21:37:43 EST 2025 Tue Aug 26 16:43:22 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 6 |
| Language | English |
| License | https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c265t-9daa0b9c18b7d69e0b3bf2bc1239c9eb6f3a656280c7d3cc4ee1a9ba3754eb5a3 |
| PageCount | 11 |
| ParticipantIDs | ieee_primary_6516638 crossref_citationtrail_10_1109_TCAD_2013_2244642 crossref_primary_10_1109_TCAD_2013_2244642 |
| PublicationCentury | 2000 |
| PublicationDate | 2013-06-01 |
| PublicationDateYYYYMMDD | 2013-06-01 |
| PublicationDate_xml | – month: 06 year: 2013 text: 2013-06-01 day: 01 |
| PublicationDecade | 2010 |
| PublicationTitle | IEEE transactions on computer-aided design of integrated circuits and systems |
| PublicationTitleAbbrev | TCAD |
| PublicationYear | 2013 |
| Publisher | IEEE |
| Publisher_xml | – name: IEEE |
| References | ref35 ref13 ref12 ref37 ref15 ref14 kuehlmann (ref21) 2003 ref31 ref30 ref33 ref11 ref32 ref10 he (ref5) 2008 ref2 brodnik (ref38) 2001 ref1 ref39 ref17 ref16 ref19 chang (ref29) 2000 ref18 cormen (ref34) 1990 ref46 ref24 ref45 ref23 ref26 ref25 ref20 ref41 ref44 johnson (ref36) 1982; 15 cong (ref43) 2013 ref28 ref27 takahashi (ref22) 1996; vld96 ref8 ref7 ref9 ref4 ref3 ref6 ref40 (ref42) 2013 |
| References_xml | – ident: ref11 doi: 10.1109/TCAD.2011.2114531 – ident: ref23 doi: 10.1109/43.969434 – ident: ref40 doi: 10.1016/0304-3975(91)90145-R – ident: ref32 doi: 10.1145/370155.370522 – ident: ref27 doi: 10.1109/TVLSI.2003.816137 – ident: ref19 doi: 10.1109/43.552084 – ident: ref6 doi: 10.1109/TCAD.2010.2041850 – ident: ref12 doi: 10.1109/ICCAD.2004.1382639 – ident: ref20 doi: 10.1109/ICCAD.1995.480159 – year: 2013 ident: ref43 publication-title: HB Suite – ident: ref10 doi: 10.1109/TCAD.2006.870076 – ident: ref41 doi: 10.1016/0022-0000(78)90020-X – start-page: 523 year: 2001 ident: ref38 article-title: Worst case constant time priority queue publication-title: Proc 12th Annu ACM-SIAM Symp Discrete Algorithms – ident: ref15 doi: 10.1007/s10479-008-0460-9 – ident: ref18 doi: 10.1109/TCAD.2011.2174640 – start-page: 458 year: 2000 ident: ref29 article-title: <formula formulatype="inline"><tex Notation="TeX">${\rm B}^{\ast}$</tex></formula>-trees: A new representation for non-slicing floorplans publication-title: Proc 35th Annu Conf Des Autom – ident: ref3 doi: 10.1145/937503.937505 – year: 1990 ident: ref34 publication-title: Introduction to Algorithms – ident: ref30 doi: 10.1145/2160916.2160956 – year: 2003 ident: ref21 publication-title: Best of ICCAD 20 Years of Excellence in Computer-Aided Design – volume: vld96 start-page: 31 year: 1996 ident: ref22 article-title: An algorithm for finding a maximum-weight decreasing sequence in a permutation, motivated by rectangle packing problem publication-title: IEICE Tech Rep VLSI Design Technol – ident: ref37 doi: 10.1145/73007.73040 – ident: ref2 doi: 10.1137/10078791X – ident: ref46 doi: 10.1007/978-3-642-02927-1_62 – ident: ref31 doi: 10.1145/1119772.1119836 – ident: ref1 doi: 10.1137/090751670 – ident: ref39 doi: 10.1145/321879.321884 – volume: 15 start-page: 295 year: 1982 ident: ref36 article-title: A priority queue in which initialization and queue operations take <formula formulatype="inline"><tex Notation="TeX">${O}(\log\log{D})$</tex> </formula> time publication-title: Math Syst Theory doi: 10.1007/BF01786986 – ident: ref16 doi: 10.1109/TVLSI.2004.830915 – ident: ref45 doi: 10.1145/343647.343713 – ident: ref44 doi: 10.1109/TVLSI.2003.817546 – ident: ref17 doi: 10.1145/1391962.1391975 – ident: ref24 doi: 10.1145/359581.359603 – ident: ref33 doi: 10.1145/364099.364331 – start-page: 16 year: 2008 ident: ref5 article-title: A novel fixed-outline floorplanner with zero deadspace for hierarchical design publication-title: Proc Int Conf Comput -Aided Design – ident: ref26 doi: 10.1109/TCAD.2008.927760 – ident: ref4 doi: 10.1109/TCAD.2005.859519 – ident: ref9 doi: 10.1109/TCAD.2011.2170567 – ident: ref35 doi: 10.1007/BF01683268 – ident: ref13 doi: 10.1145/332357.332395 – ident: ref14 doi: 10.1145/378239.379062 – ident: ref8 doi: 10.1145/1629911.1630028 – ident: ref25 doi: 10.1145/606603.606607 – year: 2013 ident: ref42 publication-title: GSRC Benchmark – ident: ref7 doi: 10.1145/1119772.1119835 – ident: ref28 doi: 10.1109/DAC.1999.781324 |
| SSID | ssj0014529 |
| Score | 2.0602248 |
| Snippet | In the electronic design automation field, as well as in other areas, problem instances and solutions are often subject to discrete changes. The foundational... |
| SourceID | crossref ieee |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 894 |
| SubjectTerms | Algorithm design and analysis Data structures Evaluation algorithm fully dynamic algorithm Heuristic algorithms History sequence pair Time complexity Vegetation |
| Title | Fully Dynamic Evaluation of Sequence Pair |
| URI | https://ieeexplore.ieee.org/document/6516638 |
| Volume | 32 |
| WOSCitedRecordID | wos000319187100008&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVIEE databaseName: IEEE Electronic Library (IEL) customDbUrl: eissn: 1937-4151 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0014529 issn: 0278-0070 databaseCode: RIE dateStart: 19820101 isFulltext: true titleUrlDefault: https://ieeexplore.ieee.org/ providerName: IEEE |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD5swwd98DbFeSMPvihmS9u0SR5FN3yQMXDK3kpuhYFsY26C_94krWWCCL6VkoT2S-A7J-fyAVxRblLnWBnsld8x1brAipICS09XbgrPQm3V6xMbDvlkIkYNuK1rYay1IfnMdv1jiOWbuV77q7JelkaOIHkTmoyxslarjhj4AGK4T_EdY905riKYERG9sfspn8SVdB1f0YzGPzhoQ1QlcMpg739fsw-7le2I7srNPoCGnR3CzkZHwTZce5fyEz2UOvOoX_fyRvMCPVdp02gkp8sjeBn0x_ePuFJDwDrO0hUWRkqihI64YiYTlqhEFbHSjnqEFlZlRSKdcRZzoplJtKbWRlIo6TVurUplcgyt2XxmTwCxyJo4CZtUUKrcupJp7k0rLimTRQfINz65rlqFe8WKtzy4DETkHtLcQ5pXkHbgpp6yKPtk_DW47eGsB1ZInv7--gy241KDApPoHFqr5dpewJb-WE3fl5fhFHwBQgat9g |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1bS8MwFD7MKagP3qY4r33wRTFb2qZt8ii6MXGOgVP2VnIrDGSVuQn-e5O0lgki-FZKEtovge-cnMsHcEGoioxjpZBVfkdEygwJgjPELV2ZKTR2tVUv_WQwoOMxG9bguqqF0Vq75DPdso8ulq9yubBXZe048g1B0hVYjQgJ_KJaq4oZ2BCiu1GxPWPNSS5jmD5m7ZH5LZvGFbYMY5GYBD9YaElWxbFKd_t_37MDW6X16N0U270LNT3dg82lnoINuLRO5ad3VyjNe52qm7eXZ95TmTjtDflktg_P3c7otodKPQQkgziaI6Y4x4JJn4pExUxjEYosENKQD5NMizgLuTHPAoplokIpidY-Z4JblVstIh4eQH2aT_UheImvVRC6bcoIEWZdnkhqjSvKScKzJuBvfFJZNgu3mhWvqXMaMEstpKmFNC0hbcJVNeWt6JTx1-CGhbMaWCJ59Pvrc1jvjR77af9-8HAMG0GhSIGwfwL1-WyhT2FNfswn77MzdyK-AIBLsT0 |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fully+Dynamic+Evaluation+of+Sequence+Pair&rft.jtitle=IEEE+transactions+on+computer-aided+design+of+integrated+circuits+and+systems&rft.au=Kozik%2C+A.&rft.date=2013-06-01&rft.pub=IEEE&rft.issn=0278-0070&rft.volume=32&rft.issue=6&rft.spage=894&rft.epage=904&rft_id=info:doi/10.1109%2FTCAD.2013.2244642&rft.externalDocID=6516638 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0278-0070&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0278-0070&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0278-0070&client=summon |