An efficient routing tree construction algorithm with buffer insertion, wire sizing and obstacle considerations

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

Volumn , Issue , 2004, Pages 361-366

  Dechu, Sampath ^a   Shen, Zion Cien ^b   Chu, Chris C N ^b  

^a MICRON TECHNOLOGY INC   (United States)

^b IOWA STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BUFFER OBSTACLES; FAST ALGORITHMS; ROUTING TREE CONSTRUCTION PROBLEMS; STOCHASTIC SEARCH SPACE;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; PROBLEM SOLVING; RANDOM PROCESSES; SPECIFICATIONS; TABLE LOOKUP; TREES (MATHEMATICS);

ROUTERS;

EID: 2442473117     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (17)

1. J. Lillis, C. K. Cheng, T. T. Lin, C. Y. Ho, "Performance driven routing techniques with explicit area/delay tradeoff and simultaneous wire sizing", in Proc. ACM/IEEE Design Automation Conf., 1996, 395-400.
2. M.Hrkic, J. Lillis, "S-Tree: A technique for Buffered routing tree synthesis", SASIMI, 2001, pp. 242-249.
3. M.Hrkic, J. Lillis, "Buffer tree synthesis with consideration of temporal locality, sink polarity requirements, solution cost and blockages", in Proc. Int. Symp. Physical Design., 2002, pp. 98-103.
4. X. Tang, R. Tian, H. Xiang, and D. Wong, "A new algorithm for routing tree construction with buffer insertion and wire sizing under obstacle constraints" in Proc. Int. Conf. Computer-Aided Design., 2001, pp. 49-56.
5. Jason Cong, Lei He, Cheng-Kok Koh, and Patrick H. Madden. Performance optimization of VLSI interconnect layout. INTEGRATION, the VLSI Journal, 21:1-94, 1996.
6. Takumi Okamoto and Jason Cong. "Buffered Steiner tree construction with wire sizing for interconnect layout optimization". In Proc. IEEE Intl. Conf. on Computer-Aided Design, pages 44-49, 1996.
7. C. Alpert, G. Gandham, M. Hrkic, J. Hu, A. Kahng, J. Lillis, B. Liu, S. Sapatnekar, A. Sullivan, and P. Villarubia. "Buffered Steiner Trees for difficult instances", in Proc. Int. Symp. Physical Design., 2001, pp. 4-9.
8. J.Hu, C. Alpert, S. T. Quay, and G. Gandham, "Buffer Insertion with Adaptive Blockage Avoidance", in Proc. Int. Symp. Physical Design., 2002, pp. 92-97.
9. H. Zhou, D. F. Wong, I.-M. Liu, and A. Aziz, "Simultaneous routing and buffer insertion with restrictions on buffer locations", in Proc. ACM/IEEE Design Automation Conf., 1999. pp. 96-99.
10. M.Lai and D. Wong, "Maze routing with buffer insertion and wiresizing", in Proc. ACM/IEEE Design Automation Conf., 2000, pp. 374-378.
11. J. Rubinstein, P. Penfield, and N. A. Horowitz, "Signal delay in RC tree networks", IEEE Transactions on Computer-Aided Design., 1983, pp. 202-211.
12. W. C. Elmore, "The transient response of damped linear networks with particular regard to wideband amplifiers", Journal of Applied Physics, 1948, 19:55-63.
13. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, "Introduction to Algorithms", Prentice - Hall, 1997.
14. R.Otten and R. Brayton, "Planning for performance" in Proc. ACM/IEEE Design Automation Conf., 1998, pp. 122-127.
15. Cien Shen and Chris Chu, "Bounds on Number of Slicing, Mosaic, and General Floorplans", IEEE TCAD, Vol. 22, No. 10, October 2003.
16. C. Alpert, C. Chu, G. Gandham, M. Hrkic, J. Hu, C. Kashyap, S. Quay, "Simultaneous driver sizing and buffer insertion using a delay penalty estimation technique", IEEE TCAD, 2004.
17. J. Lillis, C. K. Cheng, and T. T. Y. Lin, "Optimal wire sizing and buffer insertion for low power and a generalized delay model", in Proc Int. Conf. Computer-Aided Design., 1996, pp. 134-139.