Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/74190
Title: Network aware multi-user computation partitioning in mobile edge clouds
Authors: Yang, L
Cao, J 
Wang, Z
Wu, W
Keywords: Bandwidth allocation
Computation partitioning
Mobile edge cloud
Issue Date: 2017
Publisher: Institute of Electrical and Electronics Engineers
Source: Proceedings of the International Conference on Parallel Processing, 2017, 8025304, p. 302-311 How to cite?
Abstract: Mobile edge cloud has been increasingly concerned by researchers due to its closer distance to mobile users than the traditional cloud on Internet. Offloading computations from mobile devices to the nearby edge cloud is an effective technique to accelerate the applications and/or save energy on the mobile devices. However, the mobile edge cloud usually has limited computation resources and constrained access bandwidth shared by multiple users in its proximity. Thus, allocation of resources and bandwidth among the users is significant to the overall application performance. In this paper, we study network aware multi-user computation partitioning problem in mobile edge clouds, i.e., to decide for each user which parts of the application should be offload onto the edge cloud, and which others should be executed locally, and meanwhile to allocate the access bandwidth among the users, such that the average application performance of the users is maximized.This problem is novel in that we consider the competition among users for both computing resources and bandwidth, and jointly optimizes the partitioning decisions with the allocation of resources and bandwidths among users, while most existing works either focus on the single user computation partitioning or study the multiple user computation partitioning without regard of the constrained network bandwidth. We first formulate the problem, and then transform it into the classic Multi-class Multi-dimensional Knapsack Problem and develop an effective algorithm, namely Performance Function Matrix based Heuristic (PFM-H), to solve it. Comprehensive simulations show that our proposed algorithm outperforms the benchmark algorithms significantly in the average application performance.
URI: http://hdl.handle.net/10397/74190
ISBN: 9781538610428
ISSN: 0190-3918
DOI: 10.1109/ICPP.2017.39
Appears in Collections:Conference Paper

Access
View full-text via PolyU eLinks SFX Query
Show full item record

SCOPUSTM   
Citations

2
Last Week
0
Last month
Citations as of Mar 29, 2019

Page view(s)

24
Last Week
0
Last month
Citations as of May 21, 2019

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.