Sharing-aware algorithms for virtual machine colocation

Annual ACM Symposium on Parallelism in Algorithms and Architectures

Volumn , Issue , 2011, Pages 367-377

  Sindelar, Michael ^a   Sitaraman, Ramesh K ^b   Shenoy, Prashant ^b  

^a GOOGLE INC   (United States)

^b Biologically Inspired Neural and Dynamical Systems Laboratory   (United States)

Author keywords

bin packing; optimization; page sharing; virtualization

Indexed keywords

APPROXIMATION SCHEME; BIN PACKING; COLOCATIONS; MAXIMIZATION PROBLEM; MEMORY FOOTPRINT; MEMORY REQUIREMENTS; NP-HARD; PACKING ALGORITHMS; PACKING PROBLEMS; PAGE SHARING; SERVICE PROVIDER; SHARE MEMORY; SOFTWARE LIBRARIES; TREE MODELS; VIRTUAL MACHINES; VIRTUALIZATIONS;

OPTIMIZATION; PLANT EXTRACTS; PROFITABILITY; TREES (MATHEMATICS); VIRTUAL REALITY;

CLUSTERING ALGORITHMS;

EID: 79959630327     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1989493.1989554     Document Type: Conference Paper

References (17)

1. E. Bugnion, S. Devine, and M. Rosenblum. DISCO: Running Commodity Operating Systems on Scalable Multiprocessors. In SOSP, pages 143-156, 1997.
2. 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.
3. W. Fernandez de la Vega and G. Lueker. Bin packing can be solved within 1+ " in linear time. Combinatorica, 1(4):349-355, 1981.
4. L. Fleischer, M. X. Goemans, V. S. Mirrokni, and M. Sviridenko. Tight approximation algorithms for maximum general assignment problems. In Proceedings of the Seventeenth annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pages 611-620, New York, NY, USA, 2006. ACM.
5. 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.
6. 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.
7. D. Johnson and K. Niemi. On knapsacks, partitions, and a new dynamic programming technique for trees. Mathematics of Operations Research, 8(1):1-14, 1983. (Pubitemid 13527105) (Pubitemid 13527105)
8. N. Karmarkar and R. Karp. An efficient approximation scheme for the one-dimensional bin-packing problem. In 23rd Annual Symposium on Foundations of Computer Science, pages 312-320. IEEE, 1982.
9. 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.
10. S. Kolliopoulos and G. Steiner. Partially ordered knapsack and applications to scheduling. Discrete Applied Mathematics, 155(8):889-897, 2007. (Pubitemid 46442743) (Pubitemid 46442743)
11. S. Martello and P. Toth. Knapsack problems: algorithms and computer implementations. Wiley & Sons, 1990.
12. Z. Svitkina and L. Fleischer. Submodular approximation: Sampling-based algorithms and lower bounds. In FOCS, pages 697-706. IEEE Computer Society, 2008.
13. VMware. DRS performance and best practices. 2008.
14. C. Waldspurger. Memory Resource Management in VMWare ESX Server. In Proceedings of the Fifth Symposium on Operating System Design and Implementation (OSDI'02), Dec. 2002.
15. G. Woeginger. There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters, 64(6):293-297, 1997. (Pubitemid 127413199) (Pubitemid 127413199)
16. T. Wood, G. Tarasuk-Levin, P. Shenoy, P. Desnoyers, E. Cecchet, and M. Corner. Memory buddies: Exploiting page sharing for smart colocation in virtualized data centers. In 2009 ACM SIGPLAN/SIGOPS International Conference on Virtual Execution Environments (VEE 2009), Washington, DC, USA, March 2009.
17. M. Yue and L. Zhang. A simple proof of the inequality MFFD(L) ≤ 71/60 OPT(L) + 1,L for MFFD bin-packing algorithm. Acta Mathematicae Applicatae Sinica (English Series), 11:318-330, July 1995.