FLUTE: Fast lookup table based wirelength estimation technique

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

Volumn , Issue , 2004, Pages 696-701

  Chu, Chris ^a  

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

Author keywords

[No Author keywords available]

Indexed keywords

COORDINATES; LOW-DEGREE NETS; MODULES; WIRELENGTH ESTIMATION;

ALGORITHMS; ERROR ANALYSIS; ESTIMATION; HEURISTIC METHODS; OPTIMIZATION; TREES (MATHEMATICS); VECTORS;

TABLE LOOKUP;

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

References (14)

1. M. Sarrafzadeh and C. K. Wong. An Introduction to VLSI Physical Design. McGraw-Hill, 1996.
2. Chih-Liang Eric Cheng. RISA: Accurate and efficient placement routability modeling. In Proc. IEEE/ACM Intl. Conf. on Computer-Aided Design, pages 690-695, 1994.
3. L. J. Guibas and J. Stolfi. On computing all northeast nearest neighbors in the LI metric. Information Processing Letters, 17:219-223, 1983.
4. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, 1990.
5. Andrew B. Kahng and Ion Mandoiu. RMST-Pack: Rectilinear minimum spanning tree algorithms. http://vlsicad. ucsd.edu/GSRC/bookshelf/Slots/RSMT/RMST/.
6. F. K. Hwang, D. S. Richards, and P. Winter. The Steiner tree problem. Annals of Discrete Mathematics, 1992. Elsevier Science Publishers.
7. D. M. Warme, P. Winter, and M. Zachariasen. Exact algorithms for plane Steiner tree problems: A computational study. In D.Z. Du, J.M. Smith, and J.H. Rubinstein, editors, Advances in Steiner Trees, pages 81-116. Kluwer Academic Publishers, 2000.
8. J. Griffith, G. Robins, J. S. Salowe, and T. Zhang. Closing the gap: Near-optimal Steiner trees in polynomial time. IEEE Trans. Computer-Aided Design, 13(11):1351-1365, November 1994.
9. Hai Zhou. Efficient steiner tree construction based on spanning graphs. In Proc. Intl. Symp. on Physical Design, pages 152-157, 2003.
10. 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 Intl. Workshop on System Level Interconnect Prediction, pages 85-89, 2002.
11. M. Hanan. On Steiner's problem with rectilinear distance. SIAM Journal of Applied Mathematics, 14:255-265, 1966.
12. GeoSteiner - software for computing Steiner trees, http: //www.diku.dk/geosteiner/.
13. A. E. Caldwell, A. B. Kahng, and I. L. Markov. VLSI CAD Bookshelf, http://www.gigascale.org/ bookshelf/.
14. Natarajan Viswanathan and Chris Chu. FastPlace: Efficient analytical placement using cell shifting, iterative local refinement and a hybrid net model. In Proc. Intl. Symp. on Physical Design, pages 26-33, 2004.