Master-Slave Parallel Genetic Algorithm Based on MapReduce Using Cloud Computing

2011 ◽  
Vol 121-126 ◽  
pp. 4023-4027 ◽  
Author(s):  
Guang Ming Li ◽  
Wen Hua Zeng ◽  
Jian Feng Zhao ◽  
Min Liu
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
High Performance ◽  
Low Cost ◽  
Parallel Genetic Algorithm ◽  
Parallel Genetic Algorithms ◽  
Computing Platform ◽  
Speed Up ◽  
Cloud Computing Platform ◽  
High Performance Computer

The implementation platforms of parallel genetic algorithms (PGAs) include high performance computer, cluster and Grid. Contrast with the traditional platform, a Master-slave PGA based on MapReduce (MMRPGA) of cloud computing platform was proposed. Cloud computing is a new computer platform, suites for larger-scale computing and is low cost. At first, describes the design of MMRPGA, in which the whole evolution is controlled by Master and the fitness computing is assigned to Slaves; then deduces the theoretical speed-up of MMRPGA; at last, implements MMRPGA on Hadoop and compares the speed-up with traditional genetic algorithm, the experiment result shows MMRPGA can achieve slightly lower linear speed-up with Mapper’s number.

Simple Parallel Genetic Algorithm Using Cloud Computing

2011 ◽  
Vol 121-126 ◽  
pp. 4151-4155 ◽  
Author(s):  
Jian Feng Zhao ◽  
Wen Hua Zeng ◽  
Guang Ming Li ◽  
Min Liu
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Open Source ◽  
High Performance ◽  
Parallel Genetic Algorithm ◽  
Communication Time ◽  
Speed Up ◽  
Parallel Platform ◽  
High Performance Computers

Cloud computing is a novel parallel platform, this paper proposed a kind of simple parallel genetic algorithm (PGA) using Cloud computing called SMRPGA. Comparing with the traditional PGAs using high performance computers (HPC), cluster or Grid, SMRPGA is simple and easy to be implemented. Another advantage is that PGA using Cloud computing is easy to be extend to larger-scale, which is very useful for solving the time-consuming problems. A prototype is implemented based on Hadoop, which is an open source Cloud computing. The result of running two benchmark functions showed that the speed-up of PGA using Cloud Computing is not obvious considering the long communication time and it is suitable to solve the time-consuming problems.

scholarly journals Construct Linear Polynomial Complementary Transformation for NP-Completeness Using Parallel Genetic Algorithm

2016 ◽  
Author(s):  
Tarik Eltaeib ◽  
Julius Dichter
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Parallel Genetic Algorithm ◽  
Algorithm Optimization ◽  
Parallel Genetic Algorithms ◽  
Np Completeness ◽  
Linear Polynomial ◽  
Optimization Function ◽  
Speed Up ◽  
Complementary Equation

This paper examines the correlation between numbers of computer cores in parallel genetic algorithms. The objective to determine the linear polynomial complementary equation in order represent the relation between number of parallel processing and optimum solutions. Model this relation as optimization function (f(x)) which able to produce many simulation results. F(x) performance is outperform genetic algorithms. Compression results between genetic algorithm and optimization function is done. Also the optimization function give model to speed up genetic algorithm. Optimization function is a complementary transformation which maps a TSP given to linear without changing the roots of the polynomials.

scholarly journals Emergency Scheduling Optimization Simulation of Cloud Computing Platform Network Public Resources

Complexity ◽  
2021 ◽  
Vol 2021 ◽  
pp. 1-11
Author(s):  
Dingrong Liu ◽  
Zhigang Yao ◽  
Liukui Chen
Keyword(s):  
Genetic Algorithm ◽  
Cloud Computing ◽  
Objective Function ◽  
Hamming Distance ◽  
Fitness Function ◽  
Initial Population ◽  
Computing Platform ◽  
Public Resource ◽  
Public Resources ◽  
Cloud Computing Platform

Emergency scheduling of public resources on the cloud computing platform network can effectively improve the network emergency rescue capability of the cloud computing platform. To schedule the network common resources, it is necessary to generate the initial population through the Hamming distance constraint and improve the objective function as the fitness function to complete the emergency scheduling of the network common resources. The traditional method, from the perspective of public resource fairness and priority mapping, uses incremental optimization algorithm to realize emergency scheduling of public resources, neglecting the improvement process of the objective function, which leads to unsatisfactory scheduling effect. An emergency scheduling method of cloud computing platform network public resources based on genetic algorithm is proposed. With emergency public resource scheduling time cost and transportation cost minimizing target, initial population by Hamming distance constraints, emergency scheduling model, and the corresponding objective function improvement as the fitness function, the genetic algorithm to individual selection and crossover and mutation probability were optimized and complete the public emergency resources scheduling. Experimental results show that the proposed method can effectively improve the efficiency of emergency resource scheduling, and the reliability of emergency scheduling is better.

Research on Computer Networks Reliability Optimization by Parallel Genetic Algorithms Method

2014 ◽  
Vol 543-547 ◽  
pp. 2984-2987
Author(s):  
Xu Cao ◽  
Jun Pan
Keyword(s):  
Genetic Algorithm ◽  
Genetic Algorithms ◽  
Network Topology ◽  
Coarse Grained ◽  
Reliability Optimization ◽  
Parallel Genetic Algorithm ◽  
Parallel Genetic Algorithms ◽  
Cost Constraints ◽  
Speed Up

This paper can be asserted that the use of parallel genetic algorithm can not only effectively improve the calculation speed and optimize the quality, but also can improve a lot of advantages. Reliability optimization for computer net works, subject s to cost constraints, is a NP-hard combinational problem. Reg ar ding a known network topology, the problem of choosing links and switchers among alternatives different in reliability and cost is settled by a Coarse-grained parallel genetic algorithm, which maximize the network availablity within a fixed budget. T he simulations on a dedicated cluster demonst rate that contracting to the sequential counterpart, o ur par allel GA improves the quality of plans greatly with an evident speed-up.

Power Management of Virtualized Cloud Computing Platform

2012 ◽  
Vol 35 (6) ◽  
pp. 1262 ◽  
Author(s):  
Ke-Jiang YE ◽  
Zhao-Hui WU ◽  
Xiao-Hong JIANG ◽  
Qin-Ming HE
Keyword(s):  
Cloud Computing ◽  
Power Management ◽  
Computing Platform ◽  
Cloud Computing Platform
Sign in / Sign up

Export Citation Format

Share Document