ABSTRACT
This paper describes a general scheme to convert sequential ant-based algorithms into parallel shared memory algorithms. The scheme is applied to an ant-based algorithm for the maximum clique problem. Extensive experimental results indicate that the parallel version provides noticeable improvements to the running time while maintaining comparable solution quality to that of the sequential version.
- S. Alonso, O. Cordon, I. Fernandez de Viana, F. Herrera, "Integrating Evolutionary Computation Components in Ant Colony Optimization," Recent Developments in Biologically Inspired Computing, L.Nunes de Castro, F.J. Von Zuben (Eds.), Idea Group Publishing, 2004, pp. 48--180.Google Scholar
- P. Berman and A. Pelc, "Distributed Fault Diagnosis For Multiprocessor Systems," Proc. of the 20th Annual International Symposium on Fault-Tolerant Computing, Newcastle, UK, 1990, pp. 340--346.Google Scholar
- E. Bonabeau, M. Dorigo, and G. Theraulaz, "Inspiration for Optimization from Social Insect Behavior," Nature, Vol. 406, July 6, 2000, pp. 39--42.Google ScholarCross Ref
- T. Bui and J. Rizzo, "Finding Maximum Cliques with Distributed Ants," Proc. of the Genetic and Evolutionary Computation Conf., 2004, pp. 24--35.Google Scholar
- T. Bui and G. Sundarraj, "Ant System for the k-Cardinality Tree Problem," Proc. of the Genetic and Evolutionary Computation Conf., 2004, pp. 36--47.Google Scholar
- T. Bui and L. Strite, "An Ant System Algorithm for Graph Bisection," Proc. of the Genetic and Evolutionary Computation Conf., 2002, pp. 43--51. Google ScholarDigital Library
- T. Bui and C. Zrncic, "An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree," Proc. of the Genetic and Evolutionary Computation Conf., 2006, pp. 11--18. Google ScholarDigital Library
- B. Bullnheimer, G, Kotsis, and C. Strauss, "Parallelization Strategies for the Ant System," High Performance Algorithms and Software in Nonlinear Optimization, Kluwer, Dordrecht, 1998, pp. 87--100.Google Scholar
- P. Delisle, M. Krajecki, M. Gravel, and C. Gagne, "Parallel Implementation of An Ant colony Optimization Metaheuristic With OpenMP," Proc. of the 3rd European Workshop on OpenMP (EWOMP'01), Barcelona, Spain, 2001.Google Scholar
- M. Dorigo, "Optimization, Learning and Natural Algorithms," Ph.D. Thesis, Politecnico di Milano, Italy, {in Italian}, 1992.Google Scholar
- M. Dorigo and G. Di Caro, "The Ant Colony Optimization Meta-Heuristic," New Ideas in Optimization, McGraw-Hill, 1999, pp. 11--32. Google ScholarDigital Library
- M. Dorigo and L. Gambardella, "Ant Colony System: A Cooperative Learning Approach to the Traveling Salesman Problem," IEEE Trans. on Evol. Computation, 1(1), 1997, pp. 53--66. Google ScholarDigital Library
- M. Dorigo, L. Gambardella, and E. Taillard, "Ant Colonies for the Quadratic Assignment Problem," Journal of the Operational Research Society, Vol. 50, 1999, pp. 167--176.Google ScholarCross Ref
- I. Ellabib, P. Calamai, and O. Basir, "Exchange Strategies for Multiple Ant Colony System," Information Sciences, 177(5), March 2007, pp. 1248--1264. Google ScholarDigital Library
- D. Geer, "Chip Makers Turn to Multicore Processors," Computer, Vol. 38, No. 5, May 2005, pp. 11--13. Google ScholarDigital Library
- J. Hastad, "Clique Is Hard to Approximate within n1-ë," Acta Mathematica, 182, 1999, pp. 105--142.Google ScholarCross Ref
- J. Lagarias and P. Shor, "Keller's Cube-Tiling Conjecture Is False In High Dimensions," Bulletin of the American Mathematical Society, 27(2), 1992, pp. 279--283.Google ScholarCross Ref
- M. Manfrin, M. Birattari, Thomas Stutzle, and M. Dorigo, "Parallel Ant Colony Optimization for the Traveling Salesman Problem," M. Dorigo et al. (Eds.): ANTS 2006, Lecture Notes in Computer Science, 4150, 2006, pp. 224--234. Google ScholarDigital Library
- V. Maniezzo and A. Carbonaro, "Ant Colony Optimization: An Overview," Essays and Surveys in Metaheuristics, C. Ribeiro editor, Kluwer Academic Publishers, 2001, pp. 21--44.Google Scholar
- R. Michels and M. Middendorf, "An Ant System for the Shortest Common Supersequence Problem," in D. Corne, M. Dorigo, F. Glover (Eds.), New Ideas in Optimization, McGraw-Hill, 1999, pp. 51--61. Google ScholarDigital Library
- M. Middendorf, F. Reischle, and H. Schmeck, "Multi Colony Ant Algorithms," Journal of Heuristic, 8, 2002, pp. 305--320. Google ScholarDigital Library
- J. Parkhurst, J. Darringer, and B. Grundmann, "From Single Core to Multi-Core: Preparing for a New Exponential," Proc. of the 2006 IEEE/ACM International Conference on Computer-Aided Design, 2006, pp. 67--72. Google ScholarDigital Library
- D. Patterson and J. Hennessy, "Computer Organization and Design (2nd Edition)," Morgan Kaufmann Publishers, 1998. Google ScholarDigital Library
- M. Randall and A. Lewis, "A Parallel Implementation of Ant Colony Optimization," Journal of Parallel and Distributed Computing, 62(9), 2002, pp. 1421--1432. Google ScholarDigital Library
- J. E. Savage and M. Zubair, "A Unified Model for Multicore Architectures," Proc. of the 1st International Forum on Next-Generation Multicore/Manycore Technologies, 2008. Google ScholarDigital Library
- N. Sloane, "Unsolved Problems in Graph Theory Arising from the Study of Codes," Graph Theory Notes of New York, XVIII, 1989, pp. 11--20.Google Scholar
- N. Sloane and F. MacWilliams, "The Theory of Correcting Codes," North Holland, Amsterdam, 1979.Google Scholar
- T. Stutzle, "Parallelization Strategies for Ant Colony Optimization," Proc. of Parallel Problem Solving from Nature, Lecture Notes in Computer Science, 1498, Springer, 1998, pp. 722--741. Google ScholarDigital Library
- E.-G. Talbi, O. Roux, C. Fonlupt, and D. Robillard, "Parallel Ant Colonies for Combinatorial Optimization Problems," Feitelson&Rudolph (Eds.), Job Scheduling Strategies for Parallel Processing: IPPS '95 Workshop, Lecture Notes in Computer Science, 949, Springer, Vol. 11, 1999. Google ScholarDigital Library
- The Beowulf Project. http://www.beowulf.org. Last accessed March 2009.Google Scholar
- MPI - The Message Passing Interface Standard. http://www-unix.mcs.anl.gov/mpi/. Last accessed March 2009.Google Scholar
- OpenMP Architecture Review Board. http://www.openmp.org/specs/. Last accessed March 2009.Google Scholar
- Clique Benchmark Instances. http://www.cs.hbg.psu.edu/benchmarks/. Last accessed March 2009.Google Scholar
- BHOSLIB: Benchmarks with Hidden Optimum Solutions for Graph Problems. http://www.nlsde.buaa.edu.cn/ kexu/benchmarks/graphbenchmarks.htm. Last accessed March 2009.Google Scholar
- Supplemental results. http://www.cs.unm.edu/~tnguyen/Files/Papers/mcsup.pdf. Last accessed March 2009.Google Scholar
Index Terms
Parallel shared memory strategies for ant-based optimization algorithms
Recommendations
Performance comparison of MPI and three openMP programming styles on shared memory multiprocessors
SPAA '03: Proceedings of the fifteenth annual ACM symposium on Parallel algorithms and architecturesWhen using a shared memory multiprocessor, the programmer faces the selection of the portable programming model which will deliver the best performance. Even if he restricts his choice to the standard programming environments (MPI and OpenMP), he has a ...
Exploiting Distributed-Memory and Shared-Memory Parallelism on Clusters of SMPs with Data Parallel Programs
Clusters of SMPs are hybrid-parallel architectures that combine the main concepts of distributed-memory and shared-memory parallel machines. Although SMP clusters are widely used in the high performance computing community, there exists no single ...
Performance comparison of MPI and OpenMP on shared memory multiprocessors: Research Articles
When using a shared memory multiprocessor, the programmer faces the issue of selecting the portable programming model which will provide the best performance. Even if they restricts their choice to the standard programming environments (MPI and OpenMP), ...
Comments