Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization

In a distributed computing system (DCS), we need to allocate a number of modules to different processors for execution. It is desired to maximize the processor synergism in order to achieve various objectives, such as throughput maximization, reliability maximization, and cost minimization. There may also exist a set of system constraints related to memory and communication link capacity. The considered problem has been shown to be NP-hard. Most existing approaches for task allocation deal with a single objective only. This paper presents a multi-objective task allocation algorithm with presence of system constraints. The algorithm is based on the particle swarm optimization which is a new metaheuristic and has delivered many successful applications. We further devise a hybrid strategy for expediting the convergence process. We assess our algorithm by comparing to a genetic algorithm and a mathematical programming approach. The experimental results manifest that the proposed algorithm performs the best under different problem scales, task interaction densities, and network topologies.

[1]  Gen-Huey Chen,et al.  A branch-and-bound-with-underestimates algorithm for the task assignment problem with precedence constraint , 1990, Proceedings.,10th International Conference on Distributed Computing Systems.

[2]  David M. Nicol,et al.  Improved Algorithms for Mapping Pipelined and Parallel Computations , 1991, IEEE Trans. Computers.

[3]  Anil Kumar Tripathi,et al.  A GA Based Multiple Task Allocation Considering Load , 2000, Int. J. High Speed Comput..

[4]  Alain Billionnet,et al.  An efficient algorithm for a task allocation problem , 1992, JACM.

[5]  Xi-Huai Wang,et al.  Hybrid particle swarm optimization with simulated annealing , 2004, Proceedings of 2004 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.04EX826).

[6]  Yue Shi,et al.  A modified particle swarm optimizer , 1998, 1998 IEEE International Conference on Evolutionary Computation Proceedings. IEEE World Congress on Computational Intelligence (Cat. No.98TH8360).

[7]  Anil Kumar Tripathi,et al.  Maximizing reliability of distributed computing system with task allocation using simple genetic algorithm , 2001, J. Syst. Archit..

[8]  Nirwan Ansari,et al.  A Genetic Algorithm for Multiprocessor Scheduling , 1994, IEEE Trans. Parallel Distributed Syst..

[9]  M. Clerc,et al.  The swarm and the queen: towards a deterministic and adaptive particle swarm optimization , 1999, Proceedings of the 1999 Congress on Evolutionary Computation-CEC99 (Cat. No. 99TH8406).

[10]  C. Siva Ram Murthy,et al.  Optimal task allocation in distributed systems by graph matching and state space search , 1999, J. Syst. Softw..

[11]  Yang Wei-min.  A Hybrid Particle Swarm Algorithm with Embedded Chaotic Search , 2006 .

[12]  Fred W. Glover,et al.  Tabu Search - Part I , 1989, INFORMS J. Comput..

[13]  Ching-Chi Hsu,et al.  Task assignment scheduling by simulated annealing , 1990, IEEE TENCON'90: 1990 IEEE Region 10 Conference on Computer and Communication Systems. Conference Proceedings.

[14]  Chung-Chi Hsieh,et al.  Reliability and cost optimization in distributed computing systems , 2003, Comput. Oper. Res..

[15]  Yskandar Hamam,et al.  Assignment of program modules to processors: A simulated annealing approach , 2000, Eur. J. Oper. Res..

[16]  J.-P. Wang,et al.  Task Allocation for Maximizing Reliability of Distributed Computer Systems , 1992, IEEE Trans. Computers.

[17]  James Kennedy,et al.  Particle swarm optimization , 2002, Proceedings of ICNN'95 - International Conference on Neural Networks.

[18]  Chung-Chi Hsieh.  Optimal task allocation and hardware redundancy policies in distributed computing systems , 2003, Eur. J. Oper. Res..

[19]  Fred Glover,et al.  Tabu Search - Part II , 1989, INFORMS J. Comput..

[20]  Katta G. Murty,et al.  A hybrid genetic/optimization algorithm for a task allocation problem , 1999 .

[21]  Virginia Mary Lo.  Task assignment in distributed systems , 1983 .

[22]  C. Siva Ram Murthy,et al.  Task Allocation Algorithms for Maximizing Reliability of Distributed Computing Systems , 1997, IEEE Trans. Computers.

[23]  Deng-Jyi Chen,et al.  The Computational Complexity of the Reliability Problem on Distributed Systems , 1997, Inf. Process. Lett..

[24]  Kang G. Shin,et al.  Optimal Task Assignment in Homogeneous Networks , 1997, IEEE Trans. Parallel Distributed Syst..

[25]  Luca Maria Gambardella,et al.  Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[26]  Niraj K. Jha,et al.  Safety and Reliability Driven Task Allocation in Distributed Systems , 1999, IEEE Trans. Parallel Distributed Syst..

[27]  Ioan Cristian Trelea,et al.  The particle swarm optimization algorithm: convergence analysis and parameter selection , 2003, Inf. Process. Lett..

[28]  C. Siva Ram Murthy,et al.  Improved task-allocation algorithms to maximize reliability of redundant distributed computing systems , 1995 .

[29]  Yu Liu,et al.  Hybrid particle swarm optimizer with line search , 2004, 2004 IEEE International Conference on Systems, Man and Cybernetics (IEEE Cat. No.04CH37583).

[30]  David Fernández-Baca,et al.  Parametric Module Allocation on Partial k-Trees , 1993, IEEE Trans. Computers.

[31]  Maurice Clerc,et al.  The particle swarm - explosion, stability, and convergence in a multidimensional complex space , 2002, IEEE Trans. Evol. Comput..