LPSO: Another Algorithm for Workflow Scheduling in the Cloud
Toan Phan Thanh1, Loc Nguyen The1, Said Elnaffar2 & Cuong Nguyen Doan3 Show affiliations
- Hanoi National University of Education, Vietnam
- American University of RAK, United Arab Emirates
- Military Institute of Science and Technology, Vietnam
Journal of Computer Science, Volume 12, Issue 12, pp. 611–617 · doi.org/10.3844/jcssp.2016.611.617
Abstract
Although workflow scheduling problem has been discussed by many researchers, a few efficient solutions have been introduced for Cloud computing. In this article, we present LPSO, a novel algorithm for workflow scheduling. Based on the Particle Swarm Optimization method, our proposed algorithm not only ensures the fast convergence but also avoid being trapped on local extrema. Our simulation experiments using CloudSim testing real scenarios reveal that LPSO is superior to formerly proposed algorithms. Moreover, the deviation between the solution found by LPSO and the optimal solution is negligible.
Licence and reuse
Open access. This article is licensed under a Creative Commons Attribution 3.0 Licence (CC BY 3.0), as printed on the article, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original authors and the source. No permission is needed.
How to reuse this articleResponses (0)
About this article
Thanh, T. P., The, L. N., Elnaffar, S. & Doan, C. N. (2016). LPSO: Another Algorithm for Workflow Scheduling in the Cloud. Journal of Computer Science, 12(12), 611–617. https://doi.org/10.3844/jcssp.2016.611.617
- Licence
- CC BY 3.0
- Issue
- Volume 12, Issue 12
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record
