K-LZF : An efficient and fair scheduling for Edge Computing servers
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Jang, J. | - |
dc.contributor.author | Jung, J. | - |
dc.contributor.author | Hong, J. | - |
dc.date.available | 2019-04-02T05:10:02Z | - |
dc.date.created | 2019-04-02 | - |
dc.date.issued | 2019-09 | - |
dc.identifier.issn | 0167-739X | - |
dc.identifier.uri | http://scholarworks.bwise.kr/ssu/handle/2018.sw.ssu/32284 | - |
dc.description.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. © 2019 Elsevier B.V. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | Elsevier B.V. | - |
dc.relation.isPartOf | Future Generation Computer Systems | - |
dc.title | K-LZF : An efficient and fair scheduling for Edge Computing servers | - |
dc.type | Article | - |
dc.identifier.doi | 10.1016/j.future.2019.03.022 | - |
dc.type.rims | ART | - |
dc.identifier.bibliographicCitation | Future Generation Computer Systems, v.98, pp.44 - 53 | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000503818800006 | - |
dc.identifier.scopusid | 2-s2.0-85063343061 | - |
dc.citation.endPage | 53 | - |
dc.citation.startPage | 44 | - |
dc.citation.title | Future Generation Computer Systems | - |
dc.citation.volume | 98 | - |
dc.contributor.affiliatedAuthor | Hong, J. | - |
dc.type.docType | Article | - |
dc.description.isOpenAccess | N | - |
dc.subject.keywordAuthor | Edge Computing server | - |
dc.subject.keywordAuthor | Fairness | - |
dc.subject.keywordAuthor | Proportional share scheduling | - |
dc.subject.keywordAuthor | Quality of Service | - |
dc.subject.keywordAuthor | Task scheduling | - |
dc.subject.keywordPlus | Edge computing | - |
dc.subject.keywordPlus | Quality of service | - |
dc.subject.keywordPlus | Scalability | - |
dc.subject.keywordPlus | Scheduling | - |
dc.subject.keywordPlus | Scheduling algorithms | - |
dc.subject.keywordPlus | Fair scheduling | - |
dc.subject.keywordPlus | Fair scheduling algorithm | - |
dc.subject.keywordPlus | Fairness | - |
dc.subject.keywordPlus | Internet of Things (IOT) | - |
dc.subject.keywordPlus | Proportional fairness | - |
dc.subject.keywordPlus | Proportional-share | - |
dc.subject.keywordPlus | Resources based | - |
dc.subject.keywordPlus | Task-scheduling | - |
dc.subject.keywordPlus | Internet of things | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
Soongsil University Library 369 Sangdo-Ro, Dongjak-Gu, Seoul, Korea (06978)02-820-0733
COPYRIGHT ⓒ SOONGSIL UNIVERSITY, ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.