FLUTE: Fast lookup table based rectilinear steiner minimal tree algorithm for VLSI design

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

Volumn 27, Issue 1, 2008, Pages 70-83

  Chu, Chris ^a   Wong, Yiu Chung ^b  

^a Iowa State University of Science and Technology   (United States)

^b NONE

Author keywords

Interconnect optimization; Rectilinear Steiner minimal tree (RSMT) algorithm; Routing; Wirelength estimation; Wirelength minimization

Indexed keywords

HEURISTIC METHODS; INTEGRATED CIRCUITS; OPTIMIZATION; PARAMETER ESTIMATION; ROUTING ALGORITHMS; TREES (MATHEMATICS);

FAST LOOKUP TABLE ESTIMATION (FLUTE); INTERCONNECT OPTIMIZATION; RECTILINEAR STEINER MINIMAL TREE (RSMT); WIRELENGTH ESTIMATION; WIRELENGTH MINIMIZATION;

VLSI CIRCUITS;

EID: 37249074914     PISSN: 02780070     EISSN: None     Source Type: Journal    
DOI: 10.1109/TCAD.2007.907068     Document Type: Article

References (21)

1. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. New York: Freeman, 1979.
2. F. K. Hwang, "On Steiner minimal trees with rectilinear distance," SIAM J. Appl. Math., vol. 30, no. 1, pp. 104-114, Jan. 1976.
3. F. K. Hwang. D. S. Richards, and P. Winter, "The Steiner tree problem," in Annals of Discrete Mathematics. Amsterdam, The Netherlands: Elsevier. 1992.
4. D. M. Wanne, P. Winter, and M. Zachariasen. "Exact algorithms for plane Steiner tree problems: A computational study," in Advances in Steiner Trees. D. Z. Du, J. M. Smith, and J. H. Rubinstein. Eds. Norwell, MA: Kluwer, 2000, pp. 81-116.
5. GeoSteiner - Software for Computing Steiner Trees. [Online]. Available: http://www.diku.dk/geosteiner
6. J. Griffith, G. Robins, J. S. Salowe, and T. Zhang, "Closing the gap: Near-optimal Steiner trees in polynomial time." IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 13, no. 11, pp. 1351-1365, Nov. 1994.
7. I. I. Mandoiu, V. V. Vazirani, and J. L. Ganley, "A new heuristic for rectilinear Steiner trees," in Proc. IEEE/ACM Int. Conf. Comput.-Aided Des., 1999, pp. 157-162.
8. M. Borah, R. M. Owens, and M. J. Irwin. "An edge-based heuristic for Steiner routing," IEEE Trans. Comput.-Aided Design Integr. Circuits Syst., vol. 13, no. 12, pp. 1563-1568, Dec. 1994.
9. H. Zhou, "Efficient Steiner tree construction based on spanning graphs," in Proc. Int. Symp. Phys. Des., 2003, pp. 152-157.
10. H. Zhou, N. Shenoy, and W. Nicholls, "Efficient spanning tree construction without Delaunay triangulation." Inf. Process. Lett., vol. 81, no. 5, pp. 271-276, 2002.
11. A. Kahng, I. Mandoiu, and A. Zelikovsky, "Highly scalable algorithms for rectilinear and octilinear Steiner trees." in Proc. Asian South Pacific Des. Autom. Conf., 2003, pp. 827-833.
12. J. Soukup, "Circuit layout," Proc. IEEE, vol. 69, no. 10, pp. 1281-1304, Oct. 1981.
13. H. Chen, C. Qiao, F. Zhou, and C.-K. Cheng, "Refined single trunk tree: A rectilinear Steiner tree generator for interconnect prediction," in Proc. ACM Int. Workshop Syst. Level Interconnect Prediction, 2002, pp. 85-89.
14. C. J. Alpert, "The ISPD98 circuit benchmark suite," in Proc. Int. Symp. Phys. Des., 1998, pp.80-85. [Online]. Available: http://vlsicad.ucsd.edu/UCLAWeb/cheese/ispd98.html
15. A. B. Kahng and I. Mandoiu, RMST-Pack: Rectilinear Minimum Spanning Tree Algorithms. [Online]. Available: http://vlsicad.ucsd.edu/GSRC/ bookshelf/Slots/RSMT/RMST
16. M. Hanan, "On Steiner's problem with rectilinear distance," SIAM J. Appl. Math., vol. 14, no. 2, pp. 255-265, Mar. 1966.
17. C. Chu, FLUTE: Fast lookup table based technique for RSMT constriction and wirelength estimation. [Online]. Available: http://vlsicad.ucsd.edu/ GSRC/bookshelf/Slots/RSMT
18. C. Chu, "FLUTE: Fast lookup table based wirelength estimation technique," in Pmc. IEEE/ACM Int. Conf. Comput.-Aided Des., 2004, pp. 696-701.
19. C. Chu and Y.-C. Wong, "Fast and accurate rectilinear Steiner minimal tree algorithm for VLSI design," in Proc. Int. Symp. Phys. Des., 2005, pp. 28-35.
20. A. E. Caldwell, A. B. Kahng, and I. L. Markov, "Toward CAD-IP reuse: The MARCO GSRC bookshelf of fundamental CAD algorithms," in Proc. IEEE Des. Test, 2002, pp. 72-81.
21. N. Viswanathan and C. Chu, "FastPlace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model," in Proc. Int. Symp. Phys. Des., 2004, pp. 26-33.