{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,26]],"date-time":"2026-02-26T15:16:41Z","timestamp":1772119001148,"version":"3.50.1"},"reference-count":43,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2018,1,20]],"date-time":"2018-01-20T00:00:00Z","timestamp":1516406400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Internet Technol."],"published-print":{"date-parts":[[2018,5,31]]},"abstract":"<jats:p>\n            Mobile cloud computing is emerging as a promising approach to enrich user experiences at the mobile device end. Computation offloading in a heterogeneous mobile cloud environment has recently drawn increasing attention in research. The computation offloading decision making and tasks scheduling among heterogeneous shared resources in mobile clouds are becoming challenging problems in terms of providing global optimal task response time and energy efficiency. In this article, we address these two problems together in a heterogeneous mobile cloud environment as an optimization problem. Different from conventional distributed computing system scheduling problems, our joint offloading and scheduling optimization problem considers unique contexts of mobile clouds such as wireless network connections and mobile device mobility, which makes the problem more complex. We propose a context-aware mixed integer programming model to provide off-line optimal solutions for making the offloading decisions and scheduling the offloaded tasks among the shared computing resources in heterogeneous mobile clouds. The objective is to minimize the global task completion time (i.e., makespan). To solve the problem in real time, we further propose a deterministic online algorithm\u2014the Online Code Offloading and Scheduling (OCOS) algorithm\u2014based on the\n            <jats:italic>rent\/buy<\/jats:italic>\n            problem and prove the algorithm is 2-competitive. Performance evaluation results show that the OCOS algorithm can generate schedules that have around two times shorter makespan than conventional independent task scheduling algorithms. Also, it can save around 30% more on makespan of task execution schedules than conventional offloading strategies, and scales well as the number of users grows.\n          <\/jats:p>","DOI":"10.1145\/3122981","type":"journal-article","created":{"date-parts":[[2018,1,22]],"date-time":"2018-01-22T13:22:59Z","timestamp":1516627379000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":59,"title":["An Online Algorithm for Task Offloading in Heterogeneous Mobile Clouds"],"prefix":"10.1145","volume":"18","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7849-1888","authenticated-orcid":false,"given":"Bowen","family":"Zhou","sequence":"first","affiliation":[{"name":"The University of Melbourne, Australia"}]},{"given":"Amir Vahid","family":"Dastjerdi","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Australia"}]},{"given":"Rodrigo N.","family":"Calheiros","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Australia"}]},{"given":"Rajkumar","family":"Buyya","sequence":"additional","affiliation":[{"name":"The University of Melbourne, Australia"}]}],"member":"320","published-online":{"date-parts":[[2018,1,20]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2015.11.042"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.2307\/1910129"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1644893.1644927"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/SPAWC.2013.6612005"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2013.6566921"},{"key":"e_1_2_1_6_1","volume-title":"Online Computation and Competitive Analysis","author":"Borodin Allan"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1714"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1002\/ett.2967"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the IEEE Global Communications Conference.","author":"Chen Shuang"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2316834"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1966445.1966473"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1814433.1814441"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2014.2381640"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1002\/wcm.1203"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28641-7_12"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2013.09.012"},{"key":"e_1_2_1_17_1","volume-title":"Johnson","author":"Garey Michael R.","year":"1990"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2007.1042"},{"key":"e_1_2_1_19_1","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1109\/TWC.2012.041912.110912","article-title":"A dynamic offloading algorithm for mobile computing","volume":"11","author":"Huang Dong","year":"2012","journal-title":"IEEE Transactions on Wireless Communications"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/322003.322011"},{"key":"e_1_2_1_21_1","volume-title":"Proceedings of the 1st Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics, 301--309","author":"Karlin Anna R.","year":"1990"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1986.14"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195845"},{"key":"e_1_2_1_24_1","unstructured":"David Kotz Tristan Henderson Ilya Abyzov and Jihwang Yeo. 2009. CRAWDAD dataset dartmouth\/campus (v. 2009-09-09). Retrieved from http:\/\/crawdad.org\/dartmouth\/campus\/20090909\/syslog.  David Kotz Tristan Henderson Ilya Abyzov and Jihwang Yeo. 2009. CRAWDAD dataset dartmouth\/campus (v. 2009-09-09). Retrieved from http:\/\/crawdad.org\/dartmouth\/campus\/20090909\/syslog."},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/ISPA.2012.115"},{"key":"e_1_2_1_26_1","volume-title":"Proceedings of the 2016 International Conference on Computer, Information and Telecommunication Systems (CITS). 1--6.","author":"Krishna P. Venkata"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2010.98"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 2013 IEEE Wireless Communications and Networking Conference (WCNC). 4695--4700","author":"Lai Kunfeng","year":"2013"},{"key":"e_1_2_1_29_1","volume-title":"Statistical Models and Methods for Lifetime Data","author":"Lawless Jerald F."},{"key":"e_1_2_1_30_1","volume-title":"Security-Enriched Urban Computing and Smart Grid","author":"Lee JongHyuk"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2016.04.013"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/MNET.2013.6616112"},{"key":"e_1_2_1_33_1","volume-title":"Proceedings of the IEEE 15th International Symposium on Network Computing and Applications (NCA). 162--169","author":"Nan Yucen"},{"key":"e_1_2_1_34_1","volume-title":"URL: https:\/\/nectar.org.au\/research-cloud\/","year":"2015"},{"key":"e_1_2_1_35_1","volume-title":"Gurobi optimizer reference manual. URL: http:\/\/www. gurobi. com","author":"Optimization Gurobi","year":"2015"},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUD.2013.100"},{"key":"e_1_2_1_37_1","volume-title":"The Weibull Distribution: A Handbook","author":"Rinne Horst"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/MPRV.2009.82"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2015.10.004"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFCOM.2012.6195685"},{"key":"e_1_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1109\/TWC.2013.072513.121842"},{"key":"e_1_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2015.2511002"}],"container-title":["ACM Transactions on Internet Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122981","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3122981","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:11:04Z","timestamp":1750212664000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3122981"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,1,20]]},"references-count":43,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2018,5,31]]}},"alternative-id":["10.1145\/3122981"],"URL":"https:\/\/doi.org\/10.1145\/3122981","relation":{},"ISSN":["1533-5399","1557-6051"],"issn-type":[{"value":"1533-5399","type":"print"},{"value":"1557-6051","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,1,20]]},"assertion":[{"value":"2016-11-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-07-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2018-01-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}