Skip to main content

Workflow Task Scheduling Algorithm Based on IFCM and IACO

  • Conference paper
  • First Online:
  • 1886 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNISA,volume 11064))

Abstract

To solve the scheduling problem of workflow tasks in cloud computing, this paper combined the improved fuzzy c-means clustering algorithm (IFCM) and the improved ant colony optimization algorithm (IACO) and proposed a new workflow task scheduling algorithm. Firstly, the proposed algorithm used the IFCM to classify resources. Then, tasks will be sorted by their priority. Based on the results of resource clustering and the distance between resources and expect of tasks, tasks will be assigned to the appropriate resources and the scheduling will be initialized. After that, the workflow tasks will be encoded based on the initial scheduling. At last, ant colony optimization algorithm will be improved by the cross and mutation operation in genetic algorithm and used to search optimal schedules. The experiments showed that the proposed algorithm could quickly and efficiently find appropriate scheduling scheme, effectively reduce the time span of workflow tasks and increase the utilization of resources.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Calheiros, R.N., Ranjan, R., Beloglazov, A., Rose, C.A.F.D., Buyya, R.: CloudSim: a toolkit for modeling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw. Pract. Exp. 41(1), 23–50 (2010)

    Article  Google Scholar 

  2. Chauhan, J.: Simulation and performance evaluation of hadoop capacity scheduler. MapReduce, MRPERF, Capacity Scheduler (2013)

    Google Scholar 

  3. Dorigo, M., Maniezzo, V., Colorni, A.: Ant system: optimization by a colony of cooperating agents. IEEE Trans. Syst. Man Cybern. Part B Cybern. 26(1), 29 (1996). A Publication of the IEEE Systems Man and Cybernetics Society

    Article  Google Scholar 

  4. Huang, X., Du, B., Sun, L., Chen, F., Dai, W.: Service requirement conflict resolution based on ant colony optimization in group-enterprises-oriented cloud manufacturing. Int. J. Adv. Manuf. Technol. 84(1–4), 183–196 (2016)

    Article  Google Scholar 

  5. Kaur, P., Mehta, S.: Resource provisioning and work flow scheduling in clouds using augmented shuffled frog leaping algorithm. J. Parallel Distrib. Comput. 101(2017), 41–50 (2017). Academic Press, Inc.

    Article  Google Scholar 

  6. Lo, S.C., Cheng, Y.W.: Improving the performance of fair scheduler in hadoop. Adv. Sci. Technol. Eng. Syst. J. 2(3), 1050–1058 (2017)

    Article  MathSciNet  Google Scholar 

  7. Lv, Y.: An efficient and scalable density-based clustering algorithm for datasets with complex structures. Neurocomputing 171(C), 9–22 (2016)

    Article  Google Scholar 

  8. Ma, T., et al.: LED: a fast overlapping communities detection algorithm based on structural clustering. Neurocomputing 207, 488–500 (2016)

    Article  Google Scholar 

  9. Ma, T., Ying, C., Ying, C., Tian, Y., Al-Dhelaan, A., Al-Rodhaan, M.: Detect structural-connected communities based on BSCHEF in C-DBLP. Concurr. Comput. Pract. Exp. 28(2), 311–330 (2016)

    Article  Google Scholar 

  10. Ma, T., et al.: KDVEM : a k-degree anonymity with vertex and edge modification algorithm. Computing 97(12), 1165–1184 (2015)

    Article  MathSciNet  Google Scholar 

  11. Sinha, N., Srivastav, V., Ahmad, W.: Deadline constrained workflow scheduling optimization by initial seeding with ant colony optimization. Int. J. Comput. Appl. 155(14), 24–29 (2016)

    Google Scholar 

  12. Rodriguez, M.A., Buyya, R.: Deadline based resource provisioningand scheduling algorithm for scientific workflows on clouds. IEEE Trans. Cloud Comput. 2(2), 222–235 (2014)

    Article  Google Scholar 

  13. Rong, H., Ma, T., Tang, M., Cao, J.: A novel subgraph \(k^{+}\) -isomorphism method in social network based on graph similarity detection. Soft Comput. 7, 1–19 (2017)

    Google Scholar 

  14. Yu, J., Xiao, X., Zhang, Y.: From concept to implementation: the development of the emerging cloud computing industry in china. Telecommun. Policy 40(2–3), 130–146 (2016)

    Article  Google Scholar 

  15. Zhang, X., Hu, B., Jiang, J.: An optimized algorithm for reduce task scheduling. J. Comput. 9(4), 965–970 (2014)

    Google Scholar 

  16. Zuo, L., Shu, L., Dong, S., Zhu, C., Hara, T.: A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing. IEEE Access 3, 2687–2699 (2015)

    Article  Google Scholar 

Download references

Acknowledgement

This work was supported in part by National Science Foundation of China (No. 61572259, No. U1736105) and Special Public Sector Research Program of China (No. GYHY201506080) and was also supported by PAPD.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Tinghuai Ma .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2018 Springer Nature Switzerland AG

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Liu, Q., Ma, T., Li, J., Shen, W. (2018). Workflow Task Scheduling Algorithm Based on IFCM and IACO. In: Sun, X., Pan, Z., Bertino, E. (eds) Cloud Computing and Security. ICCCS 2018. Lecture Notes in Computer Science(), vol 11064. Springer, Cham. https://doi.org/10.1007/978-3-030-00009-7_35

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-00009-7_35

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-00008-0

  • Online ISBN: 978-3-030-00009-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics