An asynchronous hybrid genetic-simplex search for modeling the Milky Way galaxy using volunteer computing

GECCO'08: Proceedings of the 10th Annual Conference on Genetic and Evolutionary Computation 2008

Volumn , Issue , 2008, Pages 921-928

  Desell, Travis ^a   Szymanski, Boleslaw ^a   Varela, Carlos ^a  

^a Rensselaer Polytechnic Institute   (United States)

Author keywords

Genetic algorithms; Simplex method; Volunteer computing

Indexed keywords

DISTRIBUTED COMPUTER SYSTEMS; GALAXIES; LINEAR PROGRAMMING; SUPERCOMPUTERS;

CONTINUOUS PARAMETERS; IBM BLUEGENE/L SUPERCOMPUTER; OPTIMIZATION METHOD; OPTIMIZATION PROBLEMS; PROBABILISTIC OPERATOR; PROCESSOR PARTITIONS; SIMPLEX METHODS; VOLUNTEER COMPUTING;

GENETIC ALGORITHMS;

EID: 57349145253     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1389095.1389273     Document Type: Conference Paper

References (24)

1. J. e. a. Adelman-McCarthy. The 6th Sloan Digital Sky Survey Data Release, http://www.sdss.org/dr6/, July 2007. ApJS, in press, arXiv/0707.3413.
2. E. Alba and B. Dorronsoro. The exploration/exploitation tradeoff in dynamic cellular genetic algorithms. IEEE Transactions on Evolutionary Computation, 9:126-142, April 2005.
3. E. Alba and J. M. Troya. Analyzing synchronous and asynchronous parallel distributed genetic algorithms. Future Generation Computer Systems, 17:451-465, January 2001.
4. D. P. Anderson, J. Cobb, E. Korpela, M. Lebofsky, and D. Werthimer. SETI@home: an experiment in public-resource computing. Commun. ACM, 45(11):56-61, 2002.
5. D. P. Anderson, E. Korpela, and R. Walton. High-performance task distribution for volunteer computing. In e-Science, pages 196-203. IEEE Computer Society, 2005.
6. J. Berntsson and M. Tang. A convergence model for asynchronous parallel genetic algorithms. In IEEE Congress on Evolutionary Computation (CEC2003), volume 4, pages 2627-2634, December 2003.
7. E. Cantu-Paz. A survey of parallel genetic algorithms. Calculateurs Paralleles, Reseaux et Systems Repartis, 10(2):141-171, 1998.
8. R. Chelouah and P. Siarry. Genetic and nelder-mead algorithms hybridized for a more accurate global optimiation of continuous multiminima functions. European Journal of Operational Research, 148(2):335-348, July 2003.
9. T. Desell, N. Cole, M. Magdon-Ismail, H. Newberg, B. Szymanski, and C. Varela. Distributed and generic maximum likelihood evaluation. In 3rd IEEE International Conference on e-Science and Grid Computing (eScience2007), pages 337-344, Bangalore, India, December 2007.
10. B. Dorronsoro and E. Alba. A simple cellular genetic algorithm for continuous optimization. IEEE Congress on Evolutionary Computation (CEC2006), pages 2838-2844, July 2006.
11. G. Folino, A. Forestiero, and G. Spezzano. A JXTA based asynchronous peer-to-peer implementation of genetic programming. Journal of Software, 1:12-23, August 2006.
12. H. Imade, R. Morishita, I. Ono, N. Ono, and M. Okamoto. A grid-oriented genetic algorithm framework for bioinformatics. New Generation Computing: Grid Systems for Life Sciences, 22:177-186, January 2004.
13. V. Katari, S. C. Satapathy, J. Murthy, and P. P. Reddy. Hybridized improved genetic algorithm with variable length chromosome for image clustering. IJCSNS International Journal of COmputer Science and Network Security, 7(11):121-131, November 2007.
14. A. Lewis and D. Abramson. An evolutionary programming algorithm for multi-objective optimisation. In IEEE Congress on Evolutionary Computation (CEC2003), volume 3, pages 1926-1932, December 2003.
15. D. Lim, Y.-S. Ong, Y. Jin, B. Sendhoff, and B.-S. Lee. Efficient hierarchical parallel genetic algorithms using grid computing. Future Generation Computer Systems, 23:658-670, May 2007.
16. V. Pande et al. Atomistic protein folding simulations on the submillisecond timescale using worldwide distributed computing. Biopolymers, 68(1):91-109, 2002. Peter Kollman Memorial Issue.
17. J. Purnell, M. Magdon-Ismail, and H. Newberg. A probabilistic approach to finding geometric objects in spatial datasets of the Milky Way. In Proceedings of the 15th International Symposium on Methodoligies for Intelligent Systems (ISMIS 2005), pages 475-484, Saratoga Springs, NY, USA, May 2005. Springer.
18. J.-M. Renders and H. Bersini. Hibridizing genetic algorithms with hill-climbing methods for global optimization: two possible ways. In IEEE World Congress on Computational Intelligence, First Conference on Evolutionary Computation, volume 1, pages 312-317, June 1994.
19. S. C. Satapathy, J. Murthy, P. Prasada, V. Katari, S. Malireddi, and V. S. Kollisetty. An efficient hybrid algorithm for data clustering using improved genetic algorithm and nelder mead simplex search. In International Conference on Computational Intelligence and Multimedia Applications, volume 1, pages 498-510, December 2007.
20. G. Seront and H. Bersini. Simplex ga and hybrid methods. In IEEE International Conference on Evolutionary Computation, pages 845-848, May 1996.
21. A. Sinha and D. E. Goldberg. A survey of hybrid genetic and evolutionary algorithms. Technical Report No. 2003004, Illinois Genetic Algorithms Laboratory (IlliGAL), 2003.
22. B. Szymanski, T. Desell, and C. Varela, The effect of heterogeneity on asynchronous panmictic genetic search. In Proc. of the Seventh International Conference on Parallel Processing and Applied Mathematics (PPAM'2007), LNCS, Gdansk, Poland, September 2007. To appear.
23. L. Wei and M. Zhao. A niche hybrid genetic algorithm for global optimization of continuous multimodal functions. Applied Mathematics and Computation, 160(3):649-661, January 2005.
24. J. Yen, J. C. Liao, B. Lee, and D. Randolph. A hybrid approach to modeling metabolic systems using a genetic algorithm and simplex method. IEEE Transactions on Systems, Man and Cybernetics, Part B, 29(2):173-191, April 1998.