{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T01:03:51Z","timestamp":1782954231324,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,6,17]],"date-time":"2023-06-17T00:00:00Z","timestamp":1686960000000},"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":[],"published-print":{"date-parts":[[2023,6,17]]},"DOI":"10.1145\/3558481.3591314","type":"proceedings-article","created":{"date-parts":[[2023,5,31]],"date-time":"2023-05-31T22:22:03Z","timestamp":1685571723000},"page":"307-310","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Brief Announcement: Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5995-471X","authenticated-orcid":false,"given":"Aniket","family":"Murhekar","sequence":"first","affiliation":[{"name":"University of Illinois, Urbana-Champaign, Champaign, IL, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9932-7657","authenticated-orcid":false,"given":"David","family":"Arbour","sequence":"additional","affiliation":[{"name":"Adobe Research, San Jose, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-1081-5627","authenticated-orcid":false,"given":"Tung","family":"Mai","sequence":"additional","affiliation":[{"name":"Adobe Research, San Jose, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-7226-7860","authenticated-orcid":false,"given":"Anup B.","family":"Rao","sequence":"additional","affiliation":[{"name":"Adobe Research, San Jose, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,6,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3364214"},{"key":"e_1_3_2_1_2_1","unstructured":"Allan Borodin and Ran El-Yaniv. 1998. Online computation and competitive analysis."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/3410220.3456278"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.cosrev.2016.12.001"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-7997-1_35"},{"key":"e_1_3_2_1_6_1","unstructured":"Gaikai. https:\/\/en.wikipedia.org\/wiki\/Gaikai."},{"key":"e_1_3_2_1_7_1","volume-title":"Protean: VM Allocation Service at Scale. In OSDI. USENIX. https:\/\/www.microsoft.com\/en-us\/research\/publication\/protean-vm-allocation-service-at-scale\/","author":"Hadary Ori","year":"2020","unstructured":"Ori Hadary, Luke Marshall, Ishai Menache, Abhisek Pan, David Dion, Esaias E Greeff, Star Dorminey, Shailesh Joshi, Yang Chen, Mark Russinovich, and Thomas Moscibroda. 2020. Protean: VM Allocation Service at Scale. In OSDI. USENIX. https:\/\/www.microsoft.com\/en-us\/research\/publication\/protean-vm-allocation-service-at-scale\/"},{"key":"e_1_3_2_1_8_1","volume-title":"SOFSEM 2015: Theory and Practice of Computer Science, Giuseppe F","author":"Kamali Shahin","unstructured":"Shahin Kamali and Alejandro L\u00f3pez-Ortiz. 2015. Efficient Online Strategies for Renting Servers in the Cloud. In SOFSEM 2015: Theory and Practice of Computer Science, Giuseppe F. Italiano, Tiziana Margaria-Steffen, Jaroslav Pokorn\u00fd, Jean-Jacques Quisquater, and Roger Wattenhofer (Eds.). Springer Berlin Heidelberg, Berlin, Heidelberg, 277--288."},{"key":"e_1_3_2_1_9_1","first-page":"15","article-title":"A Dynamic Energy efficient Resource Allocation Scheme for Heterogeneous clouds using Bin-Packing Heuristics","volume":"9","author":"Karwayun Ragini","year":"2018","unstructured":"Ragini Karwayun. 2018. A Dynamic Energy efficient Resource Allocation Scheme for Heterogeneous clouds using Bin-Packing Heuristics. Algorithms, Vol. 9 (2018), 15--24.","journal-title":"Algorithms"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2612669.2612675"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2015.2393868"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2012.2226216"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Aniket Murhekar David Arbour Tung Mai and Anup Rao. 2023. Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud. arxiv: 2304.08648 [cs.DS]","DOI":"10.1145\/3558481.3591314"},{"key":"e_1_3_2_1_14_1","unstructured":"OnLive. https:\/\/en.wikipedia.org\/wiki\/OnLive."},{"key":"e_1_3_2_1_15_1","volume-title":"Heuristics for Vector Bin Packing. (January","author":"Panigrahy Rina","year":"2011","unstructured":"Rina Panigrahy, Kunal Talwar, Lincoln Uyeda, and Udi Wieder. 2011. Heuristics for Vector Bin Packing. (January 2011). https:\/\/www.microsoft.com\/en-us\/research\/publication\/heuristics-for-vector-bin-packing\/"},{"key":"e_1_3_2_1_16_1","unstructured":"Amazon EC2 Pricing. Accessed 2022-01-08. https:\/\/aws.amazon.com\/ec2\/pricing\/"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935775"},{"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.1145\/2494232.2465547"},{"key":"e_1_3_2_1_20_1","unstructured":"StreamMyGame. https:\/\/en.wikipedia.org\/wiki\/StreamMyGame."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.42"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00179-8"}],"event":{"name":"SPAA '23: 35th ACM Symposium on Parallelism in Algorithms and Architectures","location":"Orlando FL USA","acronym":"SPAA '23","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"]},"container-title":["Proceedings of the 35th ACM Symposium on Parallelism in Algorithms and Architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591314","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3558481.3591314","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:47:07Z","timestamp":1750178827000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3558481.3591314"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,17]]},"references-count":22,"alternative-id":["10.1145\/3558481.3591314","10.1145\/3558481"],"URL":"https:\/\/doi.org\/10.1145\/3558481.3591314","relation":{},"subject":[],"published":{"date-parts":[[2023,6,17]]},"assertion":[{"value":"2023-06-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}