Practical Problems in VLSI Physical Design Automation

caroline11

Contents
1. CLUSTERING
1.1 Rajaraman and Wong Algorithm
1.2 FlowMap Algorithm
1.3 Multi-Level Coarsening Algorithm
1.4 More Practice Problems
1.5 Probing Further
2. PARTITIONING
2.1 Kernighan and Lin Algorithm
2.2 Fiduccia and Mattheyses Algorithm
2.3 EIG Algorithm
2.4 FBB Algorithm
2.5 More Practice Problems
2.6 Probing Further
3. FLOORPLANNING
3.1 Stockmeyer Algorithm
3.2 Normalized Polish Expression
3.3 ILP Floorplanning Algorithm
3.4 Sequence Pair Representation
3.5 More Practice Problems
3.6 Probing Further
4. PLACEMENT
4.1 Mincut Placement
4.2 GORDIAN Algorithm
4.3 TimberWolf Algorithm
4.4 More Practice Problems
4.5 Probing Further
5. STEINER ROUTING
5.1 L-Shaped Steiner Routing Algorithm
5.2 1-Steiner Routing Algorithms
5.3 Bounded Radius Routing Algorithms
5.4 A-tree Algorithm 170
5.5 Elmore Routing Tree Algorithms
5.6 More Practice Problems
5.7 Probing Further
6. MULTI-NET ROUTING
6.1 Steiner Min-Max Tree Algorithm
6.2 Multi-Commodity Flow Routing Algorithm
6.3 Iterative Deletion Algorithm
6.4 Yoshimura and Kuh Algorithm
6.5 More Practice Problems
6.6 Probing Further