{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:13:21Z","timestamp":1755998001390,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T00:00:00Z","timestamp":1625529600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Singapore Ministry of Education Academic Research Fund Tier 1","award":["2019-T1-002-042"],"award-info":[{"award-number":["2019-T1-002-042"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,7,6]]},"DOI":"10.1145\/3409964.3461795","type":"proceedings-article","created":{"date-parts":[[2021,6,30]],"date-time":"2021-06-30T23:07:02Z","timestamp":1625094422000},"page":"340-350","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Analysis of Busy-Time Scheduling on Heterogeneous Machines"],"prefix":"10.1145","author":[{"given":"Mozhengfu","family":"Liu","sequence":"first","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xueyan","family":"Tang","sequence":"additional","affiliation":[{"name":"Nanyang Technological University, Singapore, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,7,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-39658-1_5"},{"key":"e_1_3_2_1_2_1","unstructured":"Amazon. 2021. Amazon EC2 . http:\/\/aws.amazon.com\/ec2\/  Amazon. 2021. Amazon EC2 . http:\/\/aws.amazon.com\/ec2\/"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3087556.3087570"},{"volume-title":"Online computation and competitive analysis","author":"Borodin Allan","key":"e_1_3_2_1_4_1","unstructured":"Allan Borodin and Ran El-Yaniv . 1998. Online computation and competitive analysis . Vol. 53 . Cambridge University Press Cambridge . Allan Borodin and Ran El-Yaniv. 1998. Online computation and competitive analysis. Vol. 53. Cambridge University Press Cambridge."},{"key":"e_1_3_2_1_5_1","volume-title":"Online Virtual Machine Allocation with Lifetime and Load Predictions. In ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) .","author":"Buchbinder Niv","year":"2021","unstructured":"Niv Buchbinder , Yaron Fairstein , Konstantina Mellou , Ishai Menache , and Joseph (Seffi) Naor . 2021 . Online Virtual Machine Allocation with Lifetime and Load Predictions. In ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) . Niv Buchbinder, Yaron Fairstein, Konstantina Mellou, Ishai Menache, and Joseph (Seffi) Naor. 2021. Online Virtual Machine Allocation with Lifetime and Load Predictions. In ACM International Conference on Measurement and Modeling of Computer Systems (SIGMETRICS) ."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-017-0531-3"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.05.011"},{"key":"e_1_3_2_1_8_1","unstructured":"Google. 2021. Google Cloud . https:\/\/cloud.google.com\/  Google. 2021. Google Cloud . https:\/\/cloud.google.com\/"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-014-0411-z"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/11590156_12"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612675"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2393868"},{"key":"e_1_3_2_1_13_1","volume-title":"Analysis of Busy-Time Scheduling on Heterogeneous Machines (Extended Version). arXiv preprint arXiv:2105.06287","author":"Liu Mozhengfu","year":"2021","unstructured":"Mozhengfu Liu and Xueyan Tang . 2021. Analysis of Busy-Time Scheduling on Heterogeneous Machines (Extended Version). arXiv preprint arXiv:2105.06287 ( 2021 ). Mozhengfu Liu and Xueyan Tang. 2021. Analysis of Busy-Time Scheduling on Heterogeneous Machines (Extended Version). arXiv preprint arXiv:2105.06287 (2021)."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.10.033"},{"key":"e_1_3_2_1_15_1","unstructured":"Microsoft. 2021. Microsoft Azure . https:\/\/azure.microsoft.com\/  Microsoft. 2021. Microsoft Azure . https:\/\/azure.microsoft.com\/"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935775"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS47924.2020.00040"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2016.2630052"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2020.3002786"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2014.07.017"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2889712"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.42"},{"volume-title":"Approximation algorithms","author":"Vazirani Vijay V","key":"e_1_3_2_1_23_1","unstructured":"Vijay V Vazirani . 2013. Approximation algorithms . Springer Science & Business Media . Vijay V Vazirani. 2013. Approximation algorithms .Springer Science & Business Media."},{"key":"e_1_3_2_1_24_1","volume-title":"Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) . 830--831","author":"Winkler Peter","year":"2003","unstructured":"Peter Winkler and Lisa Zhang . 2003 . Wavelength assignment and generalized interval graph coloring . In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) . 830--831 . Peter Winkler and Lisa Zhang. 2003. Wavelength assignment and generalized interval graph coloring. In Proceedings of the 14th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA) . 830--831."}],"event":{"name":"SPAA '21: 33rd ACM Symposium on Parallelism in Algorithms and Architectures","sponsor":["SIGACT ACM Special Interest Group on Algorithms and Computation Theory","SIGARCH ACM Special Interest Group on Computer Architecture","EATCS European Association for Theoretical Computer Science"],"location":"Virtual Event USA","acronym":"SPAA '21"},"container-title":["Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461795","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3409964.3461795","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:08Z","timestamp":1750191428000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3409964.3461795"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,6]]},"references-count":24,"alternative-id":["10.1145\/3409964.3461795","10.1145\/3409964"],"URL":"https:\/\/doi.org\/10.1145\/3409964.3461795","relation":{},"subject":[],"published":{"date-parts":[[2021,7,6]]},"assertion":[{"value":"2021-07-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}