Programming dynamically reconfigurable open systems with SALSA
ACM SIGPLAN Notices
A computation offloading scheme on handheld devices
Journal of Parallel and Distributed Computing - Special issue on middleware
Slingshot: deploying stateful services in wireless hotspots
Proceedings of the 3rd international conference on Mobile systems, applications, and services
EW 10 Proceedings of the 10th workshop on ACM SIGOPS European workshop
The Case for VM-Based Cloudlets in Mobile Computing
IEEE Pervasive Computing
MAUI: making smartphones last longer with code offload
Proceedings of the 8th international conference on Mobile systems, applications, and services
CloneCloud: elastic execution between mobile device and cloud
Proceedings of the sixth conference on Computer systems
Elastic Scalable Cloud Computing Using Application-Level Migration
UCC '12 Proceedings of the 2012 IEEE/ACM Fifth International Conference on Utility and Cloud Computing
Machine Learning-Based Runtime Scheduler for Mobile Offloading Framework
UCC '13 Proceedings of the 2013 IEEE/ACM 6th International Conference on Utility and Cloud Computing
| Hi-index | 0.00 |
Applications on smartphones are extremely popular as users can download and install them very easily from a service provider's application repository. Most of the applications are thoroughly tested and verified on a target smartphone platform; however, some applications could be very computationally intensive and overload the smartphone's resource capability. In this paper, we describe a method to predict the total processing time when offloading part of an application from smartphones to nearby servers. In our method, if an application developercan (1) define a basic model of the problem (e. g., f(x)=ax+b) and (2) implement an algorithm to update the model (e. g., least squares method), the application quickly adjusts the parameters of the model and minimizes the difference between predicted and measured performance adaptively. This accurate prediction helps dynamically determine whether or not it is worth offloading tasks and the expected performance improvement. Since this model's simplicity greatly reduces the time required for profiling the performance of the application at run-time, it enables users to start using an application without pre-computing a performance profile. Our experiments show that our update parameter protocol for the performance prediction functions works sufficiently well for a face detection problem. The protocol requires on average 7.8 trials to update prediction parameters, and the prediction error stays less than 10% for the rest of the trials. By offloading the face detection task to a nearby server for an image of 1.2Mbytes, the performance improved from 19 seconds to 4 seconds. This research opens up the possibility of new applications in real-time smartphone data processing by harnessing nearby computational resources.