Presentation is loading. Please wait.

Presentation is loading. Please wait.

Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA

Published byMerethe Helland Modified over 5 years ago

Similar presentations

Presentation on theme: "Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA"— Presentation transcript:

1 A New Model of Parallel Distributed Genetic Algorithms for Cluster Systems: Dual Individual DGAs
Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA Doshisha University Kyoto, Japan

2 Aim of this study Optimization methods Genetic Algorithms
Finding the best routings of the network Designing structures Constructing systems New model of DGAs Genetic Algorithms Dual Individual DGAs (DGAs) Island model (DGAs) Master Slave Cellular Easy to divide into tasks in several ways High searching ability

3 Dual Individual DGAs (DuDGAs)
There are two individuals in each island High searching ability The high validity of the solutions because there are numbers of islands. Easiness to set up Crossover rate=1.0 Mutation rate= 0.5

4 Parallerization of DuDGAs
Selection Crossover Island Mutation Evaluation In DuDGA, an island is moved by migraion.

5 Test functions and used parameters
DuDGA and DGAs (4, 8, 12, 24 islands) are applied to each test function. F1=200bit Rastrigin F2=50bit Rosenbrock F3=100bit Griewank F4=100bit Ridge Number of islands 120 4,8,12,24 Population size 240 Migration rate 0.5 0.3 Migration interval 5 Crossover rate 1.0 Mutation rate 1/L Terminal condition After 5000 generation

6 Test Functions Rastrigin Griewank Ridge Rosenbrok

7 Cluster system for calculation
Spec. of Cluster (16 nodes) Processor PentiumⅡ(Deschutes) Clock MHz # Processors 1 × 16 Main memory 128Mbytes × 16 Network Fast Ethernet (100Mbps) Communication TCP/IP, MPICH 1.1.2 OS Linux Compiler gcc (egcs )

8 Searching ability (covering rate)
Covering rate( it is the success rate of finding the optimum of each problem in 20 trials.) 率 見 1.0 4 8 0.5 12 24 A DuDGA F1 F2 F3 F4 DuDGA has high searching ability.

9 The number of processors
Distribution and parallel effects of DuDGAs 5 10 15 20 25 Speed Up Rate 1 5 10 15 The number of processors Speed up rate is the relation between the calculation time of one processor model and that of multi processor model. Therefore, this rate has the factor of the model distribution effects and the parallel effects of DuDGAs

Download ppt "Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA"

Similar presentations

Using Parallel Genetic Algorithm in a Predictive Job Scheduling

Using Parallel Genetic Algorithm in a Predictive Job Scheduling
Divided Range Genetic Algorithms in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANBE Doshisha University.

Divided Range Genetic Algorithms in Multiobjective Optimization Problems Tomoyuki HIROYASU Mitsunori MIKI Sinya WATANBE Doshisha University.
Fractal Element Antenna Genetic Optimization Using a PC Cluster ACES Proceedings March 21, 2002 Monterey, CA.

Fractal Element Antenna Genetic Optimization Using a PC Cluster ACES Proceedings March 21, 2002 Monterey, CA.
1 Distributed Computing Algorithms CSCI-6966. 2 Distributed Computing: everything not centralized many processors.

1 Distributed Computing Algorithms CSCI Distributed Computing: everything not centralized many processors.
Optimization and evaluation of parallel I/O in BIPS3D parallel irregular application Performance Modelling, Evaluation, and optimization of Parallel and.

Optimization and evaluation of parallel I/O in BIPS3D parallel irregular application Performance Modelling, Evaluation, and optimization of Parallel and.
PGA – Parallel Genetic Algorithm Hsuan Lee. Reference  E Cantú-Paz, A Survey on Parallel Genetic Algorithm, Calculateurs Paralleles, Reseaux et Systems.

PGA – Parallel Genetic Algorithm Hsuan Lee. Reference  E Cantú-Paz, A Survey on Parallel Genetic Algorithm, Calculateurs Paralleles, Reseaux et Systems.
Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.

Genetic Algorithm What is a genetic algorithm? “Genetic Algorithms are defined as global optimization procedures that use an analogy of genetic evolution.
1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.

1 Reasons for parallelization Can we make GA faster? One of the most promising choices is to use parallel implementations. The reasons for parallelization.
SBSE Course 4. Overview: Design Translate requirements into a representation of software Focuses on –Data structures –Architecture –Interfaces –Algorithmic.

SBSE Course 4. Overview: Design Translate requirements into a representation of software Focuses on –Data structures –Architecture –Interfaces –Algorithmic.
Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.

Parallel Genetic Algorithms with Distributed-Environment Multiple Population Scheme M.Miki T.Hiroyasu K.Hatanaka Doshisha University,Kyoto,Japan.
A New Model of Distributed Genetic Algorithm for Cluster Systems: Dual Individual DGA Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA.

A New Model of Distributed Genetic Algorithm for Cluster Systems: Dual Individual DGA Tomoyuki HIROYASU Mitsunori MIKI Masahiro HAMASAKI Yusuke TANIMURA.
Neural and Evolutionary Computing - Lecture 10 1 Parallel and Distributed Models in Evolutionary Computing  Motivation  Parallelization models  Distributed.

Neural and Evolutionary Computing - Lecture 10 1 Parallel and Distributed Models in Evolutionary Computing  Motivation  Parallelization models  Distributed.
MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme Intelligent Systems Design Laboratory ， Doshisha University ， Kyoto Japan.

MOGADES: Multi-Objective Genetic Algorithm with Distributed Environment Scheme Intelligent Systems Design Laboratory ， Doshisha University ， Kyoto Japan.
Doshisha Univ. JapanGECCO2002 Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing using Genetic Crossover Takeshi YoshidaTomoyuki.

Doshisha Univ. JapanGECCO2002 Energy Minimization of Protein Tertiary Structure by Parallel Simulated Annealing using Genetic Crossover Takeshi YoshidaTomoyuki.
Cluster Workstations. Recently the distinction between parallel and distributed computers has become blurred with the advent of the network of workstations.

Cluster Workstations. Recently the distinction between parallel and distributed computers has become blurred with the advent of the network of workstations.
Beowulf Cluster Jon Green Jay Hutchinson Scott Hussey Mentor: Hongchi Shi.

Beowulf Cluster Jon Green Jay Hutchinson Scott Hussey Mentor: Hongchi Shi.
Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.

Optimization Problems - Optimization: In the real world, there are many problems (e.g. Traveling Salesman Problem, Playing Chess ) that have numerous possible.
Doshisha Univ., Japan Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems ○ Shinya Watanabe Tomoyuki Hiroyasu Mitsunori Miki Intelligent.

Doshisha Univ., Japan Parallel Evolutionary Multi-Criterion Optimization for Block Layout Problems ○ Shinya Watanabe Tomoyuki Hiroyasu Mitsunori Miki Intelligent.
Robin McDougall Scott Nokleby Mechatronic and Robotic Systems Laboratory 1.

Robin McDougall Scott Nokleby Mechatronic and Robotic Systems Laboratory 1.
The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.

The Generational Control Model This is the control model that is traditionally used by GP systems. There are a distinct number of generations performed.

Similar presentations

Ads by Google