Benchmarking for large-scale placement and beyond

Proceedings of the International Symposium on Physical Design

Volumn , Issue , 2003, Pages 95-103

  Adya, Saurabh N ^a   Yildiz, Mehmet C ^b   Markov, Igor L ^a   Villarrubia, Paul G ^c   Parakh, Phiroze N ^d   Madden, Patrick H ^b  

^a University of Michigan   (United States)

^b State University of New York at Binghamton   (United States)

^c IBM   (United States)

^d Monterey Design Systems   (United States)

Author keywords

Benchmark; Comparison; Congestion; Evaluation; Layout; Performance; Placement; Placer; Routing; Signal delay; Timing; Wirelength

Indexed keywords

ALGORITHMS; BENCHMARKING; EXTRAPOLATION; PERFORMANCE;

PLACEMENT BENCHMARKING;

VLSI CIRCUITS;

EID: 0038040208     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/640020.640022     Document Type: Conference Paper

References (58)

1. S. N. Adya and I. L. Markov, "Consistent Placement of Macro-Blocks using Floorplanning and Standard-Cell Placement", ISPD 2002, pp. 12-17.
2. C. J. Alpert, G.-J. Nam and P. G. Villarrubia, "Free Space Management for Cut-Based Placement", ICCAD 2002, pp. 746-751.
3. C. J. Alpert, J.-H. Huang and A. B. Kahng, "Multilevel Circuit Partitioning", DAC 1997, pp. 530-533.
4. C. J. Alpert, "The ISPD98 Circuit Benchmark Suite," ISPD 1998, pp. 80-85. http://vlsicad.cs.ucla.edu/̃cheese/ispd98.html
5. M. R. Beasley, S. Datta, H. Kogelnik, H. Kroemer, and D. Monroe. "Report of the Investigation Committee on the Possibility of Scientific Misconduct in the Work of Hendrik Schon and Coauthors," 2000. http://www.lucent.com/news-events/researchreview.html
6. A. E. Caldwell, A. B. Kahng, A. A. Kennings, and I. L. Markov, "Hypergraph Partitioning for VLSI CAD: Methodology for Reporting, and New Results," DAC 1999, pp. 349-354.
7. A. E. Caldwell, A. B. Kahng and I. L. Markov, "Improved Algorithms for Hypergraph Bi-partitioning," ASPDAC 2000, pp. 661-666.
8. A. E. Caldwell, A. B. Kahng and I. L. Markov, "Hypergraph Partitioning With Fixed Vertices," IEEE Trans. on CAD, vol. 19, no. 2, 2000, pp. 267-272.
9. A. E. Caldwell, A. B. Kahng and I. L. Markov, "Design and Implementation of Move-based Heuristics for VLSI Hypergraph Partitioning", ACM Journal of Experimental Algorithms, vol. 5, 2000 http://www.jea.acm.org/volume5.html
10. A. E. Caldwell, A. B. Kahng and I. L. Markov, "Can Recursive Bisection Alone Produce Routable Placements?"DAC '00, pp.477-82.
11. A. E. Caldwell, A. B. Kahng, I. L. Markov, "Optimal Partitioners and End-case Placers for Standard-cell Layout", IEEE Trans. on CAD, vol. 19, no. 11, 2000, pp. 1304-1314
12. A. E. Caldwell, A. B. Kahng, I. L. Markov, "Hierarchical Whitespace Allocation", to appear in IEEE Trans. on CAD 2003.
13. A. E. Caldwell, A. B. Kahng, I. L. Markov, "VLSI CAD Bookshelf http://vlsicad.eecs.umich.edu/BK
14. T. Chan, J. Cong, T. Kong, and J. Shinnerl, "Multilevel Optimization for Large-scale Circuit Placement," ICCAD 2000, pp. 171-176.
15. C. C. Chang, J. Cong and M. Xie, "Optimality and Scalability Study of Existing Placement Algorithms," ASP DAC 2003, pp. 621-627.
16. C.-C. Chang, J. Cong, and X. Yuan, "Multi-level Placement for Large-Scale Mixed-Size IC Designs," ASP DAC 2003, pp. 325-330.
17. H. Chen, C. Qiao, F. Zhou and C.K. Cheng, "Refined Single Trunk Tree: A Rectilinear Steiner Tree Generator For Interconnect Prediction," Intl. Workshop on System-Level Interconnect Prediction (SLIP) 2002, pp. 85-89.
18. Y.-C. Chou and Y.-L. Lin, "A Performance-driven Standard Cell Placer based on a Modified Force-directed Algorithm," ISPD 2001, pp. 24-29.
19. J. Cong, M. Romesis, and M. Xie, "Optimality, Scalability and Stability Study of Partitioning and Placement Algorithms", ISPD '03.
20. J. Cong and J. R. Shinnerl, "Multi-level Optimization in VLSI CAD," Kluwer, Boston, 2002.
21. W. J. Dally and A. Chang, "The Role of Custom Design in ASIC Chips", DAC 00, p. 643-647.
22. K. Doll, F. M. Johannes and K. J. Antreich, "Iterative Placement Improvement By Network Flow Methods". IEEE Trans. On Computer-Aided Design of Integrated Circuits and Systems, vol. 13, (no.10), Oct. 1994. pp. 1189-1200.
23. W. Donath et al., "Transformational Placement and Synthesis", DATE 2000, pp. 194-201.
24. H. Eisenmann and F. M. Johannes, "Generic Global Placement and Floorplanning", DAC 1988, p. 269-274.
25. C. M. Fiduccia, R. M. Mattheyses, "A Linear-Time Heuristic For Improving Network Partitions", DAC 1982, pp. 171-181.
26. S. Goto, "An Efficient algorithm for the Two-Dimensional Placement Problem in Electrical Circuit Layout," IEEE Trans. on Circuits and Systems, vol. 28 no. 1, 1981, pp. 12-18.
27. L. Hagen, J. H. Huang, and A. B. Kahng, "Quantified Suboptimality of VLSI Layout Heuristics", DAC 1995, pp. 216-221.
28. W. Halpin, C. Y. Roger Chen, and N. Sehgal, "Timing driven placement using physical net constraints," DAC 2001, pp. 780-783.
29. D. J.-H. Huang and A. B. Kahng. "Partitioning based standard cell global placement with an exact objective," ISPD 1997, pp. 18-25.
30. A. B. Kahng, S. Mantik and I. L. Stroobandt, "Requirements for Models of Achievable Routing," ISPD 2000, pp. 4-11.
31. A. B. Kahng, S. Mantik and I. L. Markov, "Min-max Placement For Large-scale Timing Optimization" ISPD 2002, pp. 143-148.
32. G. Karypis, R. Agarwal, V. Kumar, and S. Shekhar, "Multilevel Hypergraph Partitioning: Applications in VLSI Design", DAC 1997, pp. 526-529.
33. P. Kannan, S. Balachandran, and D. Bhatia, "On Metrics for Comparing Routability Estimation Methods for FPGAs," DAC 2002, pp. 70-75.
34. R. Kastner, E. Bozogzadeh, and M. Sarrafzadeh, "Predictable Routing," ICCAD 2000, pp. 110-113.
35. T. Kong, "A Novel Net Weighting Algorithm for Timing-Driven Placement", ICCAD 2002, pp. 172-176.
36. P. Kudva, A. Sullivan and W. E. Dougherty, "Metrics for Structural Logic Synthesis", ICCAD 2002, pp. 551-556.
37. E. Lerner, "Fraud Shows Peer-review Flaws," The Industrial Physicist, 8(2), 2002.
38. J. Lou, S. Krishnamoorthy, H. S. Sheng, "Estimating Routing Congestion using Probabilistic Analysis," ISPD 2001, pp 112-117.
39. Magma Design Automation Inc., "White Papers," http://www.magma-da.com/whitepapers.html
40. P. H. Madden, "Reporting of Standard Cell Placement Results," IEEE Trans. on CAD, 21(2), Feb. 2002, pp. 240-247.
41. F. Mo, A. Tabbara, and R. K. Brayton, "A Force-directed Maze Router," ICCAD 2001, pp. 404-408.
42. Monterey Design Systems, "Dolphin," http:// www.mondes.com/products/dolphin.htm
43. Open Access, http://www.si2.org/openaccess/
44. Open Library Architecture (OLA), http://www.si2.org/OLA/
45. S.-L. Ou and M. Pedram, "Timing-driven Placement based on Partitioning with Dynamic Cut-net Control", DAC 2000, pp. 472-476.
46. P. N. Parakh, R. B. Brown, K. A. Sakallah, "Congestion Driven Quadratic Placement", DAC 1998, pp. 275-278.
47. A. Rohe and U. Brenner, "An Effective Congestion Driven Placement Framework," ISPD 02, pp. 6-11.
48. L. Scheffer and E. Nequist, "Why interconnect prediction doesn't work," Intl. Workshop on System-Level Interconnect Prediction (SLIP) 2000, pp. 139-144.
49. H. Schmit, "Vertical Benchmarks," http://www.ece.cmu.edu/̃herman/html/benchmark-slot.html
50. G. Sigl, K. Doll and F. M. Johannes, "Analytical Placement: A Linear or Quadratic Objective Function?" DAC 1991, pp. 57-62.
51. The Standard Performance Evaluation Corporation (SPEC), "SPECmarkbenchmarks," http://www.specbench.org/
52. D. Stroobandt, "A Priori Wire Length Estimates for Digital Design," 324 pages, Kluwer, ISBN 0-7923-7360-X, 2001.
53. W. Swartz and C. Sechen, "Timing-Driven Placement For Large Standard-Cell Circuits," DAC 1995, pp. 211-215.
54. M. Wang, X. Yang and M. Sarrafzadeh, "Dragon2000: Standard-cell Placement Tool for Large Industry Circuits," ICCAD 2000, pp. 260-263.
55. X. Yang, B.-K. Choi and M. Sarrafzadeh, "Routability Driven White Space Allocation for Fixed-Die Standard-Cell Placement," ISPD 2002, pp. 42-50.
56. X. Yang, B.-K. Choi and M. Sarrafzadeh, "Timing-Driven Placement using Design Hierarchy Guided Constraint Generation," ICCAD 2002, pp. 177-184.
57. X. Yang, B-K. Choi, and M. Sarrafzadeh, "A Standard-Cell Placement Tool for Designs with High Row Utilization," ICCD 2002, p. 45-47.
58. M. C. Yildiz and P. H. Madden, "Improved Cut Sequences for Partitioning Based Placement," DAC, 2001, pp. 776-779.