(Enter summary)
Abstract: Over the last five years the VLSI Placement community achieved great strides in the understanding of placement problems,
developed new high-performance algorithms, and achieved impressive empirical results. These advances have been
supported by non-trivial benchmarking infrastructure, and future achievements are set to draw on benchmarking as well.
In this paper we review motivations for benchmarking, especially for commercial EDA, analyze available benchmarks, and
point out major pitfalls in... (Update)
Cited by: More
Optimality and Scalability Study of Existing Placement.. - Chang, Cong, Romesis, Xie (2004)
(Correct)
Large-Scale Circuit Placement: Gap and Promise - Jason Cong Tim
(Correct)
Large-Scale Circuit Placement - Cong, Shinnerl, Xie, Kong, Yuan (2005)
(Correct)
Active bibliography (related documents): More All
5.2: Benchmarking For Large-scale Placement and Beyond - Saurabh Adya Mehmet (2003)
(Correct)
1.2: Constructive Benchmarking for Placement - David Papa Department
(Correct)
0.9: On Whitespace and Stability in Mixed-Size Placement and.. - Adya, Markov.. (2003)
(Correct)
Similar documents based on text: More All
0.3: CGaAs PowerPC FXU - Alan Drake Todd
(Correct)
0.3: Improving Min-cut Placement for VLSI Using Analytical.. - Adya, Markov, Villarrubia
(Correct)
0.2: Perimeter-Degree: A Priori Metric for Directly Measuring and.. - Selvakkumaran
(Correct)
Related documents from co-citation: More All
8: Generic global placement and floorplanning
- Eisenmann, Johannes - 1998
8: Can Recursive Bisection Alone Produce Routable Placements
- Caldwell, Kahng et al. - 2000
7: Multilevel optimization for large-scale circuit placement
- Chan, Cong et al. - 2000
BibTeX entry: (Update)
S. N. Adya, I. L. Markov, P. G. Villarrubia, P. Parakh, M. C. Yildiz, and P. H. Madden, "Benchmarking for Large-Scale Placement and Beyond," International Symposium on Physical Design, April 2003. http://citeseer.ist.psu.edu/adya03benchmarking.html More
@misc{ adya03benchmarking,
author = "S. Adya and I. Markov and P. Villarrubia and P. Parakh and M. Yildiz and
P. Madden",
title = "Benchmarking for Large-Scale Placement and Beyond",
text = "S. N. Adya, I. L. Markov, P. G. Villarrubia, P. Parakh, M. C. Yildiz, and
P. H. Madden, Benchmarking for Large-Scale Placement and Beyond, International
Symposium on Physical Design, April 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/adya03benchmarking.html" }
Citations (may not include all citations):
421
A Linear-Time Heuristic For Improving Network Partitions (context) - Fiduccia, Mattheyses - 1982
162
Multilevel Hypergraph Partitioning: Applications in VLSI Des..
- Karypis, Agarwal et al. - 1997
121
Recent direction in netlist partitioning: A survey (context) - Alpert, Kahng - 1995
83
GORDIAN: VLSI Placement by Quadratic Programming and Slicing.. (context) - Kleinhans, Sigl et al. - 1991
75
Can Recursive Bisection Alone Produce Routable Placements
- Caldwell, Kahng et al. - 2000
69
Multilevel Circuit Partitioning
- Alpert, Huang et al. - 1997
52
Generic Global Placement and Floorplanning
- Eisenmann, Johannes - 1988
50
The ISPD98 Circuit Benchmark Suite (context) - Alpert - 1998
46
Analytical Placement: A Linear or Quadratic Objective Functi.. (context) - Sigl, Doll et al. - 1991
39
Timing-Driven Placement For Large Standard-Cell Circuits (context) - Swartz, Sechen - 1995
35
Congestion Driven Quadratic Placement (context) - Parakh, Brown et al. - 1998
33
Partitioning based standard cell global placement with an ex..
- Huang, Kahng - 1997
29
Multilevel Optimization for Large-scale Circuit Placement
- Chan, Cong et al. - 2000
26
Estimating Routing Congestion using Probabilistic Analysis (context) - Lou, Krishnamoorthy et al. - 2001
24
Requirements for Models of Achievable Routing
- Kahng, Mantik et al. - 2000
22
Routability Driven White Space Allocation for Fixed-Die Stan..
- Yang, Choi et al. - 2002
20
Optimal Partitioners and End-case Placers for Standard-cell ..
- Caldwell, Kahng et al. - 2000
20
Mongrel: Hybrid Techniques For Standard Cell Placement (context) - Hur, Lillis - 2000
19
Algorithms for Large-Scale Flat Placement
- Vygen - 1997
18
An Efficient algorithm for the Two-Dimensional Placement Pro.. (context) - Goto - 1981
17
Predictable Routing
- Kastner, Bozogzadeh et al. - 2000
17
Quantified Suboptimality of VLSI Layout Heuristics
- Hagen, Huang et al. - 1995
17
Optimality and Scalability Study of Existing Placement Algor..
- Chang, Cong et al. - 2003
16
Improved Algorithms for Hypergraph Bi-partitioning
- Caldwell, Kahng et al. - 2000
16
The Role of Custom Design in ASIC Chips
- Dally, Chang - 2000
16
Consistent Placement of Macro-Blocks using Floorplanning and.. (context) - Adya, Markov - 2002
15
Yang and M (context) - Wang
15
Iterative Placement Improvement By Network Flow Methods (context) - Doll, Johannes et al. - 1994
15
An Effective Congestion Driven Placement Framework
- Rohe, Brenner - 2002
13
Hypergraph Partitioning for VLSI CAD: Methodology for Report..
- Caldwell, Kahng et al. - 1999
13
Improved Cut Sequences for Partitioning Based Placement
- Yildiz, Madden
13
Timing driven placement using physical net constraints
- Halpin, Chen et al. - 2001
12
Why interconnect prediction doesn't work (context) - Scheffer, Nequist - 2000
11
A Novel Net Weighting Algorithm for Timing-Driven Placement (context) - Kong - 2002
11
A Priori Wire Length Estimates for Digital Design (context) - Stroobandt - 2001
10
An Enhanced Multilevel Algorithm for Circuit Placement
- Kong, Shinnerl et al. - 2003
10
Timing-driven Placement based on Partitioning with Dynamic C.. (context) - Ou, Pedram - 2000
10
Optimality, Scalability and Stability Study of Partitioning ..
- Cong, Romesis et al. - 2003
9
Timing-Driven Placement using Design Hierarchy Guided Constr..
- Yang, Choi et al. - 2002
9
Multi-level Optimization in VLSI CAD (context) - Cong, Shinnerl - 2002
9
Multi-level Placement for Large-Scale Mixed-Size IC Designs
- Chang, Cong et al. - 2003
9
Min-max Placement For Large-scale Timing Optimization
- Kahng, Mantik et al. - 2002
9
Free Space Management for Cut-Based Placement (context) - Alpert, Nam et al. - 2002
8
A Performance-driven Standard Cell Placer based on a Modifie.. (context) - Chou, Lin - 2001
7
Fractional Cut: Improved Recursive Bisection Placement (context) - Agnihotri, Yildiz et al. - 2003
7
Reporting of Standard Cell Placement Results
- Madden - 2002
7
Hypergraph Partitioning With Fixed Vertices
- Alpert, Caldwell et al. - 2000
6
Design and Implementation of Move-based Heuristics for VLSI ..
- Caldwell, Kahng et al. - 2000
5
Transformational Placement and Synthesis
- Donath - 2000
5
Hierarchical Whitespace Allocation (context) - Caldwell, Kahng et al. - 2003
5
Report of the Investigation Committee on the Possibility of .. (context) - Beasley, Datta et al. - 2000
5
On Metrics for Comparing Routability Estimation Methods for ..
- Kannan, Balachandran et al. - 2002
4
A Force-directed Maze Router (context) - Mo, Tabbara et al. - 2001
4
On Whitespace and Stability in Mixed-Size Placement and Phys..
- Adya, Markov et al. - 2003
3
Refined Single Trunk Tree: A Rectilinear Steiner Tree Genera.. (context) - Chen, Qiao et al. - 2002
3
Fraud Shows Peer-review Flaws (context) - Lerner - 2002
3
A Standard-Cell Placement Tool for Designs with High Row Uti..
- Yang, Choi et al. - 2002
3
Metrics for Structural Logic Synthesis (context) - Kudva, Sullivan et al. - 2002
www.mondes.com/products/dolphin.htm
http://www.si2.org/openaccess/
http://www.si2.org/OLA/
http://www.ece.cmu
http://www.specbench.org/
http://www.magma-da.com/whitepapers.html
http://vlsicad.eecs.umich.edu/BK
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.eecs.umich.edu/~imarkov/pubs/): More
Graph-Based Simulation of Quantum Computation in the.. - Viamontes, Markov, Hayes
(Correct)
Toward a Software Architecture for Quantum Computing.. - Svore, Cross, Aho..
(Correct)
Symmetries in Rectangular Block-Packing - Hay-Wai Chan And (2003)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC