Job scheduling with adaptable computing levels for edge computing

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Edge computing is an emerging technology that can help huge number of devices be connected and processed with low latency. However, the performance of edge servers is far less powerful than cloud servers. When dealing with a large number of job requests from user devices, traditional job scheduling methods are not efficient enough. In this paper, we propose a new job scheduling model by considering adaptable jobs that can be executed with different computing levels and accordingly different resource requirements. We design a new job scheduling algorithm based on such an adaptable job model. The algorithm can choose an appropriate level for each job according to resource availability. Compared with existing works, our design can achieve better tradeoff between resource utilization and quality of experience. To the best of our knowledge, this is the first paper that considers adaptable job computing levels.

Cite

CITATION STYLE

APA

Jiang, H., & Wu, W. (2018). Job scheduling with adaptable computing levels for edge computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11335 LNCS, pp. 287–296). Springer Verlag. https://doi.org/10.1007/978-3-030-05054-2_22

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free