Efficient algorithms for buffer insertion in general circuits based on network flow

IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD

Volumn 2005, Issue , 2005, Pages 322-326

  Chen, Ruiming ^a   Zhou, Hai ^a  

^a Northwestern University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER INSERTION; LAGRANGIAN RELAXATION; NETWORK FLOW;

ALGORITHMS; BUFFER CIRCUITS; COMBINATORIAL CIRCUITS; DELAY CIRCUITS; PROBLEM SOLVING; VLSI CIRCUITS;

ELECTRIC NETWORK ANALYSIS;

EID: 33751438002     PISSN: 10923152     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICCAD.2005.1560087     Document Type: Conference Paper

References (22)

1. R. K. Ahuja, D. S. Hochbaum, and J. B. Orlin, Solving the convex cost Integer dual network flow problem, Management Science, 46:650-664, 2003.
2. R. K. Ahuja, T. L. Magnantl, and J. B. Orlin, Network Flows: Theory, Algorithms, and Application, Prentice Hall, 1993.
3. C. J. Alpert and A. Devgan, Wire segmenting for Improved buffer Insertion, In DAC, pages 588-563, 1997.
4. C. J. Alpert, M. Hrkic, and S. T. Quay, A fast algorithm for Identifying good buffer Insertion candidate locations, In ISPD, pages 47-52, 2004.
5. C. J. Alpert, J. Hu, S. S. Sapatnekar, and C. N. Sze, Acurate estimation of global buffer delay within a floorplan, In ICCAD, pages 706-711, 2004.
6. R. Chen and H. Zhou, A flexible data structure for efficient buffer Insertion, In ICCD, pages 216-221, 2004.
7. J. Cong and Z. Pan, Interconnect performance estimation models for synthesis and design planning, In Workshop Notes of Intl. Workshop on Logic Synthesis, pages 427-433, 1998.
8. W. C. Elmore, The transient response of damped linear networks with particular regard to wide-band amplifiers, Journal of Applied Physics, 19(1):55-63, January 1948.
9. J. R. Ford and D. R. Fulkerson, Flows in Networks, Princeton University Press, 1962.
10. M. Kang, W. W.-M. Dai, T. Dillinger, and D. LaPotin, Delay bounded buffered tree construction for timing driven floorplanning, In ICCAD, pages 707-712, 1997.
11. A. V. Karzanov and S. T. McCormick, Polynomial methods for separable convex optimization In unlmodular linear spaces with applications, SIAM, 26:1245-1275, 1997.
12. V. Khandelwal, A. Davoodi, A. Nanavati, and A. Srlvastava, A probabilistic approach to buffer Insertion, In ICCAD, pages 560-567, 2003.
13. J. Lillis, C. K. Cheng, T. T. Lin, and C. Y. Ho, New performance driven routing technique! with explicit area/delay tradeoff and simultaneous wire sizing, In DAC, pages 395-400, 1996.
14. J. Lillis, C. K. Cheng, and T. T. Y. Lin, Optimal wire sizing and buffer Insertion for low power and a generalized delay model, IEEE Trans. Solid-State Circuits, 31:437-447, 1996.
15. I.-M. Liu, A. Aziz, and D. F. Wong, Meeting delay constraints In DSM by minimal repeater Insertion, In DATE, pages 436-440, 2000.
16. I.-M. Liu, A. Aziz, D. F. Wong, and H. Zhou, An efficient buffer Insertion algorithm for large networki based on lagranglan relaxation, In ICCD, pages 210-215, 1999.
17. T. Okamoto and J. Cong, Buffered Steiner tree construction with wire sizing for Interconnect layout optimization, In ICCAD, pages 44-49, 1996.
18. R. L. Rardin, Optimization in Operations Research, Prentice Hall, 1998.
19. P. Saxena, N. Menezei, P. Cocchini, and Desmond A. Kirkpatrick, The scaling challenge: Can correct-by-conitructlon design help? In ISPD, pages 51-58, 2003.
20. W. Shl and Z. Li, An O(n log n) time algorithm for optimal buffer Insertion, In DAC, pages 580-585, 2003.
21. L. P. P. P. van Ginneken, Buffer placement In distributed RC-tree networks for minimal Elmore delay, In ISCAS, pages 865-868, 1990.
22. H. Zhou, D. F. Wong, I-Min Liu, and Adnan Aziz, Simultaneous routing and buffer Insertion with restrictions on buffer locations, DAC, 1999.