메뉴 건너뛰기




Volumn 16, Issue 11, 2017, Pages 3056-3069

HERMES: Latency Optimal Task Assignment for Resource-constrained Mobile Computing

Author keywords

approximation algorithms; computational offloading; Mobile cloud computing; on line learning

Indexed keywords

APPROXIMATION ALGORITHMS; CLOUD COMPUTING; COMPUTATIONAL COMPLEXITY; ENERGY UTILIZATION; INTEGER PROGRAMMING; MOBILE CLOUD COMPUTING; POLYNOMIAL APPROXIMATION; POLYNOMIALS; TREES (MATHEMATICS);

EID: 85032296153     PISSN: 15361233     EISSN: None     Source Type: Journal    
DOI: 10.1109/TMC.2017.2679712     Document Type: Article
Times cited : (227)

References (33)
  • 3
    • 84878499314 scopus 로고    scopus 로고
    • A survey of computation offloading for mobile systems
    • K. Kumar, J. Liu, Y.-H. Lu, and B. Bhargava, "A survey of computation offloading for mobile systems, " Mobile Netw. Appl., vol. 18, no. 1, pp. 129-140, 2013.
    • (2013) Mobile Netw. Appl , vol.18 , Issue.1 , pp. 129-140
    • Kumar, K.1    Liu, J.2    Lu, Y.-H.3    Bhargava, B.4
  • 5
    • 84861596582 scopus 로고    scopus 로고
    • ThinkAir: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading
    • S. Kosta, A. Aucinas, P. Hui, R. Mortier, and X. Zhang, "ThinkAir: Dynamic resource allocation and parallel execution in the cloud for mobile code offloading, " in Proc. IEEE INFOCOM, 2012, pp. 945-953.
    • (2012) Proc IEEE INFOCOM , pp. 945-953
    • Kosta, S.1    Aucinas, A.2    Hui, P.3    Mortier, R.4    Zhang, X.5
  • 6
    • 84925850117 scopus 로고    scopus 로고
    • Mechanisms and challenges on mobility-Augmented service provisioning for mobile cloud computing
    • Mar
    • W. Li, Y. Zhao, S. Lu, and D. Chen, "Mechanisms and challenges on mobility-Augmented service provisioning for mobile cloud computing, " IEEE Commun. Mag., vol. 53, no. 3, pp. 89-97, Mar. 2015.
    • (2015) IEEE Commun. Mag , vol.53 , Issue.3 , pp. 89-97
    • Li, W.1    Zhao, Y.2    Lu, S.3    Chen, D.4
  • 7
    • 84883128081 scopus 로고    scopus 로고
    • To offload or not to offload? the bandwidth and energy costs of mobile cloud computing
    • M. V. Barbera, S. Kosta, A. Mei, and J. Stefa, "To offload or not to offload? the bandwidth and energy costs of mobile cloud computing, " in Proc. IEEE INFOCOM, 2013, pp. 1285-1293.
    • (2013) Proc IEEE INFOCOM , pp. 1285-1293
    • Barbera, M.V.1    Kosta, S.2    Mei, A.3    Stefa, J.4
  • 11
    • 77954993714 scopus 로고    scopus 로고
    • MAUI: Making smartphones last longer with code offload
    • E. Cuervo, et al., "MAUI: Making smartphones last longer with code offload, " in Proc. 8th Int. Conf. Mobile Syst. Appl. Serv., 2010, pp. 49-62.
    • (2010) Proc. 8th Int. Conf. Mobile Syst. Appl. Serv , pp. 49-62
    • Cuervo, E.1
  • 12
    • 4544338955 scopus 로고    scopus 로고
    • Parametric analysis for adaptive computation offloading
    • C. Wang and Z. Li, "Parametric analysis for adaptive computation offloading, " ACM SIGPLAN Notices, vol. 39, no. 6, pp. 119-130, 2004.
    • (2004) ACM SIGPLAN Notices , vol.39 , Issue.6 , pp. 119-130
    • Wang, C.1    Li, Z.2
  • 14
    • 84884549238 scopus 로고    scopus 로고
    • Deterministic sequencing of exploration and exploitation for multi-Armed bandit problems
    • Oct
    • S. Vakili, K. Liu, and Q. Zhao, "Deterministic sequencing of exploration and exploitation for multi-Armed bandit problems, " IEEE J. Selected Topics Signal Process., vol. 7, no. 5, pp. 759-767, Oct. 2013.
    • (2013) IEEE J. Selected Topics Signal Process , vol.7 , Issue.5 , pp. 759-767
    • Vakili, S.1    Liu, K.2    Zhao, Q.3
  • 17
  • 18
    • 0002491487 scopus 로고
    • A polynomial algorithm for the k-cut problem for fixed k
    • O. Goldschmidt and D. S. Hochbaum, "A polynomial algorithm for the k-cut problem for fixed k, " Math. Operations Res., vol. 19, no. 1, pp. 24-37, 1994.
    • (1994) Math. Operations Res , vol.19 , Issue.1 , pp. 24-37
    • Goldschmidt, O.1    Hochbaum, D.S.2
  • 22
    • 84927536689 scopus 로고    scopus 로고
    • A game-Theoretic approach to computation offloading in mobile cloud computing
    • V. Cardellini, et al., "A game-Theoretic approach to computation offloading in mobile cloud computing, " Math. Program., vol. 157, no. 2, pp. 421-449, 2016.
    • (2016) Math. Program , vol.157 , Issue.2 , pp. 421-449
    • Cardellini, V.1
  • 24
    • 84954238579 scopus 로고    scopus 로고
    • HERMES: Latency optimal task assignment for resource-constrained mobile computing
    • Y.-H. Kao, B. Krishnamachari, M.-R. Ra, and F. Bai, "Hermes: Latency optimal task assignment for resource-constrained mobile computing, " in Proc. IEEE Conf. Comput. Commun., 2015, pp. 1894-1902.
    • (2015) Proc IEEE Conf. Comput. Commun , pp. 1894-1902
    • Kao, Y.-H.1    Krishnamachari, B.2    Ra, M.-R.3    Bai, F.4
  • 25
    • 0042983554 scopus 로고    scopus 로고
    • Polynomial time approximation algorithms for machine scheduling: Ten open problems
    • P. Schuurman and G. J. Woeginger, "Polynomial time approximation algorithms for machine scheduling: Ten open problems, " J. Scheduling, vol. 2, no. 5, pp. 203-213, 1999.
    • (1999) J. Scheduling , vol.2 , Issue.5 , pp. 203-213
    • Schuurman, P.1    Woeginger, G.J.2
  • 26
    • 35048899753 scopus 로고    scopus 로고
    • Approximation algorithms for scheduling jobs with chain precedence constraints
    • K. Jansen and R. Solis-Oba, "Approximation algorithms for scheduling jobs with chain precedence constraints, " in Proc. Int. Conf. Parallel Process. Appl. Math., 2004, pp. 105-112.
    • (2004) Proc. Int. Conf. Parallel Process. Appl. Math , pp. 105-112
    • Jansen, K.1    Solis-Oba, R.2
  • 27
    • 0026170095 scopus 로고
    • Scheduling chain-structured tasks to minimize makespan and mean flow time
    • J. Du, J. Y. Leung, and G. H. Young, "Scheduling chain-structured tasks to minimize makespan and mean flow time, " Inf. Comput., vol. 92, no. 2, pp. 219-236, 1991.
    • (1991) Inf. Comput , vol.92 , Issue.2 , pp. 219-236
    • Du, J.1    Leung, J.Y.2    Young, G.H.3
  • 28
    • 84976822151 scopus 로고
    • Strong np-completeness results: Motivation, examples, and implications
    • M. R. Garey and D. S. Johnson, ""strong"np-completeness results: Motivation, examples, and implications, " J. ACM, vol. 25, no. 3, pp. 499-508, 1978.
    • (1978) J ACM , vol.25 , Issue.3 , pp. 499-508
    • Garey, M.R.1    Johnson, D.S.2
  • 30
    • 84869125197 scopus 로고    scopus 로고
    • Predicting task execution time on handheld devices using the keystroke-level model
    • L. Luo and B. E. John, "Predicting task execution time on handheld devices using the keystroke-level model, " in Proc. ACM Extended AbstractsHuman Factors Comput. Syst., 2005, pp. 1605-1608.
    • (2005) Proc. ACM Extended AbstractsHuman Factors Comput. Syst , pp. 1605-1608
    • Luo, L.1    John, B.E.2
  • 31
    • 0016943409 scopus 로고
    • An efficient implementation of edmonds algorithm for maximum matching on graphs
    • H. N. Gabow, "An efficient implementation of edmonds algorithm for maximum matching on graphs, " J. ACM, vol. 23, no. 2, pp. 221-234, 1976.
    • (1976) J ACM , vol.23 , Issue.2 , pp. 221-234
    • Gabow, H.N.1
  • 32
    • 84859270558 scopus 로고    scopus 로고
    • Tight bound for matching
    • Y. Han, "Tight bound for matching, " J. Combinatorial Optimization, vol. 23, no. 3, pp. 322-330, 2012.
    • (2012) J. Combinatorial Optimization , vol.23 , Issue.3 , pp. 322-330
    • Han, Y.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.