{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T15:56:34Z","timestamp":1775145394008,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T00:00:00Z","timestamp":1674777600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"name":"The Department of Culture Studies, Religious Studies and Educational Sciences, University of G\u00e4vle, G\u00e4vle, Sweden","award":["No.61862051"],"award-info":[{"award-number":["No.61862051"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Cloud Comp"],"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Cloud computing is an extremely important infrastructure used to perform tasks over processing units. Despite its numerous benefits, a cloud platform has several challenges preventing it from carrying out an efficient workflow submission. One of these is linked to task scheduling. An optimization problem related to this is the maximal determination of cloud computing scheduling criteria. Existing methods have been unable to find the quality of service (QoS) limits of users- like meeting the economic restrictions and reduction of the makespan. Of all these methods, the Heterogeneous Earliest Finish Time (HEFT) algorithm produces the maximum outcomes for scheduling tasks in a heterogeneous environment in a reduced time. Reviewed literature proves that HEFT is efficient in terms of execution time and quality of schedule. The HEFT algorithm makes use of average communication and computation costs as weights in the DAG. In some cases, however, the average cost of computation and selecting the first empty slot may not be enough for a good solution to be produced. In this paper, we propose different HEFT algorithm versions altered to produce improved results. In the first stage (rank generation), we execute several methodologies to calculate the ranks, and in the second stage, we alter how the empty slots are selected for the task scheduling. These alterations do not add any cost to the primary HEFT algorithm, and reduce the makespan of the virtual machines\u2019 workflow submissions. Our findings suggest that the altered versions of the HEFT algorithm have a better performance than the basic HEFT algorithm regarding decreased schedule length of the workflow problems.\u00a0<\/jats:p>","DOI":"10.1186\/s13677-022-00374-7","type":"journal-article","created":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T16:03:52Z","timestamp":1674835432000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":28,"title":["Task scheduling in cloud environment: optimization, security prioritization and processor selection schemes"],"prefix":"10.1186","volume":"12","author":[{"given":"Tao","family":"Hai","sequence":"first","affiliation":[]},{"given":"Jincheng","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Dayang","family":"Jawawi","sequence":"additional","affiliation":[]},{"given":"Dan","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Uzoma","family":"Oduah","sequence":"additional","affiliation":[]},{"given":"Cresantus","family":"Biamba","sequence":"additional","affiliation":[]},{"given":"Sanjiv Kumar","family":"Jain","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,27]]},"reference":[{"key":"374_CR1","volume-title":"Parallel and Distributed Computing Handbook","author":"AY Zomaya","year":"1996","unstructured":"Zomaya AY (1996) Parallel and Distributed Computing Handbook. McGraw-Hill, New York"},{"issue":"6","key":"374_CR2","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1016\/j.future.2008.12.001","volume":"25","author":"R Buyya","year":"2009","unstructured":"Buyya R, Yeo CS, Venugopal S, Broberg J, Brandic I (2009) Cloud computing and emerging it platforms: Vision, hype, and reality for delivering computing as the 5th utility. Future Generation Comp Syst 25(6):599\u2013616","journal-title":"Future Generation Comp Syst"},{"key":"374_CR3","doi-asserted-by":"crossref","unstructured":"N. Tziritas, S. U. Khan, C.-Z. Xu, and J. Hong, (2012)\u201cAn optimal fully distributed algorithm to minimize the resource consumption of cloud applications,\u201d CoRR, vol. abs\/1206.6207, .","DOI":"10.1109\/ICPADS.2012.19"},{"key":"374_CR4","unstructured":"Mr. Prince Gupta, Dr. Rajeev Sharma, Dr. Sachi Gupta, (2021) \u201cResource Management, Issues, Challenges and Future Directions in Fog Computing: A Comprehensive Survey\u201d, Published in Design Engineering, ISSN: 0011\u20139342, , Issue: 7, Pages: 14580\u201314593."},{"key":"374_CR5","doi-asserted-by":"crossref","unstructured":"J. Li, Q. Li, S. Khan, and N. Ghani, (2011) \u201cCommunity-based cloud for emergency management,\u201d in Proc. SoSE, .","DOI":"10.1109\/SYSOSE.2011.5966573"},{"key":"374_CR6","first-page":"188","volume":"2","author":"SM Hashemi","year":"2012","unstructured":"Hashemi SM, Bardsiri AK (2012) Cloud computing vs. grid computing. ARPN J Syst Softw 2:188\u2013194","journal-title":"ARPN J Syst Softw"},{"issue":"1","key":"374_CR7","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1002\/spe.995","volume":"41","author":"RN Calheiros","year":"2011","unstructured":"Calheiros RN, Ranjan R, Beloglazov A, De Rose CAF, Buyya R (2011) Cloudsim: A toolkit for modelling and simulation of cloud computing environments and evaluation of resource provisioning algorithms. Softw Pract Exper 41(1):23\u201350","journal-title":"Softw Pract Exper"},{"key":"374_CR8","doi-asserted-by":"crossref","unstructured":"Gaurav Agarwal, Dr. Vikas Maheshkar, Dr. Sushila Maheshkar, Dr. Sachi Gupta, (2018) \u201cVocal Mood Recognition: Text Dependent Sequential and Parallel Approach\u201d, Published in International Conference on Signals, Machines and Automation (SIGMA\u201918), February 23\u201325, .","DOI":"10.1007\/978-981-13-1819-1_14"},{"issue":"7","key":"374_CR9","doi-asserted-by":"publisher","first-page":"1432","DOI":"10.1002\/cpe.3124","volume":"26","author":"KS Shin","year":"2014","unstructured":"Shin KS, Park M-J, Jung J-Y (2014) Dynamic task assignment and resource management in cloud services by using bargaining solution. Concurr Comput Pract Exp 26(7):1432\u20131452","journal-title":"Concurr Comput Pract Exp"},{"key":"374_CR10","doi-asserted-by":"crossref","unstructured":"E. U. Munir, S. Mohsin, A. Hussain, M.W. Nisar, and S. Ali, (2013) \u201cSDBATS: A novel algorithm for task scheduling in heterogeneous computing systems.\u201d in Proc. IEEE IPDPS Workshops (IPDPSW).","DOI":"10.1109\/IPDPSW.2013.259"},{"key":"374_CR11","unstructured":"Andrei Radulescu and Arjan J. C. van Gemund. (2000) Fast and effective task scheduling in Heterogeneous system. Proceedings of the 9th Heterogeneous Computing Workshop."},{"issue":"3","key":"374_CR12","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuouglu","year":"2002","unstructured":"Topcuouglu H, Hariri S, Wu M-Y (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distributed Syst 13(3):260\u2013274","journal-title":"IEEE Trans Parallel Distributed Syst"},{"key":"374_CR13","doi-asserted-by":"crossref","unstructured":"S. Gotoda, M. Ito, and N. Shibata, (2012) \u201cTask scheduling algorithm for multi-core processor system for minimizing recovery time in case of single node fault.\u201d in Proc. IEEE CCGRID, pp. 260\u2013267.","DOI":"10.1109\/CCGrid.2012.23"},{"key":"374_CR14","doi-asserted-by":"crossref","unstructured":"Sachi Gupta, Vikas Mittal and Gaurav Agarwal, \u201cTask Scheduling in Multiprocessor System Using Genetic Algorithm\u201d, in Proceedings of 2nd International Conference on Machine Learning and Computing (ICMLC-2010), ISBN: 9780769539775.","DOI":"10.1109\/ICMLC.2010.50"},{"key":"374_CR15","doi-asserted-by":"crossref","unstructured":"Sachi Gupta, Gaurav Agarwal and Vikas Mittal, (2013) \u201cAn Efficient and robust Genetic Algorithm for Multiprocessor Scheduling\u201d, in International Journal of Computer Theory and Engineering (IJCTE), Vol. 5, No.2, ISSN: 1793\u20138201.","DOI":"10.7763\/IJCTE.2013.V5.713"},{"key":"374_CR16","volume-title":"Genetic Algorithms in Search","author":"DC Goldberg","year":"1989","unstructured":"Goldberg DC (1989) Genetic Algorithms in Search. Wesley publishing, Optimization and Machine Learning. Add"},{"issue":"3","key":"374_CR17","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1007\/s11227-014-1090-4","volume":"68","author":"KL Jing Mei","year":"2014","unstructured":"Jing Mei KL, Li K (2014) A resource-aware scheduling algorithm with reduced task duplication on heterogeneous computing systems. J Supercomputer 68(3):1347\u20131377","journal-title":"J Supercomputer"},{"issue":"4","key":"374_CR18","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1016\/j.jpdc.2010.01.003","volume":"70","author":"X Tang","year":"2010","unstructured":"Tang X, Li K, Liao G, Li R (2010) List scheduling with duplication for heterogeneous computing systems. J Parallel Distributed Computing 70(4):323\u2013329","journal-title":"J Parallel Distributed Computing"},{"key":"374_CR19","volume-title":"Triplet. A clustering scheduling algorithm for heterogeneous systems. In proceedings of International Conference on Parallel Processing Workshop","author":"B Cirou","year":"2001","unstructured":"Cirou B, Jeannot E (2001) Triplet. A clustering scheduling algorithm for heterogeneous systems. In proceedings of International Conference on Parallel Processing Workshop"},{"issue":"5","key":"374_CR20","doi-asserted-by":"publisher","first-page":"755","DOI":"10.1007\/s10766-013-0289-y","volume":"42","author":"U Fiore","year":"2014","unstructured":"Fiore U, Palmieri F, Castiglione A, De Santis A (2014) A cluster-based data-centric model for network-aware task scheduling in distributed systems. Int J Parallel Program 42(5):755\u2013775","journal-title":"Int J Parallel Program"},{"key":"374_CR21","unstructured":"Gaurav Agarwal, Sachi Gupta, Praful Saxena and Saurabh Mukherjee, \u201cWeb Graph Based Ranking Algorithm for Search Engines\u201d, in Proceedings of International Conference on Network Communication and Computer (ICNCC-2011), ISBN: 9781424495504."},{"key":"374_CR22","unstructured":"Sachi Gupta, Saurabh Mukherjee and Gaurav Agarwal, \u201cList Scheduling Heuristic: Efficient Prioritization and Processor Selection Schemes for Heft Algorithm\u201d, in Proceedings of International Conference on Industrial Applications of Soft Computing Techniques (IIASCT-2011), ISBN: 9789381361221."},{"key":"374_CR23","doi-asserted-by":"crossref","unstructured":"Gaurav Agarwal, Sachi Gupta and Saurabh Mukherjee, \u201cWeb Graph Based Search by Using Density of Keywords and Age Factor\u201d, in Proceedings of International Conference on Computer Science and Information Technology (ICCSIT-2012), ISBN: 9789381693766.","DOI":"10.47893\/IJCSI.2013.1124"},{"issue":"3","key":"374_CR24","doi-asserted-by":"publisher","first-page":"682","DOI":"10.1109\/TPDS.2013.57","volume":"25","author":"H Arabnejad","year":"2013","unstructured":"Arabnejad H, Barbosa J (2013) List Scheduling Algorithm for Heterogeneous Systems by an Optimistic Cost Table. Parallel and Distributed Systems, IEEE Transactions on 25(3):682\u2013694","journal-title":"Parallel and Distributed Systems, IEEE Transactions on"},{"key":"374_CR25","doi-asserted-by":"crossref","unstructured":"E. Ilavarasan, P. Thambidurai, and R. Mahilmannan, (2005) \u201cPerformance effective task scheduling algorithm for heterogeneous computing system.\u201d in Proc. ISPDC. IEEE Computer Society\u00a0pp. 28\u201338.","DOI":"10.1007\/11564621_22"},{"issue":"3","key":"374_CR26","doi-asserted-by":"publisher","first-page":"2152","DOI":"10.1016\/j.jpdc.2013.12.004","volume":"74","author":"HM Fard","year":"2014","unstructured":"Fard HM, Prodan R, Fahringer T (2014) Multi-objective list scheduling of workflow applications in distributed computing infrastructures. J Parallel Distributed Comp 74(3):2152\u20132165","journal-title":"J Parallel Distributed Comp"},{"key":"374_CR27","doi-asserted-by":"publisher","unstructured":"Fard HM, Prodan R, Barrionuevo JJD, Fahringer T (2012) \"A Multi-objective Approach for Workflow Scheduling in Heterogeneous Environments,\" 2012 12th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing (ccgrid 2012), Ottawa, ON, Canada, pp. 300-309. https:\/\/doi.org\/10.1109\/CCGrid.2012.114","DOI":"10.1109\/CCGrid.2012.114"},{"key":"374_CR28","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1155\/2014\/465702","volume":"2014","author":"Y Dai","year":"2014","unstructured":"Dai Y, Zhang X (2014) A Synthesized Heuristic Task Scheduling Algorithm. Scientific World J 2014:9","journal-title":"Scientific World J"},{"key":"374_CR29","first-page":"185","volume-title":"\u201cTask execution time modelling for heterogeneous computing systems.\u201d in Heterogeneous Computing Workshop","author":"S Ali","year":"2000","unstructured":"Ali S, Siegel HJ, Maheswaran M, Hensgen DA, Ali S (2000) \u201cTask execution time modelling for heterogeneous computing systems.\u201d in Heterogeneous Computing Workshop. pp 185\u2013199"},{"key":"374_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/s13198-021-01394-3","author":"G Agarwal","year":"2021","unstructured":"Agarwal G, Om H (2021) Parallel training models of deep belief network using MapReduce for the classifications of emotions. Int J Syst Assur Eng Manag. https:\/\/doi.org\/10.1007\/s13198-021-01394-3","journal-title":"Int J Syst Assur Eng Manag"}],"container-title":["Journal of Cloud Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00374-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1186\/s13677-022-00374-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1186\/s13677-022-00374-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,27]],"date-time":"2023-01-27T16:05:47Z","timestamp":1674835547000},"score":1,"resource":{"primary":{"URL":"https:\/\/journalofcloudcomputing.springeropen.com\/articles\/10.1186\/s13677-022-00374-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,27]]},"references-count":30,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,12]]}},"alternative-id":["374"],"URL":"https:\/\/doi.org\/10.1186\/s13677-022-00374-7","relation":{},"ISSN":["2192-113X"],"issn-type":[{"value":"2192-113X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,1,27]]},"assertion":[{"value":"30 August 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 September 2022","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 January 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The research has consent for Ethical Approval and Consent to participate.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethics approval and consent to participate"}},{"value":"Consent has been granted by all authors and there is no conflict.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Consent for publication"}},{"value":"There are no competing interests.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}],"article-number":"15"}}