nach oben

Erschienen in:

06.05.2023

A Pair-Task Heuristic for Scheduling Tasks in Heterogeneous Multi-cloud Environment

verfasst von: Kamalam Gobichettipalayam Krishnasamy, Suresh Periasamy, Keerthika Periasamy, V. Prasanna Moorthy, Gunasekaran Thangavel, Ravita Lamba, Suresh Muthusamy

Erschienen in: Wireless Personal Communications | Ausgabe 2/2023

Einloggen

Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.

search-config

KI-gestützte Suche

Aus

Abstract

Heterogeneous multi-cloud environments make use of a collection of diverse performance rich cloud resources, linked with huge-speed, performs varied applications which are of computational nature. Applications in the multi-cloud environment require distinct computational features for processing. Heterogeneous multi-cloud domain well suits to satisfy the computational need of very big diverse nature of collection of tasks. Scheduling tasks to distributed heterogeneous clouds is termed NP-complete which leads to the ultimate establishment of heuristic problem solving technique. Identifying the heuristic which is appropriate and best still exists as a complicated problem. In this paper, to address scheduling collection of ‘n’ tasks in two groups among a set of 'm' clouds, three heuristicsPair-Task Threshold Limit (PTL), PTMax-Min, and PTMin-Max are proposed. Firstly, proposedheuristics calculate tasks threshold valuebased on the tasks attributes to determine the tasks scheduling order and then tasks are sorted in descending order of threshold value. Group 1 comprises ([n/2]) tasks ordered in descending value of threshold. Group 2 comprises remaining tasks ([n/2] − 1) ordered in ascending value of threshold. Secondly, tasks form group 1 are scheduled first based on minimum completion time, and then tasks in group 2 are scheduled. The proposed heuristicsare compared with existing heuristics, namely MCT, MET, Min-Min using benchmark dataset. The proposed approaches PTL, PTMax-Min, and PTMin-Max explicitly shows the better results in terms of reduced makespan, completion time, response time and more resource utilization compared to MCT, MET, and Min-min.

Vorheriger Artikel Comparative Analysis of Machine Learning Algorithms in Breast Cancer Classification

Nächster Artikel Low Complexity and Low Memory Compression Algorithm for Hyperspectral Image Sensors

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Online-Abonnement

Mit Springer Professional "Technik" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 390 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Maschinenbau + Werkstoffe

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft+Technik"

Online-Abonnement

Mit Springer Professional "Wirtschaft+Technik" erhalten Sie Zugriff auf:

über 102.000 Bücher
über 537 Zeitschriften

aus folgenden Fachgebieten:

Automobil + Motoren
Bauwesen + Immobilien
Business IT + Informatik
Elektrotechnik + Elektronik
Energie + Nachhaltigkeit
Finance + Banking
Management + Führung
Marketing + Vertrieb
Maschinenbau + Werkstoffe
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Springer Professional "Wirtschaft"

Online-Abonnement

Mit Springer Professional "Wirtschaft" erhalten Sie Zugriff auf:

über 67.000 Bücher
über 340 Zeitschriften

aus folgenden Fachgebieten:

Bauwesen + Immobilien
Business IT + Informatik
Finance + Banking
Management + Führung
Marketing + Vertrieb
Versicherung + Risiko

Jetzt Wissensvorsprung sichern!

Jetzt informieren

Manasrah, A. M., & Ali, H. B. (2018). Workflow scheduling using Hybrid GA-PSO algorithm in cloud computing. Wireless Communications and Mobile Computing. https://doi.org/10.1155/2018/1934784CrossRef

Singh, L., & Singh, S. (2014). Deadline and cost based ant colony optimization algorithm for scheduling workflow applications in hybrid cloud. Journal of Scientific & Engineering Research, 5(10), 1417–1420.

Vasanthi, S. G. R., Madhu Bharathi, M., Sentamilselvan, K., Priyadharshini, P., Subiramoniyan, S., & Jenopaul, P. (2021). LBMM in cloud computing. Annals of the Romanian Society for Cell Biology., 25(5), 1530–1536.

Kamalam, G. K., & Sentamilselvan, K. (2019). Limit value task scheduling (LVTS): An efficient task scheduling algorithm for distributed computing environment. International Journal Recent Technology and Engineering, 8(4), 10457–10462. https://doi.org/10.35940/ijrte.d9228.118419CrossRef

Sentamilselvan, K., & Kamalam, G. K. (2019). Potential finish time and min-mean algorithm for allocating meta-tasks on distributed computational grid. International Journal Recent Technology and Engineering, 8(4), 10580–10586. https://doi.org/10.35940/ijrte.d8449.118419CrossRef

Kamalam, G.K., Sentamilselvan, K., (2020) SLA-Based Group Tasks Max-Min (GTMax-Min) Algorithm for Task Scheduling in Multi-Cloud Environments, in EAI/Springer Innovations in Communication and Computing, Springer, Cham, pp. 105–127

Awad, A. I., El-Hefnawy, N. A., & Abdel-Kader, H. M. (2015). Enhanced particle swarm optimization for task scheduling in cloud computing environments. Procedia Computer Science, 65, 920–929. https://doi.org/10.1016/j.procs.2015.09.064CrossRef

Elsherbiny, S., Eldaydamony, E., Alrahmawy, M., & Reyad, A. E. (2018). An extended Intelligent Water Drops algorithm for workflow scheduling in cloud computing environment. Egypt. Informatics J., 19(1), 33–55. https://doi.org/10.1016/j.eij.2017.07.001CrossRef

Lewis, H. R. (1983). Review of ‘computers and intractability. A guide to the theory of NP-completeness.’ Journal of Symbolic Logic, 48(2), 498–500.CrossRef

10.

Haidri, R. A., Katti, C. P., & Saxena, P. C. (2020). Cost effective deadline aware scheduling strategy for workflow applications on virtual machines in cloud computing. Journal of King Saud University-Computer and Information Sciences, 32(6), 666–683. https://doi.org/10.1016/j.jksuci.2017.10.009CrossRef

11.

Kalra, M., & Singh, S. (2015). A review of metaheuristic scheduling techniques in cloud computing. Egyptian Informatics Journal., 16(3), 275–295. https://doi.org/10.1016/j.eij.2015.07.001CrossRef

12.

Pang, S., Li, W., He, H., Shan, Z., & Wang, X. (2019). An EDA-GA Hybrid Algorithm for Multi-Objective Task Scheduling in Cloud Computing. IEEE Access, 7, 146379–146389. https://doi.org/10.1109/ACCESS.2019.2946216CrossRef

13.

Yu, S., Li, K., & Xu, Y. (2018). A DAG task scheduling scheme on heterogeneous cluster systems using discrete IWO algorithm. Journal of Computer Science, 26, 307–317. https://doi.org/10.1016/j.jocs.2016.09.008CrossRef

14.

Kamalam, G. K. (2016). Sort completion time mean tasks scheduling algorithm in decentralized grid environment. Asian J. Inf. Technol., 15(12), 1957–1963. https://doi.org/10.3923/ajit.2016.1957.1963CrossRef

15.

Kamalam, G. K., & Bhaskaran, V. M. (2010). An improved minmean heuristic scheduling algorithm for mapping independent tasks on heterogenous computing environment. Journal of Computational cognition., 8(4), 85–91.

16.

Kamalam, G. K. (2014). Resource fitness task scheduling algorithm for scheduling tasks on heterogeneous grid environment. Australian Journal of Basic and Applied Sciences, 8(18), 128–135.

17.

Gao, H., Miao, H., Liu, L., Kai, J., & Zhao, K. (2018). Automated quantitative verification for service-based system design: A visualization transform tool perspective. International Journal of Software Engineering and Knowledge Engineering, 28(10), 1369–1397. https://doi.org/10.1142/S0218194018500390CrossRef

18.

Yin, Y., Chen, L., Xu, Y., Wan, J., Zhang, H., & Mai, Z. (2020). QoS prediction for service recommendation with deep feature learning in edge computing environment. Mobile Networks and Applications, 25(2), 391–401. https://doi.org/10.1007/s11036-019-01241-7CrossRef

19.

Zuo, L., Shu, L., Dong, S., Zhu, C., & Hara, T. (2015). A multi-objective optimization scheduling method based on the ant colony algorithm in cloud computing. IEEE Access, 3, 2687–2699. https://doi.org/10.1109/ACCESS.2015.2508940CrossRef

20.

Gao, H., Huang, W., Yang, X., Duan, Y., & Yin, Y. (2018). Toward service selection for workflow reconfiguration: An interface-based computing solution. Future Generation Computer Systems, 87, 298–311. https://doi.org/10.1016/j.future.2018.04.064CrossRef

21.

Yin, Y., Xu, Y., Xu, W., Gao, M., Yu, L., & Pei, Y. (2017). Collaborative service selection via ensemble learning in mixed mobile network environments. Entropy, 19(7), 358. https://doi.org/10.3390/e19070358CrossRef

22.

Konjaang, J. K., & Xu, L. (2021). Multi-objective workflow optimization strategy (MOWOS) for cloud computing. J. Cloud Comput., 10(1), 1–19. https://doi.org/10.1186/s13677-020-00219-1CrossRef

23.

Kiruthiga, G., & Mary Vennila, S. (2021). Multi-objective task scheduling using chaotic quantum-behaved chicken swarm optimization (cqcso) in cloud computing environment. Lecture Notes on Data Engineering and Communications Technologies, 53, 803–814.CrossRef

24.

Liu, G., Li, J., & Xu, J. (2013). An improved min-min algorithm in cloud computing. Advances in Intelligent Systems and Computing, 191(AISC), 47–52. https://doi.org/10.1007/978-3-642-33030-8_8CrossRef

25.

Kamolov, N. B., & Choe, T. Y. (2015). Dynamic task scheduling algorithm based on ant colony scheme. Int. J. Eng. Technol., 7(4), 1163–1172.

26.

Chaudhary, N., Kalra, M., Scholar, P.G., (2017) An improved Harmony Search algorithm with group technology model for scheduling workflows in cloud environment. in 2017 4th IEEE Uttar Pradesh Section International Conference on Electrical, Computer and Electronics, UPCON 2017, 2018-Janua, pp. 73–77, doi: https://doi.org/10.1109/UPCON.2017.8251025.

27.

Rimal, B. P., & Maier, M. (2017). Workflow scheduling in multi-tenant cloud computing environments. IEEE Transactions on Parallel and Distributed Systems, 28(1), 290–304. https://doi.org/10.1109/TPDS.2016.2556668CrossRef

28.

Li, Y., Zhu, Z., Wang, Y., (2018) MIN-Max-Min: A heuristic scheduling algorithm for jobs across geo-distributed datacenters. in Proceedings–International Conference on Distributed Computing Systems, 2018-July, pp. 1573–1574, doi: https://doi.org/10.1109/ICDCS.2018.00173.

29.

Ghumman, N. S., Kaur, R., (2016) Dynamic combination of improved max-min and ant colony algorithm for load balancing in cloud system. in 2015 6th International Conference on Computing, Communication and Networking Technologies (ICCCNT), pp. 1–5 doi: https://doi.org/10.1109/ICCCNT.2015.7395172.

30.

Tabak, E. K., Cambazoglu, B. B., & Aykanat, C. (2014). Improving the performance of independenttask assignment heuristics minmin, maxmin and sufferage. IEEE Transactions on Parallel and Distributed Systems, 25(5), 1244–1256. https://doi.org/10.1109/TPDS.2013.107CrossRef

31.

Etminani, K., Naghibzadeh, M., (2007) A min-min max-min selective algorihtm for grid task scheduling. in 2007 3rd IEEE/IFIP International Conference in Central Asia on Internet (pp. 1–7). IEEE 2007, doi: https://doi.org/10.1109/canet.2007.4401694

32.

Devipriya, S., Ramesh, C., (2013) Improved max-min heuristic model for task scheduling in cloud, in Proceedings of the 2013 International Conference on Green Computing, Communication and Conservation of Energy, ICGCE 2013, 2013, pp 883–888, doi: https://doi.org/10.1109/ICGCE.2013.6823559.

33.

Lakra, A. V., & Kumar Yadav, D. (2015). Multi-objective tasks scheduling algorithm for cloud computing throughput optimization. Procedia Computer Science, 48(C), 107–113. https://doi.org/10.1016/j.procs.2015.04.158CrossRef

34.

Jena, R. K. (2015). Multi objective task scheduling in cloud environment using nested PSO framework. Procedia Computer Science, 57, 1219–1227. https://doi.org/10.1016/j.procs.2015.07.419CrossRef

35.

Braun, T. D., et al. (2001). A comparison of eleven static heuristics for mapping a class of independent tasks onto heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing, 61(6), 810–837. https://doi.org/10.1006/jpdc.2000.1714CrossRefMATH

36.

Braun, T. D., et al. (1998). Taxonomy for describing matching and scheduling heuristics for mixed-machine heterogeneous computing systems. Proceedings of the IEEE Symposium on Reliable Distributed Systems. https://doi.org/10.1109/reldis.1998.740518CrossRef

Titel: A Pair-Task Heuristic for Scheduling Tasks in Heterogeneous Multi-cloud Environment
verfasst von: Kamalam Gobichettipalayam Krishnasamy
Suresh Periasamy
Keerthika Periasamy
V. Prasanna Moorthy
Gunasekaran Thangavel
Ravita Lamba
Suresh Muthusamy
Publikationsdatum: 06.05.2023
Verlag: Springer US
Erschienen in: Wireless Personal Communications / Ausgabe 2/2023
Print ISSN: 0929-6212
Elektronische ISSN: 1572-834X
DOI: https://doi.org/10.1007/s11277-023-10454-9

Neuer Inhalt

Bildnachweise

VDI-Icon, Profil Icon, inhalt2, Springer Professional Modul/© Springer Fachmedien Wiesbaden GmbH, Die Gewinner und Laudatoren des Sustainability Award in Automotive 2024/© Uli Regenscheit | ATZlive, Search Icon, Banner Hanser, Dinko Eror/© Red Hat GmbH, Suresh Vittal/© Alteryx, Additiv gefertigte Teile/© Marina_Skoropadskaya | Getty Images | iStock, Zeitschrift Wissensmanagement Cover, PatentFit-Logo/© Springer Fachmedien Wiesbaden GmbH, ATZ-Webinar: Prototypenfreie Entwicklung durch Offline- und Driver-in-the-Loop-HiL-Tests /© (c) VI-grade, chassis.tech plus 2023/© [M] ATZlive / TÜV SÜD PRODUCT SERVICE GMBH, adäsion-Webinar-Matinee/© krystiannawrocki_ Getty Images

Springer Professional

Abstract

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Sie haben noch keine Lizenz? Dann Informieren Sie sich jetzt über unsere Produkte:

Springer Professional "Technik"

Springer Professional "Wirtschaft+Technik"

Springer Professional "Wirtschaft"

Weitere Artikel der Ausgabe 2/2023

Novel Heuristic Subcarrier Allocation for Spectral: Energy Efficiency Tradeoff Improvement in Underlay Cognitive Radio Network

Midhaul Performance Modelling Using Commodity Hardware C-RAN Testbed

Low-Cost Compact Hairpin Filter Integrated with a Diamond Antenna for Wireless and 5G Sub-6 GHz Applications

Low Complexity and Low Memory Compression Algorithm for Hyperspectral Image Sensors

Toward an Intelligent Cache Management: In an Edge Computing Era for Delay Sensitive IoT Applications

Analysis of the Phase Velocities of (Pure, Slow and Fast) Alfvèn Waves in the E Region of the Ionosphere for Low Latitudes

Neuer Inhalt

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.

Bitte loggen Sie sich ein, um Zugang zu Ihrer Lizenz zu erhalten.