计算机科学
分布式计算
云计算
工作流程
调度(生产过程)
蚁群优化算法
动态优先级调度
作业车间调度
工作流管理系统
服务质量
计算机网络
算法
操作系统
数学优化
数据库
数学
布线(电子设计自动化)
作者
Lingjuan Ye,Liwen Yang,Yuanqing Xia,Xinchao Zhao
出处
期刊:IEEE Internet of Things Journal
[Institute of Electrical and Electronics Engineers]
日期:2024-01-01
卷期号:: 1-1
标识
DOI:10.1109/jiot.2024.3351630
摘要
Cloud computing is a potent platform for delivering high-quality computational services to intricate IoT applications. However, effective scheduling approaches are essential to meet application demands while maximizing cloud computing’s potential. In this study, we propose an innovative workflow scheduling method for addressing the cost-effective, deadline-constrained scheduling challenge of IoT applications in cloud computing systems. Our solution, the F-ACO algorithm, leverages a hybrid intelligence approach that combines Ant Colony Optimization (ACO) with a cost-driven heuristic strategy. The primary goal is to minimize workflow scheduling costs while ensuring that workflow deadlines are met. F-ACO introduces a deadline distribution method to derive task sub-deadlines, enabling dynamic adjustments for unscheduled tasks to meet workflow deadlines. Furthermore, we introduce an adaptive ACO-based task ordering mechanism with self-adaptive heuristic information to optimize task scheduling sequences, reducing search space redundancy and enhancing convergence speed. The approach includes a cost-driven task scheduling method designed to allocate each task to a virtual machine with minimal execution cost and idle time, further optimizing the overall workflow scheduling cost. To validate our F-ACO algorithm, we conducted numerous simulations using real-world workflows and compared its performance against state-of-the-art algorithms. Our experimental results affirm F-ACO’s competitive edge in effectively scheduling IoT applications in cloud computing environments.
科研通智能强力驱动
Strongly Powered by AbleSci AI