Trust-Driven and PSO-SFLA based job scheduling algorithm on Cloud
Xiaolan Xie, Ruikun Liu, Xiaochun Cheng, Xin Hu, Jinsheng Ni · Intelligent Automation & Soft Computing · 2016
With the advent of big data era, Cloud Computing has drawn widespread interests from industrial and academia. Job scheduling algorithm plays a crucial role in the paradigm of Cloud Computing. The well-designed job scheduling algorithms can provide fast, high quality and safe services. However, the conventional job scheduling algorithms are focusing on the improvement of efficiency, these obscure the important issue of trustworthiness in Cloud. This paper proposes a job scheduling algorithm with the consideration of efficiency and trustworthiness in Cloud. The intuition of the proposed algorithm is based on Particle Swarm Optimization (PSO) and Shuffled Frog Leaping Algorithm (SFLA). In this way, the proposed algorithm can avoid to obtain local optimal results. Also, the trust model is introduced to improve the trust of resources. The comprehensive simulations have been conducted via CloudSim. The experimental results have demonstrated that the proposed algorithm improve the trustworthiness than that of two classical compared algorithms GA and TDMin-Min, respectively.