A heuristic approach to task assignment optimization in distributed systems

This paper describes an efficient heuristic algorithm for the task assignment problem (an NP-complete problem). The problem is to find an optimal mapping of multiple communicating tasks onto the processing nodes of a distributed computing system. The purpose of mapping these tasks onto the nodes of the system is the minimization of the total execution time without sacrificing solution quality. Many heuristic approaches have been employed to obtain satisfactory mapping. Our heuristic, the genetic mean field annealing (GMFA), is a hybrid of genetic algorithm and mean field annealing. The hybrid algorithm combines the benefit of both methods and thus improves the performance. We compare the quality of solutions and time derived by the proposed GMFA against those derived by the genetic algorithm and mean held annealing algorithm respectively. Our experimental results from a simulation study of the heuristic algorithms are presented. In all cases studied, the solution quality derived by our new approach were significantly better than those derived by the conventional approaches.

[1]  Virginia Mary Lo,et al.  Heuristic Algorithms for Task Assignment in Distributed Systems , 1988, IEEE Trans. Computers.

[2]  Shahid H. Bokhari,et al.  On the Mapping Problem , 1981, IEEE Transactions on Computers.

[3]  J J Hopfield,et al.  Collective computation in neuronlike circuits. , 1987, Scientific American.

[4]  Donald E. Brown,et al.  A Parallel Genetic Heuristic for the Quadratic Assignment Problem , 1989, ICGA.

[5]  D. E. Goldberg,et al.  Genetic Algorithms in Search , 1989 .

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

[7]  David E. van den Bout,et al.  Graph partitioning using annealed neural networks , 1990, International 1989 Joint Conference on Neural Networks.

[8]  Tevfik Bultan,et al.  A New Mapping Heuristic Based on Mean Field Annealing , 1992, J. Parallel Distributed Comput..

[9]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[10]  Jake K. Aggarwal,et al.  A Mapping Strategy for Parallel Processing , 1987, IEEE Transactions on Computers.

[11]  Ophir Frieder,et al.  A Parallel Solution for the Multiprocessor Document Allocation Problem , 1994, 1994 International Conference on Parallel Processing Vol. 3.

[12]  Carsten Peterson,et al.  A New Method for Mapping Optimization Problems Onto Neural Networks , 1989, Int. J. Neural Syst..