A research on optimum-searching quadratic optimization for very large-scale standard cell placement

This paper presents a research on how to find the optimal or near optimal solution in the specific standard cell placement of very large-scale integration (VLSI) designs. The optimization methods currently used are faced with big difficulties in finding better placement result. This paper studies th...

Full description

Saved in:
Bibliographic Details
Main Authors: Yongqiang Lu, Xianlong Hong, Qiang Zhou, Yici Cai, Zhuoyuan Li
Format: Conference Proceeding
Language:English
Subjects:
Computer science
Design optimization
Electronic design automation and methodology
Lagrangian functions
Large scale integration
Large-scale systems
NP-hard problem
Optimization methods
Quadratic programming
Very large scale integration
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 819
container_issue
container_start_page 815
container_title
container_volume 2
creator Yongqiang Lu
Xianlong Hong
Qiang Zhou
Yici Cai
Zhuoyuan Li
description This paper presents a research on how to find the optimal or near optimal solution in the specific standard cell placement of very large-scale integration (VLSI) designs. The optimization methods currently used are faced with big difficulties in finding better placement result. This paper studies the quadratic optimization that is frequently adopted in this field and analyzes the difficulty it faces. Meanwhile, this paper suggests a very efficient quadratic programming based optimization method. This method employs the tactic of hybrid search based on multi-space search and search space traversing to try to find the optimum or near-optimum of the problem. Experimental results show that this method can make up with the shortcomings of the current quadratic optimization used in placement to a far extent and gains much placement improvement.
doi_str_mv 10.1109/ICASIC.2005.1611452
format conference_proceeding
fullrecord <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1611452</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1611452</ieee_id><sourcerecordid>1611452</sourcerecordid><originalsourceid>FETCH-ieee_primary_16114523</originalsourceid><addsrcrecordid>eNp9j09rwkAUxJdWoaL5BF72CyR9bzVJ9yihpZ7toTd5bJ66svnTt7FgP30DSo-FgRnmN5dRaomQIYJ93lab3bbKDECeYYG4zs2DmhksTFrm-eejSmz5AqNW1iAUkz-2xieVxHgGAITS2qKcKbfRwpFJ3El3re76wTeXJr01vj3qrwvVQoN3N-Z_xjwOD53ob5arDiRHTqOjwDoO1NYktXYcgu4DOW64HRZqeqAQObn7XC3fXj-q99Qz874X35Bc9_crq__pL4YlS2Y</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>A research on optimum-searching quadratic optimization for very large-scale standard cell placement</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Yongqiang Lu ; Xianlong Hong ; Qiang Zhou ; Yici Cai ; Zhuoyuan Li</creator><creatorcontrib>Yongqiang Lu ; Xianlong Hong ; Qiang Zhou ; Yici Cai ; Zhuoyuan Li</creatorcontrib><description>This paper presents a research on how to find the optimal or near optimal solution in the specific standard cell placement of very large-scale integration (VLSI) designs. The optimization methods currently used are faced with big difficulties in finding better placement result. This paper studies the quadratic optimization that is frequently adopted in this field and analyzes the difficulty it faces. Meanwhile, this paper suggests a very efficient quadratic programming based optimization method. This method employs the tactic of hybrid search based on multi-space search and search space traversing to try to find the optimum or near-optimum of the problem. Experimental results show that this method can make up with the shortcomings of the current quadratic optimization used in placement to a far extent and gains much placement improvement.</description><identifier>ISSN: 2162-7541</identifier><identifier>ISBN: 9780780392106</identifier><identifier>ISBN: 0780392108</identifier><identifier>EISSN: 2162-755X</identifier><identifier>DOI: 10.1109/ICASIC.2005.1611452</identifier><language>eng</language><publisher>IEEE</publisher><subject>Computer science ; Design optimization ; Electronic design automation and methodology ; Lagrangian functions ; Large scale integration ; Large-scale systems ; NP-hard problem ; Optimization methods ; Quadratic programming ; Very large scale integration</subject><ispartof>2005 6th International Conference on ASIC, 2005, Vol.2, p.815-819</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/1611452$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,777,781,786,787,2052,4036,4037,27906,54536,54901,54913</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1611452$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Yongqiang Lu</creatorcontrib><creatorcontrib>Xianlong Hong</creatorcontrib><creatorcontrib>Qiang Zhou</creatorcontrib><creatorcontrib>Yici Cai</creatorcontrib><creatorcontrib>Zhuoyuan Li</creatorcontrib><title>A research on optimum-searching quadratic optimization for very large-scale standard cell placement</title><title>2005 6th International Conference on ASIC</title><addtitle>ICASIC</addtitle><description>This paper presents a research on how to find the optimal or near optimal solution in the specific standard cell placement of very large-scale integration (VLSI) designs. The optimization methods currently used are faced with big difficulties in finding better placement result. This paper studies the quadratic optimization that is frequently adopted in this field and analyzes the difficulty it faces. Meanwhile, this paper suggests a very efficient quadratic programming based optimization method. This method employs the tactic of hybrid search based on multi-space search and search space traversing to try to find the optimum or near-optimum of the problem. Experimental results show that this method can make up with the shortcomings of the current quadratic optimization used in placement to a far extent and gains much placement improvement.</description><subject>Computer science</subject><subject>Design optimization</subject><subject>Electronic design automation and methodology</subject><subject>Lagrangian functions</subject><subject>Large scale integration</subject><subject>Large-scale systems</subject><subject>NP-hard problem</subject><subject>Optimization methods</subject><subject>Quadratic programming</subject><subject>Very large scale integration</subject><issn>2162-7541</issn><issn>2162-755X</issn><isbn>9780780392106</isbn><isbn>0780392108</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNp9j09rwkAUxJdWoaL5BF72CyR9bzVJ9yihpZ7toTd5bJ66svnTt7FgP30DSo-FgRnmN5dRaomQIYJ93lab3bbKDECeYYG4zs2DmhksTFrm-eejSmz5AqNW1iAUkz-2xieVxHgGAITS2qKcKbfRwpFJ3El3re76wTeXJr01vj3qrwvVQoN3N-Z_xjwOD53ob5arDiRHTqOjwDoO1NYktXYcgu4DOW64HRZqeqAQObn7XC3fXj-q99Qz874X35Bc9_crq__pL4YlS2Y</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Yongqiang Lu</creator><creator>Xianlong Hong</creator><creator>Qiang Zhou</creator><creator>Yici Cai</creator><creator>Zhuoyuan Li</creator><general>IEEE</general><scope>6IE</scope><scope>6IL</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIL</scope></search><sort><creationdate>2005</creationdate><title>A research on optimum-searching quadratic optimization for very large-scale standard cell placement</title><author>Yongqiang Lu ; Xianlong Hong ; Qiang Zhou ; Yici Cai ; Zhuoyuan Li</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-ieee_primary_16114523</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Computer science</topic><topic>Design optimization</topic><topic>Electronic design automation and methodology</topic><topic>Lagrangian functions</topic><topic>Large scale integration</topic><topic>Large-scale systems</topic><topic>NP-hard problem</topic><topic>Optimization methods</topic><topic>Quadratic programming</topic><topic>Very large scale integration</topic><toplevel>online_resources</toplevel><creatorcontrib>Yongqiang Lu</creatorcontrib><creatorcontrib>Xianlong Hong</creatorcontrib><creatorcontrib>Qiang Zhou</creatorcontrib><creatorcontrib>Yici Cai</creatorcontrib><creatorcontrib>Zhuoyuan Li</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 Xplore (Online service)</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>Yongqiang Lu</au><au>Xianlong Hong</au><au>Qiang Zhou</au><au>Yici Cai</au><au>Zhuoyuan Li</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>A research on optimum-searching quadratic optimization for very large-scale standard cell placement</atitle><btitle>2005 6th International Conference on ASIC</btitle><stitle>ICASIC</stitle><date>2005</date><risdate>2005</risdate><volume>2</volume><spage>815</spage><epage>819</epage><pages>815-819</pages><issn>2162-7541</issn><eissn>2162-755X</eissn><isbn>9780780392106</isbn><isbn>0780392108</isbn><abstract>This paper presents a research on how to find the optimal or near optimal solution in the specific standard cell placement of very large-scale integration (VLSI) designs. The optimization methods currently used are faced with big difficulties in finding better placement result. This paper studies the quadratic optimization that is frequently adopted in this field and analyzes the difficulty it faces. Meanwhile, this paper suggests a very efficient quadratic programming based optimization method. This method employs the tactic of hybrid search based on multi-space search and search space traversing to try to find the optimum or near-optimum of the problem. Experimental results show that this method can make up with the shortcomings of the current quadratic optimization used in placement to a far extent and gains much placement improvement.</abstract><pub>IEEE</pub><doi>10.1109/ICASIC.2005.1611452</doi></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 2162-7541
ispartof 2005 6th International Conference on ASIC, 2005, Vol.2, p.815-819
issn 2162-7541
2162-755X
language eng
recordid cdi_ieee_primary_1611452
source IEEE Electronic Library (IEL) Conference Proceedings
subjects Computer science
Design optimization
Electronic design automation and methodology
Lagrangian functions
Large scale integration
Large-scale systems
NP-hard problem
Optimization methods
Quadratic programming
Very large scale integration
title A research on optimum-searching quadratic optimization for very large-scale standard cell placement
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-19T17%3A14%3A22IST&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=A%20research%20on%20optimum-searching%20quadratic%20optimization%20for%20very%20large-scale%20standard%20cell%20placement&rft.btitle=2005%206th%20International%20Conference%20on%20ASIC&rft.au=Yongqiang%20Lu&rft.date=2005&rft.volume=2&rft.spage=815&rft.epage=819&rft.pages=815-819&rft.issn=2162-7541&rft.eissn=2162-755X&rft.isbn=9780780392106&rft.isbn_list=0780392108&rft_id=info:doi/10.1109/ICASIC.2005.1611452&rft_dat=%3Cieee_6IE%3E1611452%3C/ieee_6IE%3E%3Cgrp_id%3Ecdi_FETCH-ieee_primary_16114523%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1611452&rfr_iscdi=true