Complexity Analysis of Adaptive Scheduling Algorithms for RealTime Parallel Processing in Cloud Computing Platforms with Fault Tolerance Mechanisms
Keywords:
real-time processing, cloud computing, adaptive scheduling, fault tolerance, task latencyAbstract
The increasing demand for real-time parallel processing in cloud computing environments necessitates the development of more efficient and fault-tolerant scheduling algorithms. Traditional scheduling methods, such as static algorithms, often fall short when handling dynamic workloads and system failures, leading to increased task latency and reduced system performance. In contrast, adaptive scheduling algorithms dynamically adjust to changes in system conditions and workloads, ensuring timely task completion and optimized resource utilization. This study evaluates the performance of adaptive scheduling algorithms in real-time cloud environments, focusing on key factors such as task latency, system resilience, and fault tolerance. Simulation experiments were conducted using cloud computing models that incorporate fault injection scenarios, including network failures and virtual machine crashes. The results show that adaptive algorithms significantly outperform traditional static schedulers in terms of task latency reduction and improved system resilience. These algorithms demonstrated better fault recovery times and ensured consistent real-time performance, even under failure conditions. The findings highlight the advantages of adaptive scheduling in cloud environments, particularly for applications requiring rapid data processing and high system reliability. Despite the promising results, challenges remain regarding the scalability and complexity of these algorithms in large-scale cloud systems. Further research is needed to optimize adaptive scheduling algorithms for efficiency, scalability, and comprehensive performance evaluation, taking into account factors such as energy consumption, cost, and reliability. This research contributes to advancing cloud computing infrastructures that can dynamically handle real-time tasks and maintain high performance under varying workloads and failures.
References
[1] M. Sino and E. Domazet, “Scalable Parallel Processing: Architectural Models, Real-Time Programming, and Performance Evaluation †,” Eng. Proc., vol. 104, no. 1, 2025, doi: 10.3390/engproc2025104060.
[2] S. S. Thomas, S. A. Thomas, J. Paul, and K. K. B. Shibu, “An Intelligent Adaptive Scheduler for Operating Systems Experimented Using FreeRTOS,” in Proceedings of the 2nd International Conference on Intelligent Computing and Control Systems, ICICCS 2018, 2018, pp. 1592 – 1597. doi: 10.1109/ICCONS.2018.8662927.
[3] S. U. Mushtaq, S. Sheikh, and S. M. Idrees, “Enhanced priority based task scheduling with integrated fault tolerance in distributed systems,” Int. J. Cogn. Comput. Eng., vol. 6, pp. 152 – 169, 2025, doi: 10.1016/j.ijcce.2024.12.006.
[4] A. P. Sheetal and K. Ravindranath, “Cost Effective Hybrid Fault Tolerant Scheduling Model for Cloud Computing Environment: Hybrid Fault Tolerant Scheduling,” Int. J. Adv. Comput. Sci. Appl., vol. 12, no. 6, pp. 416 – 422, 2021, doi: 10.14569/IJACSA.2021.0120646.
[5] K. Ajmera, T. K. Tewari, V. K. Singh, Vikash, and P. K. Upadhyay, “Energy-Aware Dynamic Virtual Machine Scheduling in Cloud Computing: A Survey,” in ACM International Conference Proceeding Series, 2023, pp. 133 – 141. doi: 10.1145/3607947.3607970.
[6] T. Hagras and G. A. El-Sayed, “A fault-tolerant and load-balancing scheduler for independent tasks on cloud-based virtual machines,” Cluster Comput., vol. 29, no. 1, 2026, doi: 10.1007/s10586-025-05857-1.
[7] K. Tanaka, “Real-time adaptive task scheduling,” in Proceedings of the 2005 International Conference on Embedded Systems and Applications, ESA’05, 2005, pp. 24 – 30. [Online]. Available: https://www.scopus.com/inward/record.uri?eid=2-s2.0-60749110125&partnerID=40&md5=11898a7f75ac7a9cfb086cdd3d8eea95
[8] N. Wu, D. Zuo, and Z. Zhang, “Dynamic fault-tolerant workflow scheduling with hybrid spatial-temporal re-execution in clouds,” Inf., vol. 10, no. 5, 2019, doi: 10.3390/info10050169.
[9] S. Sahoo, S. Nawaz, S. K. Mishra, and B. Sahoo, “Execution of real time task on cloud environment,” in 12th IEEE International Conference Electronics, Energy, Environment, Communication, Computer, Control: (E3-C3), INDICON 2015, 2016. doi: 10.1109/INDICON.2015.7443778.
[10] S.-J. Yang and W.-L. Lu, “Design a Distributed Fog Computing Scheme to Enhance Processing Performance in Real-Time IoT Applications,” Lect. Notes Data Eng. Commun. Technol., vol. 41, pp. 99 – 112, 2020, doi: 10.1007/978-3-030-34986-8_7.
[11] M. R. Kale, S. Labhane, S. E. Manu, P. Mehta, A. Amudha, and A. Gupta, “Scalable and Efficient Real-Time Data Processing in Cloud-Based Manufacturing Systems,” in 2024 15th International Conference on Computing Communication and Networking Technologies, ICCCNT 2024, 2024. doi: 10.1109/ICCCNT61001.2024.10725934.
[12] P. Akilandeswari and H. Srimathi, “Survey and analysis on task scheduling in cloud environment,” Indian J. Sci. Technol., vol. 9, no. 37, 2016, doi: 10.17485/ijst/2016/v9i37/102058.
[13] H. Wang and H. Wang, “Survey On Task Scheduling in Cloud Computing Environment,” in ICIIBMS 2022 - 7th International Conference on Intelligent Informatics and Biomedical Sciences, 2022, pp. 286 – 291. doi: 10.1109/ICIIBMS55689.2022.9971622.
[14] R. S. K. Aakisetti, V. Ganta, P. Yellamma, C. Siram, S. H. Gampa, and K. V Brahma Rao, “Dynamic Priority Scheduling Algorithms for Flexible Task Management in Cloud Computing,” Int. J. Intell. Syst. Appl. Eng., vol. 12, no. 13s, pp. 246 – 256, 2024, [Online]. Available: https://www.scopus.com/inward/record.uri?eid=2-s2.0-85184431242&partnerID=40&md5=609ac627c3fc050f57af59c347d44ace
[15] R. Ghafouri and A. Movaghar, “An adaptive and deadline-constrained workflow scheduling algorithm in infrastructure as a service clouds,” Iran J. Comput. Sci., vol. 5, no. 1, pp. 17 – 39, 2022, doi: 10.1007/s42044-021-00082-6.
[16] Y. Liu, J. Liu, Z. Zhu, C. Deng, Z. Ren, and X. Xu, “Adaptive fault-tolerant scheduling in heterogeneous real-time systems,” in Proceedings of the 14th IEEE Conference on Industrial Electronics and Applications, ICIEA 2019, 2019, pp. 982 – 987. doi: 10.1109/ICIEA.2019.8833833.
[17] K. Sumangali and N. Benny, “Advanced cloud fault tolerance system,” in IOP Conference Series: Materials Science and Engineering, 2017. doi: 10.1088/1757-899X/263/4/042060.
[18] P. Marcotte, F. Gregoire, and F. Petrillo, “Multiple fault-Tolerance mechanisms in cloud systems: A systematic review,” in Proceedings - 2019 IEEE 30th International Symposium on Software Reliability Engineering Workshops, ISSREW 2019, 2019, pp. 414 – 421. doi: 10.1109/ISSREW.2019.00104.
[19] J. Hao, Z. Cui, and Z. Peng, “Load balancing for data centre: A brief survey,” Int. J. Wirel. Mob. Comput., vol. 11, no. 1, pp. 47 – 53, 2016, doi: 10.1504/IJWMC.2016.079464.
[20] K. A. Ali, O. A. Fadare, and F. Al-Turjman, “Dynamic Resource Allocation (DRA) in Cloud Computing,” Sustain. Civ. Infrastructures, vol. Part F4042, pp. 1033 – 1049, 2025, doi: 10.1007/978-3-031-72509-8_85.
[21] J. Liu, Z. Zhu, and C. Deng, “A Novel and Adaptive Transient Fault-Tolerant Algorithm Considering Timing Constraint on Heterogeneous Systems,” IEEE Access, vol. 8, pp. 103047 – 103061, 2020, doi: 10.1109/ACCESS.2020.2999092.
[22] O. Gokalp, “Performance evaluation of heuristic and metaheuristic algorithms for independent and static task scheduling in cloud computing; [Bulut hesaplamada baǧimsiz ve statik görev çizelgeleme için sezgisel ve metasezgisel algoritmalarin performans deǧerlendirmesi],” in SIU 2021 - 29th IEEE Conference on Signal Processing and Communications Applications, Proceedings, 2021. doi: 10.1109/SIU53274.2021.9477821.
[23] A. Khiat, “Optimizing Cloud Energy Consumption Using Static Task Scheduling Algorithms: A Comparative Study,” in 2023 14th International Conference on Information and Communication Systems, ICICS 2023, 2023. doi: 10.1109/ICICS60529.2023.10330466.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 Programming and Algorithm Fundamentals
This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.
