A Flexible Data Structure for Efficient Buffer Insertion

Authors:
Ruiming Chen;Hai Zhou
Affiliations:
Northwestern University, Evanston, IL;Northwestern University, Evanston, IL
Venue:
ICCD '04 Proceedings of the IEEE International Conference on Computer Design
Year:
2004

Citing 0
Cited 4

An O(mn) time algorithm for optimal buffer insertion of nets with m sinks

ASP-DAC '06 Proceedings of the 2006 Asia and South Pacific Design Automation Conference
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
Fast min-cost buffer insertion under process variations

Proceedings of the 44th annual Design Automation Conference
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion

Proceedings of the 46th Annual Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

With continuous down-scaling of minimum feature sizes and increasing of chip areas, buffering has become a necessary technique to control the interconnect delays in VLSI chips.Recently, Shi and Li proposed an efficient O(n log n) time algorithm to speed up buffering. Based on balanced binary search trees, their algorithm showed superb performance with the most unbalanced sizes of merging solution lists. We propose in this paper a more exible data structure for the same buffering operations. With parameters to adjust, our algorithm works better than Shi and Li under all cases: unbalanced, balanced, and mix sizes. Our data structure is also simpler than theirs.