A l a p a g o s : a generic distributed parallel genetic algorithm development platform Nicolas Kruchten 4 th year Engineering Science (Infrastructure.

Slides:



Advertisements
Similar presentations
Evolutionary Algorithms Nicolas Kruchten 4 th Year Engineering Science Infrastructure Option.
Advertisements

New Micro Genetic Algorithm for multi-user detection in WCDMA AZMI BIN AHMAD Borhanuddin Mohd Ali, Sabira Khatun, Azmi Hassan Dept of Computer and Communication.
1 An Adaptive GA for Multi Objective Flexible Manufacturing Systems A. Younes, H. Ghenniwa, S. Areibi uoguelph.ca.
Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Software Process Models
Genetic Algorithms By: Anna Scheuler and Aaron Smittle.
SBSE Course 3. EA applications to SE Analysis Design Implementation Testing Reference: Evolutionary Computing in Search-Based Software Engineering Leo.
Introduction to Evolutionary Computation. Questions to consider during this lesson:  - How is digital evolution similar to biological evolution? How.
Institute of Intelligent Power Electronics – IPE Page1 Introduction to Basics of Genetic Algorithms Docent Xiao-Zhi Gao Department of Electrical Engineering.
Parallelized Evolution System Onur Soysal, Erkin Bahçeci Erol Şahin Dept. of Computer Engineering Middle East Technical University.
The Adaptive Hierarchical Fair Competition (HFC) Model for EA’s Jianjun Hu, Erik D. Goodman Kisung Seo, Min Pei Genetic Algorithm Research &Applications.
Introduction to Genetic Algorithms Yonatan Shichel.
Effective gradient-free methods for inverse problems Jyri Leskinen FiDiPro DESIGN project.
Trivial Parallelization of an Existing EA Asher Freese CS401.
PGA – Parallel Genetic Algorithm Hsuan Lee. Reference  E Cantú-Paz, A Survey on Parallel Genetic Algorithm, Calculateurs Paralleles, Reseaux et Systems.
Crossover Operation with Different Parents Crossover Operation with Identical Parents.
Introduction to Computational Intelligence (Evolutionary Computation) Evolutionary Computation is the field of study devoted to the design, development,
Parallel Computing in SAS. Genetic Algorithms Application Alejandro Correa, Banco Colpatria Andrés González, Banco Colpatria Darwin Amézquita, Banco Colpatria.
Neural Optimization of Evolutionary Algorithm Strategy Parameters Hiral Patel.
Computer Science Genetic Algorithms CS 776: Evolutionary Computation Syllabus Objectives: –Learn about Evolutionary Computation.
Intro to AI Genetic Algorithm Ruth Bergman Fall 2004.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
A Load Balancing Framework for Adaptive and Asynchronous Applications Kevin Barker, Andrey Chernikov, Nikos Chrisochoides,Keshav Pingali ; IEEE TRANSACTIONS.
McGraw-Hill/Irwin ©2005 The McGraw-Hill Companies, All rights reserved ©2005 The McGraw-Hill Companies, All rights reserved McGraw-Hill/Irwin.
Khaled Rasheed Computer Science Dept. University of Georgia
Genetic Algorithms Overview Genetic Algorithms: a gentle introduction –What are GAs –How do they work/ Why? –Critical issues Use in Data Mining –GAs.
Genetic Algorithms: A Tutorial
Island Based GA for Optimization University of Guelph School of Engineering Hooman Homayounfar March 2003.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
Parallel Computing The Bad News –Hardware is not getting faster fast enough –Too many architectures –Existing architectures are too specific –Programs.
By Paul Cottrell, BSc, MBA, ABD. Author Complexity Science, Behavioral Finance, Dynamic Hedging, Financial Statistics, Chaos Theory Proprietary Trader.
Prepared by Barış GÖKÇE 1.  Search Methods  Evolutionary Algorithms (EA)  Characteristics of EAs  Genetic Programming (GP)  Evolutionary Programming.
Evolutionary algorithms
RUNNING PARALLEL APPLICATIONS BEYOND EP WORKLOADS IN DISTRIBUTED COMPUTING ENVIRONMENTS Zholudev Yury.
Parallel Algorithms Sorting and more. Keep hardware in mind When considering ‘parallel’ algorithms, – We have to have an understanding of the hardware.
Neural and Evolutionary Computing - Lecture 10 1 Parallel and Distributed Models in Evolutionary Computing  Motivation  Parallelization models  Distributed.
Introduction to Genetic Algorithms and Evolutionary Computation
Evolution Strategies Evolutionary Programming Genetic Programming Michael J. Watts
By: Andrew Moir. Table of Contents  Overview of Evolutionary Computation  Programming Strategies  Related Architecture  Efficiency Comparison  Implementations.
Automatic Test-Data Generation: An Immunological Approach Kostas Liaskos Marc Roper {Konstantinos.Liaskos, TAIC PART 2007.
Young Suk Moon Chair: Dr. Hans-Peter Bischof Reader: Dr. Gregor von Laszewski Observer: Dr. Minseok Kwon 1.
© ABB Inc. - USETI All Rights Reserved 10/17/2015 Insert image here An Economic Analysis Development Framework for Distributed Resources Aaron F. Snyder.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
EE459 I ntroduction to Artificial I ntelligence Genetic Algorithms Kasin Prakobwaitayakit Department of Electrical Engineering Chiangmai University.
CS 460/660 Compiler Construction. Class 01 2 Why Study Compilers? Compilers are important – –Responsible for many aspects of system performance Compilers.
ELeaRNT: Evolutionary Learning of Rich Neural Network Topologies Authors: Slobodan Miletic 3078/2010 Nikola Jovanovic 3077/2010
Chapter 4 Decision Support System & Artificial Intelligence.
George Goulas, Christos Gogos, Panayiotis Alefragis, Efthymios Housos Computer Systems Laboratory, Electrical & Computer Engineering Dept., University.
A Production Scheduling Problem Using Genetic Algorithm Presented by: Ken Johnson R. Knosala, T. Wal Silesian Technical University, Konarskiego Gliwice,
FATCOP: A Mixed Integer Program Solver Michael FerrisQun Chen Department of Computer Sciences University of Wisconsin-Madison Jeff Linderoth, Argonne.
A l a p a g o s : a generic distributed parallel genetic algorithm development platform Nicolas Kruchten 4 th year Engineering Science (Infrastructure.
Evolutionary Computation (P. Koumoutsakos) 1 What is Life  Key point : Ability to reproduce.  Are computer programs alive ? Are viruses a form of life.
Parallel Genetic Algorithms By Larry Hale and Trevor McCasland.
Coevolutionary Automated Software Correction Josh Wilkerson PhD Candidate in Computer Science Missouri S&T.
FACTS Placement Optimization For Multi-Line Contignecies Josh Wilkerson November 30, 2005.
Derek Weitzel Grid Computing. Background B.S. Computer Engineering from University of Nebraska – Lincoln (UNL) 3 years administering supercomputers at.
Next Generation of Apache Hadoop MapReduce Owen
Multi-cellular paradigm The molecular level can support self- replication (and self- repair). But we also need cells that can be designed to fit the specific.
Genetic Algorithms An Evolutionary Approach to Problem Solving.
 Negnevitsky, Pearson Education, Lecture 12 Hybrid intelligent systems: Evolutionary neural networks and fuzzy evolutionary systems n Introduction.
Evolutionary Computation Evolving Neural Network Topologies.
CEng 713, Evolutionary Computation, Lecture Notes parallel Evolutionary Computation.
Introduction to Parallel Computing: MPI, OpenMP and Hybrid Programming
Tutorial: Big Data Algorithms and Applications Under Hadoop
ECRG High-Performance Computing Seminar
Performance Evaluation of Adaptive MPI
Logistic Regression & Parallel SGD
Neural Networks Geoff Hulten.
Task-Based Design Optimization of Modular Robots
Coevolutionary Automated Software Correction
Presentation transcript:

a l a p a g o s : a generic distributed parallel genetic algorithm development platform Nicolas Kruchten 4 th year Engineering Science (Infrastructure Option)

Roadmap What is Galapagos? EAs, GAs & PGAs Distributed Computing Distributed GAs & PGAs Case study: dGAID a l a p a g o s

a software framework for building distributed parallel genetic algorithms defines and steps through a basic flowchart with ‘black-box’ steps provides basic black boxes (modules), templates for the creation of new modules a l a p a g o s What is Galapagos?

Genetic Algorithms Many ITS problems are or can be formulated as optimization problems Traditional methods often don’t suffice Genetic Algorithms are powerful but can require a lot of intuition or original coding a l a p a g o s

Evolutionary Algorithms EA = GA + EP + ES Evolutionary Programming GA minus the G (single parents) not same as ‘genetic programming’ Evolutionary Strategies very similar to GA with adaptive mutation a l a p a g o s

Let t = 0; Initialize P(t) Evaluate P’(t) Let t = t + 1; Assemble P(t) from P(t-1) and P’(t-1) Stop? no End yes Evaluate P(t) Generate P’(t) from P(t) a l a p a g o s

Parallel Genetic Algorithms ‘regular’ GA aka ‘panmictic’ GA PGAs have multiple interacting ‘demes’ or sub-populations (also: islands) Interaction occurs through ‘migration’ Can converge faster, to better optima a l a p a g o s

Parallel Genetic Algorithms Many different topologies are possible: a few large demes many small demes Other possibilities: synchronous vs asynchronous heterogeneous PGAs n-level PGAs a l a p a g o s

Migration Path5 GenomesDeme a l a p a g o s

Distributed Computing GAs and PGAs can be very slow We can use a faster computer Or we can use more than one computer Multi-processor machines Clusters Grid computing a l a p a g o s

Master Process Slave Process Slave Process Slave Process Slave Process Resource Pool Job Result Dispatcher a l a p a g o s : a distributed PGA platform

Distributed GAs & PGAs ‘Master/Worker’ architecture: GAs are ‘embarassingly parallel’ ‘Peered’ architecture: PGAs are uniquely suited to this sort of distribution ‘Hybrid’ architecture: Peered Masters with a Worker pool a l a p a g o s

Let t = 0; Initialize P(t) Generate P’(t) from P(t) Let t = t + 1; Assemble P(t) from P(t-1) and P’(t-1) Stop? no End yes Evaluate P(t) Evaluate P’(t) Evaluate P 1 (t) Evaluate P …. (t) Evaluate P n (t) Evaluate P 1 (t) Evaluate P …. (t) Evaluate P n (t) a l a p a g o s

Master Worker Master Master / WorkerPeered

Worker Master Hybrid: Peered Masters with Worker Pool a l a p a g o s

Galapagos and LightGrid LightGrid: lightweight grid engine Galapagos: generic EA/GA/PGA platform together: very flexible and powerful base onto which a variety of applications can be built! a l a p a g o s

LightGrid Galapagos Any Distributed Application Any GA Any PGA a l a p a g o s

ControllerDispatcher Container Evaluator a l a p a g o s

Galapagos is Generic built with the freedom of the developer in mind at all times: not representation-specific not problem-specific not GA-specific not platform-specific (written in Java) a l a p a g o s

Initializer Generator Assembler Migrator evaluation Convergence Epoch end yes no evaluation

Galapagos a generic distributed parallel genetic algorithm development platform a l a p a g o s

Case Study: dGAID Genetic Adaptive Incident Detection Developed here at U of T Calibrating an artificial neural network classifier using a GA 16-dimensional maximization, non-differentiable a l a p a g o s

Case Study: dGAID Tests run with 1-50 computers, 1 population of 50 solutions 1 computer: ~ 1 h 15 min 25 computers: ~ 3.2 min 50 computers: ~ 2.3 min a l a p a g o s

Conclusions Galapagos brings together GAs, PGAs and distributed computing into one package Its use in speeding up solution of ITS problems has been demonstrated Come back next week for a more technical look at how Galapagos works and how to use it

this presentation is available at: Questions? a l a p a g o s

a l a p a g o s : a generic distributed parallel genetic algorithm development platform Nicolas Kruchten 4 th year Engineering Science (Infrastructure Option)