Title
K-LZF : An efficient and fair scheduling for Edge Computing servers
Abstract
With the emergence of the increasingly heterogeneous Internet of Things(IoT) devices, Edge Computing servers are required to support a variety of services with different quality of service requirements. The degree of heterogeneity of IoT devices makes it more difficult to fairly and efficiently allocate resources based on the task’s weight. However, most fair schedulers are not suitable for simultaneously providing scalability and robustness in Edge Computing servers. In this paper, we propose K-LZF which is an efficient and fair scheduling algorithm for Edge Computing Servers. K-LZF aims to achieve a high level of proportional fairness for a large number of heterogeneous tasks, with constant overhead. We simulated and evaluated the performance of the proposed K-LZF in a heterogeneous IoT environment. We also designed and implemented in the AVOS kernel to show that it is applicable in actual IoT environment. The results of the simulation and implementations show that the proposed K-LZF outperforms several existing scheduling algorithm with respect to scalability and robustness even when the degree of task heterogeneity becomes high.
Year
DOI
Venue
2019
10.1016/j.future.2019.03.022
Future Generation Computer Systems
Keywords
Field
DocType
Edge Computing server,Task scheduling,Proportional share scheduling,Fairness,Quality of Service
Edge computing,Kernel (linear algebra),Scheduling (computing),Computer science,Server,Quality of service,Implementation,Robustness (computer science),Scalability,Distributed computing
Journal
Volume
ISSN
Citations 
98
0167-739X
4
PageRank 
References 
Authors
0.39
0
3
Name
Order
Citations
PageRank
Joonhyouk Jang1145.59
Jinman Jung22414.63
Jiman Hong393.55