GORDIAN Placement Perform GORDIAN placement

Slides:



Advertisements
Similar presentations
2.3 Modeling Real World Data with Matrices
Advertisements

Graphs and Finding your way in the wilderness
Introduction to Graph “theory”
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.
Online Social Networks and Media. Graph partitioning The general problem – Input: a graph G=(V,E) edge (u,v) denotes similarity between u and v weighted.
Clustering II CMPUT 466/551 Nilanjan Ray. Mean-shift Clustering Will show slides from:
(0,1)-Matrices If the row-sums of a matrix A are r 1, …,r k, then we shall call the vector r:=(r 1,r 2, …,r k ) the row-sum of A, and similarly for the.
Rajat K. Pal. Chapter 3 Emran Chowdhury # P Presented by.
Partitioning 1 Outline –What is Partitioning –Partitioning Example –Partitioning Theory –Partitioning Algorithms Goal –Understand partitioning problem.
7/15/ VLSI Placement Prof. Shiyan Hu Office: EERC 731.
10/11/ VLSI Physical Design Automation Prof. David Pan Office: ACES Placement (2)
Gordian Placement Tool: Quadratic and Linear Problem Formulation Ryan Speelman Jason Gordon Steven Butt EE 201A
Analytic Placement. Layout Project:  Sending the RTL file: −Thursday, 27 Farvardin  Final deadline: −Tuesday, 22 Ordibehesht  New Project: −Soon 2.
Quadratic and Linear WL Placement Using Quadratic Programming: Gordian & Gordian-L Shantanu Dutt ECE Dept., Univ. of Illinois at Chicago Acknowledgements:
13.1 Matrices and Their Sums
Massachusetts Institute of Technology 1 L14 – Physical Design Spring 2007 Ajay Joshi.
Placement. Physical Design Cycle Partitioning Placement/ Floorplanning Placement/ Floorplanning Routing Break the circuit up into smaller segments Place.
If A and B are both m × n matrices then the sum of A and B, denoted A + B, is a matrix obtained by adding corresponding elements of A and B. add these.
Quadratic VLSI Placement Manolis Pantelias. General Various types of VLSI placement  Simulated-Annealing  Quadratic or Force-Directed  Min-Cut  Nonlinear.
How to Multiply Two Matrices. Steps for Matrix Multiplication 1.Determine whether the matrices are compatible. 2.Determine the dimensions of the product.
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.
Copyright © Cengage Learning. All rights reserved. 2 SYSTEMS OF LINEAR EQUATIONS AND MATRICES.
Algebra Matrix Operations. Definition Matrix-A rectangular arrangement of numbers in rows and columns Dimensions- number of rows then columns Entries-
Efficient Semi-supervised Spectral Co-clustering with Constraints
VLSI Floorplanning and Planar Graphs prepared and Instructed by Shmuel Wimer Eng. Faculty, Bar-Ilan University July 2015VLSI Floor Planning and Planar.
2.3 MODELING REAL WORLD DATA WITH MATRICES By the end of the section students will be able to add, subtract, and multiply matrices of various sizes. Students.
RTL Design Flow RTL Synthesis HDL netlist logic optimization netlist Library/ module generators physical design layout manual design a b s q 0 1 d clk.
Subject Four Graphs Data Structures. What is a graph? A data structure that consists of a set of nodes (vertices) and a set of edges that relate the nodes.
Mincut Placement (1/12)Practical Problems in VLSI Physical Design Mincut Placement Perform quadrature mincut onto 4 × 4 grid  Start with vertical cut.
Spectral partitioning works: Planar graphs and finite element meshes
13.4 Product of Two Matrices
12-1 Organizing Data Using Matrices
Matrices Rules & Operations.
Matrix Operations Free powerpoints at
Matrix Operations.
Graphs Representation, BFS, DFS
Matrix Representation of Graphs
15. Directed graphs and networks
Matrix Operations.
Matrix Operations Free powerpoints at
Matrix Multiplication
Matrix Operations.
VLSI Quadratic Placement
Matrix Operations SpringSemester 2017.
Matrix Operations Free powerpoints at
Hagen-Kahng EIG Partitioning
WarmUp 2-3 on your calculator or on paper..
MULTIPLYING TWO MATRICES
Graph Algorithm.
Part 3 Linear Programming
Sequence Pair Representation
Iterative Deletion Routing Algorithm
Matrices Elements, Adding and Subtracting
EE5780 Advanced VLSI Computer-Aided Design
Multi-level Coarsening Algorithm
Optimal Non-Manhattan Bubble Sort Channel Router
Walks, Paths, and Circuits
Objectives Multiply two matrices.
TimberWolf 7.0 Placement Perform TimberWolf placement
3.3 Network-Centric Community Detection
Graphs G = (V, E) V are the vertices; E are the edges.
GRAPHS G=<V,E> Adjacent vertices Undirected graph
3.6 Multiply Matrices.
The Determinant of a 2  2 Matrix
12 Further mathematics Adjacency Matrices.
Part 3 Linear Programming
Matrix Operations SpringSemester 2017.
Kramer’s (a.k.a Cramer’s) Rule
“Easy” Integer Programming Problems: Network Flow Problems
Presentation transcript:

GORDIAN Placement Perform GORDIAN placement Uniform area and net weight, area balance factor = 0.5 Undirected graph model: each edge in k-clique gets weight 2/k Practical Problems in VLSI Physical Design

IO Placement Necessary for GORDIAN to work Practical Problems in VLSI Physical Design

Adjacency Matrix Shows connections among movable nodes Among nodes a to j Practical Problems in VLSI Physical Design

Pin Connection Matrix Shows connections between movable nodes and IO Rows = movable nodes, columns = IO (fixed) Practical Problems in VLSI Physical Design

Degree Matrix Based on both adjacency and pin connection matrices Sum of entries in the same row (= node degree) Practical Problems in VLSI Physical Design

Laplacian Matrix Degree matrix minus adjacency matrix Practical Problems in VLSI Physical Design

Fixed Pin Vectors Based on pin connection matrix and IO location Y-direction is defined similarly Practical Problems in VLSI Physical Design

Fixed Pin Vectors (cont) Practical Problems in VLSI Physical Design

Fixed Pin Vectors (cont) Practical Problems in VLSI Physical Design

Level 0 QP Formulation No constraint necessary Practical Problems in VLSI Physical Design

Level 0 Placement Cells with real dimension will overlap Practical Problems in VLSI Physical Design

Level 1 Partitioning Perform level 1 partitioning Obtain center locations for center-of-gravity constraints Practical Problems in VLSI Physical Design

Level 1 Constraint Practical Problems in VLSI Physical Design

Level 1 LQP Formulation Practical Problems in VLSI Physical Design

Level 1 Placement Practical Problems in VLSI Physical Design

Verification Verify that the constraints are satisfied in the left partition Practical Problems in VLSI Physical Design

Level 2 Partitioning Add two more cut-lines This results in p1={c,d}, p2={a,b,e}, p3={g,j}, p4={f,h,i} Practical Problems in VLSI Physical Design

Level 2 Constraint Practical Problems in VLSI Physical Design

Level 2 LQP Formulation Practical Problems in VLSI Physical Design

Level 2 Placement Clique-based wiring is shown Practical Problems in VLSI Physical Design

Summary Center-of-gravity constraint Helps spread the cells evenly while monitoring wirelength Removes overlaps among the cells (with real dimension) Practical Problems in VLSI Physical Design