GLOBAL OPTIMIZATION ALGORITHMS FOR CHIP LAYOUT AND COMPACTION
The package planning (chip layout and compaction) problem can be stated in terms of an optimization problem. The goal is to find the relative placement and shapes of the chips in a way that minimizes the total chip area subject to linear and nonlinear constraints. The constraints arise from geometri...
Uloženo v:
| Vydáno v: | Engineering optimization Ročník 25; číslo 2; s. 131 - 154 |
|---|---|
| Hlavní autoři: | , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis Group
01.10.1995
|
| Témata: | |
| ISSN: | 0305-215X, 1029-0273 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Abstract | The package planning (chip layout and compaction) problem can be stated in terms of an optimization problem. The goal is to find the relative placement and shapes of the chips in a way that minimizes the total chip area subject to linear and nonlinear constraints. The constraints arise from geometric design rules, distance and connectivity requirements between various components, area and communication costs and other designer-specified requirements. The problem has been addressed in various settings. It is of unusual computational difficulty due to the nonconvexities- involved. This paper presents a new mixed-integer nonlinear programming formulation for simultaneous chip layout and two-dimensional compaction. Global optimization algorithms are developed for this model as well as for an existing formulation for the chip compaction problem. These algorithms are implemented with the global optimization software BARON and illustrated by solving several example problems. |
|---|---|
| AbstractList | The package planning (chip layout and compaction) problem can be stated in terms of an optimization problem. The goal is to find the relative placement and shapes of the chips in a way that minimizes the total chip area subject to linear and nonlinear constraints. The constraints arise from geometric design rules, distance and connectivity requirements between various components, area and communication costs and other designer-specified requirements. The problem has been addressed in various settings. It is of unusual computational difficulty due to the nonconvexities- involved. This paper presents a new mixed-integer nonlinear programming formulation for simultaneous chip layout and two-dimensional compaction. Global optimization algorithms are developed for this model as well as for an existing formulation for the chip compaction problem. These algorithms are implemented with the global optimization software BARON and illustrated by solving several example problems. |
| Author | DORNEICH, MICHAEL C. SAHINIDIS, NIKOLAOS V. |
| Author_xml | – sequence: 1 givenname: MICHAEL C. surname: DORNEICH fullname: DORNEICH, MICHAEL C. organization: Department of Electrical and Computer Engineering – sequence: 2 givenname: NIKOLAOS V. surname: SAHINIDIS fullname: SAHINIDIS, NIKOLAOS V. organization: Department of Mechanical and Industrial Engineering , University of Illinois |
| BookMark | eNp90M9Kw0AQBvBFKthWH8BbXiA6s5t_C3pYo20DabfUFNRL2GyyEEkT2QSkb29LPSl6msN8v2H4JmTUdm1FyDXCDUIEt8DAp-hzHyLuIfX5GRkjUO4CDdmIjI979xB4uSCTvn8HQAYQjcn9PJUPInXkOkuWyZvIErlyRDqXmyRbLJ-dmdw48SJZO6l4ldvMEatHJ5bLtYiPyUtyblTTV1ffc0q2s6csXripnCexSF1NeTC4noGCFyYszeHBUEGgURtPs0BXAddR6ZWeRwsDWDBe6hKZbypqEGkY8QojxaYkPN3Vtut7W5lc14Ma6q4drKqbHCE_tpD_auEg8Yf8sPVO2f2_5u5k6tZ0dqc-O9uU-aD2TWeNVa2u-5z9zb8AoSltQw |
| CitedBy_id | crossref_primary_10_1007_s10898_023_01358_w crossref_primary_10_1080_02331934_2024_2323684 crossref_primary_10_1002_oca_3177 crossref_primary_10_1080_02331934_2020_1812603 crossref_primary_10_1016_j_chaos_2023_114144 crossref_primary_10_1155_2018_9146309 crossref_primary_10_1007_s12190_024_02202_4 crossref_primary_10_1007_s12190_024_02244_8 crossref_primary_10_1186_s13662_025_03981_1 crossref_primary_10_1186_s13660_018_1947_9 crossref_primary_10_1007_s11075_023_01689_5 crossref_primary_10_1016_j_cam_2021_114080 crossref_primary_10_1155_2014_697321 crossref_primary_10_1016_j_cor_2008_11_002 crossref_primary_10_1016_j_cor_2010_10_016 crossref_primary_10_1007_s12532_018_0147_4 crossref_primary_10_1016_S0098_1354_99_80231_2 crossref_primary_10_3390_math8030315 crossref_primary_10_1007_BF00138693 crossref_primary_10_1007_s10898_020_00919_7 crossref_primary_10_3934_math_2025938 crossref_primary_10_1016_j_cam_2023_115100 crossref_primary_10_1007_s11075_023_01523_y crossref_primary_10_1016_j_jclepro_2024_142377 crossref_primary_10_1080_02331934_2016_1269765 crossref_primary_10_1007_s10898_012_9874_7 crossref_primary_10_1023_A_1021279918708 crossref_primary_10_1155_2011_409491 crossref_primary_10_1080_00207160_2024_2407887 crossref_primary_10_1155_2016_3204368 crossref_primary_10_1002_aic_690490714 crossref_primary_10_1016_S0098_1354_02_00262_4 crossref_primary_10_1023_A_1008241411395 crossref_primary_10_1016_j_cam_2022_114784 crossref_primary_10_1016_j_jclepro_2021_128780 crossref_primary_10_1007_s10898_024_01416_x crossref_primary_10_1080_10556788_2022_2157002 crossref_primary_10_1016_j_cam_2024_116481 crossref_primary_10_1016_j_ejor_2015_12_018 crossref_primary_10_1007_s10107_011_0462_2 crossref_primary_10_1007_s12008_016_0362_z crossref_primary_10_1016_j_apm_2015_03_025 crossref_primary_10_1088_1367_2630_aae72a crossref_primary_10_1007_s11075_025_02137_2 crossref_primary_10_1007_s11075_024_01961_2 crossref_primary_10_1016_j_cam_2015_11_009 crossref_primary_10_1080_02331934_2023_2253816 crossref_primary_10_1016_j_cam_2024_116035 crossref_primary_10_1007_s10255_015_0456_6 crossref_primary_10_4028_www_scientific_net_AMR_765_767_1196 crossref_primary_10_1007_s10479_008_0462_7 crossref_primary_10_1016_j_ejor_2022_06_006 crossref_primary_10_1007_s10957_024_02461_y crossref_primary_10_1007_s10898_025_01519_z crossref_primary_10_1007_s10898_023_01277_w crossref_primary_10_1016_j_amc_2005_11_111 crossref_primary_10_1016_j_chaos_2023_113924 crossref_primary_10_1088_2632_072X_abe27f |
| Cites_doi | 10.1145/58859.58863 10.1145/127601.127708 10.1007/BF00122429 10.1109/PROC.1981.12167 10.1016/0098-1354(94)00097-2 10.1145/157485.164947 10.1109/DAC.1992.227787 10.1007/3-540-53032-0 10.1007/978-3-662-02947-3 10.1016/S0019-9958(83)80038-2 10.1007/978-3-322-92106-2 10.1109/TCAD.1987.1270329 10.1109/43.137505 |
| ContentType | Journal Article |
| Copyright | Copyright Taylor & Francis Group, LLC 1995 |
| Copyright_xml | – notice: Copyright Taylor & Francis Group, LLC 1995 |
| DBID | AAYXX CITATION |
| DOI | 10.1080/03052159508941259 |
| DatabaseName | CrossRef |
| DatabaseTitle | CrossRef |
| DatabaseTitleList | |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 1029-0273 |
| EndPage | 154 |
| ExternalDocumentID | 10_1080_03052159508941259 8941259 |
| GroupedDBID | -~X 07I 0R~ 1TA 4.4 4B5 5GY 5VS AAYLN ABJNI ACGEJ ACGFS ACGOD ACIWK ADCVX ADXEU ADXPE AEHZU AENEX AEPSL AEYOC AEZBV AFION AGBLW AGYFW AKHJE AKMBP ALMA_UNASSIGNED_HOLDINGS ALXIB AQTUD AWYRJ BGSSV C0- C5H CS3 DEXXA EBS EJD FETWF H13 HZ~ IFELN L8C NA5 NUSFT NX~ O9- P2P PQQKQ TAJZE TAP TDBHL TFL TFT TFW TN5 UB6 .7F .QJ 0BK 29G 2DF 30N AAENE AAGDL AAHIA AAJMT AALDU AAMIU AAPUL AAQRR AAYXX ABCCY ABFIM ABHAV ABLIJ ABPAQ ABPEM ABTAI ABXUL ABXYU ACTIO ACTTO ADGTB ADUMR AEISY AEOZL AFBWG AFFNX AFKVX AFRVT AGBKS AGDLA AGMYJ AGVKY AGWUF AHDZW AIJEM AIYEW AJWEG AKBVH AKOOK ALQZU ALRRR AQRUH ARCSS AVBZW BLEHA BWMZZ CAG CCCUG CE4 CITATION COF CYRSC DAOYK DGEBU DKSSO E~A E~B GTTXZ HF~ H~P IPNFZ J.P KYCEM LJTGL M4Z OPCYK RIG RNANH ROSJB RTWRZ S-T SNACF TASJS TBQAZ TEN TNC TTHFI TUROJ TWF UT5 UU3 ZGOLN ~S~ |
| ID | FETCH-LOGICAL-c296t-4f0b9bf7df5957a06c1cf4c36ce69c8d4d442bf01b39dcd135fe2f112789e18a3 |
| IEDL.DBID | TFW |
| ISICitedReferencesCount | 70 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=10_1080_03052159508941259&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 0305-215X |
| IngestDate | Sat Nov 29 02:09:54 EST 2025 Tue Nov 18 21:46:29 EST 2025 Mon Oct 20 23:46:15 EDT 2025 |
| IsPeerReviewed | true |
| IsScholarly | true |
| Issue | 2 |
| Language | English |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c296t-4f0b9bf7df5957a06c1cf4c36ce69c8d4d442bf01b39dcd135fe2f112789e18a3 |
| PageCount | 24 |
| ParticipantIDs | informaworld_taylorfrancis_310_1080_03052159508941259 crossref_citationtrail_10_1080_03052159508941259 crossref_primary_10_1080_03052159508941259 |
| PublicationCentury | 1900 |
| PublicationDate | 1995-10-01 |
| PublicationDateYYYYMMDD | 1995-10-01 |
| PublicationDate_xml | – month: 10 year: 1995 text: 1995-10-01 day: 01 |
| PublicationDecade | 1990 |
| PublicationTitle | Engineering optimization |
| PublicationYear | 1995 |
| Publisher | Taylor & Francis Group |
| Publisher_xml | – name: Taylor & Francis Group |
| References | Kedem G. (CIT0012) 1984 CIT0030 Floudas C. A. (CIT0006) 1990; 455 CIT0032 CIT0031 Mirchandani P. B. (CIT0019) 1990 Lengauer T. (CIT0014) 1988 Murtagh B. A. (CIT0020) 1986 Preas B. T. (CIT0025) 1988 Hill D. (CIT0009) 1989 Otten R. H. J. M. (CIT0023) 1983 Maling K. (CIT0017) 1982; 19 Ryoo H. S. (CIT0027) 1994 Hu T. C. (CIT0011) 1985 Francis R. L. (CIT0007) 1992 Otten R. H. J. M. (CIT0022) 1981 Heller W. R. (CIT0008) 1982; 19 Lengauer T. (CIT0013) 1982 McCormick G. P. (CIT0018) 1983 CIT0021 CIT0001 Ryoo H. S. (CIT0026) 1995; 19 Yao S.-Z. (CIT0035) 1993 Lengauer T. (CIT0015) 1990 Pardalos P. M. (CIT0024) 1994 Sahinidis N. V. (CIT0028) 1994 Brooke A. (CIT0002) 1988 Love R. F. (CIT0016) 1988 (CIT0004) 1993 Walanabe H. (CIT0033) 1984 Wolf W. H. (CIT0034) 1988 Cieslielski M. J. (CIT0003) 1982; 19 CIT0005 CIT0029 Horst R. (CIT0010) 1993 |
| References_xml | – start-page: 12 volume-title: IEEE Trans, on.Computer Aided Design of Integrated Circuits and Systems year: 1984 ident: CIT0012 – volume-title: Physical Design Automation of VLSI Systems year: 1988 ident: CIT0025 – volume-title: GAMS-A User's Guide year: 1988 ident: CIT0002 doi: 10.1145/58859.58863 – volume-title: Facility Layout and Location An Analytical Approach year: 1992 ident: CIT0007 – volume-title: Physical Design Automation of VLSI Systems year: 1988 ident: CIT0014 – ident: CIT0021 doi: 10.1145/127601.127708 – ident: CIT0029 doi: 10.1007/BF00122429 – ident: CIT0030 doi: 10.1109/PROC.1981.12167 – volume-title: Nonlinear Programming. Theory, Algorithms, and Applications year: 1983 ident: CIT0018 – volume-title: MINOS 5.0 Users Guide year: 1986 ident: CIT0020 – volume-title: IC Layout Generation and Compaction Using Mathematical Optimization year: 1984 ident: CIT0033 – volume-title: Discrete Location Theory year: 1990 ident: CIT0019 – volume: 19 start-page: 551 year: 1995 ident: CIT0026 publication-title: Computers & Chemical Engineering doi: 10.1016/0098-1354(94)00097-2 – volume-title: Facilities Location. Models & Methods year: 1988 ident: CIT0016 – start-page: 395 volume-title: Proc. 30th /ACM/IEEE Design Automation Conference year: 1993 ident: CIT0035 doi: 10.1145/157485.164947 – volume-title: VLSI Circuit Layout Theory and Design year: 1985 ident: CIT0011 – volume: 19 start-page: 30 volume-title: Proc. I9th ACM/IEEE Design Automation Conference year: 1982 ident: CIT0003 – start-page: 358 volume-title: Proceedings, 21rd Annual Symp. on Foundations of Computer Science year: 1982 ident: CIT0013 – ident: CIT0001 doi: 10.1109/DAC.1992.227787 – volume-title: Using the CPLEX Callable Library and CPLEX Mixed Integer Library year: 1993 ident: CIT0004 – volume: 455 volume-title: A Collection of Test Problems for Constrained Global Optimization Algorithms year: 1990 ident: CIT0006 doi: 10.1007/3-540-53032-0 – start-page: 499 volume-title: Proc. Int. Conf. on Computer Design year: 1983 ident: CIT0023 – volume-title: Handbook of Global Optimization year: 1994 ident: CIT0024 – volume: 19 start-page: 253 volume-title: Proc. 19th ACM J IEEE Design Automation Conference year: 1982 ident: CIT0008 – volume-title: Global Optimization Deterministic Approaches year: 1993 ident: CIT0010 doi: 10.1007/978-3-662-02947-3 – ident: CIT0031 doi: 10.1016/S0019-9958(83)80038-2 – year: 1994 ident: CIT0027 publication-title: Journal of Global Optimization – volume-title: Combinatorial Algorithms for Integrated Circuit Layout year: 1990 ident: CIT0015 doi: 10.1007/978-3-322-92106-2 – volume-title: Physical Design Automation of VLSI Systems year: 1988 ident: CIT0034 – volume-title: Algorithms and Techniques for VLSI Layout Synthesis year: 1989 ident: CIT0009 – ident: CIT0005 doi: 10.1109/TCAD.1987.1270329 – start-page: 261 volume-title: Proc. 18th ACM /IEEE Design Automation Conference year: 1981 ident: CIT0022 – ident: CIT0032 doi: 10.1109/43.137505 – volume-title: The Branch And Reduce Optimization Navigator (BARON) year: 1994 ident: CIT0028 – volume: 19 start-page: 663 volume-title: Proceedings 19th ACM/IEEE Design Automation Conference year: 1982 ident: CIT0017 |
| SSID | ssj0013008 |
| Score | 1.6481816 |
| Snippet | The package planning (chip layout and compaction) problem can be stated in terms of an optimization problem. The goal is to find the relative placement and... |
| SourceID | crossref informaworld |
| SourceType | Enrichment Source Index Database Publisher |
| StartPage | 131 |
| SubjectTerms | branch-and-reduce chip layout and compaction mixed-integer nonlinear programming package planning |
| Title | GLOBAL OPTIMIZATION ALGORITHMS FOR CHIP LAYOUT AND COMPACTION |
| URI | https://www.tandfonline.com/doi/abs/10.1080/03052159508941259 |
| Volume | 25 |
| WOSCitedRecordID | wos10_1080_03052159508941259&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: PRVAWR databaseName: Taylor & Francis customDbUrl: eissn: 1029-0273 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0013008 issn: 0305-215X databaseCode: TFW dateStart: 19740101 isFulltext: true titleUrlDefault: https://www.tandfonline.com providerName: Taylor & Francis |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV1LS8QwEA4iHvTgW1xf5OBJKPaRpsnBQ13dB3S3Rbu4eilpmoAgq-xWf79J2uquqAe9z5SQTvJ9k0y-AeDUlnmhabLl-dizUE4DK8cBtpBgDDHiu0wYndkoGA7JeEyTujZnVpdV6hxaVkIRZq_Wi5vls6Yi7lzHqEIq3b-UIgXQ-vmeYvU6vtPO3ecdgm360WlrS5mPmzvN776wgEoLmqVzaNPZ-Oc4N8F6TTNhWMXFFlgSk22wNic-uAMuulF8GUYwTlK1gT2YsyoYRt34pp_2BrdQpYew3esnMArv41EKw-EVbMeDpCo72QWjznXa7ll1MwWLuxSXFpJ2TnMZFFINKGA25g6XiHuYC0w5KVCBkJtL28k9WvDC8XwpXKnYWECocAjz9sDy5Hki9gHEhfAJF4gob5W9-MRWFF2BIRW2x4KCtIDdTGbGa6Vx3fDiKXMaQdKvM9MCZx8uL5XMxm_G_vwfykpztiGrRiSZ96PfwR_9DsGqechuSviOwHI5fRXHYIW_lY-z6YkJuneV_cuM |
| linkProvider | Taylor & Francis |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELWgIAEHdkRZfeCEFJHFSewDh1DoItIkglQULlHiRUJCBbWB78fOAi0CDnCfiSxn4jczfnkDwIkuMqbSZM2yHUtDGXG1zHEdDfE0RSm2zZQXOrO-GwR4OCRR1XCbVLRKVUOLUiiiOKvVx62a0TUl7kwFqYQqNcCUIInQZB4s2BJnFaUvbt993iLoxUQ6Za5J-2F9q_ndI2ZwaUa1dApv2mv_Xek6WK0yTeiVobEB5vhoE6xM6Q9ugfOOH154PgyjWJ5hD0W7Cnp-J7zpxd3-LZQVImx1exH0vftwEEMvuIStsB-VzJNtMGhfxa2uVs1T0KhJnFxDQs9IJlwm5ILcVHeoQQWilkO5QyhmiCFkZkI3MoswygzLFtwUMiFzMeEGTq0d0Bg9j_gugA7jNqYcYektCxgb6zJLl3hIuG6lLsNNoNe7mdBKbFzNvHhKjFqT9OvONMHph8tLqbTxm7E9_YqSvGhviHIWSWL96Lf3R79jsNSN-37i94LrfbBc_NdeMPoOQCMfv_JDsEjf8sfJ-KiIwHeXlM-t |
| linkToPdf | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwpV3JTsMwELWgIAQHdkRZfeCEFJHFSewDh9DSRaRJBKkoXKLEi4SEStUGvh_HSaFFwAHuM5ZlT_xm7Jc3AJzpImNFmqxZtmNpKCOuljmuoyGepijFtplypTPru0GABwMSVdycSUWrLGpoUQpFqLO6-LhHTEwZcRdFjEqkKvqXEiQBmiyCJSWMJcM5bt1_PiLoqiFdYa5J-8H0UfO7IeZgaU60dAZuWhv_nOgmWK_yTOiVgbEFFvhwG6zNqA_ugMu2H155PgyjWJ5gj-qyCnp-O7ztxp3eHZT1IWx0uhH0vYewH0MvaMJG2ItK3sku6Leu40ZHq7opaNQkTq4hoWckEy4TckJuqjvUoAJRy6HcIRQzxBAyM6EbmUUYZYZlC24KmY65mHADp9YeqA1fhnwfQIdxG1OOsPSW5YuNdZmjSzQkXLdSl-E60KeLmdBKarzoePGcGFNF0q8rUwfnHy6jUmfjN2N7doeSXF1uiLITSWL96HfwR79TsBI1W4nfDW4Owar6qV3R-Y5ALR-_8mOwTN_yp8n4RMXfOw8_zlE |
| 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=GLOBAL+OPTIMIZATION+ALGORITHMS+FOR+CHIP+LAYOUT+AND+COMPACTION&rft.jtitle=Engineering+optimization&rft.au=DORNEICH%2C+MICHAEL+C.&rft.au=SAHINIDIS%2C+NIKOLAOS+V.&rft.date=1995-10-01&rft.pub=Taylor+%26+Francis+Group&rft.issn=0305-215X&rft.eissn=1029-0273&rft.volume=25&rft.issue=2&rft.spage=131&rft.epage=154&rft_id=info:doi/10.1080%2F03052159508941259&rft.externalDocID=8941259 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-215X&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-215X&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-215X&client=summon |