An improved ant colony optimization job scheduling algorithm in fog computing

Chao Yin; Tongfang Li; Xiaoping Qu; Sihao Yuan

doi:10.1117/12.2580303

12 October 2020 An improved ant colony optimization job scheduling algorithm in fog computing

Chao Yin, Tongfang Li, Xiaoping Qu, Sihao Yuan

Proceedings Volume 11574, International Symposium on Artificial Intelligence and Robotics 2020; 115740G (2020) https://doi.org/10.1117/12.2580303
Event: International Symposium on Artificial Intelligence and Robotics (ISAIR), 2020, Kitakyushu, Japan

Abstract

With the application of internet of things technology, fog computing has provided computing and storage services near the bottom network. It can solve the problem of rapid response and bandwidth consumption of delay sensitive applications at the edge of local network as a highly virtualized platform. However, in the case of large scale service requests, if the job scheduling problem cannot be effectively solved, it will increase service delay, reduce resource utilization and user satisfaction. In this paper, we have improved the basic ant colony optimization (ACO) and developed a new job scheduling strategy improved ant colony optimization named IACO. IACO can assign to the resource with the lowest total cost of all selected tasks, which is always determined by calculating the total cost value of the task on the resource. We have finished some experiments by imitating the foraging process of multiple ants and repeated it iteratively. The optimal task scheduling sequence can be obtained through the different pheromone concentration left by ants. Experimental results show that IACO scheduling algorithm is better than ACO in the total cost, completion time and economic cost.

Citation Download Citation

Chao Yin, Tongfang Li, Xiaoping Qu, and Sihao Yuan "An improved ant colony optimization job scheduling algorithm in fog computing", Proc. SPIE 11574, International Symposium on Artificial Intelligence and Robotics 2020, 115740G (12 October 2020); https://doi.org/10.1117/12.2580303

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available