Presentation is loading. Please wait.

Presentation is loading. Please wait.

1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 1 Course Overview Mustafa Ozdal Computer Engineering Department, Bilkent University.

Published byRoy Dennis Modified over 8 years ago

Similar presentations

Presentation on theme: "1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 1 Course Overview Mustafa Ozdal Computer Engineering Department, Bilkent University."— Presentation transcript:

1 1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 1 Course Overview Mustafa Ozdal Computer Engineering Department, Bilkent University Mustafa Ozdal

2 2 CS 612 – Lecture 1 Mustafa Ozdal Computer Engineering Department, Bilkent University What is EDA?  Stands for Electronic Design Automation  a.k.a VLSI CAD  Software tools to support engineers in the creation of new IC designs.  EDA tools significantly reduce the cost and time-to- market of new projects.  A CPU can easily contain > 1B transistors in a single chip  Manual design is prohibitive

3 3 CS 612 – Lecture 1 Mustafa Ozdal Computer Engineering Department, Bilkent University What is EDA?  Solves a wide-range of problems high-level system design to fabrication (and everything in between)  Strong software skills required  This course will cover the physical design problems  Abstract and algorithmic problems  No EE knowledge needed

4 4 CS 612 – Lecture 1 Mustafa Ozdal Computer Engineering Department, Bilkent University Why Study EDA Algorithms?  You may consider a career in the EDA field  EDA companies: Synopsys, Cadence, Mentor Graphics, …  Design companies: Intel, IBM, Apple, AMD, Nvidia, TI, Qualcomm, ARM, TSMC, …  You may be working in a related field  e.g. Computer architecture: What is the hardware cost, energy cost, etc. of a new feature?  e.g. Scientific computing: Common algorithms used in both domains (e.g. graph partitioning, clustering, etc.)  You may want to improve your algorithmic skills  We will study algorithms for abstract problems that also occur in other domains. e.g. routing, rectangle packing, partitioning, etc.

5 5 CS 612 – Lecture 1 Mustafa Ozdal Computer Engineering Department, Bilkent University Course Overview  Schedule: Lecture: Tue. 13:40-14:30 EA502 Lecture: Thu. 15:40-17:30EA502 Spare Hour: Tue. 14:40:15:30  Course project: More in-depth study of a topic  Literature survey + implementation + experiments  Presentation (survey + plans)  Final report (implementation + experiments + conclusions)

6 6 CS 612 – Lecture 1 Mustafa Ozdal Computer Engineering Department, Bilkent University Sneak Preview of the Problems

7 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 2: Netlist and System Partitioning © KLMH Lienig 7 Circuit: 1 2 4 5 3 6 7 8 Partitioning Problem Partition the netlist into 2 equal parts (i.e. each part must have 4 gates) such that the # of edges between two partitions is minimized.

8 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 2: Netlist and System Partitioning © KLMH Lienig 8 Circuit: Cut c a : four external connections 1 2 4 5 3 6 7 8 5 6 4 8 7 2 3 1 5 6 4 8 7 2 3 1 Cut c a Cut c b Block ABlock B Block ABlock B Cut c b : two external connections Partitioning Problem How to do this for > 1M gates?

9 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 2: Netlist and System Partitioning © KLMH Lienig 9 Floorplanning Problem Example Given: Three blocks with the following potential widths and heights Block A: w = 1, h = 4 or w = 4, h = 1 or w = 2, h = 2 Block B: w = 1, h = 2 or w = 2, h = 1 Block C: w = 1, h = 3 or w = 3, h = 1 Task: Floorplan with minimum total area enclosed A A A B B C C A B C 4 3

10 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 2: Netlist and System Partitioning © KLMH Lienig 10 Floorplanning Problem Example Given: Three blocks with the following potential widths and heights Block A: w = 1, h = 4 or w = 4, h = 1 or w = 2, h = 2 Block B: w = 1, h = 2 or w = 2, h = 1 Block C: w = 1, h = 3 or w = 3, h = 1 Task: Floorplan with minimum total area enclosed

11 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 2: Netlist and System Partitioning © KLMH Lienig 11 Floorplanning Problem Solution: Aspect ratios Block A with w = 2, h = 2; Block B with w = 2, h = 1; Block C with w = 1, h = 3 This floorplan has a global bounding box with minimum possible area (9 square units). Example Given: Three blocks with the following potential widths and heights Block A: w = 1, h = 4 or w = 4, h = 1 or w = 2, h = 2 Block B: w = 1, h = 2 or w = 2, h = 1 Block C: w = 1, h = 3 or w = 3, h = 1 Task: Floorplan with minimum total area enclosed How to do this for 1000s of blocks?

12 - 12 - Placement A C B D E F BDF ACE ACB EDF Which is better? More wirelength Harder routing Less wirelength Easier routing

13 - 13 - Placement as an Optimization Problem Place all cells in the netlist such that: Minimize chip area Minimize wire length Make routing easy Satisfy timing constraints Keep cells on critical paths closer Satisfy various other design constraints A typical design can have > 1M cells NP-complete problem

14 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig © 2011 Springer Verlag 14 C D A B 43 21 4 3 4 1 1 654 Netlist: N 1 = {C 4, D 6, B 3 } N 2 = {D 4, B 4, C 1, A 4 } N 3 = {C 2, D 5 } N 4 = {B 1, A 1, C 3 } Technology Information (Design Rules) Placement result Routing Problem

15 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig © 2011 Springer Verlag 15 Netlist: N 1 = {C 4, D 6, B 3 } N 2 = {D 4, B 4, C 1, A 4 } N 3 = {C 2, D 5 } N 4 = {B 1, A 1, C 3 } Technology Information (Design Rules) Routing Problem C D A B 43 21 4 3 4 1 1 654 N1N1

16 VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig © 2011 Springer Verlag 16 Netlist: N 1 = {C 4, D 6, B 3 } N 2 = {D 4, B 4, C 1, A 4 } N 3 = {C 2, D 5 } N 4 = {B 1, A 1, C 3 } Technology Information (Design Rules) Routing Problem C D A B 43 21 4 3 4 1 1 654 N2N2 N3N3 N4N4 N1N1 How to do this for > 1M nets?

Download ppt "1 CS612 Algorithms for Electronic Design Automation CS 612 – Lecture 1 Course Overview Mustafa Ozdal Computer Engineering Department, Bilkent University."

Similar presentations

An Effective Floorplanning Algorithm in Mixed Mode Placement Integrated with Rectilinear- Shaped Optimization for Soft Blocks Changqi Yang, Xianlong Hong,

An Effective Floorplanning Algorithm in Mixed Mode Placement Integrated with Rectilinear- Shaped Optimization for Soft Blocks Changqi Yang, Xianlong Hong,
Modern VLSI Design 3e: Chapter 10 Copyright  2002 Prentice Hall Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture 24: CAD Systems &

Modern VLSI Design 3e: Chapter 10 Copyright  2002 Prentice Hall Adapted by Yunsi Fei ECE 300 Advanced VLSI Design Fall 2006 Lecture 24: CAD Systems &
VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Topological Design of Clock.

VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Topological Design of Clock.
Congestion Driven Placement for VLSI Standard Cell Design Shawki Areibi and Zhen Yang School of Engineering, University of Guelph, Ontario, Canada December.

Congestion Driven Placement for VLSI Standard Cell Design Shawki Areibi and Zhen Yang School of Engineering, University of Guelph, Ontario, Canada December.
ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.

ENGIN112 L38: Programmable Logic December 5, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 38 Programmable Logic.
Spring 08, Jan 15 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Introduction Vishwani D. Agrawal James J. Danaher.

Spring 08, Jan 15 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Introduction Vishwani D. Agrawal James J. Danaher.
Spring 07, Jan 16 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Introduction Vishwani D. Agrawal James J. Danaher.

Spring 07, Jan 16 ELEC 7770: Advanced VLSI Design (Agrawal) 1 ELEC 7770 Advanced VLSI Design Spring 2007 Introduction Vishwani D. Agrawal James J. Danaher.
Chapter 2 – Netlist and System Partitioning

Chapter 2 – Netlist and System Partitioning
Placement 1 Outline Goal What is Placement? Why Placement?

Placement 1 Outline Goal What is Placement? Why Placement?
Chapter 1 – Introduction

Chapter 1 – Introduction
Hard Optimization Problems: Practical Approach DORIT RON Tel. 08 934 2141 Ziskind room #303

Hard Optimization Problems: Practical Approach DORIT RON Tel Ziskind room #303
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Chapter 3 – Chip Planning 3.1 Introduction to.

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 3: Chip Planning © KLMH Lienig 1 Chapter 3 – Chip Planning 3.1 Introduction to.
ENEE 644 Dr. Ankur Srivastava Office: 1349 A.V. Williams URL: Computer-Aided Design of.

ENEE 644 Dr. Ankur Srivastava Office: 1349 A.V. Williams URL: Computer-Aided Design of.
CS 151 Digital Systems Design Lecture 38 Programmable Logic.

CS 151 Digital Systems Design Lecture 38 Programmable Logic.
Chip Planning 1. Introduction Chip Planning:  Deals with large modules with −known areas −fixed/changeable shapes −(possibly fixed locations for some.

Chip Planning 1. Introduction Chip Planning:  Deals with large modules with −known areas −fixed/changeable shapes −(possibly fixed locations for some.
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.

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.
VLSI CAD Overview: Design, Flows, Algorithms and Tools Konstantin Moiseev – Intel Corp. & Technion Shmuel Wimer – Bar Ilan Univ. & Technion Compiled from.

VLSI CAD Overview: Design, Flows, Algorithms and Tools Konstantin Moiseev – Intel Corp. & Technion Shmuel Wimer – Bar Ilan Univ. & Technion Compiled from.
ELEC516/10 course_des 1 ELEC516 VLSI System Design and Design Automation Spring 2010 Course Description Chi-ying Tsui Department of Electrical and Electronic.

ELEC516/10 course_des 1 ELEC516 VLSI System Design and Design Automation Spring 2010 Course Description Chi-ying Tsui Department of Electrical and Electronic.
VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Accurate Estimation of Global.

VLSI Physical Design: From Graph Partitioning to Timing Closure Paper Presentation © KLMH Lienig 1 EECS 527 Paper Presentation Accurate Estimation of Global.
VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 FLUTE: Fast Lookup Table Based RSMT Algorithm.

VLSI Physical Design: From Graph Partitioning to Timing Closure Chapter 5: Global Routing © KLMH Lienig 1 FLUTE: Fast Lookup Table Based RSMT Algorithm.

Similar presentations

Ads by Google