مرتضي صاحب الزماني 1 Maze Routing. Homework 4 مهلت تحویل : 23 اردیبهشت پروژه 1 : انتخاب طرح : امروز مرتضي صاحب الزماني 2.

Slides:

Advertisements

Similar presentations

A Minimum Cost Path Search Algorithm Through Tile Obstacles Zhaoyun Xing and Russell Kao Sun Microsystems Laboratories.

Advertisements

Algorithms (and Datastructures) Lecture 3 MAS 714 part 2 Hartmut Klauck.

Introduction to Algorithms Lecture 12 Prof. Constantinos Daskalakis CLRS

Chapter 9: Graphs Shortest Paths

Review Binary Search Trees Operations on Binary Search Tree

IKI 10100: Data Structures & Algorithms Ruli Manurung (acknowledgments to Denny & Ade Azurat) 1 Fasilkom UI Ruli Manurung (Fasilkom UI)IKI10100: Lecture10.

ALGORITHMS THIRD YEAR BANHA UNIVERSITY FACULTY OF COMPUTERS AND INFORMATIC Lecture eight Dr. Hamdy M. Mousa.

CS 473Lecture 141 CS473-Algorithms I Lecture 14-A Graph Searching: Breadth-First Search.

Breadth-First Search Seminar – Networking Algorithms CS and EE Dept. Lulea University of Technology 27 Jan Mohammad Reza Akhavan.

Graphs Chapter 12. Chapter Objectives  To become familiar with graph terminology and the different types of graphs  To study a Graph ADT and different.

Graph Search Methods Spring 2007 CSE, POSTECH. Graph Search Methods A vertex u is reachable from vertex v iff there is a path from v to u. A search method.

Data Structure and Algorithms (BCS 1223) GRAPH. Introduction of Graph A graph G consists of two things: 1.A set V of elements called nodes(or points or.

Breadth-First Search David Johnson. Today Look at one version of Breadth-first search on a grid Develop Matlab version of BFS.

Midwestern State University Department of Computer Science Dr. Ranette Halverson CMPS 2433 CHAPTER 4 - PART 2 GRAPHS 1.

Visibility Computations: Finding the Shortest Route for Motion Planning COMP Presentation Eric D. Baker Tuesday 1 December 1998.

State Space Search Algorithms CSE 472 Introduction to Artificial Intelligence Autumn 2003.

©Wen-mei W. Hwu and David Kirk/NVIDIA 2010 ECE 498HK Computational Thinking for Many-core Computing Lecture 15: Dealing with Dynamic Data.

Chapter 7: Greedy Algorithms 7.4 Finding the Shortest Path Dijkstra’s Algorithm pp

ICS 252 Introduction to Computer Design Routing Fall 2007 Eli Bozorgzadeh Computer Science Department-UCI.

Nyhoff, ADTs, Data Structures and Problem Solving with C++, Second Edition, © 2005 Pearson Education, Inc. All rights reserved Graphs.

1 CSE 417: Algorithms and Computational Complexity Winter 2001 Lecture 9 Instructor: Paul Beame.

Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.

Spring 2010CS 2251 Graphs Chapter 10. Spring 2010CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs.

VLSI Routing. Routing Problem  Given a placement, and a fixed number of metal layers, find a valid pattern of horizontal and vertical wires that connect.

Routing 1 Outline –What is Routing? –Why Routing? –Routing Algorithms Overview –Global Routing –Detail Routing –Shortest Path Algorithms Goal –Understand.

CSE 780 Algorithms Advanced Algorithms Graph Algorithms Representations BFS.

Breadth First Search (BFS) Part 2 COMP171. Graph / Slide 2 Shortest Path Recording * BFS we saw only tells us whether a path exists from source s, to.

Fall 2007CS 2251 Graphs Chapter 12. Fall 2007CS 2252 Chapter Objectives To become familiar with graph terminology and the different types of graphs To.

CS 206 Introduction to Computer Science II 03 / 30 / 2009 Instructor: Michael Eckmann.

CISC220 Fall 2009 James Atlas Nov 13: Graphs, Line Intersections.

Routing 2 Outline –Maze Routing –Line Probe Routing –Channel Routing Goal –Understand maze routing –Understand line probe routing.

1 Shortest Path Calculations in Graphs Prof. S. M. Lee Department of Computer Science.

CS261 Data Structures DFS and BFS – Edge List Representation.

Introduction to Routing. The Routing Problem Apply after placement Input: –Netlist –Timing budget for, typically, critical nets –Locations of blocks and.

Dijkstra’s Algorithm and Heuristic Graph Search David Johnson.

Global Routing. Global routing:  To route all the nets, should consider capacities  Sequential −One net at a time  Concurrent −Order-independent 2.

Structures 7 Decision Maths: Graph Theory, Networks and Algorithms.

Maze Routing مرتضي صاحب الزماني.

Data Structures and Algorithms Ver. 1.0 Session 17 Objectives In this session, you will learn to: Implement a graph Apply graphs to solve programming problems.

GLOBAL ROUTING Anita Antony PR11EC1011. Approaches for Global Routing Sequential Approach: – Route the nets one at a time. Concurrent Approach: – Consider.

Lecture 11 Algorithm Analysis Arne Kutzner Hanyang University / Seoul Korea.

Detailed Routing مرتضي صاحب الزماني.

1 Directed Graphs Chapter 8. 2 Objectives You will be able to: Say what a directed graph is. Describe two ways to represent a directed graph: Adjacency.

Depth-First Search Lecture 21: Graph Traversals

Graphs Chapter 12. Chapter 12: Graphs2 Chapter Objectives To become familiar with graph terminology and the different types of graphs To study a Graph.

Graphs. Introduction Graphs are a collection of vertices and edges Graphs are a collection of vertices and edges The solid circles are the vertices A,

Subject : CAD For VLSI (7CS4) 1 Unit 5 Floor-planning, Placement & Routing.

Graphs & Paths Presentation : Part II. Graph representation Given graph G = (V, E). May be either directed or undirected. Two common ways to represent.

CHAPTER 13 GRAPH ALGORITHMS ACKNOWLEDGEMENT: THESE SLIDES ARE ADAPTED FROM SLIDES PROVIDED WITH DATA STRUCTURES AND ALGORITHMS IN C++, GOODRICH, TAMASSIA.

P, NP, and NP-Complete Problems Section 10.3 The class P consists of all problems that can be solved in polynomial time, O(N k ), by deterministic computers.

CSCE 552 Fall 2012 AI By Jijun Tang. Homework 3 List of AI techniques in games you have played; Select one game and discuss how AI enhances its game play.

Spanning Trees Dijkstra (Unit 10) SOL: DM.2 Classwork worksheet Homework (day 70) Worksheet Quiz next block.

CSC 213 – Large Scale Programming Lecture 31: Graph Traversals.

Parallel Algorithms for VLSI Routing 曾奕倫 Department of Computer Science & Engineering Yuan Ze University.

Graphs – Breadth First Search

VLSI Physical Design Automation

Graphs Representation, BFS, DFS

Plan Agents Chapter 7..

Chapter 7: Greedy Algorithms

Graphs Representation, BFS, DFS

Chapter 22: Elementary Graph Algorithms I

Routing Algorithms.

Detailed Routing مرتضي صاحب الزماني.

Algorithms Lecture # 29 Dr. Sohail Aslam.

ICS 252 Introduction to Computer Design

Chapter 9: Graphs Shortest Paths

Under a Concurrent and Hierarchical Scheme

Presentation transcript:

مرتضي صاحب الزماني 1 Maze Routing

Homework 4 مهلت تحویل : 23 اردیبهشت پروژه 1 : انتخاب طرح : امروز مرتضي صاحب الزماني 2

3 Maze Routing Problem Given: –A planar rectangular grid graph. –Two points on the graph, S and T. –Obstacles modeled as blocked vertices. Objective: –Find the shortest path connecting S and T. Can be used to solve global or detailed routing (switchbox) problems.

مرتضي صاحب الزماني 4 Grid Graph Area Routing S T X S T X Simplified Representation X Grid Graph (Maze) S T X

مرتضي صاحب الزماني 5 Maze Routing S T

مرتضي صاحب الزماني 6 Lee’s Algorithm “ An Algorithm for Path Connection and its Application ”, C.Y. Lee, IRE Transactions on Electronic Computers, 1961.

مرتضي صاحب الزماني 7 Basic Idea A Breadth-First Search (BFS) of the grid graph. Always find the shortest path possible. Consists of 2 phases: –Wave Propagation –Retrace

مرتضي صاحب الزماني 8 An Illustration S T

مرتضي صاحب الزماني 9 Wave Propagation At step i, all vertices at Manhattan-distance i from S are labeled with i. A Propagation List (FIFO) is used to keep track of the vertices to consider in next step. S T 0 S T S T After Step 0After Step 3 After Step 6

مرتضي صاحب الزماني 10 Retrace Trace back the actual route. Starting from T. At vertex with i, goto any vertex with label i-1. S T Final Labeling

مرتضي صاحب الزماني 11 Example A B

مرتضي صاحب الزماني 12 Example (continued) A B

مرتضي صاحب الزماني 13 Retrace the Path A B

مرتضي صاحب الزماني 14 Alternative Paths Guideline: do not change direction unless you must

مرتضي صاحب الزماني 15 Maze Routing Summary Four Main Steps: 1.Expansion – Breadth first search to find all paths from source to target 2.Backtrace – Walk the shortest path back to the source and mark the path cells used 3.Clean Up – Erase all distance marks from other grid cells before the next net is routed 4.Reduce Capacities.

مرتضي صاحب الزماني 16 How many grids visited using Lee’s algorithm? S T

مرتضي صاحب الزماني 17 Time and Space Complexity For a grid of size w  h: Time per net = O(wh) Space = O(wh log wh) (Since O(log wh) bits are needed to store each label.) For a x grid: 32 bits per label Total 4.8*4/3 Gbytes of memory!

مرتضي صاحب الزماني 18 Lee Algorithm

References David Pan, VLSI Physical Design Automation, Lecture Slides, University of Texas, مرتضي صاحب الزماني 19