4.6 Article

Internet of Things Data Cloud Jobs Scheduling Using Modified Distance Cat Swarm Optimization

期刊

ELECTRONICS
卷 12, 期 23, 页码 -

出版社

MDPI
DOI: 10.3390/electronics12234784

关键词

cloud; IoT; job scheduling; metaheuristic; cat swarm optimization

向作者/读者索取更多资源

This paper introduces an enhanced job scheduling mechanism using cat swarm optimization to minimize the execution time of jobs in IoT cloud computing. Through experimental evaluation, it was found that the proposed mechanism outperforms the firefly algorithm and glowworm swarm optimization in reducing execution time.
IoT cloud computing provides all functions of traditional computing as services through the Internet for the users. Big data processing is one of the most crucial advantages of IoT cloud computing. However, IoT cloud job scheduling is considered an NP-hard problem due to the hardness of allocating the clients' jobs to suitable IoT cloud provider resources. Previous work on job scheduling tried to minimize the execution time of the job scheduling in the IoT cloud, but it still needs improvement. This paper proposes an enhanced job scheduling mechanism using cat swarm optimization (CSO) with modified distance to minimize the execution time. The proposed job scheduling mechanism first creates a set of jobs and resources to generate the population by randomly assigning the jobs to resources. Then, it evaluates the population using the fitness value, which represents the execution time of the jobs. In addition, we use iterations to regenerate populations based on the cat's behaviour to produce the best job schedule that gives the minimum execution time for the jobs. We evaluated the proposed mechanism by implementing an initial simulation using Java Language and then conducted a complete simulation using the CloudSim simulator. We ran several experimentation scenarios using different numbers of jobs and resources to evaluate the proposed mechanism regarding the execution time. The proposed mechanism significantly reduces the execution time when we compare the proposed mechanism against the firefly algorithm and glowworm swarm optimization. The average execution time of the proposed cat swarm optimization was 131, while the average execution times for the firefly algorithm and glowworm optimization were 237 and 220, respectively. Hence, the experimental findings demonstrated that the proposed mechanism performs better than the firefly algorithm and glowworm swarm optimization in reducing the execution time of the jobs.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据