skip to main content
10.1145/3466772.3467034acmconferencesArticle/Chapter ViewAbstractPublication PagesmobihocConference Proceedingsconference-collections
research-article
Public Access

Task Offloading with Uncertain Processing Cycles

Published:26 July 2021Publication History

ABSTRACT

Mobile Edge Computing (MEC) has emerged to be an integral component of 5G infrastructure due to its potential to speed up task processing and reduce energy consumption for mobile devices. However, a major technical challenge in making offloading decisions is that the number of required processing cycles of a task is usually unknown in advance. Due to this processing uncertainty, it is difficult to make offloading decisions while providing any guarantee on task deadlines. To address this challenge, we propose EPD---Energy-minimized solution with Probabilistic Deadline guarantee to task offloading problem. The mathematical foundation of EPD is Exact Conic Reformulation (ECR), which is a powerful tool that reformulates a probabilistic constraint for task deadline into a deterministic one. In the absence of distribution knowledge of processing cycles, we use the estimated mean and variance of processing cycles and exploit ECR to the fullest extent in the design of EPD. Simulation results show that EPD successfully guarantees the probabilistic deadlines while minimizing the energy consumption of mobile users, and can achieve significant improvement in energy saving when compared to a state-of-the-art approach.

References

  1. 3GPP. TR 36.931: Radio Frequency (RF) requirements for LTE Pico Node B, June 2018. Version 15.0.0. Available: https://portal.3gpp.org/desktopmodules/Specifications/SpecificationDetails.aspx?specificationId=2589.Google ScholarGoogle Scholar
  2. 3GPP. TR 23.501: System architecture for the 5G System (5GS), Aug. 2020. Version 16.5.1. Available: https://portal.3gpp.org/desktopmodules/Specifications/SpecificationDetails.aspx?specificationId=3144.Google ScholarGoogle Scholar
  3. Abbas, N., Zhang, Y., Taherkordi, A., and Skeie, T. Mobile edge computing: A survey. IEEE Internet of Things Journal 5, 1 (2017), 450--465.Google ScholarGoogle Scholar
  4. Atawia, R., Abou-Zeid, H., Hassanein, H. S., and Noureldin, A. Joint chance-constrained predictive resource allocation for energy-efficient video streaming. IEEE J. Selected Areas in Commun. 34, 5 (2016), 1389--1404.Google ScholarGoogle ScholarDigital LibraryDigital Library
  5. Baker, T. P. A comparison of global and partitioned EDF schedulability tests for multiprocessors. In Proc. ACM RTNS 2005. Paris, France, May 2005.Google ScholarGoogle Scholar
  6. Ben-Tal, A., and Nemirovski, A. Selected topics in robust convex optimization. Mathematical Programming 112, 1 (2008), 125--158.Google ScholarGoogle Scholar
  7. Cao, J., Yang, L., and Cao, J. Revisiting computation partitioning in future 5G-based edge computing environments. IEEE Internet of Things Journal 6, 2 (2018), 2427--2438.Google ScholarGoogle Scholar
  8. Chen, J., and Ran, X. Deep learning with edge computing: A review. Proceedings of the IEEE 107, 8 (2019), 1655--1674.Google ScholarGoogle ScholarCross RefCross Ref
  9. Chen, X., Jiao, L., Li, W., and Fu, X. Efficient multi-user computation offloading for mobile-edge cloud computing. IEEE/ACM Trans. Networking 24, 5 (2015), 2795--2808.Google ScholarGoogle Scholar
  10. Eshraghi, N., and Liang, B. Joint offloading decision and resource allocation with uncertain task computing requirement. In Proc. IEEE INFOCOM, pp. 1414--1422. Paris, France, May 2019.Google ScholarGoogle ScholarDigital LibraryDigital Library
  11. Feller, W. An Introduction to Probability Theory and Its Applications, vol. 2. John Wiley & Sons. Ch. 1, 2008.Google ScholarGoogle Scholar
  12. Fisher, N., and Baruah, S. The partitioned multiprocessor scheduling of non-preemptive sporadic task systems. In Proc. ACM RTNS, pp. 99--108. Poitiers, France, May 2006.Google ScholarGoogle Scholar
  13. Gao, W., Li, Y., Lu, H., Wang, T., and Liu, C. On exploiting dynamic execution patterns for workload offloading in mobile cloud applications. In Proc. IEEE ICNP, pp. 1--12. Raleigh, NC, USA, Oct. 21--24, 2014.Google ScholarGoogle ScholarDigital LibraryDigital Library
  14. Kekki, S., Featherstone, W., Fang, Y., Kuure, P., Li, A., Ranjan, A., Purkayastha, D., Jiangping, F., Frydman, D., Verin, G., et al. MEC in 5G networks. ETSI white paper 28 (2018), 1--28.Google ScholarGoogle Scholar
  15. Kwak, J., Kim, Y., Lee, J., and Chong, S. Dream: Dynamic resource and task allocation for energy minimization in mobile cloud systems. IEEE J. Selected Areas in Commun. 33, 12 (2015), 2510--2523.Google ScholarGoogle ScholarDigital LibraryDigital Library
  16. Leung, J. Y., and Pinedo, M. Minimizing total completion time on parallel machines with deadline constraints. SIAM J. Computing 32, 5 (2003), 1370--1388.Google ScholarGoogle ScholarDigital LibraryDigital Library
  17. Li, S., Huang, Y., Li, C., Jalaian, B. A., Hou, Y. T., and Lou, W. Coping uncertainty in coexistence via exploitation of interference threshold violation. In Proc. ACM MobiHoc, pp. 71--80. Catania, Italy, July 2019.Google ScholarGoogle ScholarDigital LibraryDigital Library
  18. Li, W. W.-L., Zhang, Y. J., So, A. M.-C., and Win, M. Z. Slow adaptive OFDMA systems through chance constrained programming. IEEE Trans. Signal Processing 58, 7 (2010), 3858--3869.Google ScholarGoogle ScholarDigital LibraryDigital Library
  19. Liu, Z., Chan, K. Y., Ma, K., Guan, X., et al. Chance-constrained optimization in D2D-based vehicular communication network. IEEE Trans. Vehicular Technology 68, 5 (2019), 5045--5058.Google ScholarGoogle Scholar
  20. López, J. M., Díaz, J. L., and García, D. F. Utilization bounds for EDF scheduling on real-time multiprocessor systems. Real-Time Systems 28, 1 (2004), 39--68.Google ScholarGoogle ScholarDigital LibraryDigital Library
  21. Lyu, X., and Tian, H. Adaptive receding horizon offloading strategy under dynamic environment. IEEE Commun. Letters 20, 5 (2016), 878--881.Google ScholarGoogle ScholarCross RefCross Ref
  22. Mach, P., and Becvar, Z. Mobile edge computing: A survey on architecture and computation offloading. IEEE Commun. Surveys & Tutorials 19, 3 (2017), 1628--1656.Google ScholarGoogle ScholarDigital LibraryDigital Library
  23. Mao, Y., You, C., Zhang, J., Huang, K., and Letaief, K. B. A survey on mobile edge computing: The communication perspective. IEEE Commun. Surveys & Tutorials 19, 4 (2017), 2322--2358.Google ScholarGoogle ScholarCross RefCross Ref
  24. Mao, Y., Zhang, J., and Letaief, K. B. Dynamic computation offloading for mobile-edge computing with energy harvesting devices. IEEE J. Selected Areas in Commun. 34, 12 (2016), 3590--3605.Google ScholarGoogle ScholarDigital LibraryDigital Library
  25. Nemirovski, A., and Shapiro, A. Convex approximations of chance constrained programs. SIAM J. Optimization 17, 4 (2007), 969--996.Google ScholarGoogle ScholarDigital LibraryDigital Library
  26. Painter, T., and Spanias, A. Perceptual coding of digital audio. Proceedings of the IEEE 88, 4 (2000), 451--515.Google ScholarGoogle ScholarCross RefCross Ref
  27. Rockafellar, R. T., Uryasev, S., et al. Optimization of conditional value-at-risk. Journal of Risk 2 (2000), 21--42.Google ScholarGoogle ScholarCross RefCross Ref
  28. Shmoys, D. B., Wein, J., and Williamson, D. P. Scheduling parallel machines on-line. SIAM J. Computing 24, 6 (1995), 1313--1331.Google ScholarGoogle ScholarDigital LibraryDigital Library
  29. Sun, H., Zhou, F., and Hu, R. Q. Joint offloading and computation energy efficiency maximization in a mobile edge computing system. IEEE Trans. Vehicular Technology 68, 3 (2019), 3052--3056.Google ScholarGoogle Scholar
  30. Zhang, W., Wen, Y., Guan, K., Kilper, D., Luo, H., and Wu, D. O. Energy-optimal mobile cloud computing under stochastic wireless channel. IEEE Trans. Wireless Commun. 12, 9 (2013), 4569--4581.Google ScholarGoogle ScholarCross RefCross Ref

Index Terms

  1. Task Offloading with Uncertain Processing Cycles

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in
        • Published in

          cover image ACM Conferences
          MobiHoc '21: Proceedings of the Twenty-second International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing
          July 2021
          286 pages
          ISBN:9781450385589
          DOI:10.1145/3466772

          Copyright © 2021 ACM

          Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          • Published: 26 July 2021

          Permissions

          Request permissions about this article.

          Request Permissions

          Check for updates

          Qualifiers

          • research-article
          • Research
          • Refereed limited

          Acceptance Rates

          MobiHoc '21 Paper Acceptance Rate28of139submissions,20%Overall Acceptance Rate296of1,843submissions,16%

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader