{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,14]],"date-time":"2026-01-14T13:39:48Z","timestamp":1768397988118,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":17,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,6,4]],"date-time":"2011-06-04T00:00:00Z","timestamp":1307145600000},"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":[[2011,6,4]]},"DOI":"10.1145\/1989493.1989554","type":"proceedings-article","created":{"date-parts":[[2011,6,8]],"date-time":"2011-06-08T14:36:21Z","timestamp":1307543781000},"page":"367-378","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":63,"title":["Sharing-aware algorithms for virtual machine colocation"],"prefix":"10.1145","author":[{"given":"Michael","family":"Sindelar","sequence":"first","affiliation":[{"name":"Google Inc., Mountain View, CA, USA"}]},{"given":"Ramesh K.","family":"Sitaraman","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}]},{"given":"Prashant","family":"Shenoy","sequence":"additional","affiliation":[{"name":"University of Massachusetts, Amherst, MA, USA"}]}],"member":"320","published-online":{"date-parts":[[2011,6,4]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/268998.266672"},{"key":"e_1_3_2_1_2_1","first-page":"46","volume-title":"Approximation Algorithms for NP-hard Problems","author":"Coffman E. G.","year":"1997","unstructured":"E. G. Coffman , Jr., M. R. Garey , and D. S. Johnson . Approximation algorithms for bin packing: A survey . In Approximation Algorithms for NP-hard Problems , pages 46 -- 93 , Boston, MA , USA, 1997 . PWS Publishing Co. E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson. Approximation algorithms for bin packing: A survey. In Approximation Algorithms for NP-hard Problems, pages 46--93, Boston, MA, USA, 1997. PWS Publishing Co."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579456"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/1109557.1109624"},{"key":"e_1_3_2_1_5_1","volume-title":"Usenix OSDI","author":"Gupta D.","year":"2008","unstructured":"D. Gupta , S. Lee , M. Vrable , S. Savage , A. C. Snoeren , G. Varghese , G. M. Voelker , and A. Vahdat . Difference engine: Harnessing memory redundancy in virtual machines . In Usenix OSDI , December 2008 . D. Gupta, S. Lee, M. Vrable, S. Savage, A. C. Snoeren, G. Varghese, G. M. Voelker, and A. Vahdat. Difference engine: Harnessing memory redundancy in virtual machines. In Usenix OSDI, December 2008."},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the International Workshop on Bioinformatics Research and Applications (IWBRA)","author":"Hajiaghayi M.","year":"2006","unstructured":"M. Hajiaghayi , K. Jain , K. Konwar , L. Lau , I. Mandoiu , A. Russell , A. Shvartsman , and V. Vazirani . The minimum k-colored subgraph problem in haplotyping and DNA primer selection . In Proceedings of the International Workshop on Bioinformatics Research and Applications (IWBRA) , 2006 . M. Hajiaghayi, K. Jain, K. Konwar, L. Lau, I. Mandoiu, A. Russell, A. Shvartsman, and V. Vazirani. The minimum k-colored subgraph problem in haplotyping and DNA primer selection. In Proceedings of the International Workshop on Bioinformatics Research and Applications (IWBRA), 2006."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.8.1.1"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1982.61"},{"key":"e_1_3_2_1_9_1","volume-title":"Department of Computer Science","author":"Kloster J.","year":"2006","unstructured":"J. Kloster , J. Kristensen , and A. Mejlholm . On the Feasibility of Memory Sharing: Content-Based Page Sharing in the Xen Virtual Machine Monitor. Master's thesis , Department of Computer Science , Aalborg University , June 2006 . J. Kloster, J. Kristensen, and A. Mejlholm. On the Feasibility of Memory Sharing: Content-Based Page Sharing in the Xen Virtual Machine Monitor. Master's thesis, Department of Computer Science, Aalborg University, June 2006."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.dam.2006.08.006"},{"key":"e_1_3_2_1_11_1","volume-title":"Knapsack problems: algorithms and computer implementations","author":"Martello S.","year":"1990","unstructured":"S. Martello and P. Toth . Knapsack problems: algorithms and computer implementations . Wiley & Sons , 1990 . S. Martello and P. Toth. Knapsack problems: algorithms and computer implementations. Wiley & Sons, 1990."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.66"},{"key":"e_1_3_2_1_13_1","volume-title":"DRS performance and best practices","year":"2008","unstructured":"VMware. DRS performance and best practices . 2008 . VMware. DRS performance and best practices. 2008."},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/1060289.1060307"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00179-8"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508293.1508299"},{"key":"e_1_3_2_1_17_1","volume-title":"July","author":"Yue M.","year":"1995","unstructured":"M. Yue and L. Zhang . A simple proof of the inequality MFFD(L) \u0142eq 71\/60 OPT(L)+1,L for MFFD bin-packing algorithm. Acta Mathematicae Applicatae Sinica (English Series), 11:318--330 , July 1995 . M. Yue and L. Zhang. A simple proof of the inequality MFFD(L) \u0142eq 71\/60 OPT(L)+1,L for MFFD bin-packing algorithm. Acta Mathematicae Applicatae Sinica (English Series), 11:318--330, July 1995."}],"event":{"name":"SPAA '11: 23rd ACM Symposium on Parallelism in Algorithms and Architectures","location":"San Jose California USA","acronym":"SPAA '11","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 twenty-third annual ACM symposium on Parallelism in algorithms and architectures"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989554","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1989493.1989554","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:05:54Z","timestamp":1750244754000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1989493.1989554"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,6,4]]},"references-count":17,"alternative-id":["10.1145\/1989493.1989554","10.1145\/1989493"],"URL":"https:\/\/doi.org\/10.1145\/1989493.1989554","relation":{},"subject":[],"published":{"date-parts":[[2011,6,4]]},"assertion":[{"value":"2011-06-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}