4.5 Article

Joint optimization of data placement and scheduling for improving user experience in edge computing

Journal

JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING
Volume 125, Issue -, Pages 93-105

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jpdc.2018.11.006

Keywords

Data placement; Task scheduling; Edge computing; User experience

Funding

  1. National Natural Science Foundation (NSF) [61873341, 61672397, 61472294]
  2. Application Foundation Frontier Project of WuHan [2018010401011290]
  3. Open Foundation of Key Laboratory of Embedded System and Service Computing (Tongji University), Ministry of Education [ESSCKF 2018-2]
  4. Open fund of Key Laboratory of Grain Information Processing and Control [KFJJ-2018-204]

Ask authors/readers for more resources

In recent years, edge computing becomes an increasingly popular alternative. Edge computing allows the computation is implemented in the edge of network, in which the data are stored in the edge of network, to improve the efficiency of data process. However, some resource management techniques in cloud or distributed system cannot better suit for edge computing. Therefore, there exist some challenges on the performance improvement of edge computing. In this paper, the main purpose is to combine the optimal placement of data blocks and the optimal scheduling of tasks to reduce the computation delay and response time for the submitted tasks and improve user experience in edge computing. In optimal placement of data blocks, the value of the data blocks considers not only the popularity of the data blocks, but the data storage capacity and replacement ratios of an edge server that will store those data blocks. Furthermore, the replacement cost for placed data blocks is regarded as an important component of data block placement. This optimal placement scheme can avoid replacing the placed data blocks repeatedly so that the bandwidth overhead is reduced. In optimal scheduling of tasks, the containers are taken as the lightweight resource unit for the services for user requests to make full use of data storage in edge servers and improve the services performance of edge servers. Finally, extensive experiments are conducted to value the performance of task scheduling strategy. The results show that the performance of the proposed task scheduling algorithm is better than that of the compared algorithms. (C) 2018 Elsevier Inc. 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

Primary Rating

4.5
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available