A Genetic Approach to Standard Cell Placement Using Meta- Genetic Parameter Optimization Khusro Shahookar Pinaka Mazumder.

Slides:



Advertisements
Similar presentations
Exact and heuristics algorithms
Advertisements

Tetris and Genetic Algorithms Math Club 5/30/2011.
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
On the Genetic Evolution of a Perfect Tic-Tac-Toe Strategy
Valery Frolov.  The algorithm  Fitness function  Crossover  Mutation  Elite individuals  Reverse mutations  Some statistics  Run examples.
A GENETIC ALGORITHM APPROACH TO SPACE LAYOUT PLANNING OPTIMIZATION Hoda Homayouni.
Non-Linear Problems General approach. Non-linear Optimization Many objective functions, tend to be non-linear. Design problems for which the objective.
Study of a Paper about Genetic Algorithm For CS8995 Parallel Programming Yanhua Li.
COMP305. Part II. Genetic Algorithms. Genetic Algorithms.
Data Mining CS 341, Spring 2007 Genetic Algorithm.
Introduction to Genetic Algorithms Yonatan Shichel.
Learning Behavior using Genetic Algorithms and Fuzzy Logic GROUP #8 Maryam Mustafa Sarah Karim
Population New Population Selection Crossover and Mutation Insert When the new population is full repeat Generational Algorithm.
Research Trends in AI Maze Solving using GA Muhammad Younas Hassan Javaid Danish Hussain
Local Search and Stochastic Algorithms
11.1 Genetic Variation Within Population KEY CONCEPT A population shares a common gene pool.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
Genie: A Genetic Placement Algorithm James P. Cohoon William D. Paris © 1987 IEEE.
Christoph F. Eick: Applying EC to TSP(n) Example: Applying EC to the TSP Problem  Given: n cities including the cost of getting from on city to the other.
Genetic Programming.
Evolutionary algorithms
Genetic Algorithm.
Lecture 8: 24/5/1435 Genetic Algorithms Lecturer/ Kawther Abas 363CS – Artificial Intelligence.
Ch.12 Machine Learning Genetic Algorithm Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2011.
Zorica Stanimirović Faculty of Mathematics, University of Belgrade
Genetic Algorithms Michael J. Watts
HOW TO MAKE A TIMETABLE USING GENETIC ALGORITHMS Introduction with an example.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.
Solving Double Digest Problem by Genetic Algorithm
Evolution Programs (insert catchy subtitle here).
 Based on observed functioning of human brain.  (Artificial Neural Networks (ANN)  Our view of neural networks is very simplistic.  We view a neural.
ECE 103 Engineering Programming Chapter 52 Generic Algorithm Herbert G. Mayer, PSU CS Status 6/4/2014 Initial content copied verbatim from ECE 103 material.
N- Queens Solution with Genetic Algorithm By Mohammad A. Ismael.
1 Chapter 3 GAs: Why Do They Work?. 2 Schema Theorem SGA’s features: binary encoding proportional selection one-point crossover strong mutation Schema.
Genetic Algorithms. Underlying Concept  Charles Darwin outlined the principle of natural selection.  Natural Selection is the process by which evolution.
Agenda  INTRODUCTION  GENETIC ALGORITHMS  GENETIC ALGORITHMS FOR EXPLORING QUERY SPACE  SYSTEM ARCHITECTURE  THE EFFECT OF DIFFERENT MUTATION RATES.
Genetic Algorithms. Overview “A genetic algorithm (or GA) is a variant of stochastic beam search in which successor states are generated by combining.
Artificial Intelligence By Mr. Ejaz CIIT Sahiwal Evolutionary Computation.
Genetic Algorithm(GA)
Evolutionary Design of the Closed Loop Control on the Basis of NN-ANARX Model Using Genetic Algoritm.
Genetic Algorithm (Knapsack Problem)
Using GA’s to Solve Problems
Genetic Algorithms.
KEY CONCEPT A population shares a common gene pool.
A Study of Genetic Algorithms for Parameter Optimization
Example: Applying EC to the TSP Problem
Genetic Algorithm and Their Applications to Scheduling
Bin Packing Optimization
ECE 556 Project Algorithm Presentation
An evolutionary approach to solving complex problems

Genetic Algorithms CPSC 212 Spring 2004.
Evolution of populations
KEY CONCEPT A population shares a common gene pool.
Evolution of populations
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
Example: Applying EC to the TSP Problem
GENIE Eric Jackowski.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
Unit 9: Evolution 9.5 Genes and Variation.
Self-Configuring Crossover
Steady state Selection
A population shares a common gene pool.
KEY CONCEPT A population shares a common gene pool.
Presentation transcript:

A Genetic Approach to Standard Cell Placement Using Meta- Genetic Parameter Optimization Khusro Shahookar Pinaka Mazumder

Genetic Algorithms

Genetic Placement Population consists of an array of unordered triples – x-position, y-position, cell number Fitness = 1 / (total wire length) Cyclic crossover breeding scheme Mutation: – Cell Swapping – Inversion

Cyclic Crossover Each cell’s position in offspring matches position in one of the offspring’s parents – Naturally cyclic (see example) Randomly select starting parent and starting position – Give cells to offspring such that the above holds

Cyclic Crossover - Example

Mutation Cell Swapping – Swap two cells at random – Changes placement Inversion – Change the order of cells in the array – Does not change placement – Changes crossover behavior “Genes” combine in new ways

Meta-Genetic Parameter Opt. 1 Recall Genetic Algorithm Takes Parameters: – Rc – Rate of Crossover – Ri – Rate of Inversion – Rm – Rate of Mutation (cell swapping) Where do these parameters come from? – “Vanilla” genetic: The user – MGPO: Another genetic process

Meta-Genetic Parameter Opt. 2 A genetic algorithm inside a genetic algorithm MetaGenetic() keeps a population of triples: – Rc, Ri, Rm MetaGenetic() runs Genetic() once for each member of its population MG() genetically improves parameters

Demonstrations (time permitting) Genetic Placement genetic –i gen_10_1.txt –np 1 –ng 1 –npg 10 –ngg 5 –v 7 Meta-Genetic Optimization genetic –i gen_10_1.txt –np 3 –ng 5 –v 4 Large-Scale Interaction (MG+G) genetic –i gen_50_1.txt –v 4

Results versus Timberwolf GeneticTimberwolf 10-cell circuit cell circuit cell circuit cell circuit

Questions ?