Lecture 3 Evolutionary Algorithms (I) & Metaheuristics and Parallelism (II)
|
|
- Jesse Walsh
- 7 years ago
- Views:
Transcription
1 Bio-inspired Optimization Techniques in Parallel and Distributed Systems - Biologisch inspirierte Optimierungstechniken in parallelen und verteilten Systemen Lecture 3 Evolutionary Algorithms (I) & Metaheuristics and Parallelism (II)
2 Evolutionary Computation Inspiration Darwinism Transmutation of species Evolution Origin of species 1809 Altering of species Natural selection
3 Evolution through the Giraffe Example
4 Alteration of Species Species were (are) able to create new species never seen so far Reproduction (sexual reproduction) With another (or same specie) having different genetic material Pure alterations Sometimes, because of hazard, some modification in the genetic information (DNA) of a given specie is modified Giving rise to advantages Better capabilities than original genetic information
5 Natural Selection Mechanism by which evolution of species takes place In every environment, there are species which are better adapted than others In difficult situations, better adapted species have a higher probability to survive than others
6 Evolution Combines alteration of species and natural selection Some species will evolve altering its genetic material and become well adapted to the environment They will have higher chances of surviving than others At the end, new species better adapted to the environment will appear This cycle will continue forever
7 Evolutionary Computation How is possible to create an optimization technique based on these principles? What do we need? We need an environment We need something like genetic information (DNA) We need something to measure how well-adapted is a solution We need populations of individuals living in the environment We need a way of altering solutions Recombination Pure alteration We need a natural selection mechanism
8 Evolutionary Computation Environment? The target problem Genetic information or DNA? Problem representation Adaptation of solutions to the environment? Fitness function (for now, the function/problem value) Reproduction We should define a way to create new solutions given two (or more) parents Pure alteration Define a way of altering a solution
9 Evolutionary Computation Evolutionary algorithms are methods inspired by Alteration of species Natural selection They apply Recombination of solutions Alteration of solutions Selection Having all these ideas in mind, it is really easy to work out a generic skeleton for an evolutionary computation algorithm
10 Evolutionary Computation Pseudo-code of a generic evolutionary algorithm 1. P generateinitialpopulation(); // creation 2. evaluate(p); //assign fitness to all the solutions 3. while!(terminationcriteria()) do 4. P' recombine(p); 5. P'' mutate(p'); 6. evaluate(p''); 7. P select(p,p''); 8. end 9. return best solution found so far
11 Types of Evolutionary Computation Algorithms Genetic Algorithms Evolutionary Strategies Genetic Programming Evolutionary Programming Differential Evolution Some people also consider Ant Colony Optimization (ACO) Particle Swarm Optimizers (PSO) Scatter Search (SS)
12 Types of Evolutionary Computation Differences arise In their main use Representation Operators used
13 Types of Evolutionary Computation Genetic Programming Note (Genetic Programming!= Genetic Algorithm) Every solution is a computer program Tree representation Idea: Evolve complete programs trying to optimize different goals Speed up Robustness Features Example Design of distributed algorithms
14 Types of Evolutionary Computation Genetic Algorithm Most famous one Widely used in engineering and research Initially developed only for combinatorial programs Solutions representation could be whatever representation Initially was only for binary strings Disclaimer!!! A blind application of a genetic algorithm will probably result in poor and slow results
15 Types of Evolutionary Computation Evolutionary Programming The idea is similar to genetic programming Programs to be evolved Here the structure of the problem is fixed No tree representation Only some parameters in the representation have to be optimized
16 Types of Evolutionary Computation Evolutionary Strategies It only uses alteration No recombination of solutions Still a population based metaheuristic
17 Genetic Algorithms Originally were conceived only for binary string representation We are going to develop all the knowledge about genetic algorithms using binary string, however: Permutations Real variables Vectors of real variables are also possible!
18 Some Terminology Every solution to the problem is called individual A set of individual is called population We refer to a solution (individual) representation as genotype or chromosome We refer to the value of a solution (i.e., y, where y = f(x) and x our solution) as phenotype We refer to the measure of how well a solution is adapted as fitness The recombination operator is called crossover The alteration operator is called mutation
19 Crossover Operator Once we have a representation we need to define a way to combine (recombination) two solutions A, and B A B A and B are called parents in the crossover terminology
20 Crossover Operator Basic idea some parts of A represent good values for a given feature, function Some parts of B represent good values for another different feature or function A B
21 Crossover Operator Basic idea The combination of those parts could produce a good solution in these two (or more) different features New The new solution is called offspring
22 Different Types of Crossover Single Point Crossover: choose a cutting point in both parents. Create a new solution which contains the first half of one parent, and the second half of the other A B new
23 Different Types of Crossover Two Points Crossover: choose two cutting points. Use the first part of the first parent, the second of the second parent, and the third again from the first parent A B new
24 Different Types of Crossover Uniform Crossover: Combine, at random, parts of the first and second parent A B new
25 Mutation Operator Basic idea We have a solution A, which is good in some parts but... would it be possible to get a better solution (better adapted to the environment)? A
26 Mutation Operator Basic idea make a small modification in A with the aim of producing a better adapted solution A B
27 Bit Flip Mutation Idea: flip the value of a bit A A How many bits should be modified? Every bit is modified with a probability 1/L L is the string length In average only one bit is modified
28 Natural Selection Where does it takes place the natural selection in a Genetic Algorithm? 1. P generateinitialpopulation(); // creation 2. evaluate(p); //assign fitness to all the solutions 3. while!(terminationcriteria()) do 4. P' recombine(p); 5. P'' mutate(p'); 6. evaluate(p''); 7. P select(p,p''); 8. end 9. return best solution found so far
29 Natural Selection Where else? P' recombine(p); Selection also takes place through the selection of individuals to be recombined (i.e., selection of parent solutions) Which solutions are selected to be recombined? The best ones? The worse ones? Does it matter? Different selection mechanisms Roulette based Binary tournament K tournament
30 Genetic Algorithm Behavior Two key concepts Intensification: exploitation of already known good solutions Diversification: try solutions not visited so far High intensification means fast convergence towards the optimal solutions But it could mean a local optimum High diversification means lower possibility of hitting a local minimum But also low convergence speed towards the global minimum A trade-off between these two concepts is required However it highly depends on the problem
31 Sources of Intensification and Diversification on a GA Intensification Selection mechanism Crossover operator Diversification Mutation operator Intensification and diversification Population Size
32 Further Issues When does a GA stop? What happens when all the individuals in the population are identical? What happens if we never update the population with new individuals? What happens when we include an already-known good solution in the initial population? How can we accelerate the convergence speed of a GA?
33 When does a GA stop? After generating a maximum number of offspring After computing the desired solution The optimal This we do not know (only in our experiments) Meeting some criteria Does a GA stop at some moment by itself? When finding a global minimum When no new (better) solutions are produced
34 What happens when all the individuals are identical? The crossover operator has no effect The only chance of producing better solutions is by means of the mutation operator The mutation operator modifies every bit with a probability 1/N (N=length of the string) In average, after N movements (with an identical population) all the different possibilities have been produced The algorithm stops!
35 What happens if we do not update the population with new individuals? The crossover operator has no effect neither The mutation operator has no effect Natural selection Has only effect when selecting the parents Taking all these things into account It behaves like a Random Search But this effects also appears if we update the population in a naive way
36 What happens when including a good solution in the population? That solution will have a high probability of being selected as a parent in the crossover Its genetic information will be transferred with high probability Many offspring solutions will be produced using that solution as parent Convergence towards that solution Is that good or bad?
37 How can we accelerate a GA? Obviously, including a good solution in the initial population Applying a local search after crossover + mutation Not a complete local search but some steps at least Changing representation This means new crossover operators New mutation operators Parallelism!
38 You must know... It is very easy to develop a basic genetic algorithm It is very easy to apply it You do not need to be a genius to do it Xin Yao (Best quote ever I heard about this topic) however If you do not think carefully your representation, your crossover, and your mutation operators Do not expect your GA to perform as the best and fastest technique in the world
39 Parallel and distributed systems overview It is a matter of study in many subjects Plenty of books and scientific work about this topic What do we need to know? We need only some basic concepts about parallel architectures to see how they match the requirement of metaheuristic techniques
40 Parallel Computing Basic Idea Many computations/calculations are carried out simultaneously How do we do it? Parallel architectures Today s situation Different kind of parallel architectures Different capabilities and features Flynn's classification
41 Parallel Computing
42 Parallel Architectures Shared memory All the threads have access to the data Fast data accesses Scalability? Other classifications: Parallel Architectures 5-7 years ago only possible in expensive, complex, dedicated machines Today Easy to have 8 cores in our personal computers (cheap) In more complex and dedicated machines up to cores using a shared memory system Easy access for practically everyone Still room for researching in parallel metaheuristics in those systems Easily programmable with OpenMP or threads
43 Parallel Architectures Distributed memory Data is private to some processors Data exchange using message passing Highly scalable Other classifications: Parallel Architectures Advances in technology and communication networks make it possible and cheap Some example of this kind of systems are Clusters GRID Cloud Huge room for researching in those topics with parallel metaheuristics Example of programming languages for these systems are MPI, RMI, frameworks like ProActive (still alive?), Condor Master-Worker, or similar
44 Parallel Architectures GPU Not so many years ago, graphic processors were complex to program Few people interested in doing general purpose computations in GPU The appearance of systems like CUDA or OpenCL brought an easy way of doing it It can be classified under the category of SIMD (simple instruction multiple data) GPU consist of a bunch of multi-processors which allow to execute thousand of threads simultaneously Shared memory system but Other classifications: Parallel Architectures many schemes like Multi-GPU or Cluster of GPU have been used with success. CUDA 5.0 and OpenCL 3.0 may help pushing forward in that direction
45 Parallel Architectures and Metaheuristics Goal when designing a parallel metaheuristic Approach 1 Analyze the sequential behavior, identifying parts that can be parallelized or simply to figure out parallel extensions Identify which architecture suits better with the new parallel metaheuristic Approach 2 We have a parallel architecture Analyze how a given technique can be extended in order to take advance of our hardware
46 Measuring the Performance of Parallel Metaheuristics Once you have your parallel metaheuristic and the parallel architecture where it will be executed? How to measure the performance of our parallel implementation? Exact technique: time reduction when computing the optimal solution Approximation technique: time reduction when computing the near optimal solution? Near optimal solution can be different We can even find a better near optimal solution
47 Parallel Architectures and Metaheuristics Exact techniques Theoretical analysis Allow us to characterize the order to which an algorithm belong e.g., O(n), O(n 2 ), O(n Log(n)), Approximation techniques Lack of theoretical models Empirical analysis is performed To execute the parallel and sequential technique taking measurements about the execution time
48 Speed-up Basic definition: Ratio between the time on a single processor (t 1 ) and the time of the parallel version (t n ) Speed-up : t 1 / t n Stochastic methods (possible non-deterministic time) Speed-up : E[t 1 ] / E[t n ] where E[x] denotes the mean of x, and x a distribution of different values (example, the times of k different executions)
49 Speed-up Issues How to measure the time? Uni-processor system CPU time Typically exclude input/output data System overhead activities Multi-processor system Wall-clock time Communication should be taken into account (price to pay for parallelizing a given algorithm) Having in mind that t 1 and t n are measured we can find different taxonomies for speed-up measures Strong speed-up Weak speed-up with solution stop Speed-up with predefined effort Proposed by E. Alba et al.
50 Speed-up Taxonomy Strong speed-up To compare the parallel run time with the best-so-far sequential algorithm Weak speed-up To compare the parallel version of an algorithm with its own sequential version When to stop? When the searched solution (or a solution of a given quality is found) After a predetermined number of evaluations has been carried out
51 Speed-up Taxonomy Stop after a predefined computational effort Sequential algorithm find a solution a Parallel algorithm find a solution b Is it fair to compare then? NO Many authors discard this kind of speed-up since it is against the aim of the speed-up to compare algorithms yielding different results or accuracy
52 Super linear Speed-up Several authors have reported super lineal speed-up Its existence is still controversial How it is possible to get super-lineal speed-up? Implementation source The algorithm being run on one processor is inefficient somehow Numerical source The order in which the search is done is changed Physical source More CPUs, more cache, more memory. A metaheuristic technique may take advantage of these results
53 Computational Effort of Parallel Metaheuristics Two key factors: superior (better) solutions and speed of computation Speed of computation Number of evaluations Drawback: Evaluations can take different times Wall time Drawback: Many different implementations Best option seems to be to use the ratio evaluations / time to a solution
54 Parallel and Sequential Metaheuristics: Same principle, Different behavior The behavior of a parallel metaheuristic is many times different to its sequential counterpart Different ways of navigating the search space Every parallel instance could work in a reduced portion of the search space Introduces diversity etc., Parallelism is then a way not only to reduce time but also as a mean for obtaining possible better solutions That a sequential implementation could probably not reach
55 Parallel Trajectory-based Metaheuristics Three main models Parallel Multi-start Parallel moves Move acceleration
56 Classical Local Search Method Pseudo-code of a Local Search Method 1. s initialsolution(); // start with a complete solution 2. n(s) getneighborhood(s); 3. s' getbetterthan(n(s),s) 4. while (s'!= null) 5. s s' 6. n(s) getneighborhood(s) 7. s' getbetterthan(n(s),s); 8. end
57 Parallel multi-start model Simultaneously launching several local searches for computing better and robust solutions Heterogeneous or homogeneous The different searches can collaborate between then or not Search can start from the same initial solution Using different neighborhood for example Using different parameters
58 Parallel moves model Similar to a master-slave model Every solution in the neighborhood is evaluated in a different machine Does not change the behavior of the algorithm The sequential counterpart will reach the same results using a higher computational time
59 Move acceleration model The quality of every movement is evaluated in parallel The evaluation function can be parallelized The whole evaluation of the function can be seen as an aggregation of different small sub-evaluations Do not get it wrong In parallel moves, the whole evaluation of different solutions of the neighborhood are made in parallel. In this model, only the evaluation of one solution is
60 Parallel Variable Neighborhood Search Basic Idea of the technique: Successively explore a set of predefined neighborhood to provide a better solution How can we parallelized the VNS? Multi-start model Parallelizing the local search phase Using a parallel multi-start mode Parallel cooperative multi-start model
61 Parallel Variable Neighborhood Search: Examples Parallel multi-start methods Parallel evaluations of solutions Parallel neighborhood exploration Hierarchical solution
62 Parallel evaluation of solutions
63 Parallel Neighborhood Exploration
64 Parallel Hierarchical Neighborhood Exploration
Introduction to Cloud Computing
Introduction to Cloud Computing Parallel Processing I 15 319, spring 2010 7 th Lecture, Feb 2 nd Majd F. Sakr Lecture Motivation Concurrency and why? Different flavors of parallel computing Get the basic
More information14.10.2014. Overview. Swarms in nature. Fish, birds, ants, termites, Introduction to swarm intelligence principles Particle Swarm Optimization (PSO)
Overview Kyrre Glette kyrrehg@ifi INF3490 Swarm Intelligence Particle Swarm Optimization Introduction to swarm intelligence principles Particle Swarm Optimization (PSO) 3 Swarms in nature Fish, birds,
More informationIntroduction To Genetic Algorithms
1 Introduction To Genetic Algorithms Dr. Rajib Kumar Bhattacharjya Department of Civil Engineering IIT Guwahati Email: rkbc@iitg.ernet.in References 2 D. E. Goldberg, Genetic Algorithm In Search, Optimization
More informationEvolutionary Algorithms Software
Evolutionary Algorithms Software Prof. Dr. Rudolf Kruse Pascal Held {kruse,pheld}@iws.cs.uni-magdeburg.de Otto-von-Guericke-Universität Magdeburg Fakultät für Informatik Institut für Wissens- und Sprachverarbeitung
More informationA Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN)
ISSN: 2278 1323 All Rights Reserved 2014 IJARCET 3910 A Genetic Algorithm Processor Based on Redundant Binary Numbers (GAPBRBN) Miss: KIRTI JOSHI Abstract A Genetic Algorithm (GA) is an intelligent search
More informationCLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM
CLOUD DATABASE ROUTE SCHEDULING USING COMBANATION OF PARTICLE SWARM OPTIMIZATION AND GENETIC ALGORITHM *Shabnam Ghasemi 1 and Mohammad Kalantari 2 1 Deparment of Computer Engineering, Islamic Azad University,
More informationMemory Allocation Technique for Segregated Free List Based on Genetic Algorithm
Journal of Al-Nahrain University Vol.15 (2), June, 2012, pp.161-168 Science Memory Allocation Technique for Segregated Free List Based on Genetic Algorithm Manal F. Younis Computer Department, College
More informationISSN: 2319-5967 ISO 9001:2008 Certified International Journal of Engineering Science and Innovative Technology (IJESIT) Volume 2, Issue 3, May 2013
Transistor Level Fault Finding in VLSI Circuits using Genetic Algorithm Lalit A. Patel, Sarman K. Hadia CSPIT, CHARUSAT, Changa., CSPIT, CHARUSAT, Changa Abstract This paper presents, genetic based algorithm
More informationLab 4: 26 th March 2012. Exercise 1: Evolutionary algorithms
Lab 4: 26 th March 2012 Exercise 1: Evolutionary algorithms 1. Found a problem where EAs would certainly perform very poorly compared to alternative approaches. Explain why. Suppose that we want to find
More informationHow Can Metaheuristics Help Software Engineers
and Software How Can Help Software Engineers Enrique Alba eat@lcc.uma.es http://www.lcc.uma.es/~eat Universidad de Málaga, ESPAÑA Enrique Alba How Can Help Software Engineers of 8 and Software What s a
More informationD A T A M I N I N G C L A S S I F I C A T I O N
D A T A M I N I N G C L A S S I F I C A T I O N FABRICIO VOZNIKA LEO NARDO VIA NA INTRODUCTION Nowadays there is huge amount of data being collected and stored in databases everywhere across the globe.
More informationA Binary Model on the Basis of Imperialist Competitive Algorithm in Order to Solve the Problem of Knapsack 1-0
212 International Conference on System Engineering and Modeling (ICSEM 212) IPCSIT vol. 34 (212) (212) IACSIT Press, Singapore A Binary Model on the Basis of Imperialist Competitive Algorithm in Order
More informationGenetic Algorithm. Based on Darwinian Paradigm. Intrinsically a robust search and optimization mechanism. Conceptual Algorithm
24 Genetic Algorithm Based on Darwinian Paradigm Reproduction Competition Survive Selection Intrinsically a robust search and optimization mechanism Slide -47 - Conceptual Algorithm Slide -48 - 25 Genetic
More informationEvolutionary SAT Solver (ESS)
Ninth LACCEI Latin American and Caribbean Conference (LACCEI 2011), Engineering for a Smart Planet, Innovation, Information Technology and Computational Tools for Sustainable Development, August 3-5, 2011,
More informationA Robust Method for Solving Transcendental Equations
www.ijcsi.org 413 A Robust Method for Solving Transcendental Equations Md. Golam Moazzam, Amita Chakraborty and Md. Al-Amin Bhuiyan Department of Computer Science and Engineering, Jahangirnagar University,
More informationEvolutionary Detection of Rules for Text Categorization. Application to Spam Filtering
Advances in Intelligent Systems and Technologies Proceedings ECIT2004 - Third European Conference on Intelligent Systems and Technologies Iasi, Romania, July 21-23, 2004 Evolutionary Detection of Rules
More informationStudy of Various Load Balancing Techniques in Cloud Environment- A Review
International Journal of Computer Sciences and Engineering Open Access Review Paper Volume-4, Issue-04 E-ISSN: 2347-2693 Study of Various Load Balancing Techniques in Cloud Environment- A Review Rajdeep
More informationNumerical Research on Distributed Genetic Algorithm with Redundant
Numerical Research on Distributed Genetic Algorithm with Redundant Binary Number 1 Sayori Seto, 2 Akinori Kanasugi 1,2 Graduate School of Engineering, Tokyo Denki University, Japan 10kme41@ms.dendai.ac.jp,
More informationNew Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem
New Modifications of Selection Operator in Genetic Algorithms for the Traveling Salesman Problem Radovic, Marija; and Milutinovic, Veljko Abstract One of the algorithms used for solving Traveling Salesman
More informationIntroduction to GPU Programming Languages
CSC 391/691: GPU Programming Fall 2011 Introduction to GPU Programming Languages Copyright 2011 Samuel S. Cho http://www.umiacs.umd.edu/ research/gpu/facilities.html Maryland CPU/GPU Cluster Infrastructure
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 MOTIVATION OF RESEARCH Multicore processors have two or more execution cores (processors) implemented on a single chip having their own set of execution and architectural recourses.
More informationIn-Memory Databases Algorithms and Data Structures on Modern Hardware. Martin Faust David Schwalb Jens Krüger Jürgen Müller
In-Memory Databases Algorithms and Data Structures on Modern Hardware Martin Faust David Schwalb Jens Krüger Jürgen Müller The Free Lunch Is Over 2 Number of transistors per CPU increases Clock frequency
More informationResearch on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province
Research on a Heuristic GA-Based Decision Support System for Rice in Heilongjiang Province Ran Cao 1,1, Yushu Yang 1, Wei Guo 1, 1 Engineering college of Northeast Agricultural University, Haerbin, China
More informationPractical Applications of Evolutionary Computation to Financial Engineering
Hitoshi Iba and Claus C. Aranha Practical Applications of Evolutionary Computation to Financial Engineering Robust Techniques for Forecasting, Trading and Hedging 4Q Springer Contents 1 Introduction to
More informationAlpha Cut based Novel Selection for Genetic Algorithm
Alpha Cut based Novel for Genetic Algorithm Rakesh Kumar Professor Girdhar Gopal Research Scholar Rajesh Kumar Assistant Professor ABSTRACT Genetic algorithm (GA) has several genetic operators that can
More informationOverview on Modern Accelerators and Programming Paradigms Ivan Giro7o igiro7o@ictp.it
Overview on Modern Accelerators and Programming Paradigms Ivan Giro7o igiro7o@ictp.it Informa(on & Communica(on Technology Sec(on (ICTS) Interna(onal Centre for Theore(cal Physics (ICTP) Mul(ple Socket
More informationModel-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms
Symposium on Automotive/Avionics Avionics Systems Engineering (SAASE) 2009, UC San Diego Model-based Parameter Optimization of an Engine Control Unit using Genetic Algorithms Dipl.-Inform. Malte Lochau
More informationA Simultaneous Solution for General Linear Equations on a Ring or Hierarchical Cluster
Acta Technica Jaurinensis Vol. 3. No. 1. 010 A Simultaneous Solution for General Linear Equations on a Ring or Hierarchical Cluster G. Molnárka, N. Varjasi Széchenyi István University Győr, Hungary, H-906
More informationA Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms
A Multi-Objective Performance Evaluation in Grid Task Scheduling using Evolutionary Algorithms MIGUEL CAMELO, YEZID DONOSO, HAROLD CASTRO Systems and Computer Engineering Department Universidad de los
More informationCHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT
77 CHAPTER 6 GENETIC ALGORITHM OPTIMIZED FUZZY CONTROLLED MOBILE ROBOT 6.1 INTRODUCTION The idea of evolutionary computing was introduced by (Ingo Rechenberg 1971) in his work Evolutionary strategies.
More informationWeb Service Selection using Particle Swarm Optimization and Genetic Algorithms
Web Service Selection using Particle Swarm Optimization and Genetic Algorithms Simone A. Ludwig Department of Computer Science North Dakota State University Fargo, ND, USA simone.ludwig@ndsu.edu Thomas
More informationA Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number
A Parallel Processor for Distributed Genetic Algorithm with Redundant Binary Number 1 Tomohiro KAMIMURA, 2 Akinori KANASUGI 1 Department of Electronics, Tokyo Denki University, 07ee055@ms.dendai.ac.jp
More informationPart I Courses Syllabus
Part I Courses Syllabus This document provides detailed information about the basic courses of the MHPC first part activities. The list of courses is the following 1.1 Scientific Programming Environment
More informationGenetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve
Genetic Algorithms commonly used selection, replacement, and variation operators Fernando Lobo University of Algarve Outline Selection methods Replacement methods Variation operators Selection Methods
More informationHigh Performance Computing. Course Notes 2007-2008. HPC Fundamentals
High Performance Computing Course Notes 2007-2008 2008 HPC Fundamentals Introduction What is High Performance Computing (HPC)? Difficult to define - it s a moving target. Later 1980s, a supercomputer performs
More informationProjects - Neural and Evolutionary Computing
Projects - Neural and Evolutionary Computing 2014-2015 I. Application oriented topics 1. Task scheduling in distributed systems. The aim is to assign a set of (independent or correlated) tasks to some
More informationIntroduction to GPU hardware and to CUDA
Introduction to GPU hardware and to CUDA Philip Blakely Laboratory for Scientific Computing, University of Cambridge Philip Blakely (LSC) GPU introduction 1 / 37 Course outline Introduction to GPU hardware
More informationGPUs for Scientific Computing
GPUs for Scientific Computing p. 1/16 GPUs for Scientific Computing Mike Giles mike.giles@maths.ox.ac.uk Oxford-Man Institute of Quantitative Finance Oxford University Mathematical Institute Oxford e-research
More informationA hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation
A hybrid Approach of Genetic Algorithm and Particle Swarm Technique to Software Test Case Generation Abhishek Singh Department of Information Technology Amity School of Engineering and Technology Amity
More informationProgramming models for heterogeneous computing. Manuel Ujaldón Nvidia CUDA Fellow and A/Prof. Computer Architecture Department University of Malaga
Programming models for heterogeneous computing Manuel Ujaldón Nvidia CUDA Fellow and A/Prof. Computer Architecture Department University of Malaga Talk outline [30 slides] 1. Introduction [5 slides] 2.
More informationSolving the Vehicle Routing Problem with Genetic Algorithms
Solving the Vehicle Routing Problem with Genetic Algorithms Áslaug Sóley Bjarnadóttir April 2004 Informatics and Mathematical Modelling, IMM Technical University of Denmark, DTU Printed by IMM, DTU 3 Preface
More informationChapter 6. The stacking ensemble approach
82 This chapter proposes the stacking ensemble approach for combining different data mining classifiers to get better performance. Other combination techniques like voting, bagging etc are also described
More information. 1/ CHAPTER- 4 SIMULATION RESULTS & DISCUSSION CHAPTER 4 SIMULATION RESULTS & DISCUSSION 4.1: ANT COLONY OPTIMIZATION BASED ON ESTIMATION OF DISTRIBUTION ACS possesses
More informationThe Lattice Project: A Multi-Model Grid Computing System. Center for Bioinformatics and Computational Biology University of Maryland
The Lattice Project: A Multi-Model Grid Computing System Center for Bioinformatics and Computational Biology University of Maryland Parallel Computing PARALLEL COMPUTING a form of computation in which
More informationChapter 1 Computer System Overview
Operating Systems: Internals and Design Principles Chapter 1 Computer System Overview Eighth Edition By William Stallings Operating System Exploits the hardware resources of one or more processors Provides
More informationGPU Computing with CUDA Lecture 2 - CUDA Memories. Christopher Cooper Boston University August, 2011 UTFSM, Valparaíso, Chile
GPU Computing with CUDA Lecture 2 - CUDA Memories Christopher Cooper Boston University August, 2011 UTFSM, Valparaíso, Chile 1 Outline of lecture Recap of Lecture 1 Warp scheduling CUDA Memory hierarchy
More informationModified Version of Roulette Selection for Evolution Algorithms - the Fan Selection
Modified Version of Roulette Selection for Evolution Algorithms - the Fan Selection Adam S lowik, Micha l Bia lko Department of Electronic, Technical University of Koszalin, ul. Śniadeckich 2, 75-453 Koszalin,
More informationInternational Journal of Advanced Research in Electrical, Electronics and Instrumentation Engineering
DOI: 10.15662/ijareeie.2014.0307061 Economic Dispatch of Power System Optimization with Power Generation Schedule Using Evolutionary Technique Girish Kumar 1, Rameshwar singh 2 PG Student [Control system],
More informationIntelligent Heuristic Construction with Active Learning
Intelligent Heuristic Construction with Active Learning William F. Ogilvie, Pavlos Petoumenos, Zheng Wang, Hugh Leather E H U N I V E R S I T Y T O H F G R E D I N B U Space is BIG! Hubble Ultra-Deep Field
More informationBinary search tree with SIMD bandwidth optimization using SSE
Binary search tree with SIMD bandwidth optimization using SSE Bowen Zhang, Xinwei Li 1.ABSTRACT In-memory tree structured index search is a fundamental database operation. Modern processors provide tremendous
More informationA Service Revenue-oriented Task Scheduling Model of Cloud Computing
Journal of Information & Computational Science 10:10 (2013) 3153 3161 July 1, 2013 Available at http://www.joics.com A Service Revenue-oriented Task Scheduling Model of Cloud Computing Jianguang Deng a,b,,
More informationA GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS
A GENETIC ALGORITHM FOR RESOURCE LEVELING OF CONSTRUCTION PROJECTS Mahdi Abbasi Iranagh 1 and Rifat Sonmez 2 Dept. of Civil Engrg, Middle East Technical University, Ankara, 06800, Turkey Critical path
More informationIntro to GPU computing. Spring 2015 Mark Silberstein, 048661, Technion 1
Intro to GPU computing Spring 2015 Mark Silberstein, 048661, Technion 1 Serial vs. parallel program One instruction at a time Multiple instructions in parallel Spring 2015 Mark Silberstein, 048661, Technion
More informationInternational Journal of Software and Web Sciences (IJSWS) www.iasir.net
International Association of Scientific Innovation and Research (IASIR) (An Association Unifying the Sciences, Engineering, and Applied Research) ISSN (Print): 2279-0063 ISSN (Online): 2279-0071 International
More informationOriginal Article Efficient Genetic Algorithm on Linear Programming Problem for Fittest Chromosomes
International Archive of Applied Sciences and Technology Volume 3 [2] June 2012: 47-57 ISSN: 0976-4828 Society of Education, India Website: www.soeagra.com/iaast/iaast.htm Original Article Efficient Genetic
More informationExtended Finite-State Machine Inference with Parallel Ant Colony Based Algorithms
Extended Finite-State Machine Inference with Parallel Ant Colony Based Algorithms Daniil Chivilikhin PhD student ITMO University Vladimir Ulyantsev PhD student ITMO University Anatoly Shalyto Dr.Sci.,
More informationCollege of information technology Department of software
University of Babylon Undergraduate: third class College of information technology Department of software Subj.: Application of AI lecture notes/2011-2012 ***************************************************************************
More informationHybrid Evolution of Heterogeneous Neural Networks
Hybrid Evolution of Heterogeneous Neural Networks 01001110 01100101 01110101 01110010 01101111 01101110 01101111 01110110 01100001 00100000 01110011 01101011 01110101 01110000 01101001 01101110 01100001
More informationAPPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION
APPLICATION OF ADVANCED SEARCH- METHODS FOR AUTOMOTIVE DATA-BUS SYSTEM SIGNAL INTEGRITY OPTIMIZATION Harald Günther 1, Stephan Frei 1, Thomas Wenzel, Wolfgang Mickisch 1 Technische Universität Dortmund,
More informationContents. Dedication List of Figures List of Tables. Acknowledgments
Contents Dedication List of Figures List of Tables Foreword Preface Acknowledgments v xiii xvii xix xxi xxv Part I Concepts and Techniques 1. INTRODUCTION 3 1 The Quest for Knowledge 3 2 Problem Description
More informationHPC with Multicore and GPUs
HPC with Multicore and GPUs Stan Tomov Electrical Engineering and Computer Science Department University of Tennessee, Knoxville CS 594 Lecture Notes March 4, 2015 1/18 Outline! Introduction - Hardware
More informationScalability and Classifications
Scalability and Classifications 1 Types of Parallel Computers MIMD and SIMD classifications shared and distributed memory multicomputers distributed shared memory computers 2 Network Topologies static
More informationGenetic Algorithms and Sudoku
Genetic Algorithms and Sudoku Dr. John M. Weiss Department of Mathematics and Computer Science South Dakota School of Mines and Technology (SDSM&T) Rapid City, SD 57701-3995 john.weiss@sdsmt.edu MICS 2009
More informationCellular Automaton: The Roulette Wheel and the Landscape Effect
Cellular Automaton: The Roulette Wheel and the Landscape Effect Ioan Hălălae Faculty of Engineering, Eftimie Murgu University, Traian Vuia Square 1-4, 385 Reşiţa, Romania Phone: +40 255 210227, Fax: +40
More informationAdvanced Core Operating System (ACOS): Experience the Performance
WHITE PAPER Advanced Core Operating System (ACOS): Experience the Performance Table of Contents Trends Affecting Application Networking...3 The Era of Multicore...3 Multicore System Design Challenges...3
More informationFinding Liveness Errors with ACO
Hong Kong, June 1-6, 2008 1 / 24 Finding Liveness Errors with ACO Francisco Chicano and Enrique Alba Motivation Motivation Nowadays software is very complex An error in a software system can imply the
More informationRodrigo Fernandes de Mello, Evgueni Dodonov, José Augusto Andrade Filho
Middleware for High Performance Computing Rodrigo Fernandes de Mello, Evgueni Dodonov, José Augusto Andrade Filho University of São Paulo São Carlos, Brazil {mello, eugeni, augustoa}@icmc.usp.br Outline
More informationCOMPUTATIONIMPROVEMENTOFSTOCKMARKETDECISIONMAKING MODELTHROUGHTHEAPPLICATIONOFGRID. Jovita Nenortaitė
ISSN 1392 124X INFORMATION TECHNOLOGY AND CONTROL, 2005, Vol.34, No.3 COMPUTATIONIMPROVEMENTOFSTOCKMARKETDECISIONMAKING MODELTHROUGHTHEAPPLICATIONOFGRID Jovita Nenortaitė InformaticsDepartment,VilniusUniversityKaunasFacultyofHumanities
More informationEvaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware
Evaluation of Different Task Scheduling Policies in Multi-Core Systems with Reconfigurable Hardware Mahyar Shahsavari, Zaid Al-Ars, Koen Bertels,1, Computer Engineering Group, Software & Computer Technology
More informationOptimal Tuning of PID Controller Using Meta Heuristic Approach
International Journal of Electronic and Electrical Engineering. ISSN 0974-2174, Volume 7, Number 2 (2014), pp. 171-176 International Research Publication House http://www.irphouse.com Optimal Tuning of
More informationEvolutionary Prefetching and Caching in an Independent Storage Units Model
Evolutionary Prefetching and Caching in an Independent Units Model Athena Vakali Department of Informatics Aristotle University of Thessaloniki, Greece E-mail: avakali@csdauthgr Abstract Modern applications
More informationAn evolutionary learning spam filter system
An evolutionary learning spam filter system Catalin Stoean 1, Ruxandra Gorunescu 2, Mike Preuss 3, D. Dumitrescu 4 1 University of Craiova, Romania, catalin.stoean@inf.ucv.ro 2 University of Craiova, Romania,
More informationGPU-BASED TUNING OF QUANTUM-INSPIRED GENETIC ALGORITHM FOR A COMBINATORIAL OPTIMIZATION PROBLEM
GPU-BASED TUNING OF QUANTUM-INSPIRED GENETIC ALGORITHM FOR A COMBINATORIAL OPTIMIZATION PROBLEM Robert Nowotniak, Jacek Kucharski Computer Engineering Department The Faculty of Electrical, Electronic,
More informationArchitecture bits. (Chromosome) (Evolved chromosome) Downloading. Downloading PLD. GA operation Architecture bits
A Pattern Recognition System Using Evolvable Hardware Masaya Iwata 1 Isamu Kajitani 2 Hitoshi Yamada 2 Hitoshi Iba 1 Tetsuya Higuchi 1 1 1-1-4,Umezono,Tsukuba,Ibaraki,305,Japan Electrotechnical Laboratory
More informationGPU File System Encryption Kartik Kulkarni and Eugene Linkov
GPU File System Encryption Kartik Kulkarni and Eugene Linkov 5/10/2012 SUMMARY. We implemented a file system that encrypts and decrypts files. The implementation uses the AES algorithm computed through
More informationDriving force. What future software needs. Potential research topics
Improving Software Robustness and Efficiency Driving force Processor core clock speed reach practical limit ~4GHz (power issue) Percentage of sustainable # of active transistors decrease; Increase in #
More informationLOAD BALANCING IN CLOUD COMPUTING
LOAD BALANCING IN CLOUD COMPUTING Neethu M.S 1 PG Student, Dept. of Computer Science and Engineering, LBSITW (India) ABSTRACT Cloud computing is emerging as a new paradigm for manipulating, configuring,
More informationKeywords revenue management, yield management, genetic algorithm, airline reservation
Volume 4, Issue 1, January 2014 ISSN: 2277 128X International Journal of Advanced Research in Computer Science and Software Engineering Research Paper Available online at: www.ijarcsse.com A Revenue Management
More informationParallel Programming Map-Reduce. Needless to Say, We Need Machine Learning for Big Data
Case Study 2: Document Retrieval Parallel Programming Map-Reduce Machine Learning/Statistics for Big Data CSE599C1/STAT592, University of Washington Carlos Guestrin January 31 st, 2013 Carlos Guestrin
More informationPractice Questions 1: Evolution
Practice Questions 1: Evolution 1. Which concept is best illustrated in the flowchart below? A. natural selection B. genetic manipulation C. dynamic equilibrium D. material cycles 2. The diagram below
More informationGenetic Algorithm Performance with Different Selection Strategies in Solving TSP
Proceedings of the World Congress on Engineering Vol II WCE, July 6-8,, London, U.K. Genetic Algorithm Performance with Different Selection Strategies in Solving TSP Noraini Mohd Razali, John Geraghty
More informationWrite a technical report Present your results Write a workshop/conference paper (optional) Could be a real system, simulation and/or theoretical
Identify a problem Review approaches to the problem Propose a novel approach to the problem Define, design, prototype an implementation to evaluate your approach Could be a real system, simulation and/or
More informationSoftware Engineering and Service Design: courses in ITMO University
Software Engineering and Service Design: courses in ITMO University Igor Buzhinsky igor.buzhinsky@gmail.com Computer Technologies Department Department of Computer Science and Information Systems December
More informationComparison of Major Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments
Comparison of Maor Domination Schemes for Diploid Binary Genetic Algorithms in Dynamic Environments A. Sima UYAR and A. Emre HARMANCI Istanbul Technical University Computer Engineering Department Maslak
More informationOptimizing Machine Allocation in Semiconductor Manufacturing Capacity Planning using. Bio-Inspired Approaches
Optimizing Machine Allocation in Semiconductor Manufacturing Capacity Planning using Umi Kalsom Yusof School of Computer Sciences Universiti Sains Malaysia 11800 USM, Penang, Malaysia umiyusof@cs.usm.my
More informationAn Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system
An Efficient load balancing using Genetic algorithm in Hierarchical structured distributed system Priyanka Gonnade 1, Sonali Bodkhe 2 Mtech Student Dept. of CSE, Priyadarshini Instiute of Engineering and
More informationRevoScaleR Speed and Scalability
EXECUTIVE WHITE PAPER RevoScaleR Speed and Scalability By Lee Edlefsen Ph.D., Chief Scientist, Revolution Analytics Abstract RevoScaleR, the Big Data predictive analytics library included with Revolution
More informationSwinburne Research Bank http://researchbank.swinburne.edu.au
Swinburne Research Bank http://researchbank.swinburne.edu.au Wu, Z., Liu, X., Ni, Z., Yuan, D., & Yang, Y. (2013). A market-oriented hierarchical scheduling strategy in cloud workflow systems. Originally
More informationAn Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment
IJCSC VOLUME 5 NUMBER 2 JULY-SEPT 2014 PP. 110-115 ISSN-0973-7391 An Efficient Approach for Task Scheduling Based on Multi-Objective Genetic Algorithm in Cloud Computing Environment 1 Sourabh Budhiraja,
More informationLecture 3: Modern GPUs A Hardware Perspective Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com
CSCI-GA.3033-012 Graphics Processing Units (GPUs): Architecture and Programming Lecture 3: Modern GPUs A Hardware Perspective Mohamed Zahran (aka Z) mzahran@cs.nyu.edu http://www.mzahran.com Modern GPU
More informationENHANCED CONFIDENCE INTERPRETATIONS OF GP BASED ENSEMBLE MODELING RESULTS
ENHANCED CONFIDENCE INTERPRETATIONS OF GP BASED ENSEMBLE MODELING RESULTS Michael Affenzeller (a), Stephan M. Winkler (b), Stefan Forstenlechner (c), Gabriel Kronberger (d), Michael Kommenda (e), Stefan
More informationIntroduction to GP-GPUs. Advanced Computer Architectures, Cristina Silvano, Politecnico di Milano 1
Introduction to GP-GPUs Advanced Computer Architectures, Cristina Silvano, Politecnico di Milano 1 GPU Architectures: How do we reach here? NVIDIA Fermi, 512 Processing Elements (PEs) 2 What Can It Do?
More informationParallel Firewalls on General-Purpose Graphics Processing Units
Parallel Firewalls on General-Purpose Graphics Processing Units Manoj Singh Gaur and Vijay Laxmi Kamal Chandra Reddy, Ankit Tharwani, Ch.Vamshi Krishna, Lakshminarayanan.V Department of Computer Engineering
More informationA Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
Journal of Information & Computational Science 9: 16 (2012) 4801 4809 Available at http://www.joics.com A Method of Cloud Resource Load Balancing Scheduling Based on Improved Adaptive Genetic Algorithm
More informationParallelism and Cloud Computing
Parallelism and Cloud Computing Kai Shen Parallel Computing Parallel computing: Process sub tasks simultaneously so that work can be completed faster. For instances: divide the work of matrix multiplication
More informationIEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 13, NO. 2, APRIL 2009 243
IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION, VOL. 13, NO. 2, APRIL 2009 243 Self-Adaptive Multimethod Search for Global Optimization in Real-Parameter Spaces Jasper A. Vrugt, Bruce A. Robinson, and James
More informationSpring 2011 Prof. Hyesoon Kim
Spring 2011 Prof. Hyesoon Kim Today, we will study typical patterns of parallel programming This is just one of the ways. Materials are based on a book by Timothy. Decompose Into tasks Original Problem
More informationAn Introduction to Parallel Computing/ Programming
An Introduction to Parallel Computing/ Programming Vicky Papadopoulou Lesta Astrophysics and High Performance Computing Research Group (http://ahpc.euc.ac.cy) Dep. of Computer Science and Engineering European
More informationSimple Population Replacement Strategies for a Steady-State Multi-Objective Evolutionary Algorithm
Simple Population Replacement Strategies for a Steady-State Multi-Objective Evolutionary Christine L. Mumford School of Computer Science, Cardiff University PO Box 916, Cardiff CF24 3XF, United Kingdom
More informationACO Based Dynamic Resource Scheduling for Improving Cloud Performance
ACO Based Dynamic Resource Scheduling for Improving Cloud Performance Priyanka Mod 1, Prof. Mayank Bhatt 2 Computer Science Engineering Rishiraj Institute of Technology 1 Computer Science Engineering Rishiraj
More information