Genetic algorithms for graph partitioning and incremental graph partitioning

Authors:
Harpal Maini;Kishan Mehrotra;Chilukuri Mohan;Sanjay Ranka
Affiliations:
Syracuse University, Syracuse, NY;Syracuse University, Syracuse, NY;Syracuse University, Syracuse, NY;Syracuse University, Syracuse, NY
Venue:
Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Year:
1994

Citing 8
Cited 13

Heuristic approaches to task allocation for parallel computing

Heuristic approaches to task allocation for parallel computing
Partitioning sparse matrices with eigenvectors of graphs

SIAM Journal on Matrix Analysis and Applications
Uniform crossover in genetic algorithms

Proceedings of the third international conference on Genetic algorithms
Parallel genetic algorithms, population genetics and combinatorial optimization

Proceedings of the third international conference on Genetic algorithms
Performance of dynamic load balancing algorithms for unstructured mesh calculations

Concurrency: Practice and Experience
Adaptation in natural and artificial systems

Adaptation in natural and artificial systems
Physical optimization algorithms for mapping data to distributed-memory multiprocessors

Physical optimization algorithms for mapping data to distributed-memory multiprocessors
Incorporation of knowledge in genetic recombination

Incorporation of knowledge in genetic recombination

Architecture-independent locality-improving transformations of computational graphs embedded in k-dimensions

ICS '95 Proceedings of the 9th international conference on Supercomputing
Parallel Incremental Graph Partitioning

IEEE Transactions on Parallel and Distributed Systems
Scalable Parallel Genetic Algorithms

Artificial Intelligence Review
Parallel incremental graph partitioning using linear programming

Proceedings of the 1994 ACM/IEEE conference on Supercomputing
Opportunity Cost Algorithms for Reduction of I/O and Interprocess Communication Overhead in a Computing Cluster

IEEE Transactions on Parallel and Distributed Systems
Simultaneous Partitioning and Frequency Assignment for On-Chip Bus Architectures

Proceedings of the conference on Design, Automation and Test in Europe - Volume 1
Adaptive Linkage Crossover

Evolutionary Computation
D3G2A: the dynamic distributed double guided genetic algorithm for the K-Graph partitioning problem

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Scheduling of tasks with batch-shared I/O on heterogeneous systems

IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Graph partitioning by multi-objective real-valued metaheuristics: A comparative study

Applied Soft Computing
Genetic approaches for graph partitioning: a survey

Proceedings of the 13th annual conference on Genetic and evolutionary computation
Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem

EvoCOP'06 Proceedings of the 6th European conference on Evolutionary Computation in Combinatorial Optimization
Workload driven power domain partitioning

VDAT'12 Proceedings of the 16th international conference on Progress in VLSI Design and Test

Quantified Score

Hi-index	0.00

Visualization

Abstract

Partitioning graphs into equally large groups of nodes, minimizing the number of edges between different groups, is an extremely important problem in parallel computing. This paper presents genetic algorithms for suboptimal graph partitioning, with new crossover operators (KNUX, DKNUX) that lead to orders of magnitude improvement over traditional genetic operators in solution quality and speed. Our method can improve on good solutions previously obtained by using other algorithms or graph theoretic heuristics in minimizing the total communication cost or the worst case cost of communication for a single processor. We also extend our algorithm to Incremental Graph Partitioning problems, in which the graph structure or system properties changes with time.