Fast wire length estimation by net bundling for block placement

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

Volumn , Issue , 2006, Pages 172-178

  Yan, Tan ^a   Murata, Hiroshi ^a  

^a UNIVERSITY OF KITAKYUSHU   (Japan)

Author keywords

Lookup table; Net bundling; Wire length estimation

Indexed keywords

DESIGN; ESTIMATION; MARINE BIOLOGY; MOBILE TELECOMMUNICATION SYSTEMS; PIECEWISE LINEAR TECHNIQUES; TABLE LOOKUP;

BINARY SEARCH; BLOCK PLACEMENT; BUNDLING METHOD; COMPUTER-AIDED DESIGN; INTERNATIONAL CONFERENCES; LOOK UP TABLE (LUT); PIECE-WISE LINEAR (PWL); WIRE LENGTH ESTIMATION; WIRE LENGTHS;

WIRE;

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

References (19)

1. S. N. Adya and I. L. Markov. Fixed-outline floorplanning: Enabling hierarchical design. IEEE Trans, on VLSI Systems, 1(11):1120-1135, December 2003.
2. C. J. Alpert. The ISPD98 circuit benchmark suite. In Proc. ISPD'98, pages 80-85. ACM, April 1998.
3. U. Brenner and J. Vygen. Faster optimal single-row placement with fixed ordering. In Proc. DATE'00, pages 117-121. ACM/IEEE, March 2000.
4. A. E. Caldwell, A. B. Kahng, and I. L. Markov. Optimal partitioners and end-case placers for standard-cell layout. IEEE Trans. on CAD of Integrated Circuits, 19(11):1304-1314, November 2000.
5. H. H. Chan, S. N. Adya, and I. L. Markov. Are floorplan representations important in digital design? In Proc. ISPD'05, pages 129-136. ACM, April 2005.
6. Y.-C. Chang, Y.-W. Chang, G.-M. Wu, and S.-W. Wu. B*-trees: a new representation for non-slicing floorplans. In Proc. DAC'00, pages 458-463. ACM/IEEE, June 2000.
7. T.-C. Chen and Y.-W. Chang. Modern floorplanning based on fast simulated annealing. In Proc. ISPD'05, pages 104-112. ACM, April 2005.
8. T.-C. Chen, Y.-W. Chang, and S.-C. Lin. IMF: Interconnect-driven multilevel floorplanning for large-scale building-module designs. In Proc. ICCAD'05, pages 159-164. ACM/IEEE, November 2005.
9. P.-N. Guo, C.-K. Cheng, and T. Yoshimura. An O-tree representation of non-slicing floorplan. In Proc. DAC'99,pages 268-273. ACM/IEEE, June 1999.
10. X. Hong, G. Huang, Y. Cai, J. Gu, S. Dong, C. K. Cheng, and J. Gu. Corner block list: an effective and efficient topological representation of non-slicing floorplan. In Proc. ICCAD'00, pages 8-12. ACM/IEEE, November 2000.
11. A. B. Kahng. Classical floorplanning harmful? In Proc. ISPD'00, pages 207-213. ACM, April 2000.
12. A. B. Kahng and S. Reda. A tale of two nets: Studies of wirelength progression in physical design. In Proc. SLIP'06, pages 17-24. ACM, March 2006.
13. A. B. Kahng, P. Tucker, and A. Zelikovsky. Optimization of linear placements for wirelength minimization with free sites. In Proc. ASP-DAC'99, pages 241-244. ACM/IEEE, Janurary 1999.
14. G. Karypis and V. Kumar. Multilevel k-way hypergraph partitioning. In Proc. DAC'99, pages 343-348. ACM/IEEE, June 1999.
15. MCNC/GSRC Floorplan Benchmarks. http://www.cse.ucsc.edu/research/surf/ GSRC/progress.html.
16. H. Murata, K. Fujiyoshi, S. Nakatake, and Y. Kajitani. VLSI module placement based on rectangle-packing by the sequence pair. IEEE Trans. on CAD, 15(12):1518-1524, December 1996.
17. M. Ohmura, S. Wakabayashi, J. Miyao, and N. Yoshida. Improvement of one dimensional module placement in VLSI layout design. Electronics and Communications in Japan, 74(7):67-76, July 1991.
18. D. Sylvester and K. Keutzer. Getting to the bottom of deep submicron. In Proc. ICCAD'98, pages 203-211. ACM, November 1998.
19. X. Tang, R. Tian, and D. F. Wong. Fast evaluation of sequence pair in block placement by longest common subsequence computation. In Proc. DATE'00, pages 106-111. ACM/IEEE, March 2000.