Proceedings of the ACM International Conference on Object Oriented Programming Systems Languages and Applications 2012
DOI: 10.1145/2384616.2384634
|View full text |Cite
|
Sign up to set email alerts
|

Refactoring android Java code for on-demand computation offloading

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
31
0

Year Published

2013
2013
2021
2021

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 81 publications
(39 citation statements)
references
References 16 publications
(6 reference statements)
0
31
0
Order By: Relevance
“…Since the queueing delay of C3P is small, this time interval will result in the delay of D C3P n less than or equal to r C3P n E[β n,i ] for calculating r C3P n packets by helper n. On the other hand, the collector stops sending packets to helpers once it receives R + K packets collectively from all helpers. Again, since the queueing delay of C3P is small, i.e., the period of time packets wait in the queue of helper n to be computed is small, at the time that R + K packets are collected at the collector, there might be only small number of packets waiting at the queue of each helper and thus N n=1 r C3P n ≃ R + K. In addition, with small queueing delay, all helpers will finish their assigned tasks approximately at the same time; this results in (17) and (18).…”
Section: Appendix C: Proof Of Theoremmentioning
confidence: 99%
“…Since the queueing delay of C3P is small, this time interval will result in the delay of D C3P n less than or equal to r C3P n E[β n,i ] for calculating r C3P n packets by helper n. On the other hand, the collector stops sending packets to helpers once it receives R + K packets collectively from all helpers. Again, since the queueing delay of C3P is small, i.e., the period of time packets wait in the queue of helper n to be computed is small, at the time that R + K packets are collected at the collector, there might be only small number of packets waiting at the queue of each helper and thus N n=1 r C3P n ≃ R + K. In addition, with small queueing delay, all helpers will finish their assigned tasks approximately at the same time; this results in (17) and (18).…”
Section: Appendix C: Proof Of Theoremmentioning
confidence: 99%
“…The choice of the offloading scheme would be a critical decision, as it is the core functionality, which transforms mobile application to MCA. [3][4][5][6] Assuming that a development team chooses to use an existing scheme, they will need to evaluate and compare between existing offloading schemes. Two offloading schemes have been selected, 1 based on single thresholding 4 -ST for brevity and another based on multilayer perceptron 3 -known as properly offloading mobile applications to clouds (POMAC).…”
Section: Motivating Examplementioning
confidence: 99%
“…research. 3,5 The purpose of using case study applications from the literature is because of their identified taxonomy (for offloadable tasks). Table 3 presents details of the mobile applications used.…”
Section: The Metrics Collector Interfacementioning
confidence: 99%
See 1 more Smart Citation
“…Although the bulk of the original research on program partitioning for managed languages took place during the first decade of this century, recently this technique reemerged under the guise of cloud offloading, a technique for increasing the energy efficiency of mobile applications [1,2,4,8,9]. Our vision is that offloading and insourcing transformations should be developed in concert with each other as complementary operations.…”
Section: Related Workmentioning
confidence: 99%