{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T16:45:39Z","timestamp":1765039539519,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":38,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,10,11]],"date-time":"2020-10-11T00:00:00Z","timestamp":1602374400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Key Research Program of Frontier Sciences (CAS) award","award":["QYZDY-SSW-JSC002"],"award-info":[{"award-number":["QYZDY-SSW-JSC002"]}]},{"name":"National Key R&D Program of China award","award":["2018YFB0803400"],"award-info":[{"award-number":["2018YFB0803400"]}]},{"name":"Anhui Dept. of Science and Technology award","award":["201903a05020049"],"award-info":[{"award-number":["201903a05020049"]}]},{"name":"Microsoft Research Asia"},{"name":"NSFC award","award":["61772489, 61751211"],"award-info":[{"award-number":["61772489, 61751211"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,10,11]]},"DOI":"10.1145\/3397166.3409122","type":"proceedings-article","created":{"date-parts":[[2020,10,8]],"date-time":"2020-10-08T02:02:42Z","timestamp":1602122562000},"page":"101-110","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":20,"title":["Online dispatching and scheduling of jobs with heterogeneous utilities in edge computing"],"prefix":"10.1145","author":[{"given":"Chi","family":"Zhang","sequence":"first","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Haisheng","family":"Tan","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Haoqiang","family":"Huang","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Zhenhua","family":"Han","sequence":"additional","affiliation":[{"name":"Microsoft Research Asia, Shanghai, China"}]},{"given":"Shaofeng H.-C.","family":"Jiang","sequence":"additional","affiliation":[{"name":"Weizmann Institute of Science, Israel"}]},{"given":"Nikolaos","family":"Freris","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]},{"given":"Xiang-Yang","family":"Li","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}]}],"member":"320","published-online":{"date-parts":[[2020,10,11]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_2_1_1_1","DOI":"10.1007\/s00453-009-9321-4"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_2_1","DOI":"10.1007\/BF00365406"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_3_1","DOI":"10.1109\/SFCS.1991.185354"},{"key":"e_1_3_2_1_4_1","volume-title":"Proc. of STOC.","author":"Chadha Jivitej S","year":"2009","unstructured":"Jivitej S Chadha , Naveen Garg , Amit Kumar , and VN Muralidhara . 2009 . A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation . In Proc. of STOC. Jivitej S Chadha, Naveen Garg, Amit Kumar, and VN Muralidhara. 2009. A competitive algorithm for minimizing weighted flow time on unrelated machines with speed augmentation. In Proc. of STOC."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_5_1","DOI":"10.1109\/INFOCOM.2016.7524525"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1007\/978-3-030-17953-3_11"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/1966445.1966473"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1109\/CVPR.2009.5206848"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_9_1","DOI":"10.1109\/TVT.2017.2714704"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1109\/FOCS.2007.52"},{"key":"e_1_3_2_1_11_1","volume-title":"COMET: Code Offload by Migrating Execution Transparently. In OSDI.","author":"Gordon Mark S","year":"2012","unstructured":"Mark S Gordon , D Anoushe Jamshidi , Scott Mahlke , Z Morley Mao , and Xu Chen . 2012 . COMET: Code Offload by Migrating Execution Transparently. In OSDI. Mark S Gordon, D Anoushe Jamshidi, Scott Mahlke, Z Morley Mao, and Xu Chen. 2012. COMET: Code Offload by Migrating Execution Transparently. In OSDI."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.1109\/CVPR.2016.90"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/978-3-319-46493-0_38"},{"key":"e_1_3_2_1_14_1","volume-title":"Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861","author":"Howard Andrew G","year":"2017","unstructured":"Andrew G Howard , Menglong Zhu , Bo Chen , Dmitry Kalenichenko , Weijun Wang , Tobias Weyand , Marco Andreetto , and Hartwig Adam . 2017 . Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861 (2017). Andrew G Howard, Menglong Zhu, Bo Chen, Dmitry Kalenichenko, Weijun Wang, Tobias Weyand, Marco Andreetto, and Hartwig Adam. 2017. Mobilenets: Efficient convolutional neural networks for mobile vision applications. arXiv preprint arXiv:1704.04861 (2017)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_15_1","DOI":"10.1109\/CVPR.2017.243"},{"key":"e_1_3_2_1_16_1","volume-title":"SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and&lt","author":"Iandola Forrest N","year":"2016","unstructured":"Forrest N Iandola , Song Han , Matthew W Moskewicz , Khalid Ashraf , William J Dally , and Kurt Keutzer . 2016. SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and&lt ; 0.5 MB model size. arXiv preprint arXiv:1602.07360 ( 2016 ). Forrest N Iandola, Song Han, Matthew W Moskewicz, Khalid Ashraf, William J Dally, and Kurt Keutzer. 2016. SqueezeNet: AlexNet-level accuracy with 50x fewer parameters and< 0.5 MB model size. arXiv preprint arXiv:1602.07360 (2016)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_17_1","DOI":"10.1145\/2935764.2935771"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1007\/s004530010034"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_19_1","DOI":"10.1016\/0304-3975(94)90165-1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1137\/S0097539792236882"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1109\/INFCOM.2012.6195845"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1145\/3173162.3173191"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1145\/3210240.3210313"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_24_1","DOI":"10.1109\/INFOCOM.2019.8737577"},{"volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"Pruhs Kirk","unstructured":"Kirk Pruhs and Cliff Stein . 2010. How to schedule when you have to buy your energy . In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques . Springer , 352--365. Kirk Pruhs and Cliff Stein. 2010. How to schedule when you have to buy your energy. In Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. Springer, 352--365.","key":"e_1_3_2_1_25_1"},{"unstructured":"Charles Reiss et al. 2011. Google cluster-usage traces. Technical Report.  Charles Reiss et al. 2011. Google cluster-usage traces. Technical Report.","key":"e_1_3_2_1_26_1"},{"key":"e_1_3_2_1_27_1","volume-title":"2014 AAAI Spring Symposium Series.","author":"Sadigh Dorsa","year":"2014","unstructured":"Dorsa Sadigh , Katherine Driggs-Campbell , Alberto Puggelli , Wenchao Li , Victor Shia , Ruzena Bajcsy , Alberto Sangiovanni-Vincentelli , S Shankar Sastry , and Sanjit Seshia . 2014 . Data-driven probabilistic modeling and verification of human driver behavior . In 2014 AAAI Spring Symposium Series. Dorsa Sadigh, Katherine Driggs-Campbell, Alberto Puggelli, Wenchao Li, Victor Shia, Ruzena Bajcsy, Alberto Sangiovanni-Vincentelli, S Shankar Sastry, and Sanjit Seshia. 2014. Data-driven probabilistic modeling and verification of human driver behavior. In 2014 AAAI Spring Symposium Series."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_28_1","DOI":"10.1109\/CVPR.2018.00474"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.1109\/MPRV.2009.82"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.1109\/JIOT.2018.2838022"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_31_1","DOI":"10.1109\/INFOCOM.2017.8057116"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_32_1","DOI":"10.1109\/INFOCOM.2016.7524340"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.1016\/j.peva.2015.06.013"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1109\/TITS.2015.2396031"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1109\/INFOCOM.2018.8486411"},{"unstructured":"Kathy Winter. 2017. For Self-Driving Cars There's Big Meaning Behind One Big Number: 4 Terabytes. https:\/\/newsroom.intel.com\/editorials\/self-driving-cars-big-meaning-behind-one-number-4-terabytes\/  Kathy Winter. 2017. For Self-Driving Cars There's Big Meaning Behind One Big Number: 4 Terabytes. https:\/\/newsroom.intel.com\/editorials\/self-driving-cars-big-meaning-behind-one-number-4-terabytes\/","key":"e_1_3_2_1_36_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1109\/CVPR.2017.376"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_38_1","DOI":"10.1145\/3341302.3342089"}],"event":{"sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"],"acronym":"Mobihoc '20","name":"Mobihoc '20: The Twenty-first ACM International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","location":"Virtual Event USA"},"container-title":["Proceedings of the Twenty-First International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397166.3409122","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3397166.3409122","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:41:25Z","timestamp":1750200085000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3397166.3409122"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,11]]},"references-count":38,"alternative-id":["10.1145\/3397166.3409122","10.1145\/3397166"],"URL":"https:\/\/doi.org\/10.1145\/3397166.3409122","relation":{},"subject":[],"published":{"date-parts":[[2020,10,11]]},"assertion":[{"value":"2020-10-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}