Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2014, Article ID 151394, 13 pages
http://dx.doi.org/10.1155/2014/151394
Research Article

Simulated Annealing Algorithm Combined with Chaos for Task Allocation in Real-Time Distributed Systems

College of Information System and Management, National University of Defense Technology, Changsha, Hunan 410073, China

Received 17 May 2014; Revised 24 July 2014; Accepted 3 August 2014; Published 14 August 2014

Academic Editor: Jun-Juh Yan

Copyright © 2014 Wenbo Wu et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. C. H. Lee and K. G. Shin, “Optimal task assignment in homogeneous networks,” IEEE Transactions on Parallel and Distributed Systems, vol. 8, no. 2, pp. 119–129, 1997. View at Publisher · View at Google Scholar · View at Scopus
  2. T. P. Ajith and C. S. R. Murthy, “Optimal task allocation in distributed systems by graph matching and state space search,” Journal of Systems and Software, vol. 46, no. 1, pp. 59–75, 1999. View at Publisher · View at Google Scholar · View at Scopus
  3. G. Attiya and Y. Hamam, “Static task assignment in distributed computing systems,” in Proceedings of the 21st IFIP TC7 Conference on System Modeling and Optimization, 2003.
  4. M. Kafil and I. Ahmad, “Optimal task assignment in heterogeneous distributed computing systems,” IEEE Concurrency, vol. 6, no. 3, pp. 42–51, 1998. View at Publisher · View at Google Scholar · View at Scopus
  5. G. Attiya and Y. Hamam, “Optimal allocation of tasks onto networked heterogeneous computers using minimax criterion,” in Proceedings of the International Network Optimization Conference (INOC '03), Paris, France, 2003.
  6. S. Kartik and C. S. R. Murthy, “Improved task-allocation algorithms to maximize reliability of redundant distributed computing systems,” IEEE Transactions on Reliability, vol. 44, no. 4, pp. 575–586, 1995. View at Publisher · View at Google Scholar · View at Scopus
  7. C. Hsieh, “Optimal task allocation and hardware redundancy policies in distributed computing systems,” European Journal of Operational Research, vol. 147, no. 2, pp. 430–447, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  8. V. K. P. Kumar, S. Hariri, and C. S. Raghavendra, “Distributed program reliability analysis,” IEEE Transactions on Software Engineering, vol. 12, no. 1, pp. 42–50, 1986. View at Publisher · View at Google Scholar · View at Scopus
  9. S. M. Shatz and J. Wang, “Models and algorithms for reliability-oriented task-allocation in redundant distributed-computer systems,” IEEE Transactions on Reliability, vol. 38, no. 1, pp. 16–27, 1989. View at Publisher · View at Google Scholar · View at Scopus
  10. A. Kumar and D. P. Agrawal, “Generalized algorithm for evaluating distributed-program reliability,” IEEE Transactions on Reliability, vol. 42, no. 4, pp. 416–426, 1993. View at Publisher · View at Google Scholar · View at Scopus
  11. P. A. Tom and C. S. R. Murthy, “Algorithms for reliability-oriented module allocation in distributed computing systems,” Journal of Systems and Software, vol. 40, no. 2, pp. 125–138, 1998. View at Publisher · View at Google Scholar · View at Scopus
  12. C. C. Chiu, Y. S. Yeh, and J. S. Chou, “A fast algorithm for reliability-oriented task assignment in a distributed system,” Computer Communications, vol. 25, no. 17, pp. 1622–1630, 2002. View at Publisher · View at Google Scholar · View at Scopus
  13. A. O. Charles Elegbede, C. Chu, K. H. Adjallah, and F. Yalaoui, “Reliability allocation through cost minimization,” IEEE Transactions on Reliability, vol. 52, no. 1, pp. 106–111, 2003. View at Publisher · View at Google Scholar · View at Scopus
  14. C. Hsieh and Y. Hsieh, “Reliability and cost optimization in distributed computing systems,” Computers & Operations Research, vol. 30, no. 8, pp. 1103–1119, 2003. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  15. D. P. Vidyarthi and A. K. Tripathi, “Maximizing reliability of distributed computing system with task allocation using simple genetic algorithm,” Journal of Systems Architecture, vol. 47, no. 7, pp. 549–554, 2001. View at Publisher · View at Google Scholar · View at Scopus
  16. G. Attiya and Y. Hamam, “Task allocation for maximizing reliability of distributed systems: a simulated annealing approach,” Journal of Parallel and Distributed Computing, vol. 66, no. 10, pp. 1259–1266, 2006. View at Publisher · View at Google Scholar · View at Scopus
  17. P. Yin, S. S. Yu, P. P. Wang, and Y. T. Wang, “Task allocation for maximizing reliability of a distributed system using hybrid particle swarm optimization,” Journal of Systems and Software, vol. 80, no. 5, pp. 724–735, 2007. View at Publisher · View at Google Scholar · View at Scopus
  18. Q. M. Kang, H. He, H. M. Song, and R. Deng, “Task allocation for maximizing reliability of distributed computing systems using honeybee mating optimization,” Journal of Systems and Software, vol. 83, no. 11, pp. 2165–2174, 2010. View at Publisher · View at Google Scholar · View at Scopus
  19. R. Shojaee, H. R. Faragardi, S. Alaee, and N. Yazdani, “A new Cat Swarm Optimization based algorithm for reliability-oriented task allocation in distributed systems,” in Proceedings of the 6th International Symposium on Telecommunications (IST '12), pp. 861–866, IEEE, Tehran, Iran, November 2012. View at Publisher · View at Google Scholar · View at Scopus
  20. Q. M. Kang, H. He, and J. Wei, “An effective iterated greedy algorithm for reliability-oriented task allocation in distributed computing systems,” Journal of Parallel and Distributed Computing, vol. 73, no. 8, pp. 1106–1115, 2013. View at Publisher · View at Google Scholar · View at Scopus
  21. C. Blum and A. Roli, “Metaheuristics incombinatorial optimization: overview and conceptual comparision,” IEEE Transactions on Evolutionary Computation, vol. 32, no. 1, pp. 48–77, 2003. View at Google Scholar
  22. N. Metropolis, A. W. Rosenbluth, M. N. Rosenbluth, A. H. Teller, and E. Teller, “Equation of state calculations by fast computing machines,” The Journal of Chemical Physics, vol. 21, no. 6, pp. 1087–1092, 1953. View at Google Scholar · View at Scopus
  23. B. Liu, L. Wang, Y. Jin, F. Tang, and D. Huang, “Improved particle swarm optimization combined with chaos,” Chaos, Solitons and Fractals, vol. 25, no. 5, pp. 1261–1271, 2005. View at Publisher · View at Google Scholar · View at Scopus
  24. L. Wnag, D. Z. Zheng, and Q. S. Lin, “Survey on chaotic optimization methods,” Computing Technology and Automation, vol. 20, no. 1, pp. 1–5, 2001 (Chinese). View at Google Scholar
  25. S. Kirkpatrick, J. Gelatt, and M. P. Vecchi, “Optimization by simulated annealing,” Science, vol. 220, no. 4598, pp. 671–680, 1983. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. P. J. M. van Laarhoven, E. H. L. Aarts, and J. K. Lenstra, “Job shop scheduling by simulated annealing,” Operations Research, vol. 40, no. 1, pp. 113–125, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. P. Eles, Z. Peng, K. Kuchcinski, and A. Doboli, “System level hardware/software partitioning based on simulated annealing and tabu search,” Design Automation for Embedded Systems, vol. 2, no. 1, pp. 5–32, 1997. View at Publisher · View at Google Scholar · View at Scopus
  28. T. Wiangtong, P. K. Cheung, and W. Luk, “Comparing three heuristic search methods for functional partitioning in hardware-software codesign,” Design Automation for Embedded Systems, vol. 6, no. 4, pp. 425–449, 2002. View at Publisher · View at Google Scholar · View at Scopus
  29. F. Ferrandi, P. L. Lanzi, C. Pilato, D. Sciuto, and A. Tumeo, “Ant colony heuristic for mapping and scheduling tasks and communications on heterogeneous embedded systems,” IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, vol. 29, no. 6, pp. 911–924, 2010. View at Publisher · View at Google Scholar · View at Scopus
  30. H. R. Faragardi, R. Shojaee, and N. Yazdani, “Reliability-aware task allocation in distributed computing systems using hybrid simulated annealing and tabu search,” in Proceedings of the IEEE 9th International Conference on High Performance Computing and Communication, pp. 1088–1095, IEEE, Liverpool, UK, 2012.
  31. H. R. Faragardi, R. Shojaee, M. A. Keshtkar, and H. Tabani, “Optimal task allocation for maximizing reliability in distributed real-time systems,” in Proceedings of the IEEE/ACIS 12th International Conference on Computer and Information Science (ICIS '13), pp. 513–519, IEEE, Niigata, Japan, 2013.
  32. L. Chen and K. Aihara, “Chaotic simulated annealing by a neural network model with transient chaos,” Neural Networks, vol. 8, no. 6, pp. 915–930, 1995. View at Publisher · View at Google Scholar · View at Scopus
  33. S. Talatahari, B. Farahmand Azar, R. Sheikholeslami, and A. H. Gandomi, “Imperialist competitive algorithm combined with chaos for global optimization,” Communications in Nonlinear Science and Numerical Simulation, vol. 17, no. 3, pp. 1312–1319, 2012. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet · View at Scopus
  34. L. Chen and K. Aihara, “Combinatorial optimization by chaotic dynamics,” in Proceedings of the IEEE International Conference on Systems, Man, and Cybernetics, pp. 2921–2926, IEEE, Orlando, Fla, USA, October 1997. View at Scopus
  35. L. Wang and K. Smith, “On chaotic simulated annealing,” IEEE Transactions on Neural Networks, vol. 9, no. 4, pp. 716–718, 1998. View at Publisher · View at Google Scholar · View at Scopus
  36. L. Wang and F. Tian, “Noisy chaotic neural networks for solving combinatorial optimization problems,” in Proceedings of the IEEE-INNS-ENNS International Joint Conference on Neural Networks (IJCNN '00), vol. 4, pp. 37–40, IEEE, Como, Italy, 2000. View at Publisher · View at Google Scholar
  37. K. Masuda and E. Aiyoshi, “Solution to combinatorial problems by using chaotic global optimization method on a simplex,” in Proceedings of the 41st SICE Annual Conference, pp. 1313–1318, IEEE, 2002.
  38. J. Mingjun and T. Huanwen, “Application of chaos in simulated annealing,” Chaos, Solitons and Fractals, vol. 21, no. 4, pp. 933–941, 2004. View at Publisher · View at Google Scholar · View at Scopus
  39. K. Ferens and D. Cook, “Chaotic walk in simulated annealing search space for task allocation in a multiprocessing system,” International Journal of Cognitive Informatics and Natural Intelligence, vol. 7, no. 3, pp. 58–79, 2013. View at Google Scholar
  40. S. Kartik and C. S. R. Murthy, “Task allocation algorithms for maximizing reliability of distributed computing systems,” IEEE Transactions on Computers, vol. 46, no. 6, pp. 719–724, 1997. View at Publisher · View at Google Scholar · View at Scopus
  41. B. Hajek, “Cooling schedules for optimal annealing,” Mathematics of Operations Research, vol. 13, no. 2, pp. 311–329, 1988. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus