Slew Constrained Minimum Cost Buffering

A buffer insertion technique addresses slew constraints while minimizing buffer cost. The method builds initial solutions for the sinks, each having an associated cost, slew and capacitance. As a solution propagates toward a source, wire capacitance and wire slew arc added to the solution. When a bu...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: MAHMUD TUHIN, ALPERT CHARLES J, QUAY STEPHEN T, KARANDIKAR ARVIND K, SZE CHIN NGAI
Format: Patent
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
container_end_page
container_issue
container_start_page
container_title
container_volume
creator MAHMUD TUHIN
ALPERT CHARLES J
QUAY STEPHEN T
KARANDIKAR ARVIND K
SZE CHIN NGAI
description A buffer insertion technique addresses slew constraints while minimizing buffer cost. The method builds initial solutions for the sinks, each having an associated cost, slew and capacitance. As a solution propagates toward a source, wire capacitance and wire slew arc added to the solution. When a buffer is selected for possible insertion, the slew of the solution is set to zero while the cost of the solution is incremented based on the selected buffer and the capacitance is set to an intrinsic capacitance of the buffer. The solutions of two intersecting wire branches are merged by adding branch capacitances and costs, and selecting the highest branch slew. The solution sets are updated by disregarding solutions which have a slew component greater than a slew constraint, and any solution that is dominated by another solution is eliminated. The solution having the smallest cost is selected as the final solution.
format Patent
fullrecord <record><control><sourceid>epo_EVB</sourceid><recordid>TN_cdi_epo_espacenet_US2008016479A1</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>US2008016479A1</sourcerecordid><originalsourceid>FETCH-epo_espacenet_US2008016479A13</originalsourceid><addsrcrecordid>eNrjZFAPzkktV3DOzysuKUrMzEtNUfDNzMvMLc0FihWXKDiVpqWlFmXmpfMwsKYl5hSn8kJpbgZlN9cQZw_d1IL8-NTigsTk1LzUkvjQYCMDAwsDQzMTc0tHQ2PiVAEAJ4gorg</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>patent</recordtype></control><display><type>patent</type><title>Slew Constrained Minimum Cost Buffering</title><source>esp@cenet</source><creator>MAHMUD TUHIN ; ALPERT CHARLES J ; QUAY STEPHEN T ; KARANDIKAR ARVIND K ; SZE CHIN NGAI</creator><creatorcontrib>MAHMUD TUHIN ; ALPERT CHARLES J ; QUAY STEPHEN T ; KARANDIKAR ARVIND K ; SZE CHIN NGAI</creatorcontrib><description>A buffer insertion technique addresses slew constraints while minimizing buffer cost. The method builds initial solutions for the sinks, each having an associated cost, slew and capacitance. As a solution propagates toward a source, wire capacitance and wire slew arc added to the solution. When a buffer is selected for possible insertion, the slew of the solution is set to zero while the cost of the solution is incremented based on the selected buffer and the capacitance is set to an intrinsic capacitance of the buffer. The solutions of two intersecting wire branches are merged by adding branch capacitances and costs, and selecting the highest branch slew. The solution sets are updated by disregarding solutions which have a slew component greater than a slew constraint, and any solution that is dominated by another solution is eliminated. The solution having the smallest cost is selected as the final solution.</description><language>eng</language><subject>CALCULATING ; COMPUTING ; COUNTING ; ELECTRIC DIGITAL DATA PROCESSING ; PHYSICS</subject><creationdate>2008</creationdate><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20080117&amp;DB=EPODOC&amp;CC=US&amp;NR=2008016479A1$$EHTML$$P50$$Gepo$$Hfree_for_read</linktohtml><link.rule.ids>230,308,780,885,25563,76418</link.rule.ids><linktorsrc>$$Uhttps://worldwide.espacenet.com/publicationDetails/biblio?FT=D&amp;date=20080117&amp;DB=EPODOC&amp;CC=US&amp;NR=2008016479A1$$EView_record_in_European_Patent_Office$$FView_record_in_$$GEuropean_Patent_Office$$Hfree_for_read</linktorsrc></links><search><creatorcontrib>MAHMUD TUHIN</creatorcontrib><creatorcontrib>ALPERT CHARLES J</creatorcontrib><creatorcontrib>QUAY STEPHEN T</creatorcontrib><creatorcontrib>KARANDIKAR ARVIND K</creatorcontrib><creatorcontrib>SZE CHIN NGAI</creatorcontrib><title>Slew Constrained Minimum Cost Buffering</title><description>A buffer insertion technique addresses slew constraints while minimizing buffer cost. The method builds initial solutions for the sinks, each having an associated cost, slew and capacitance. As a solution propagates toward a source, wire capacitance and wire slew arc added to the solution. When a buffer is selected for possible insertion, the slew of the solution is set to zero while the cost of the solution is incremented based on the selected buffer and the capacitance is set to an intrinsic capacitance of the buffer. The solutions of two intersecting wire branches are merged by adding branch capacitances and costs, and selecting the highest branch slew. The solution sets are updated by disregarding solutions which have a slew component greater than a slew constraint, and any solution that is dominated by another solution is eliminated. The solution having the smallest cost is selected as the final solution.</description><subject>CALCULATING</subject><subject>COMPUTING</subject><subject>COUNTING</subject><subject>ELECTRIC DIGITAL DATA PROCESSING</subject><subject>PHYSICS</subject><fulltext>true</fulltext><rsrctype>patent</rsrctype><creationdate>2008</creationdate><recordtype>patent</recordtype><sourceid>EVB</sourceid><recordid>eNrjZFAPzkktV3DOzysuKUrMzEtNUfDNzMvMLc0FihWXKDiVpqWlFmXmpfMwsKYl5hSn8kJpbgZlN9cQZw_d1IL8-NTigsTk1LzUkvjQYCMDAwsDQzMTc0tHQ2PiVAEAJ4gorg</recordid><startdate>20080117</startdate><enddate>20080117</enddate><creator>MAHMUD TUHIN</creator><creator>ALPERT CHARLES J</creator><creator>QUAY STEPHEN T</creator><creator>KARANDIKAR ARVIND K</creator><creator>SZE CHIN NGAI</creator><scope>EVB</scope></search><sort><creationdate>20080117</creationdate><title>Slew Constrained Minimum Cost Buffering</title><author>MAHMUD TUHIN ; ALPERT CHARLES J ; QUAY STEPHEN T ; KARANDIKAR ARVIND K ; SZE CHIN NGAI</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-epo_espacenet_US2008016479A13</frbrgroupid><rsrctype>patents</rsrctype><prefilter>patents</prefilter><language>eng</language><creationdate>2008</creationdate><topic>CALCULATING</topic><topic>COMPUTING</topic><topic>COUNTING</topic><topic>ELECTRIC DIGITAL DATA PROCESSING</topic><topic>PHYSICS</topic><toplevel>online_resources</toplevel><creatorcontrib>MAHMUD TUHIN</creatorcontrib><creatorcontrib>ALPERT CHARLES J</creatorcontrib><creatorcontrib>QUAY STEPHEN T</creatorcontrib><creatorcontrib>KARANDIKAR ARVIND K</creatorcontrib><creatorcontrib>SZE CHIN NGAI</creatorcontrib><collection>esp@cenet</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>MAHMUD TUHIN</au><au>ALPERT CHARLES J</au><au>QUAY STEPHEN T</au><au>KARANDIKAR ARVIND K</au><au>SZE CHIN NGAI</au><format>patent</format><genre>patent</genre><ristype>GEN</ristype><title>Slew Constrained Minimum Cost Buffering</title><date>2008-01-17</date><risdate>2008</risdate><abstract>A buffer insertion technique addresses slew constraints while minimizing buffer cost. The method builds initial solutions for the sinks, each having an associated cost, slew and capacitance. As a solution propagates toward a source, wire capacitance and wire slew arc added to the solution. When a buffer is selected for possible insertion, the slew of the solution is set to zero while the cost of the solution is incremented based on the selected buffer and the capacitance is set to an intrinsic capacitance of the buffer. The solutions of two intersecting wire branches are merged by adding branch capacitances and costs, and selecting the highest branch slew. The solution sets are updated by disregarding solutions which have a slew component greater than a slew constraint, and any solution that is dominated by another solution is eliminated. The solution having the smallest cost is selected as the final solution.</abstract><oa>free_for_read</oa></addata></record>
fulltext fulltext_linktorsrc
identifier
ispartof
issn
language eng
recordid cdi_epo_espacenet_US2008016479A1
source esp@cenet
subjects CALCULATING
COMPUTING
COUNTING
ELECTRIC DIGITAL DATA PROCESSING
PHYSICS
title Slew Constrained Minimum Cost Buffering
url https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-09T06%3A45%3A36IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-epo_EVB&rft_val_fmt=info:ofi/fmt:kev:mtx:patent&rft.genre=patent&rft.au=MAHMUD%20TUHIN&rft.date=2008-01-17&rft_id=info:doi/&rft_dat=%3Cepo_EVB%3EUS2008016479A1%3C/epo_EVB%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true