Two Stage Deadline Aware Cloudlet Scheduler for Time Critical Workloads
Gritto D
Department of Computer Science, Faculty of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, Chengalpattu, Tamil Nadu, India.
Department of Computer Science, Faculty of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, Chengalpattu, Tamil Nadu, India.
In modern computing environments such as cloud, edge, and fog computing, as well as IoT networks and real-time systems, meeting workload deadlines is critical to ensure reliability, quality of service, and user satisfaction. The traditional scheduling algorithms often fail to adequately address the constraints associated with the workloads, particularly deadlines, the dynamic nature of workloads and resources, and the inherent resource limitations. Deadlines are the most important constraints, especially for time-sensitive applications. Achieving deadline compliance requires optimal resource provisioning, scheduling, resource allocation, resource scaling, workload migration, etc. This paper proposes a novel deadline-aware cloudlet scheduling algorithm, the Two-Stage Deadline-Aware Cloudlet Scheduling Algorithm (TSDACS), designed to minimize deadline misses through efficient resource provisioning and scaling strategies. In stage one, the algorithm provisions virtual machines with suitable configurations and quantities based on the requirements of the cloudlets to ensure they can be processed within their deadlines. Cloudlets are then scheduled onto the virtual machines in a way that minimizes deadline violations. In stage two, if the initially provisioned virtual machines fail to meet the deadlines, horizontal scaling is applied, up to a limited threshold, to enhance the performance and the deadline compliance. Experimental results demonstrate that the proposed TSDACS algorithm outperforms existing approaches, such as CPDALB, DBS, and RDLBS2, in terms of deadline miss ratio, makespan, response time, and cost efficiency, while maintaining competitive VM utilization and effective load balancing.
N. Omran Alkaam, A. Bakar Md Sultan, M. B. Hussin, and K. Yatim Sharif, “Hybrid Henry Gas-Harris Hawks Comprehensive-Opposition Algorithm for Task Scheduling in Cloud Computing,” IEEE Access, vol. 13, pp. 12956–12965, 2025, doi: 10.1109/access.2025.3530860.
A. Goubaa, M. Khalgui, Z. Li, G. Frey, and M. Zhou, “Scheduling periodic and aperiodic tasks with time, energy harvesting and precedence constraints on multi-core systems,” Information Sciences, vol. 520, pp. 86–104, May 2020, doi: 10.1016/j.ins.2019.12.034.
Asiaban, “A Real-Time Scheduling Algorithm for Soft Periodic Tasks,” International Journal of Digital Content Technology and its Applications, 2009, doi: 10.4156/jdcta.vol3.issue4.11.
A. Visheratin, M. Melnik, N. Butakov, and D. Nasonov, “Hard-deadline Constrained Workflows Scheduling Using Metaheuristic Algorithms,” Procedia Computer Science, vol. 66, pp. 506–514, 2015, doi: 10.1016/j.procs.2015.11.057.
Singh, Jagbeer. "An algorithm to reduce the time complexity of earliest deadline first scheduling algorithm in real-time system." arXiv preprint arXiv:1101.0056 (2010).
M. Naghibzadeh, “A modified version of rate-monotonic scheduling algorithm and its’ efficiency assessment,” Proceedings of the Seventh IEEE International Workshop on Object-Oriented Real-Time Dependable Systems. (WORDS 2002), pp. 289–294, doi: 10.1109/words.2002.1000064.
W. Zhang, S. Teng, Z. Zhu, X. Fu, and H. Zhu, “An Improved Least-Laxity-First Scheduling Algorithm of Variable Time Slice for Periodic Tasks,” 6th IEEE International Conference on Cognitive Informatics, pp. 548–553, Aug. 2007, doi: 10.1109/coginf.2007.4341935.
V. Shinde and S. C., “Comparison of Real Time Task Scheduling Algorithms,” International Journal of Computer Applications, vol. 158, no. 6, pp. 37–41, Jan. 2017, doi: 10.5120/ijca2017912832.
C. Scordino and G. Lipari, “A Resource Reservation Algorithm for Power-Aware Scheduling of Periodic and Aperiodic Real-Time Tasks,” IEEE Transactions on Computers, vol. 55, no. 12, pp. 1509–1522, Dec. 2006, doi: 10.1109/tc.2006.190.
F. Yao, C. Pu, and Z. Zhang, “Task Duplication-Based Scheduling Algorithm for Budget-Constrained Workflows in Cloud Computing,” IEEE Access, vol. 9, pp. 37262–37272, 2021, doi: 10.1109/access.2021.3063456.
L. Yu, F. Teng, and F. Magoules, “Node Scaling Analysis for Power-Aware Real-Time Tasks Scheduling,” IEEE Transactions on Computers, vol. 65, no. 8, pp. 2510–2521, Aug. 2016, doi: 10.1109/tc.2015.2485229.
A. A. Khan et al., “A Migration Aware Scheduling Technique for Real-Time Aperiodic Tasks Over Multiprocessor Systems,” IEEE Access, vol. 7, pp. 27859–27873, 2019, doi: 10.1109/access.2019.2901411.
L. Lu et al., “Application-driven dynamic vertical scaling of virtual machines in resource pools,” 2014 IEEE Network Operations and Management Symposium (NOMS), pp. 1–9, May 2014, doi: 10.1109/noms.2014.6838238.
Sotiriadis, Stelios, et al. "Vertical and horizontal elasticity for dynamic virtual machine reconfiguration." IEEE Transactions on Services Computing 99 (2016): 1-1.
T. Alyas et al., “Performance Framework for Virtual Machine Migration in Cloud Computing,” Computers, Materials & Continua, vol. 74, no. 3, pp. 6289–6305, 2023, doi: 10.32604/cmc.2023.035161.
N. H. Shahapure and P. Jayarekha, “Distance and Traffic Based Virtual Machine Migration for Scalability in Cloud Computing,” Procedia Computer Science, vol. 132, pp. 728–737, 2018, doi: 10.1016/j.procs.2018.05.083.
H. Beitollahi, S. G. Miremadi, and G. Deconinck, “Fault-Tolerant Earliest-Deadline-First Scheduling Algorithm,” 2007 IEEE International Parallel and Distributed Processing Symposium, pp. 1–6, 2007, doi: 10.1109/ipdps.2007.370608.
Q. Li and W. Ba, “A group priority earliest deadline first scheduling algorithm,” Frontiers of Computer Science, Sep. 2012, doi: 10.1007/s11704-012-1104-4.
Tseng, Li-Ya, Yeh-Hao Chin, and Shu-Ching Wang. "A deadline-based task scheduling with minimized makespan." International Journal of Innovative Computing, Information and Control 5.6 (2009): 1665-1679.
M. A. Rodriguez and R. Buyya, “Deadline Based Resource Provisioningand Scheduling Algorithm for Scientific Workflows on Clouds,” IEEE Transactions on Cloud Computing, vol. 2, no. 2, pp. 222–235, Apr. 2014, doi: 10.1109/tcc.2014.2314655.
Himani and H. S. Sidhu, “Cost-Deadline Based Task Scheduling in Cloud Computing,” 2015 Second International Conference on Advances in Computing and Communication Engineering, pp. 273–279, May 2015, doi: 10.1109/icacce.2015.86.
S. C. Nayak and C. Tripathy, “Deadline based task scheduling using multi-criteria decision-making in cloud environment,” Ain Shams Engineering Journal, vol. 9, no. 4, pp. 3315–3324, Dec. 2018, doi: 10.1016/j.asej.2017.10.007.
S. BEN ALLA, H. BEN ALLA, A. TOUHAFI, and A. EZZATI, “An Efficient Energy-Aware Tasks Scheduling with Deadline-Constrained in Cloud Computing,” Computers, vol. 8, no. 2, p. 46, Jun. 2019, doi: 10.3390/computers8020046.
J. Li, G. Zheng, H. Zhang, and G. Shi, “Task Scheduling Algorithm for Heterogeneous Real-time Systems Based on Deadline Constraints,” 2019 IEEE 9th International Conference on Electronics Information and Emergency Communication (ICEIEC), pp. 113–116, Jul. 2019, doi: 10.1109/iceiec.2019.8784641.
S. Sahoo, B. Sahoo, and A. K. Turuk, “A Learning Automata-Based Scheduling for Deadline Sensitive Task in The Cloud,” IEEE Transactions on Services Computing, vol. 14, no. 6, pp. 1662–1674, Nov. 2021, doi: 10.1109/tsc.2019.2906870.
A. Tarafdar, M. Debnath, S. Khatua, and R. K. Das, “Energy and Makespan Aware Scheduling of Deadline Sensitive Tasks in the Cloud Environment,” Journal of Grid Computing, vol. 19, no. 2, Apr. 2021, doi: 10.1007/s10723-021-09548-0.
Y. Zhang, B. Tang, J. Luo, and J. Zhang, “Deadline-Aware Dynamic Task Scheduling in Edge–Cloud Collaborative Computing,” Electronics, vol. 11, no. 15, p. 2464, Aug. 2022, doi: 10.3390/electronics11152464.
X. He, J. Shen, F. Liu, B. Wang, G. Zhong, and J. Jiang, “A two-stage scheduling method for deadline-constrained task in cloud computing,” Cluster Computing, vol. 25, no. 5, pp. 3265–3281, Feb. 2022, doi: 10.1007/s10586-022-03561-y.
A. Iranmanesh and H. R. Naji, “DCHG-TS: a deadline-constrained and cost-effective hybrid genetic algorithm for scientific workflow scheduling in cloud computing,” Cluster Computing, vol. 24, no. 2, pp. 667–681, Jun. 2020, doi: 10.1007/s10586-020-03145-8.
S. Azizi, M. Shojafar, J. Abawajy, and R. Buyya, “Deadline-aware and energy-efficient IoT task scheduling in fog computing systems: A semi-greedy approach,” Journal of Network and Computer Applications, vol. 201, p. 103333, May 2022, doi: 10.1016/j.jnca.2022.103333.
A. Verma and S. Kaushal, “Deadline constraint heuristic-based genetic algorithm for workflow scheduling in cloud,” International Journal of Grid and Utility Computing, vol. 5, no. 2, p. 96, 2014, doi: 10.1504/ijguc.2014.060199.
D. Komarasamy and V. Muthuswamy, “Adaptive Deadline Based Dependent Job Scheduling algorithm in cloud computing,” 2015 Seventh International Conference on Advanced Computing (ICoAC), pp. 1–5, Dec. 2015, doi: 10.1109/icoac.2015.7562794.
M. M. M. R. Ohee, F. N. Nur, A. Karim, S. Sultana, S. Azam, and N. N. Moon, “An Efficient Deadline Based Priority Job Scheduling in Mobile Cloud Computing,” IET Communications, vol. 19, no. 1, Jan. 2025, doi: 10.1049/cmu2.70031.
S. Abdi, M. Ashjaei, and S. Mubeen, “Deadline-constrained security-aware workflow scheduling in hybrid cloud architecture,” Future Generation Computer Systems, vol. 162, p. 107466, Jan. 2025, doi: 10.1016/j.future.2024.07.044.
S. Qamar, N. Ahmad, and P. M. Khan, “Task Scheduling for Public Clouds Using a Fuzzy Controller-Based Priority- and Deadline-Aware Approach,” Future Internet, vol. 17, no. 4, p. 148, Mar. 2025, doi: 10.3390/fi17040148.
Effah, Emmanuel, et al. "Exploring the Landscape of CPU Scheduling Algorithms: A Comprehensive Survey and Novel Adaptive Deadline-Based Approach." International Journal of Computer Science and Information Security (IJCSIS) 23.1 (2025).
X. Ma, H. Gao, H. Xu, and M. Bian, “An IoT-based task scheduling optimization scheme considering the deadline and cost-aware scientific workflow for cloud computing,” EURASIP Journal on Wireless Communications and Networking, vol. 2019, no. 1, Nov. 2019, doi: 10.1186/s13638-019-1557-3.
N. Anwar and H. Deng, “Elastic Scheduling of Scientific Workflows under Deadline Constraints in Cloud Computing Environments,” Future Internet, vol. 10, no. 1, p. 5, Jan. 2018, doi: 10.3390/fi10010005.
R. A. Haidri, C. P. Katti, and P. C. Saxena, “Capacity based deadline aware dynamic load balancing (CPDALB) model in cloud computing environment,” International Journal of Computers and Applications, vol. 43, no. 10, pp. 987–1001, Jul. 2019, doi: 10.1080/1206212x.2019.1640932.
M. A. Alworafi and S. Mallappa, “A collaboration of deadline and budget constraints for task scheduling in cloud computing,” Cluster Computing, vol. 23, no. 2, pp. 1073–1083, Aug. 2019, doi: 10.1007/s10586-019-02978-2.
R. A. Haidri, M. Alam, M. Shahid, S. Prakash, and M. Sajid, “A deadline aware load balancing strategy for cloud computing,” Concurrency and Computation: Practice and Experience, vol. 34, no. 1, Jul. 2021, doi: 10.1002/cpe.6496.
CRediT Author Statement
The authors confirm contribution to the paper as follows:
Conceptualization: Gritto D and Muthulakshmi P;
Methodology: Gritto D;
Software: Muthulakshmi P;
Data Curation: Gritto D;
Writing- Original Draft Preparation: Gritto D and Muthulakshmi P;
Visualization: Gritto D;
Investigation: Muthulakshmi P;
Supervision: Gritto D;
Validation: Muthulakshmi P;
Writing- Reviewing and Editing: Gritto D and Muthulakshmi P; All authors reviewed the results and approved the final version of the manuscript.
Acknowledgements
Author(s) thanks to Dr. Muthulakshmi P for this research completion and support.
Funding
No funding was received to assist with the preparation of this manuscript.
Ethics declarations
Conflict of interest
The authors have no conflicts of interest to declare that are relevant to the content of this article.
Availability of data and materials
Data sharing is not applicable to this article as no new data were created or analysed in this study.
Author information
Contributions
All authors have equal contribution in the paper and all authors have read and agreed to the published version of the manuscript.
Corresponding author
Gritto D
Department of Computer Science, Faculty of Science and Humanities, SRM Institute of Science and Technology, Kattankulathur, Chengalpattu, Tamil Nadu, India.
Open Access This article is licensed under a Creative Commons Attribution NoDerivs is a more restrictive license. It allows you to redistribute the material commercially or non-commercially but the user cannot make any changes whatsoever to the original, i.e. no derivatives of the original work. To view a copy of this license, visit https://creativecommons.org/licenses/by-nc-nd/4.0/
Cite this article
Gritto D and Muthulakshmi P, “Two Stage Deadline Aware Cloudlet Scheduler for Time Critical Workloads”, Journal of Machine and Computing, vol.5, no.4, pp. 2066-2086, October 2025, doi: 10.53759/7669/jmc202505161.
