Mincut Placement (1/12)Practical Problems in VLSI Physical Design Mincut Placement Perform quadrature mincut onto 4 × 4 grid  Start with vertical cut.

Slides:



Advertisements
Similar presentations
Drawing furniture using One Point Perspective
Advertisements

L30: Partitioning 성균관대학교 조 준 동 교수
Graph Partitioning Problems Lecture 18: March 14 s1 s3 s4 s2 T1 T4 T2 T3 s1 s4 s2 s3 t3 t1 t2 t4 A region R1 R2 C1 C2.
Divide and Conquer. Subject Series-Parallel Digraphs Planarity testing.
Jump to first page DISTRIBUTED GENERATION OF PAIRWISE COMBINATIONS PARALLEL GRAPH PARTITIONING ON A HYPERCUBE F. Ercal, P. Sadayappan, and J. Ramanujan.
Approximation Algoirthms: Graph Partitioning Problems Lecture 17: March 16 s1 s3 s4 s2 T1 T4 T2 T3.
EMIS 8374 Vertex Connectivity Updated 20 March 2008.
X-Architecture Placement Based on Effective Wire Models Tung-Chieh Chen, Yi-Lin Chuang, and Yao-Wen Chang Graduate Institute of Electronics Engineering.
Ch.7 Layout Design Standard Cell Design TAIST ICTES Program VLSI Design Methodology Hiroaki Kunieda Tokyo Institute of Technology.
Shuai Li and Cheng-Kok Koh School of Electrical and Computer Engineering, Purdue University West Lafayette, IN, Mixed Integer Programming Models.
Components Connection Jig Graph Paper (#4101) Mounting Blocks (#5902) Nails Tape Measure Pen Hammer Customer Coordinates.
NetMine: Mining Tools for Large Graphs Deepayan Chakrabarti Yiping Zhan Daniel Blandford Christos Faloutsos Guy Blelloch.
Graph Clustering. Why graph clustering is useful? Distance matrices are graphs  as useful as any other clustering Identification of communities in social.
Boosting: Min-Cut Placement with Improved Signal Delay Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA
Karger’s Min-Cut Algorithm Amihood Amir Bar-Ilan University, 2009.
CSE 222 Systems Programming Graph Theory Basics Dr. Jim Holten.
Placement Feedback: A Concept and Method for Better Min-Cut Placements Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La.
On Legalization of Row-Based Placements Andrew B. KahngSherief Reda CSE & ECE Departments University of CA, San Diego La Jolla, CA 92093
Can Recursive Bisection Alone Produce Routable Placements? Andrew E. Caldwell Andrew B. Kahng Igor L. Markov Supported by Cadence.
Fixed-outline Floorplanner (Parquet) A constraint satisfaction problem “Parquet” based on “floorplan slack” Use better local search to satisfy constraints.
1 Circuit Partitioning Presented by Jill. 2 Outline Introduction Cut-size driven circuit partitioning Multi-objective circuit partitioning Our approach.
CSE 144 Project Part 2. Overview Multiple rows Routing channel between rows Components of identical height but various width Goal: Implement a placement.
Partitioning 1 Outline –What is Partitioning –Partitioning Example –Partitioning Theory –Partitioning Algorithms Goal –Understand partitioning problem.
1 CSC 6001 VLSI CAD (Physical Design) January
Joanna Ellis-Monaghan, St. Michaels College Paul Gutwin, Principal Technical Account Manager, Cadence.
How to make a paper airplane
Air Racer Design and Layout.
1 Min-cut for Undirected Graphs Given an undirected graph, a global min-cut is a cut (S,V-S) minimizing the number of crossing edges, where a crossing.
Global Routing.
Graph Partitioning Problem Kernighan and Lin Algorithm
CS774. Markov Random Field : Theory and Application Lecture 13 Kyomin Jung KAIST Oct
Chapter 14: SEGMENTATION BY CLUSTERING 1. 2 Outline Introduction Human Vision & Gestalt Properties Applications – Background Subtraction – Shot Boundary.
Seeing the Forest and the Trees: Steiner Wirelength Optimization in Placement Jarrod A. Roy, James F. Lu and Igor L. Markov University of Michigan Ann.
Applications of the Max-Flow Min-Cut Theorem. S-T Cuts SF D H C A NY S = {SF, D, H}, T={C,A,NY} [S,T] = {(D,A),(D,C),(H,A)}, Cap [S,T] =
Improved Cut Sequences for Partitioning Based Placement Mehmet Can YILDIZ and Patrick H. Madden State University of New York at BinghamtonComputer Science.
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
10/25/ VLSI Physical Design Automation Prof. David Pan Office: ACES Lecture 3. Circuit Partitioning.
Placement. Physical Design Cycle Partitioning Placement/ Floorplanning Placement/ Floorplanning Routing Break the circuit up into smaller segments Place.
Modern VLSI Design 3e: Chapter 10 Copyright  1998, 2002 Prentice Hall PTR Topics n CAD systems. n Simulation. n Placement and routing. n Layout analysis.
International Workshop on System-Level Interconnection Prediction, Sonoma County, CA March 2001ER UCLA UCLA 1 Wirelength Estimation based on Rent Exponents.
A deterministic near-linear time algorithm for finding minimum cuts in planar graphs Thank you, Steve, for presenting it for us!!! Parinya Chalermsook.
Circuit Partitioning Divides circuit into smaller partitions that can be efficiently handled Goal is generally to minimize communication between balanced.
The Percent Proportion. To solve a proportion, multiply the numbers that are diagonal, divide by the one that’s left.
CS 484 Load Balancing. Goal: All processors working all the time Efficiency of 1 Distribute the load (work) to meet the goal Two types of load balancing.
Discrete Mathematics Chapter 5 Trees.
1 NTUplace: A Partitioning Based Placement Algorithm for Large-Scale Designs Tung-Chieh Chen 1, Tien-Chang Hsu 1, Zhe-Wei Jiang 1, and Yao-Wen Chang 1,2.
Data Structures and Algorithms in Parallel Computing Lecture 7.
Routing Topology Algorithms Mustafa Ozdal 1. Introduction How to connect nets with multiple terminals? Net topologies needed before point-to-point routing.
VLSI Floorplanning and Planar Graphs prepared and Instructed by Shmuel Wimer Eng. Faculty, Bar-Ilan University July 2015VLSI Floor Planning and Planar.
Outline Standard 2-way minimum graph cut problem. Applications to problems in computer vision Classical algorithms from the theory literature A new algorithm.
Outline Motivation and Contributions Related Works ILP Formulation
CSC 252 Pallavi Moorthy Homework 5. 1.) Vertices, edges From cd../../handout/demo/graph_alg/gw_shortest_path.
Graphs -An abstract way of representing connectivity using nodes (also called vertices) and edges vertices edges directed undirected - weighted.
Min-Cut Placement.
Minimum Spanning Tree Chapter 13.6.
VLSI Quadratic Placement
Making the 17-1 Motion Foldable
NetMine: Mining Tools for Large Graphs
Hagen-Kahng EIG Partitioning
Sequence Pair Representation
Iterative Deletion Routing Algorithm
GORDIAN Placement Perform GORDIAN placement
Creating a grid by Carl Dellutri.
CS 583 Analysis of Algorithms
Network Flow-based Bipartitioning
FRONT No Solutions Infinite Solutions 1 solution (x, y)
TimberWolf 7.0 Placement Perform TimberWolf placement
Steiner Min/Max Tree Routing
Graphs G = (V, E) V are the vertices; E are the edges.
L2036H1 grid6 First cut x x x x x x x x x x x x x x x x x x x x x x x
Presentation transcript:

Mincut Placement (1/12)Practical Problems in VLSI Physical Design Mincut Placement Perform quadrature mincut onto 4 × 4 grid  Start with vertical cut first undirected graph model w/ k-clique weighting thin edges = weight 0.5, thick edges = weight 1

Mincut Placement (2/12)Practical Problems in VLSI Physical Design Cut 1 and 2 First cut has min-cutsize of 3 (not unique)  Both cuts 1 and 2 divide the entire chip

Mincut Placement (3/12)Practical Problems in VLSI Physical Design Cut 3 and 4 Each cut minimizes cutsize  Helps reduce overall wirelength

Mincut Placement (4/12)Practical Problems in VLSI Physical Design Cut 5 and 6 16 partitions generated by 6 cuts  HPBB wirelength = 27

Mincut Placement (5/12)Practical Problems in VLSI Physical Design Recursive Bisection Start with vertical cut  Perform terminal propagation with middle third window

Mincut Placement (6/12)Practical Problems in VLSI Physical Design Cut 3: Terminal Propagation Two terminals are propagated and are “pulling” nodes  Node k and o connect to n and j: p 1 propagated (outside window)  Node g connect to j, f and b: p 2 propagated (outside window)  Terminal p 1 pulls k/o/g to top partition, and p 2 pulls g to bottom

Mincut Placement (7/12)Practical Problems in VLSI Physical Design Cut 4: Terminal Propagation One terminal propagated  Node n and j connect to o/k/g: p 1 propagated  Node i and j connect to e/f/a: no propagation (inside window)  Terminal p 1 pulls n and j to right partition

Mincut Placement (8/12)Practical Problems in VLSI Physical Design Cut 5: Terminal Propagation Three terminals propagated  Node i propagated to p 1, j to p 2, and g to p 3  Terminal p 1 pulls e and a to left partition  Terminal p 2 and p 3 pull f/b/e to right partition

Mincut Placement (9/12)Practical Problems in VLSI Physical Design Cut 6: Terminal Propagation One terminal propagated  Node n and j are propagated to p 1  Terminal p 1 pulls o and k to left partition

Mincut Placement (10/12)Practical Problems in VLSI Physical Design Cut 7: Terminal Propagation Three terminals propagated  Node j/f/b propagated to p 1, o/k to p 2, and h/p to p 3  Terminal p 1 and p 2 pull g and l to left partition  Terminal p 3 pull l and d to right partition

Mincut Placement (11/12)Practical Problems in VLSI Physical Design Cut 8 to partitions generated by 15 cuts  HPBB wirelength = 23

Mincut Placement (12/12)Practical Problems in VLSI Physical Design Comparison Quadrature vs recursive bisection + terminal propagation  Number of cuts: 6 vs 15  Wirelength: 27 vs 23