An Adaptive Simulated Annealing Algorithm for Optimizing Task Scheduling in Internet of Things
The Internet of Things (IoT) has grown significantly, and hence, it is being used extensively in real-time applications. However, this exponential data growth has also brought issues like CPU scheduling delays and increased computational overhead. Traditional CPU scheduling algorithms optimize one factor leading to delays, like task scheduling or execution time. In practice, delays occur because of a mix of both task scheduling and execution time. To overcome this weakness, this paper proposes an adaptive cooling rate simulated annealing algorithm to optimize scheduling time and execution times for effectively addressing scheduling delay problems. Simulation outcomes show that the proposed algorithm outperforms current methods in minimizing scheduling delays.
Authors
- Elankovan Sundararajan (ORCID: https://orcid.org/0000-0003-2711-0659)
- Thippa Reddy Gadekallu
- Mohammad Kamrul Hasan (ORCID: https://orcid.org/0000-0001-5511-0205)
- Shayla Islam (ORCID: https://orcid.org/0000-0002-0490-7799)
- Zhang Bo
Institutions
- Lovely Professional University (IN)
- UCSI University (MY)
- National University of Malaysia (MY)
Publication Details
- Published
- 2025-03-14
- DOI
- https://doi.org/10.1145/3746709.3746967
- Primary Topic
- IoT and Edge/Fog Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00