An O(nlogn) time algorithm for optimal buffer insertion

Authors:
Weiping Shi;Zhuo Li
Affiliations:
Texas A&M University, College Station, TX;Texas A&M University, College Station, TX
Venue:
Proceedings of the 40th annual Design Automation Conference
Year:
2003

Citing 7
Cited 16

Introduction to algorithms

Introduction to algorithms
New performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Buffered Steiner tree construction with wire sizing for interconnect layout optimization

Proceedings of the 1996 IEEE/ACM international conference on Computer-aided design
Wire segmenting for improved buffer insertion

DAC '97 Proceedings of the 34th annual Design Automation Conference
Delay bounded buffered tree construction for timing driven floorplanning

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
A fast algorithm for area minimization of slicing floorplans

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Simultaneous routing and buffer insertion with restrictions on buffer locations

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A fast algorithm for identifying good buffer insertion candidate locations

Proceedings of the 2004 international symposium on Physical design
Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost

Proceedings of the 2004 Asia and South Pacific Design Automation Conference
An O(bn^2) Time Algorithm for Optimal Buffer Insertion with b Buffer Types

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
RIP: An Efficient Hybrid Repeater Insertion Scheme for Low Power

Proceedings of the conference on Design, Automation and Test in Europe - Volume 2
Path based buffer insertion

Proceedings of the 42nd annual Design Automation Conference
Making fast buffer insertion even faster via approximation techniques

Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Efficient generation of short and fast repeater tree topologies

Proceedings of the 2006 international symposium on Physical design
Fast buffer insertion considering process variations

Proceedings of the 2006 international symposium on Physical design
Efficient algorithms for buffer insertion in general circuits based on network flow

ICCAD '05 Proceedings of the 2005 IEEE/ACM International conference on Computer-aided design
Design and verification of high-speed VLSI physical design

Journal of Computer Science and Technology
An efficient net ordering algorithm for buffer insertion

Proceedings of the 17th ACM Great Lakes symposium on VLSI
Fast dual-vdd buffering based on interconnect prediction and sampling

Proceedings of the 2007 international workshop on System level interconnect prediction
ECO timing optimization using spare cells

Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design
A metal-only-ECO solver for input-slew and output-loading violations

Proceedings of the 2009 international symposium on Physical design
Interconnect power and delay optimization by dynamic programming in gridded design rules

Proceedings of the 19th international symposium on Physical design
Interconnect bundle sizing under discrete design rules

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems - Special section on the ACM IEEE international conference on formal methods and models for codesign (MEMOCODE) 2009

Quantified Score

Hi-index	0.00

Visualization

Abstract

The classic algorithm for optimal buffer insertion due to van Ginneken has time and space complexity O(n2), where n is the number of possible buffer positions.