Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/17763
Title: A framework for partitioning and execution of data stream applications in mobile cloud computing
Authors: Yang, L
Cao, J 
Yuan, Y
Li, T
Han, A
Chan, A 
Keywords: Application partitioning
Genetic algorithm
Mobile cloud computing
Issue Date: 2013
Publisher: Association for Computing Machinary
Source: Performance evaluation review, 2013, v. 40, no. 4, p. 23-32 How to cite?
Journal: Performance evaluation review 
Abstract: The contribution of cloud computing and mobile computing technologies lead to the newly emerging mobile cloud computing paradigm. Three major approaches have been proposed for mobile cloud applications: 1) extending the access to cloud services to mobile devices; 2) enabling mobile devices to work collaboratively as cloud resource providers; 3) augmenting the execution of mobile applications on portable devices using cloud resources. In this paper, we focus on the third approach in supporting mobile data stream applications. More specifically, we study how to optimize the computation partitioning of a data stream application between mobile and cloud to achieve maximum speed/throughput in processing the streaming data. To the best of our knowledge, it is the first work to study the partitioning problem for mobile data stream applications, where the optimization is placed on achieving high throughput of processing the streaming data rather than minimizing the makespan of executions as in other applications. We first propose a framework to provide runtime support for the dynamic computation partitioning and execution of the application. Different from existing works, the framework not only allows the dynamic partitioning for a single user but also supports the sharing of computation instances among multiple users in the cloud to achieve efficient utilization of the underlying cloud resources. Meanwhile, the framework has better scalability because it is designed on the elastic cloud fabrics. Based on the framework, we design a genetic algorithm for optimal computation partition. Both numerical evaluation and real world experiment have been performed, and the results show that the partitioned application can achieve at least two times better performance in terms of throughput than the application without partitioning.
URI: http://hdl.handle.net/10397/17763
ISSN: 0163-5999
DOI: 10.1145/2479942.2479946
Appears in Collections:Journal/Magazine Article

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

SCOPUSTM   
Citations

64
Last Week
1
Last month
1
Citations as of Jul 30, 2017

Page view(s)

37
Last Week
4
Last month
Checked on Aug 14, 2017

Google ScholarTM

Check

Altmetric



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