Improvement of the efficiency of genetic algorithms for scalable parallel graph partitioning in a multi-level framework

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4128 LNCS, Issue , 2006, Pages 243-252

  Chevalier, Cédric ^a   Pellegrini, François ^a  

^a UNIVERSITÉ BORDEAUX 1   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CONVERGENCE OF NUMERICAL METHODS; EVOLUTIONARY ALGORITHMS; GENETIC ALGORITHMS; ITERATIVE METHODS; OPTIMIZATION; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING;

BIPARTITIONING PROBLEM; GRAPH PARTITIONING METHODS; OPTIMIZATION ALGORITHMS; PARALLEL PARTITIONERS;

GRAPH THEORY;

EID: 33750008943     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11823285_25     Document Type: Conference Paper

References (15)

1. S. Areibi and Zeng Y. Effective memetic algorithms for VLSI design automation = genetic algorithms + local search + multi-level clustering. Evolutionary Computation, 12(3):327-353, 2004.
2. S. T. Barnard and H. D. Simon. A fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems. Concurrency: Practice and Experience, 6(2): 101-117, 1994.
3. T. N. Bui and B. R. Moon. Genetic algorithm and graph partitioning. IEEE Trans. Comput., 45(7):841-855, 1996.
4. C. M. Fiduccia and R. M. Mattheyses. A linear-time heuristic for improving network partitions. In Proc. 19th Design Automat. Conf., pages 175-181. IEEE, 1982.
5. A. George and J. W.-H. Liu. Computer solution of large sparse positive definite systems. Prentice Hall, 1981.
6. B. Hendrickson and R. Leland. A multilevel algorithm for partitioning graphs. In Proceedings of Supercomputing, 1995.
7. J. Horn, N. Nafpliotis, and D. E. Goldberg. A niched Pareto genetic algorithm for multiobjective optimization. In IEEE World Congress on Computational Intelligence, volume 1, pages 82-87, 1994.
8. G. Karypis and V. Kumar. A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM J. on Scientific Computing, 20(1):359-392, 1998.
9. METIS: Family of multilevel partitioning algorithms, http://glaros.dtc. umn.edu/gkhome/views/metis.
10. B. W. Kernighan and S. Lin. An efficient heuristic procedure for partitioning graphs. Bell System Technical Journal, 49:291-307, February 1970.
11. P. Moscato. On evolution, search, optimization, genetic algorithms and martial arts, towards memetic algorithms. Technical Report 826, California Intitute of Technology, Pasadena, CA 91125, U.S.A., 1989.
12. SCOTCH: Static mapping, graph partitioning, and sparse matrix block ordering package, http://www.labri.fr/~pelegrin/scotch/.
13. K. Schloegel, G. Karypis, and V. Kumar. Parallel multilevel algorithms for multi-constraint graph partitioning. In Proceedings of EuroPar, pages 296-310, 2000.
14. H. D. Simon and S.-H. Teng. How good is recursive bipartition. SIAM J. Sc. Comput., 18(5): 1436-1445, 1995.
15. D. Whitley, S. Rana, and R. B. Heckendorn. The island model genetic algorithm: On separability, population size and convergence. Journal of Computing and Information Technology, 7:33-47, 1999.