Transient fault aware application partitioning computational offloading algorithm in microservices based mobile cloudlet networks

Computing ◽  
2019 ◽  
Vol 102 (1) ◽  
pp. 105-139 ◽  
Author(s):  
Abdullah Lakhan ◽  
Xiaoping Li
Author(s):  
Robin Prakash Mathur ◽  
Manmohan Sharma

: Computational offloading is emerging as a popular field in mobile cloud computing (MCC). Modern applications are power and compute-intensive which leads to the energy, storage and processing issues in mobile devices. Using the offloading concept, a mobile device can offload its computation to the cloud servers and receives back the results on the device. An important question that arises in the offloading scenario is which part of the application needs to be offloaded remotely. In order to identify that, the application needs to be partitioned. In this paper, the graph partitioning approach is considered which is based upon the spectral graph partitioning with the Kernighan Lin algorithm. Experimental results show that the proposed approach performs optimally in partitioning the application. The proposed technique gave better results than the existing techniques in terms of edge cut which is less, concluding minimum communication cost among components and thus save energy of the mobile device.


2012 ◽  
Vol 35 (12) ◽  
pp. 2562
Author(s):  
Chao WANG ◽  
Zhong-Chuan FU ◽  
Hong-Song CHEN ◽  
Gang CUI

Sensors ◽  
2021 ◽  
Vol 21 (7) ◽  
pp. 2347
Author(s):  
Yanyan Wang ◽  
Lin Wang ◽  
Ruijuan Zheng ◽  
Xuhui Zhao ◽  
Muhua Liu

In smart homes, the computational offloading technology of edge cloud computing (ECC) can effectively deal with the large amount of computation generated by smart devices. In this paper, we propose a computational offloading strategy for minimizing delay based on the back-pressure algorithm (BMDCO) to get the offloading decision and the number of tasks that can be offloaded. Specifically, we first construct a system with multiple local smart device task queues and multiple edge processor task queues. Then, we formulate an offloading strategy to minimize the queue length of tasks in each time slot by minimizing the Lyapunov drift optimization problem, so as to realize the stability of queues and improve the offloading performance. In addition, we give a theoretical analysis on the stability of the BMDCO algorithm by deducing the upper bound of all queues in this system. The simulation results show the stability of the proposed algorithm, and demonstrate that the BMDCO algorithm is superior to other alternatives. Compared with other algorithms, this algorithm can effectively reduce the computation delay.


Sign in / Sign up

Export Citation Format

Share Document