Relaxing Synchronization in Distributed Simulated Annealing
IEEE Transactions on Parallel and Distributed Systems
Observations on Using Genetic Algorithms for Dynamic Load-Balancing
IEEE Transactions on Parallel and Distributed Systems
Hi-index | 0.00 |
In this paper, we propose a novel approach to the load balancing problem, which is an important issue in parallel processing. The proposed load balancing algorithm called Mean Field Genetic Algorithm (MGA) is a hybrid algorithm of Mean Field Annealing (MFA) and Simulated annealing-like Genetic Algorithm (SGA). The proposed MGA combines the benefit of rapid convergence property of MFA and the effective genetic operations of SGA. Our experimental results indicate that the composition of heuristic mapping methods improves the performance over the conventional ones in terms of communication cost, load imbalance and maximum execution time.