A Review of Computational Task Offloading Approaches in Mobile Computing

Authors

  • Dr. Gopal Sakarkar  Assistant Professor, Department of Master of Computer Applications, G.H.Raisoni College of Engineering, Nagpur, Maharashtra, India
  • Neha Purohit  Assistant Professor, Department of Master of Computer Applications, G.H.Raisoni College of Engineering, Nagpur, Maharashtra, India
  • Nidhi Santosh Gour  PG Scholar, Department of Master of Computer Applications, G.H.Raisoni College of Engineering, Nagpur, Maharashtra, India
  • Saroj Bandooji Meshram  PG Scholar, Department of Master of Computer Applications, G.H.Raisoni College of Engineering, Nagpur, Maharashtra, India

Keywords:

Computational Offloading, Mobile Cloud Computing, Computation With Communication, Semi-Online Algorithms

Abstract

Mobile cloud computing permits the execution of calculation escalated uses of cell phones in computational clouds, and this procedure of executing in cloud by sending the application VM/Components is called application/code/part offloading. Offloading is a successful strategy to spare the execution time and vitality utilization of cell phones. In this way it amplifies the battery life of cell phones. Applications are first apportioned into offloadable and on-offloadable segments, which are then exchanged to remote server for execution. We concentrate the booking of computational assignments on one nearby processor and one remote processor with correspondence delay. This issue has vital application in cloud computing. In spite of the fact that the correspondence time to transmit an errand can be induced from the known information size of the assignment and the transmission data transfer capacity, the preparing time of the undertaking is for the most part obscure until it is handled to completion. The target of this paper is to investigate the distinctive systems of offloading and application dividing techniques. These strategies are completely surveyed in this paper. This paper likewise highlights the examination of various systems on the premise of their commitment, benefits, negative marks and furthermore on the premise of change in execution time, vitality utilization, correspondence time.

References

  1. M. Armbrust, A. Fox, R. Griffith, A. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia, “A view of cloud computing,” Commun. ACM, vol. 53, no. 4, pp. 50–58, Apr. 2010.
  2. R. L. Graham, “Bounds for certain multiprocessing anomalies,” Bell System Technical Journal, vol. 45, pp. 1563–1541, 1966.
  3. B. Shmoys, J. Wein, and D. P. Williamson, “Scheduling parallel machines on-line,” SIAM J. Comput., vol. 24, no. 6, pp. 1313–1331, Dec. 1995.
  4. G. Fries, “Scheduling independent tasks on uniform processors,” SIAM J. Computing, vol. 13, no. 1, pp. 705–716, 1984.
  5. Kovcs, “New approximation bounds for lpt scheduling.” Algo- rithmica, vol. 57, no. 2, pp. 413–433, 2010.
  6. R. L. Graham, E. L. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan, “Optimization and approximation in deterministic sequencing and scheduling: a survey,” Annals of discrete mathematics, vol. 5, no. 2, pp. 287–326, 1979.
  7. P. Williamson and D. B. Shmoys, The Design of Approximation Algorithms, 1st ed. Cambridge University Press, 2011.
  8. H. Casanova, A. Legrand, D. Zagorodnov, and F. Berman, “Heuristics for scheduling parameter sweep applications in grid environments,” in Heterogeneous Computing Workshop, 2000, pp. 349–363
  9. Giersch, Y. Robert, and F. Vivien, “Scheduling tasks sharing files on heterogeneous master-slave platforms,” Journal of Systems Architecture, vol. 52, no. 2, pp. 88–104, 2006.
  10. K. Kaya and C. Aykanat, “Iterative-improvement-based heuristics for adaptive scheduling of tasks sharing files on heterogeneous master-slave environments.” IEEE Trans. Parallel Distrib. Syst., vol. 17, no. 8, pp. 883–896, 2006.
  11. O. Beaumont, A. Legrand, and Y. Robert, “The master-slave paradigm with heterogeneous processors,” IEEE Trans. Parallel Distrib. Syst., vol. 14, no. 9, pp. 897–908, 2003.
  12. M. Drozdowski, Scheduling for Parallel Processing, 1st ed. Springer Publishing Company, Incorporated, 2009.
  13. K. Kumar, J. Liu, Y.-H. Lu, and B. Bhargava, “A survey of computation offloading for mobile systems,” Mob. Netw. Appl., vol. 18, no. 1, pp. 129–140, Feb. 2013.
  14. K. Tabak, B. B. Cambazoglu, and C. Aykanat, “Improving the performance of independent task assignment heuristics minmin, maxmin and sufferage,” IEEE Trans. Parallel Distrib. Syst., vol. 25, no. 5, pp. 1244–1256, May 2014.
  15. V. Vazirani, Approximation Algorithms. New York, NY, USA: Springer-Verlag New York, Inc., 2001. 12
  16. H. Kellerer, V. Kotov, M. G. Speranza, and Z. Tuza, “Semi on-line algorithms for the partition problem,” Operations Research Letters, vol. 21, no. 5, pp. 235 – 242, 1997.
  17. T. E. Cheng, H. Kellerer, and V. Kotov, “Semi-on-line multiprocessor scheduling with given total processing time,” Theoretical Computer Science, vol. 337, no. 13, pp. 134 – 146, 2005.
  18. S. Albers and M. Hellwig, “Semi-online scheduling revisited,” Theoretical Computer Science, vol. 443, pp. 1 – 9, 2012.
  19. H. Kellerer, V. Kotov, and M. Gabay, “An efficient algorithm for semi-online multiprocessor scheduling with given total processing time,” Journal of Scheduling, vol. 8, no. 6, pp. 623–630, 2015.
  20. C. Ng, Z. Tan, Y. He, and T. Cheng, “Two semi-online scheduling problems on two uniform machines,” Theoretical Computer Science, vol. 410, no. 810, pp. 776 – 792, 2009.
  21. R. K. Balan, M. Satyanarayanan, S. Y. Park, and T. Okoshi, “Tactics-based remote execution for mobile computing,” in Proc. International Conference on Mobile Systems, Applications, and Services (MobiSys), 2003, pp. 273–286.

International Journal of Scientific Research in Science, Engineering and Technology

Downloads

Published

2019-04-30

Issue

Volume 6, Issue 2, March-April-2019

Section

Research Articles

License

Copyright (c) IJSRSET

Creative Commons License

This work is licensed under a Creative Commons Attribution 4.0 International License.

How to Cite

[1]
Dr. Gopal Sakarkar, Neha Purohit, Nidhi Santosh Gour, Saroj Bandooji Meshram, " A Review of Computational Task Offloading Approaches in Mobile Computing, International Journal of Scientific Research in Science, Engineering and Technology(IJSRSET), Print ISSN : 2395-1990, Online ISSN : 2394-4099, Volume 6, Issue 2, pp.381-387, March-April-2019.