NDTAEP: Design of a novel deadline-aware task scheduling model using augmented ensemble pattern analysis

Gaikwad, Amol D.; Singh, Kavita R.; Kamble, Shailesh D.; Chouhan, Vikas

doi:10.47974/JSMS-1078

Open Access Research Article

NDTAEP: Design of a novel deadline-aware task scheduling model using augmented ensemble pattern analysis

^*Amol D. GaikwadCorresponding authoramolgaikwad.ag@gmail.comYeshwantrao Chavan College of EngineeringRTMNU Nagpur University NagpurNagpur, Maharashtra, 440001, IndiaView full profile → , Kavita R. Singhsinghkavita19@yahoo.co.inYeshwantrao Chavan College of EngineeringRTMNU Nagpur University NagpurNagpur, Maharashtra, 440001, IndiaView full profile → , Shailesh D. KambleShaileshdkamble@igdtuw.ac.inIndira Gandhi Delhi Technical University for WomenDelhi, 110006, IndiaView full profile → , Vikas Chouhanvchouhan@cs.iitr.ac.inUniversity of New BrunswickFredericton, New Brunswick, E3B5A3, CanadaView full profile →

* Corresponding author · click or hover a name for details

pp. 1377–1389Vol. 26Issue 6September 2023DOI: 10.47974/JSMS-1078XML

Received:: 03 Feb 2023
Published Online:: 12 Sep 2023
Article type:: Research Article
Language:: EN
Article no.:: JSMS-1078
Pages:: 1377–1389

Abstract

A wide variety of scheduling models have been proposed by researchers over the years, and each of them has varying performance in terms of deadline hit ratio, scheduling effort, efficiency of task mapping, etc. However, these models are highly context-sensitive and cannot be scaled to heterogeneous task types due to their internal mapping characteristics. To improve task scalability, this work proposes a design of a novel deadline-aware task scheduling model that uses augmented ensemble pattern analysis for task clustering. The pattern analysis module uses a combination of K-means, hierarchical, and Fuzzy C Means (FCM) clustering to effectively segregate tasks depending on their completion and deadline parameters. These tasks are given to a modified deadline-aware League Championship Algorithm (LCA) optimizer, which assists in mapping the clustered tasks with worker threads. The modified LCA model uses a combination of task priority, task deadline, and worker capacity for scheduling. The model maps tasks that require higher execution effort with moderately performing worker nodes, while tasks with nearer deadlines are allotted to higher-performance workers. Due to the use of an ensemble augmented pattern analyzer with a modified LCA optimizer, the proposed model can improve execution speed by 8%, deadline hit ratio by 1.5%, and scheduling efficiency by 6.5% when compared with various state-of-the-art scheduling approaches. The proposed model was evaluated and showcased a deadline hit ratio of 99.95%, computational efficiency of 96.26%, and average task-scheduling delay of less than 0.1 ms, which makes it highly useful for a wide variety of task scheduling application scenarios.

Keywords

Cloud computing Load balancing Task scheduling League championship algorithm Pattern analysis

Subject Classifications

30D4062H3013F60

Acknowledgements

DG 9442

References

[1] Y. Xiong, S. Huang, M. Wu, J. She and K. Jiang, “A Johnson’s-Rule-Based Genetic Algorithm for Two-Stage-Task Scheduling Problem in Data-Centers of Cloud Computing,” in IEEE Transactions on Cloud Computing, vol. 7, no. 3, pp. 597-610 (2019).
[2] Vivek Gupta, Harpreet Singh Gill, Prabhdeep Singh & Rajbir Kaur, “An energy efficient fog-cloud based architecture for healthcare,” in Journal of Statistics and Management Systems, vol. 21:4, pp. 529-537 (2018), DOI: 10.1080/09720510.2018.1466961.
[3] B. A. Al-Maytami, P. Fan, A. Hussain, T. Baker, and P. Liatsis, “ A review of virtual machine (VM) resource scheduling algorithms in cloud computing environment,” in Journal of Statistics and Management Systems, vol. 20:4, , pp. 703-711, DOI: 10.1080/09720510.2017.1395190
[4] F. Yao, C. Pu and Z. Zhang, “Task Duplication-Based Scheduling Algorithm for Budget-Constrained Workflows in Cloud Computing,” in IEEE Access, vol. 9, pp. 37262-37272 (2021).
[5] Z. Chen, J. Hu, X. Chen, J. Hu, X. Zheng, and G. Min, “Computation Offloading and Task Scheduling for DNN-Based Applications in Cloud-Edge Computing,” in IEEE Access, vol. 8, pp. 115537-115547, (2020).
[6] Kusum Tharani, Neeraj Kumar, Vishal Srivastava, Sakshi Mishra & M. Pratyush Jayachandran , Machine learning models for renewable energy forecasting,,” in Journal of Statistics and Management Systems, vol. 23:1, pp. 171-180, (2020). DOI: 10.1080/09720510.2020.1721636.
[7] Y. Wang and X. Zuo, “An Effective Cloud Workflow Scheduling Approach Combining PSO and Idle Time Slot-Aware Rules,” in IEEE/CAA Journal of Automatic Sinica, vol. 8, no. 5, pp. 1079-1094 (2021).
[8] H. Zhang, J. Shi, B. Deng, G. Jia, G. Han, and L. Shu, “MCTE: Minimizes Task Completion Time and Execution Cost to Optimize Scheduling Performance for Smart Grid Cloud,” in IEEE Access, vol. 7, pp. 134793-134803 (2019).
[9] L. Zhu, K. Huang, Y. Hu, and X. Tai, “A Self-Adapting Task Scheduling Algorithm for Container Cloud Using Learning Automata,” in IEEE Access, vol. 9, pp. 81236-81252 (2021).
[10] D. Alsadie, “A Metaheuristic Framework for Dynamic Virtual Machine Allocation with Optimized Task Scheduling in Cloud Data Centers,” in IEEE Access, vol. 9, pp. 74218-74233 (2021).
[11] K. Dubey, M. Y. Shams, S. C. Sharma, A. Alarifi, M. Amoon and A. A. Nasr, “A Management System for Servicing Multi-Organizations on Community Cloud Model in Secure Cloud Environment,” in IEEE Access, vol. 7, pp. 159535-159546 (2019).
[12] S. Pang, W. Li, H. He, Z. Shan, and X. Wang, “An EDA-GA Hybrid Algorithm for Multi-Objective Task Scheduling in Cloud Computing,” in IEEE Access, vol. 7, pp. 146379-146389 (2019).
[13] T. A. L. Genez, L. F. Bittencourt, N. L. S. d. Fonseca and E. R. M. Madeira, “Estimation of the Available Bandwidth in Inter-Cloud Links for Task Scheduling in Hybrid Clouds,” in IEEE Transactions on Cloud Computing, vol. 7, no. 1, pp. 62-74 (2019).
[14] Y. Alahmad, T. Daradkeh and A. Agarwal, “Proactive Failure-Aware Task Scheduling Framework for Cloud Computing,” in IEEE Access, vol. 9, pp. 106152-106168 (2021).
[15] J. Xu, Z. Hao, R. Zhang, and X. Sun, “A Method Based on the Combination of Laxity and Ant Colony System for Cloud-Fog Task Scheduling,” in IEEE Access, vol. 7, pp. 116218-116226 (2019).
[16] S. Geng, D. Wu, P. Wang, and X. Cai, “Many-Objective Cloud Task Scheduling,” in IEEE Access, vol. 8, pp. 79079-79088 (2020).
[17] X. Chen et al., “A WOA-Based Optimization Approach for Task Scheduling in Cloud Computing Systems,” in IEEE Systems Journal, vol. 14, no. 3, pp. 3117-3128, (2020).
[18] D. Alsadie, “TSMGWO: Optimizing Task Schedule Using Multi-Objectives Grey Wolf Optimizer for Cloud Data Centers,” in IEEE Access, vol. 9, pp. 37707-37725 (2021).
[19] H. Yuan, J. Bi and M. Zhou, “Multiqueue Scheduling of Heterogeneous Tasks With Bounded Response Time in Hybrid Green IaaS Clouds,” in IEEE Transactions on Industrial Informatics, vol. 15, no. 10, pp. 5404-5412 (2019).
[20] Ruchi Nanda, Amita Sharma, Pooja Choraria, Astha Pareek, Neha Tiwari & Anubha Jain. Statistical analysis of query processing time in cache-based cloud database systems, Journal of Statistics and Management Systems, 25:7, 1673-1683 (2022), DOI: 10.1080/09720510.2022.2130576.

Views: 256Downloads: 67Citations: 0