Sequence Pair Representation

Slides:



Advertisements
Similar presentations
Floorplanning. Non-Slicing Floorplan Representation Rectangle-Packing-Based Module Placement, H. Murata, K. Fujiyoushi, S. Nakatake and Y. Kajitani, IEEE.
Advertisements

THERMAL-AWARE BUS-DRIVEN FLOORPLANNING PO-HSUN WU & TSUNG-YI HO Department of Computer Science and Information Engineering, National Cheng Kung University.
1.7 Transformations of Functions Ex. 1 Shifting Points in the Plane Shift the triangle three units to the right and two units up. What are the.
Octagonal Drawing Johan van Rooij. Overview What is an octagonal drawing Good slicing graphs Octagonal drawing algorithm for good slicing graphs Correctness.
CS 253: Algorithms Chapter 22 Graphs Credit: Dr. George Bebis.
VLSI DESIGN & COMPARABILITY GRAPHS By Deepak Katta.
Simple Graph Warmup. Cycles in Simple Graphs A cycle in a simple graph is a sequence of vertices v 0, …, v n for some n>0, where v 0, ….v n-1 are distinct,
Graph Theory Arnold Mesa. Basic Concepts n A graph G = (V,E) is defined by a set of vertices and edges v3 v1 v2Vertex (v1) Edge (e1) A Graph with 3 vertices.
ECE Longest Path dual 1 ECE 665 Spring 2005 ECE 665 Spring 2005 Computer Algorithms with Applications to VLSI CAD Linear Programming Duality – Longest.
An Introduction to Channel Routing
Control Flow Analysis. Construct representations for the structure of flow-of-control of programs Control flow graphs represent the structure of flow-of-control.
Linear Constraint Graph for Floorplan Optimization with Soft Blocks Jia Wang Electrical and Computer Engineering Illinois Institute of Technology Chicago,
Optimal Rectangle Packing: A Meta-CSP Approach Chris Reeson Advanced Constraint Processing Fall 2009 By Michael D. Moffitt and Martha E. Pollack, AAAI.
ECE734 VLSI Arrays for Digital Signal Processing Algorithm Representations and Iteration Bound.
Chapter 3 – Chip Planning
Interconnect Estimation without Packing via ACG Floorplans Jia Wang and Hai Zhou Electrical & Computer Engineering Northwestern University U.S.A.
Rectangle Visibility Graphs: Characterization, Construction, Compaction Ileana Streinu (Smith) Sue Whitesides (McGill U.)
Fixed-outline Floorplanning Through Better Local Search
NuCAD ACG - Adjacent Constraint Graph for General Floorplans Hai Zhou and Jia Wang ICCD 2004, San Jose October 11-13, 2004.
Graphic Tool for Computer Chip Layout Laura McLane Saint Michael’s College Advisor: Joanna Ellis-Monaghan.
Chapter 9 Graph algorithms Lec 21 Dec 1, Sample Graph Problems Path problems. Connectedness problems. Spanning tree problems.
Penn ESE535 Spring DeHon 1 ESE535: Electronic Design Automation Day 19: April 9, 2008 Routing 1.
CSE 321 Discrete Structures Winter 2008 Lecture 25 Graph Theory.
Processing Rate Optimization by Sequential System Floorplanning Jia Wang 1, Ping-Chih Wu 2, and Hai Zhou 1 1 Electrical Engineering & Computer Science.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Chapter 3 – Chip Planning 3.1 Introduction to.
Floorplanning. Obtained by subdividing a given rectangle into smaller rectangles. Each smaller rectangle corresponds to a module.
1 ENTITY test is port a: in bit; end ENTITY test; DRC LVS ERC Circuit Design Functional Design and Logic Design Physical Design Physical Verification and.
8/15/ VLSI Physical Design Automation Prof. David Pan Office: ACES Lecture 8. Floorplanning (2)
9/4/ VLSI Physical Design Automation Prof. David Pan Office: ACES Detailed Routing (I)
Simulated Annealing.
Introduction to Job Shop Scheduling Problem Qianjun Xu Oct. 30, 2001.
VLSI Backend CAD Konstantin Moiseev – Intel Corp. & Technion Shmuel Wimer – Bar Ilan Univ. & Technion.
Bus-Driven Floorplanning Hua Xiang*, Xiaoping Tang +, Martin D. F. Wong* * Univ. Of Illinois at Urbana-Champaign + Cadence Design Systems Inc.
Bus-Pin-Aware Bus-Driven Floorplanning B. Wu and T. Ho Department of Computer Science and Information Engineering NCKU GLSVLSI 2010.
1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 4 Floorplanning Mustafa Ozdal Computer Engineering Department, Bilkent University.
YK Channel Routing (1/16)Practical Problems in VLSI Physical Design Yoshimura-Kuh Channel Routing Perform YK channel routing with K = 100 TOP = [1,1,4,2,3,4,3,6,5,8,5,9]
Non-Slicing Floorplanning Joanna Ho David Lee David Omoto.
Rectlinear Block Packing Using the O-tree Representation Yingxin Pang Koen Lampaert Mindspeed Technologies Chung-Kuan Cheng University of California, San.
A Stable Fixed-outline Floorplanning Method Song Chen and Takeshi Yoshimura Graduate School of IPS, Waseda University March, 2007.
CALTECH CS137 Winter DeHon CS137: Electronic Design Automation Day 13: February 20, 2002 Routing 1.
By P.-H. Lin, H. Zhang, M.D.F. Wong, and Y.-W. Chang Presented by Lin Liu, Michigan Tech Based on “Thermal-Driven Analog Placement Considering Device Matching”
Graphs of Linear Equations. 1)Copy and complete the ordered pairs using the equation y = 3x + 2 (-4, -10) (-2, ? ) (0, ? ) (2, ? ) (4, ? ) 2) Graph each.
VLSI Floorplanning and Planar Graphs prepared and Instructed by Shmuel Wimer Eng. Faculty, Bar-Ilan University July 2015VLSI Floor Planning and Planar.
Graphs Definition: a graph is an abstract representation of a set of objects where some pairs of the objects are connected by links. The interconnected.
CALTECH CS137 Fall DeHon 1 CS137: Electronic Design Automation Day 21: November 28, 2005 Routing 1.
Chapter 8.1 vocabulary Relation Is a pairing of numbers or a set of ordered pair {(2,1) (3,5) (6, 3)} Domain: first set of numbers Range: Second set of.
Partial Reconfigurable Designs
VLSI Physical Design Automation
3.5 Graphs in Three Dimensions
Notes Over 4.2 Is a Solution Verifying Solutions of an Equation
Normalized Polish Expression
Can you draw this picture without lifting up your pen/pencil?
By Santhosh Reddy Katkoori
GORDIAN Placement Perform GORDIAN placement
I. Floorplanning with Fixed Modules
Optimal Non-Manhattan Bubble Sort Channel Router
Section 1.6 Transformation of Functions
Graph Theory By Amy C. and John M..
Shortest Path Algorithms
Comparing and Ordering Integers
Detailed Routing مرتضي صاحب الزماني.
Slope  4 Ways: Graph Formula Ordered Pairs Table.
Graphs G = (V, E) V are the vertices; E are the edges.
Inspired by SWERC 2014 ( City Park), ecs
A B D C E F Rectangle corners Lower left Upper right A (4, 9) (8,11)
VLSI Physical Design Automation
1.4 Ordered Pairs and Relations
Objective- To graph a relationship in a table.
Relation (a set of ordered pairs)
Floorplanning (Adapted from Prof. E. Young’s and Prof. Y
Presentation transcript:

Sequence Pair Representation Initial SP: SP1 = (17452638, 84725361) Dimensions: (2,4), (1,3), (3,3), (3,5), (3,2), (5,3), (1,2), (2,4) Based on SP1 we build the following table: Practical Problems in VLSI Physical Design

Constraint Graphs Horizontal constraint graph (HCG) Before and after removing transitive edges Practical Problems in VLSI Physical Design

Constraint Graphs (cont) Vertical constraint graph (VCG) Practical Problems in VLSI Physical Design

Computing Chip Width and Height Longest source-sink path length in: HCG = chip width, VCG = chip height Node weight = module width/height Practical Problems in VLSI Physical Design

Computing Module Location Use longest source-module path length in HCG/VCG Lower-left corner location = source to module input path length Practical Problems in VLSI Physical Design

Final Floorplan Dimension: 11 × 15 Practical Problems in VLSI Physical Design

Move I Swap 1 and 3 in positive sequence of SP1 Practical Problems in VLSI Physical Design

Constraint Graphs Practical Problems in VLSI Physical Design

Constructing Floorplan Dimension: 13 × 14 Practical Problems in VLSI Physical Design

Move II Swap 4 and 6 in both sequences of SP2 Practical Problems in VLSI Physical Design

Constraint Graphs Practical Problems in VLSI Physical Design

Constructing Floorplan Dimension: 13 × 12 Practical Problems in VLSI Physical Design

Summary Impact of the moves: Floorplan dimension changes from 11 × 15 to 13 × 14 to 13 × 12 Practical Problems in VLSI Physical Design