An effective algorithm for predicting load and dynamic task scheduling in cloud fog architecture for smart homes
The need for smart homes with many devices and services continues to rise quickly. With this surge, smart homes need task scheduling and load-prediction algorithms to provide the proper services for the residents. A deep learning-based dynamic job scheduling and load prediction technique for cloud-fog smart homes is proposed in this paper. This algorithm forecasts task arrival rates at each fog node and assigns them to available fog nodes. It dynamically schedules tasks based on fog node workload. Another option is to send non-real-time jobs to the cloud and real-time tasks to the fog layer. This optimises load distribution for performance. Using these task assignee models and features, the program optimises prioritised tasks, scores, network latency, and device resource characteristics. We simulate the algorithm's performance in various workloads in this part. The proposed algorithms achieved in higher percentile for 93.79% latency, 95.00% throughput, 95.34% response time, 96.28% scalability, 94.20% fault-tolerance, 97.41% scheduling capacity, 91.41% load balancing capacity, and 95.22% priority management. The results indicate that such an algorithm significantly surpasses the conventional task scheduling methods in load balancing and shortens the average task response time.
Authors
- Sujeet Kumar
- Krishna Kant Agrawal (ORCID: https://orcid.org/0000-0001-5788-9136)
- Jitendra Kumar Seth (ORCID: https://orcid.org/0000-0001-7997-3443)
- Abhishek Kumar Gupta (ORCID: https://orcid.org/0000-0001-8913-2365)
- Sonia Lamba
Institutions
- Jagannath University (IN)
- Galgotias University (IN)
- Institute of Management Technology (IN)
- Noida International University (IN)
Publication Details
- Journal
- International Journal of Cloud Computing
- Published
- 2025-01-01
- DOI
- https://doi.org/10.1504/ijcc.2025.145657
- Primary Topic
- IoT and Edge/Fog Computing
- Type
- article
- Field-Weighted Citation Impact
- 0.00