Back to results list
Please use this identifier to cite or link to this item:
|Title:||Computation partitioning in mobile cloud applications : modeling, optimization and evaluations||Authors:||Yang, Lei||Keywords:||Cloud computing.
Hong Kong Polytechnic University -- Dissertations
|Issue Date:||2014||Publisher:||The Hong Kong Polytechnic University||Abstract:||Second, we study the model of single user computation partitioning, where the application is composed of dependent computations and the partitioning decision is done for one single user. We found that most existing works on computation partitioning pertains to this model. We tackle two issues that are important but not solved in existing works. One issue is partitioning of data streaming application. In this work, we aim at optimizing the partition of a data stream application between mobile and cloud so that the application has maximum speed/throughput in processing the streaming data. To the best of our knowledge, ours 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 in other applications. We propose a framework to provide runtime support for the dynamic 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 multiple tenancy service invocation in the cloud to achieve efficient utilization of the underlying cloud resources. The framework is designed on the elastic cloud fabrics for better scalability. The optimization of the partitioning for each single user is by using genetic algorithm. Through both extensive simulations and experiments on real world applications, we show that our method can achieve more than 2X better performance over the execution without partitioning. The other issue is computation partitioning under dynamic mobile cloud environments. Existing works assume that the computational and data transmission cost of each part of the application remains the same as the application is running. This assumption does not hold in dynamic mobile cloud environments, where the device and network connection status may fluctuate, and thus affects the computational and transmission cost. In this case, the one time partitioning of the application may yield significant performance degradations. Therefore, we consider updating the partition periodically during the course of application execution, which is named as computation repartitioning in our thesis. We propose a framework for run time computation repartitioning in dynamic mobile cloud environments. Based on this framework, we take the dynamic network connection to clouds as a case study, and design an online solution, Foreseer, to solve the mobile cloud application repartitioning problem. We evaluate our solution based on real world data traces that are collected in a campus WiFi hotspot testbed. The result shows that our method can achieve significantly shorter completion time over previous approaches. Third, we study the most complex model of computation partitioning, where the application is composed of dependent computations, and the partitioning decision is made for multiple users. In this model, the multiple users compete for the computing resources shared by the users on the cloud. The users' partitioning decisions are dependent with each other. To achieve high system performance, the users' partitioning decisions should be considered jointly with the scheduling of computations on the shared cloud resources. To the best of our knowledge, we are the first to study the Multiple user Computation Partitioning Problem (MCPP). We show that MCPP is different from and more difficult than the classical job scheduling problems. In classical job scheduling problems, the computations are allowed to schedule onto arbitrary resources including the mobile devices and cloud resources, while in MCPP the users computations can not be scheduled to other usersdevices. We design an offline heuristic algorithm, namely SearchAdjust, to solve MCPP. We demonstrate through benchmarks that SearchAdjust outperforms the classical job scheduling approaches by 10% on average in terms of application delay. Based on SearchAdjust, we also design an online algorithm for MCPP that can be easily deployed in practical systems. We validate the effectiveness of our online algorithm using real world load traces.||Description:||xx, 180 p. : ill. ; 30 cm.
PolyU Library Call No.: [THS] LG51 .H577P COMP 2014 Yang
|URI:||http://hdl.handle.net/10397/7148||Rights:||All rights reserved.|
|Appears in Collections:||Thesis|
Show full item record
Files in This Item:
|b27473041_link.htm||For PolyU Users||203 B||HTML||View/Open|
|b27473041_ir.pdf||For All Users (Non-printable)||4.06 MB||Adobe PDF||View/Open|
Citations as of Feb 19, 2018
Citations as of Feb 19, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.