Submit your papersSubmit Now
For Enquiries: [email protected]
IIARD LogoIIARD

Improved Job Scheduling Algorithm with Fault Tolerance in Grid Computing

Idayana Alabere

Abstract

Job scheduling in grid computing remains challenging due to heterogeneous resources, dynamic workloads, and frequent failures. Traditional algorithms such as First-Come-First-Served and Round Robin lack adaptive mechanisms for reliability in failure-prone environments. This study develops an improved job scheduling algorithm that incorporates fault tolerance to enhance reliability, efficiency, and task completion. Objectives were to design a scheduler integrating checkpointing, selective replication, and adaptive rescheduling; implement it using Python ; and evaluate its performance against conventional methods. A Design Science Research methodology was adopted, involving iterative development, simulation, and comparative testing. Results show the improved algorithm achieved higher completion rates, reduced recovery times, and better scalability than baseline schedulers, confirming that the proposed solution addresses the limitations of existing approaches and offers a practical framework for resilient distributed computing.

Keywords

Grid computingjob schedulingfault tolerancecheckpointingreplicationadaptive rescheduling

References

1. Abbas, G., Mehmood, A., Carsten, M., & Epiphaniou, G. (2020). Chaotic maps-enabled particle swarm optimization for dynamic task scheduling in cloud computing. Future Generation Computer Systems, 113, 41–54. https://doi.org/10.1016/j.future.2020.06.005 2. Ahmed, S., Li, Y., & Zahid, S. (2023). Machine learning-based failure prediction for cloud and grid environments. Journal of Parallel and Distributed Computing, 182, 104–117. https://doi.org/10.1016/j.jpdc.2023.04.005 3. Buyya, R., Abramson, D., & Giddy, J. (2002). Economic models for resource management and scheduling in grid computing. Concurrency and Computation: Practice and Experience, 14(13– 15), 1507–1542. https://doi.org/10.1002/cpe.710 4. Chen, Y., Das, A., Qin, W., Sivasubramaniam, A., Wang, Q., & Gautam, N. (2022). Managing server energy and operational costs in hosting centers. ACM SIGMETRICS Performance Evaluation Review, 33(1), 303–314. https://doi.org/10.1145/1071690.1064222 5. Du, W., Gao, Y., & Liu, Y. (2020). Adaptive particle swarm optimization for grid task scheduling. Applied Soft Computing, 93, 106–119. https://doi.org/10.1016/j.asoc.2020.106291 6. Foster, I., & Kesselman, C. (2004). The Grid: Blueprint for a new computing infrastructure (2nd ed.). Morgan Kaufmann. 7. Foster, I., Kesselman, C., Nick, J., & Tuecke, S. (2008). The physiology of the grid: An open grid services architecture for distributed systems integration. Open Grid Forum. 8. Idris, I., Ibrahim, A., & Uthman, M. (2017). Improved ant colony optimization with fault tolerance for grid job scheduling. Journal of Parallel and Distributed Computing, 101, 1–10. https://doi.org/10.1016/j.jpdc.2016.11.010 9. Khanli, L. M., Fazeli, M., & Ghaffari, A. (2010). Reliability forecasting and heuristic optimization scheduler for grid computing. Future Generation Computer Systems, 26(8), 1195–1208. https://doi.org/10.1016/j.future.2010.03.002 10. Kondo, D., Anderson, D. P., & McLeod, J. (2010). Resource failure analysis in volunteer computing. Proceedings of IEEE IPDPS (pp. 1–8). IEEE. https://doi.org/10.1109/IPDPS.2010.5470465 11. Li, H., Xu, T., & Wang, L. (2021). Adaptive failure recovery in grid computing. Future Generation Computer Systems, 115, 267–278. https://doi.org/10.1016/j.future.2020.08.007 12. Malik, S., Ghani, N., & Khan, A. (2012). Grid dependability: A comprehensive review. Future Generation Computer Systems, 28(8), 1241–1256. https://doi.org/10.1016/j.future.2012.02.004 13. Matrenin, P., & Sekaev, V. (2020). Hybrid PSO-GA approaches for job scheduling in dynamic grid environments. Applied Intelligence, 50, 4152–4165. https://doi.org/10.1007/s10489-020- 01718-4 14. Middendorf, M., Reischuk, R., & Elster, J. (2009). Ant colony optimization with balanced load distribution for grid scheduling. Journal of Systems Architecture, 55(7), 420–432. https://doi.org/10.1016/j.sysarc.2009.03.005 15. Rahman, M., Alam, S., & Sultana, T. (2021). Fault-tolerant genetic algorithm for grid job scheduling. Cluster Computing, 24, 317–330. https://doi.org/10.1007/s10586-021-03252-w 16. Ranaweera, S., & Agrawal, D. (2000). A fault-tolerant job scheduling algorithm for computational grids. Proceedings of IEEE HiPC (pp. 147–154). IEEE. https://doi.org/10.1109/HiPC.2000.892285 IJCSMT 17. Sharma, R., Kumar, S., & Singh, N. (2019). Performance overhead analysis of checkpointing in grid computing. Journal of Parallel and Distributed Computing, 127, 1–12. https://doi.org/10.1016/j.jpdc.2018.12.002 18. Torkestani, J. (2019). Resource heterogeneity-aware scheduling in grid computing. Future Generation Computer Systems, 95, 245–257. https://doi.org/10.1016/j.future.2018.12.046 19. Wang, Y., Zhang, J., & Chen, L. (2020). Dynamic resource availability and scheduling in grid environments. Concurrency and Computation: Practice and Experience, 32(10), e5221. https://doi.org/10.1002/cpe.5221 20. Xhafa, F., & Abraham, A. (2010). Computational models and heuristic methods for grid scheduling problems. Future Generation Computer Systems, 26(4), 608–621. https://doi.org/10.1016/j.future.2009.11.005 21. Yu, J., & Buyya, R. (2005). A taxonomy of workflow management systems for grid computing. Journal of Grid Computing, 3(3–4), 171–200. https://doi.org/10.1007/s10723-005-9010-8 22. Zhang, Y., Li, Y., & Huang, C. (2020). Decentralized particle swarm optimization for grid scheduling. Journal of Parallel and Distributed Computing, 144, 45–56. https://doi.org/10.1016/j.jpdc.2020.05.018 23. Zhao, H., Li, K., & Xu, Y. (2010). Fault tolerance in grid computing systems. Future Generation Computer Systems, 26(1), 122–132. https://doi.org/10.1016/j.future.2009.05.002

More Articles from INTERNATIONAL JOURNAL OF COMPUTER SCIENCE AND MATHEMATICAL THEORY