Journal
FUTURE GENERATION COMPUTER SYSTEMS-THE INTERNATIONAL JOURNAL OF ESCIENCE
Volume 98, Issue -, Pages 44-53Publisher
ELSEVIER
DOI: 10.1016/j.future.2019.03.022
Keywords
Edge Computing server; Task scheduling; Proportional share scheduling; Fairness; Quality of Service
Categories
Funding
- Industrial key Technology Development Program of MKE/KEIT [10063496]
Ask authors/readers for more resources
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. (C) 2019 Elsevier B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available