Advertisement

A Combinatorial Multi-objective Particle Swarm Optimization Based Algorithm for Task Allocation in Distributed Computing Systems

  • Rahul Roy
  • Madhabananda Das
  • Satchidananda Dehuri
Part of the Communications in Computer and Information Science book series (CCIS, volume 193)

Abstract

In a distributed computing system (DCS), the scheduling of tasks comprise of two phases, task allocation and task scheduling. The allocation of tasks to different processors is required to maximize the processors synergism in order to achieve the various objectives, such as, system throughput, reliability maximization and cost minimization. The task allocation also need to satisfy a set of system constraints related to memory and link capacity. This problem has been shown as NP-Hard. Most of meta-heuristic algorithms deal with the task allocation problem as single objective or transform the multiple objectives into single objective. This paper presents a combinatorial multi-objective particle swarm optimization based (CMOPSO) algorithm to deal with the multiple conflicting objectives of task allocation problem simultaneously without transforming them to single objective. The performance of the algorithm is compared with a NSGA-II based task allocation algorithm; results manifest that the algorithm shows good performance under different problem scales and task interaction density.

Keywords

Task allocation MOPSO Combinatorial optimization problem Distributed computing system 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Attiya, G., Hamam, Y.: Task allocation for maximizing reliability of distributed systems: A simulated annealing approach. Journal of Parallel and Distributed Computing 66(10), 1259–1266 (2006)CrossRefzbMATHGoogle Scholar
  2. 2.
    Coello Coello, C.A., Lechuga, M.S.: MOPSO: a proposal for multiple objective particle swarm optimization. In: Proceedings of the Evolutionary Computation on 2002, CEC 2002, pp. 1051–1056. IEEE Computer Society, Washington, DC, USA (2002)Google Scholar
  3. 3.
    Ernst, A., Hiang, H., Krishnamoorthy, M.: Mathematical programming approaches for solving task allocation problems. In: Proceedings of the 16th National Conference of Australian Society of Operations Research, Australia (2001)Google Scholar
  4. 4.
    Hsieh, C.-C.: Optimal task allocation and hardware redundancy policies in distributed computing systems. European Journal of Operational Research 147(2), 430–447 (2003)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Jarboui, B., Ibrahim, S., Siarry, P., Rebai, A.: A combinatorial particle swarm optimisation for solving permutation flowshop problems. Computers and Industrial Engineering 54(3), 526–538 (2008)CrossRefGoogle Scholar
  6. 6.
    Kartik, S., Siva Ram Murthy, C.: Task allocation algorithms for maximizing reliability of distributed computing systems. IEEE Transaction on Computers 46, 719–724 (1997)CrossRefGoogle Scholar
  7. 7.
    Lee, C.-H., Shin, K.G.: Optimal task assignment in homogeneous networks. IEEE Transactions on Parallel and Distributed Systems 8, 119–129 (1997)CrossRefGoogle Scholar
  8. 8.
    Lin, M.-S., Chen, D.-J.: The computational complexity of the reliability problem on distributed systems. Information Processing Letters 64(3), 143–147 (1997)MathSciNetCrossRefzbMATHGoogle Scholar
  9. 9.
    Mostaghim, S., Teich, J.: Strategies for finding good local guides in multi-objective particle swarm optimization MOPSO. In: Proceedings of the IEEE, Symposium on Swarm Intelligence, pp. 26–33 (2003)Google Scholar
  10. 10.
    Ajith Tom, P., Siva Ram Murthy, C.: Optimal task allocation in distributed systems by graph matching and state space search. Journal of Systems and Software 46(1), 59–75 (1999)CrossRefGoogle Scholar
  11. 11.
    Page, A.J., Keane, T.M., Naughton, T.J.: A multi-heuristic dynamic task allocation using genetic algorithms in a heterogeneous distributed environment. International Journal of Parallel Distributed Computing 70, 758–766 (2010)CrossRefzbMATHGoogle Scholar
  12. 12.
    Shatz, S.M., Wang, J.-P., Goto, M.: Task allocation for maximizing reliability of distributed computer systems. IEEE Transaction on Computers 41, 1156–1168 (1992)CrossRefGoogle Scholar
  13. 13.
    Srinivasan, S., Jha, N.K.: Safety and reliability driven task allocation in distributed systems. IEEE Transactions on Parallel and Distributed Systems 10, 238–251 (1999)CrossRefGoogle Scholar
  14. 14.
    Tripathi, A.K., Sarker, B.K., Kumar, N.: A ga based multiple task allocation considering load. International Journal of High Speed Computing 11(4), 214–230 (2000)zbMATHGoogle Scholar
  15. 15.
    Yin, P.-Y., Yu, S.-S., Wang, P.-P., Wang, Y.-T.: Multi-objective task allocation in distributed computing systems by hybrid particle swarm optimization. Applied Mathematics and Computation 184(2), 407–420 (2007)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Yin, P.-Y., Yu, S.-S., Wang, P.-P., Wang, Y.-T.: Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization. Journal of System Software 80, 724–735 (2007)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Rahul Roy
    • 1
  • Madhabananda Das
    • 1
  • Satchidananda Dehuri
    • 2
  1. 1.Department of Computer Science EngineeringKIIT UniversityBhubaneswarIndia
  2. 2.Department of Information and Communication TechnologyFakir Mohan UniversityBalasoreIndia

Personalised recommendations