A Parallel Genetic Algorithm Framework for Cloud Computing Applications

Author(s):  
Elena Apostol ◽  
Iulia Băluţă ◽  
Alexandru Gorgoi ◽  
Valentin Cristea
2011 ◽  
Vol 121-126 ◽  
pp. 4023-4027 ◽  
Author(s):  
Guang Ming Li ◽  
Wen Hua Zeng ◽  
Jian Feng Zhao ◽  
Min Liu

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.


2011 ◽  
Vol 121-126 ◽  
pp. 4151-4155 ◽  
Author(s):  
Jian Feng Zhao ◽  
Wen Hua Zeng ◽  
Guang Ming Li ◽  
Min Liu

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.


Author(s):  
M. Y. Jiang ◽  
X. J. Fan ◽  
Y. X. Zhou ◽  
J. Lian ◽  
J. Q. Jiang ◽  
...  

Author(s):  
Ge Weiqing ◽  
Cui Yanru

Background: In order to make up for the shortcomings of the traditional algorithm, Min-Min and Max-Min algorithm are combined on the basis of the traditional genetic algorithm. Methods: In this paper, a new cloud computing task scheduling algorithm is proposed, which introduces Min-Min and Max-Min algorithm to generate initialization population, and selects task completion time and load balancing as double fitness functions, which improves the quality of initialization population, algorithm search ability and convergence speed. Results: The simulation results show that the algorithm is superior to the traditional genetic algorithm and is an effective cloud computing task scheduling algorithm. Conclusion: Finally, this paper proposes the possibility of the fusion of the two quadratively improved algorithms and completes the preliminary fusion of the algorithm, but the simulation results of the new algorithm are not ideal and need to be further studied.


Author(s):  
Siddhanth Dhodhi ◽  
Debarshi Chatterjee ◽  
Eric Hill ◽  
Saad Godil

Sign in / Sign up

Export Citation Format

Share Document