A graph based algorithm for optimal buffer insertion under accurate delay models

Buffer insertion is an efficient technique in interconnect optimization. This paper presents a graph based algorithm for optimal buffer insertion under accurate delay models. In our algorithm, a signal is accurately represented by a finite ramp which is characterized by two parameters, shift time an...

Full description

Saved in:
Bibliographic Details
Published in:Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001 pp. 535 - 539
Main Author: Youxin Gao
Format: Conference Proceeding
Language:English
Published: IEEE 2001
Subjects:
Delay effects
Integrated circuit interconnections
Polynomials
Propagation delay
Shortest path problem
SPICE
Time factors
Transmission lines
Very large scale integration
Wire
ISBN:9780769509938, 0769509932
ISSN:1530-1591
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract Buffer insertion is an efficient technique in interconnect optimization. This paper presents a graph based algorithm for optimal buffer insertion under accurate delay models. In our algorithm, a signal is accurately represented by a finite ramp which is characterized by two parameters, shift time and transition time. Any accurate delay model, such as delay models based on the transmission line model and SPICE simulations, can be incorporated into our algorithm. The algorithm determines the optimal number of buffers and their locations on a wire such that some optimization objective is satisfied. Two typical examples of such optimization objectives are minimizing the 50% threshold delay and minimizing the transition time. Both can be easily determined in our algorithm. We show that the buffer insertion problem can be reduced to a shortest path problem. The algorithm can be easily extended for simultaneous buffer insertion and wire-sizing, and complexity is still polynomial. The algorithm can also be extended to deal with problems such as buffer insertion subject to transition time constraints at any position along the wire.
AbstractList Buffer insertion is an efficient technique in interconnect optimization. This paper presents a graph based algorithm for optimal buffer insertion under accurate delay models. In our algorithm, a signal is accurately represented by a finite ramp which is characterized by two parameters, shift time and transition time. Any accurate delay model, such as delay models based on the transmission line model and SPICE simulations, can be incorporated into our algorithm. The algorithm determines the optimal number of buffers and their locations on a wire such that some optimization objective is satisfied. Two typical examples of such optimization objectives are minimizing the 50% threshold delay and minimizing the transition time. Both can be easily determined in our algorithm. We show that the buffer insertion problem can be reduced to a shortest path problem. The algorithm can be easily extended for simultaneous buffer insertion and wire-sizing, and complexity is still polynomial. The algorithm can also be extended to deal with problems such as buffer insertion subject to transition time constraints at any position along the wire.
Author Youxin Gao
Author_xml – sequence: 1
  surname: Youxin Gao
  fullname: Youxin Gao
  organization: Avant Corp., Fremont, LA, USA
BookMark eNotj7tqwzAYRgVNoUmavXTSC9j9ZVm30aRpWgi0g_ega-LiG5I95O1rSKfDtxy-s0Grfug9Qi8EckJAvb1X9SEvAEiuCAPBHtBOCQmCKwZKUblCa8IoZIQp8oQ2Kf0CAKOFWqOfCl-iHq_Y6OQd1u1liM107XAYIh7Gqel0i80cgo-46ZOPUzP0eO7dsrW1c9STx863-oa7YWF6Ro9Bt8nv_rlF9ceh3n9mp-_j1746ZY0UU2YCKWiwgXJNLSm4NEZISp0QpZWaKBZ4yTmoQEzJLDWlBldaF5jlDDQVdIte79rGe38e4_Iz3s73fPoHnulQow
ContentType Conference Proceeding
DBID 6IE
6IL
CBEJK
RIE
RIL
DOI 10.1109/DATE.2001.915075
DatabaseName IEEE Electronic Library (IEL) Conference Proceedings
IEEE Proceedings Order Plan All Online (POP All Online) 1998-present by volume
IEEE Xplore All Conference Proceedings
IEEE/IET Electronic Library (IEL) (UW System Shared)
IEEE Proceedings Order Plans (POP All) 1998-Present
DatabaseTitleList
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE/IET Electronic Library (IEL) (UW System Shared)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Computer Science
EndPage 539
ExternalDocumentID 915075
GroupedDBID 123
29F
29O
6IE
6IF
6IH
6IK
6IL
6IN
AAJGR
AAWTH
ABLEC
ADZIZ
ALMA_UNASSIGNED_HOLDINGS
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CBEJK
CHZPO
FEDTE
IEGSK
IPLJI
KZ1
LMP
M43
OCL
RIE
RIL
RNS
ID FETCH-LOGICAL-i87t-bf123fcf36a3c1268bb7833d774c8a195f646609f1b45c3b4a0d4cdf5c650a373
IEDL.DBID RIE
ISBN 9780769509938
0769509932
ISSN 1530-1591
IngestDate Tue Aug 26 18:50:48 EDT 2025
IsPeerReviewed false
IsScholarly true
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-i87t-bf123fcf36a3c1268bb7833d774c8a195f646609f1b45c3b4a0d4cdf5c650a373
PageCount 5
ParticipantIDs ieee_primary_915075
PublicationCentury 2000
PublicationDate 20010000
PublicationDateYYYYMMDD 2001-01-01
PublicationDate_xml – year: 2001
  text: 20010000
PublicationDecade 2000
PublicationTitle Proceedings Design, Automation and Test in Europe. Conference and Exhibition 2001
PublicationTitleAbbrev DATE
PublicationYear 2001
Publisher IEEE
Publisher_xml – name: IEEE
SSID ssj0005329
ssj0000394166
Score 1.5428802
Snippet Buffer insertion is an efficient technique in interconnect optimization. This paper presents a graph based algorithm for optimal buffer insertion under...
SourceID ieee
SourceType Publisher
StartPage 535
SubjectTerms Delay effects
Integrated circuit interconnections
Polynomials
Propagation delay
Shortest path problem
SPICE
Time factors
Transmission lines
Very large scale integration
Wire
Title A graph based algorithm for optimal buffer insertion under accurate delay models
URI https://ieeexplore.ieee.org/document/915075
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV27TsMwFLUoYoClUIp4ywNrWgc7fowVtGJAVYcO3Sq_ApHaBKUJEn-P7aQtSCxIGRIvifzIOfa99xwAHmJstJspJEoRSyOiExJxrXhEE8mRRRIhE0b6lU2nfLEQs1ZnO9TCWGtD8pkd-NsQyzeFrv1R2VB49pJ0QIcx2pRq7Y5TEBaOWtB9dgcOBmVuPaPIIXbc7NiFg0dHWFrhne0z34YvkRg-j-Zjv2uMB83LfpmuBMyZdP_1taegv6_dg7MdKp2BA5v3QHdr3gDbtdwDJz-UCM_BbASDdDX0qGagXL0VZVa9r6HjtLBwv5W1XEFVezMVmOU-gu_GE_oCtBJKrWsvOAG94OQXDN46mz6YT8bzp5eoNVuIMs6qSKUOwlKdYiqxjh8pV4pxjI1jh5rLWCQpJZQikcaKJBorIpEh2qSJdhRPYoYvwGFe5PYSQMfJGHG00hFiRTRJFDXWCiS0iR29lPYK9HxnLT8aOY1l00_Xf7begOMm6ctft-CwKmt7B470Z5VtyvswBb4B0RuqrA
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1NT8IwGG4UTdQLihi_7cHroKPd1h6JQjAi4bADN9KvKQlsZmwm_nvbbogmXkx22HrZ0o89T_u-7_MAcO9jJc1MIV6CosQjMiAelYJ6YcAp0ogjpNxIj6PJhM5mbFrrbLtaGK21Sz7THXvrYvkqk6U9Kusyy16CXbAXENJDVbHW94EKwsyQi3Cb34GdRZlZ0cgzmO1Xe3ZmANJQllp6Z_NMNwFMxLqP_Xhg941-p3rdL9sVhzrD5r--9xi0t9V7cPqNSydgR6ct0NzYN8B6NbfA0Q8twlMw7UMnXg0trinIl69ZvijeVtCwWpiZH8uKL6EorZ0KXKQ2hm9GFNoStBxyKUsrOQGt5OQndO466zaIh4P4YeTVdgvegkaFJxIDYolMcMix9HshFSKiGCvDDyXlPguSkIQhYokvSCCxIBwpIlUSSEPyOI7wGWikWarPATSsLCKGWBpKLIgkgQiV1gwxqXxDMLm-AC3bWfP3SlBjXvXT5Z-td-BgFL-M5-OnyfMVOKxSwOx1DRpFXuobsC8_isU6v3XT4Qvmia3z
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%3Abook&rft.genre=proceeding&rft.title=Proceedings+Design%2C+Automation+and+Test+in+Europe.+Conference+and+Exhibition+2001&rft.atitle=A+graph+based+algorithm+for+optimal+buffer+insertion+under+accurate+delay+models&rft.au=Youxin+Gao&rft.date=2001-01-01&rft.pub=IEEE&rft.isbn=9780769509938&rft.issn=1530-1591&rft.spage=535&rft.epage=539&rft_id=info:doi/10.1109%2FDATE.2001.915075&rft.externalDocID=915075
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1530-1591&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1530-1591&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1530-1591&client=summon