Towards Scheduling Data-Intensive and Privacy-Aware Workflows in Clouds

  • Yiping WenEmail author
  • Wanchun Dou
  • Buqing Cao
  • Congyang Chen
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 201)


Nowadays, business or scientific workflows with a massive of data are springing up in clouds. To avoid security and privacy leakage issues, users’ privacy or sensitive data may be restricted to being processed in some specified and trusted cloud datacenters. Meanwhile, users may also pay attention to the cost incurred by renting cloud resources. Therefore, new workflow scheduling algorithms should be developed to achieve a balance between economically utilizing the cloud resources and protection of users’ data privacy and security. In this paper, we propose a cost-aware scheduling algorithm for executing multiple data-intensive and privacy-aware workflow instances in clouds. Our proposed algorithm is based on the strategy of batch processing, the ideas of simulated annealing algorithm and the particle swarm optimization, the coding strategy of which is devised to minimize the total execution cost while meeting specified privacy protection constraints. The experimental results demonstrate the effectiveness of our algorithm.


Privacy protection Cloud Workflow scheduling Cost Batch processing Particle swarm optimization 



This paper was supported by National Natural Science Fund of China, under grant number 61402167, 61572187, 61402168, and National Science and Technology Support Project of China, under grant number 2015BAF32B01.


  1. 1.
    Smanchat, S., Viriyapant, K.: Taxonomies of workflow scheduling problem and techniques in the cloud. Future Gener. Comput. Syst. 52, 1–12 (2015)CrossRefGoogle Scholar
  2. 2.
    Chen, C., Liu, J., Wen, Y., Chen, J., Zhou, D.: A hybrid genetic algorithm for privacy and cost aware scheduling of data intensive workflow in cloud. In: Wang, G., Zomaya, A., Perez, G.M., Li, K. (eds.) ICA3PP 2015. LNCS, vol. 9528, pp. 578–591. Springer, Cham (2015). doi: 10.1007/978-3-319-27119-4_40 CrossRefGoogle Scholar
  3. 3.
    Kennedy, J., Eberhart, R.: Particle swarm optimization. In: Proceedings of IEEE International Conference on Neutral Networks. pp. 1942–1948. IEEE Service Center, Piscataway (1995)Google Scholar
  4. 4.
    Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)MathSciNetCrossRefzbMATHGoogle Scholar
  5. 5.
    Li, Z.J., Ge, J.D., Yang, H.J., Huang, L.G., Hu, H.Y., Hu, H., Luo, B.: A security and cost aware scheduling algorithm for heterogeneous tasks of scientific workflow in clouds. Future Gener. Comput. Syst. 65, 140–152 (2016)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2017

Authors and Affiliations

  • Yiping Wen
    • 1
    • 2
    Email author
  • Wanchun Dou
    • 1
  • Buqing Cao
    • 2
  • Congyang Chen
    • 2
  1. 1.State Key Laboratory for Novel Software TechnologyNanjing UniversityNanjingChina
  2. 2.Key Laboratory of Knowledge Processing and Networked ManufactureHunan University of Science and TechnologyXiangtanChina

Personalised recommendations