D 3 G 2 A: the dynamic distributed double guided genetic algorithm for the K-Graph partitioning problem

Graph Partitioning has several important applications in Computer Science, including VLSI circuit layout, image processing, and distributing workloads for parallel computation. It is known to be NP-hard. In this paper we present in detail the K-Graph Partitioning Problem and the Dynamic Distributed Double Guided Genetic Algorithm. This algorithm consists of agents dynamically created and cooperated in order to solve the problem. Each agent performs its own genetic algorithm, guided by the min-conflict-heuristic. The paper also presents the results of application the algorithm for the $K$-Graph Partitioning Problem using a multilevel paradigm.

[1]  Kyriakos C. Giannakoglou,et al.  Partitioning of unstructured grid meshes using Boltzmann machine neural networks , 2000 .

[2]  Vipin Kumar,et al.  Multilevel k-way hypergraph partitioning , 1999, DAC '99.

[3]  Jurij Silc,et al.  Solving the mesh-partitioning problem with an ant-colony algorithm , 2004, Parallel Comput..

[4]  Steven Minton,et al.  Minimizing Conflicts: A Heuristic Repair Method for Constraint Satisfaction and Scheduling Problems , 1992, Artif. Intell..

[5]  Kishan G. Mehrotra,et al.  Genetic algorithms for graph partitioning and incremental graph partitioning , 1994, Proceedings of Supercomputing '94.

[6]  Horst D. Simon,et al.  Fast multilevel implementation of recursive spectral bisection for partitioning unstructured problems , 1994, Concurr. Pract. Exp..

[7]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[8]  Francesc Comellas,et al.  A Multiagent Algorithm for Graph Partitioning , 2006, EvoWorkshops.

[9]  Bruce Hendrickson,et al.  The Chaco user`s guide. Version 1.0 , 1993 .

[10]  Chris Walshaw,et al.  Parallel optimisation algorithms for multilevel mesh partitioning , 2000, Parallel Comput..

[11]  Vipin Kumar,et al.  A Fast and High Quality Multilevel Scheme for Partitioning Irregular Graphs , 1998, SIAM J. Sci. Comput..

[12]  Kengo Katayama,et al.  Performance of a genetic algorithm for the graph partitioning problem , 2003 .

[13]  Vipin Kumar,et al.  Analysis of Multilevel Graph Partitioning , 1995, Proceedings of the IEEE/ACM SC95 Conference.

[14]  Gregor von Laszewski,et al.  Intelligent Structural Operators for the k-way Graph Partitioning Problem , 1991, ICGA.

[15]  Jesper Larsson Träff,et al.  Direct graph k-partitioning with a Kernighan-Lin like heuristic , 2006, Oper. Res. Lett..