版权所有:内蒙古大学图书馆 技术提供:维普资讯• 智图
内蒙古自治区呼和浩特市赛罕区大学西街235号 邮编: 010021
作者机构:Chitkara Univ Inst Engn & Technol Chandigarh Punjab India Thapar Inst Engn & Technol Dept Comp Sci & Engn Patiala Punjab India
出 版 物:《CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE》 (并行学和计算:实践与经验)
年 卷 期:2021年第33卷第21期
页 面:e6432-e6432页
核心收录:
学科分类:08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术(可授工学、理学学位)]
主 题:Fog computing job scheduling optimal scheduling scheduling algorithms task scheduling
摘 要:The biggest challenge of task scheduling in Fog computing is to satisfy users dynamic requirements in real-time with Fog nodes limited resource capacities. Fog nodes heterogeneity and an obligation to complete tasks by the deadline while minimizing cost and energy consumption makes the scheduling process more challenging. This article facilitates a deeper understanding of the research issues through a detailed taxonomy and distinguishes significant challenges in existing work. Furthermore, the paper investigates existing solutions for various challenges, presents a meta-analysis on quality of service parameters and tools used to implement Fog task scheduling algorithms. This systematic review will help potential researchers easily identify specific research problems and future directions to enhance scheduling efficiency.