The Community for Technology Leaders
RSS Icon
Issue No.04 - October-December (2010 vol.3)
pp: 266-278
Benjamin Speitkamp , Technische Universität München, Munich
Martin Bichler , Technische Universität München, Munich
Today's data centers offer IT services mostly hosted on dedicated physical servers. Server virtualization provides a technical means for server consolidation. Thus, multiple virtual servers can be hosted on a single server. Server consolidation describes the process of combining the workloads of several different servers on a set of target servers. We focus on server consolidation with dozens or hundreds of servers, which can be regularly found in enterprise data centers. Cost saving is among the key drivers for such projects. This paper presents decision models to optimally allocate source servers to physical target servers while considering real-world constraints. Our central model is proven to be an NP-hard problem. Therefore, besides an exact solution method, a heuristic is presented to address large-scale server consolidation projects. In addition, a preprocessing method for server load data is introduced allowing for the consideration of quality-of-service levels. Extensive experiments were conducted based on a large set of server load data from a data center provider focusing on managerial concerns over what types of problems can be solved. Results show that, on average, server savings of 31 percent can be achieved only by taking cycles in the server workload into account.
Management of services delivery, modeling of resources, data center management services, optimization of services systems.
Benjamin Speitkamp, Martin Bichler, "A Mathematical Programming Approach for Server Consolidation Problems in Virtualized Data Centers", IEEE Transactions on Services Computing, vol.3, no. 4, pp. 266-278, October-December 2010, doi:10.1109/TSC.2010.25
[1] K. Parent, "Server Consolidation Improves IT's Capacity Utilization," Court Square Data Group, 2005.
[2] D. Filani, J. He, S. Gao, M. Rajappa, A. Kumar, P. Shah, and R. Nagappan, "Technology with the Environment in Mind— Dynamic Data Center Power Management: Trends, Issues, and Solutions," Intel Technology J., vol. 12, pp. 59-68, Feb. 2008.
[3] IDC, "Increasing the Load: Virtualization Moves Beyond Proof of Concept in the Volume Server Market," press release, Oct. 2005.
[4] D. Menasce, Performance by Design: Computer Capacity Planning. Prentice Hall, 2004.
[5] J.-N. Lee, S.M. Miranda, and Y.-M. Kim, "IT Outsourcing Strategies: Universalistic, Contingency, and Configurational Explanations of Success," Information Systems Research, vol. 15, pp. 110-131, June 2004.
[6] OGC, ITIL Best Practice for Service Delivery, fourth ed. The Stationary Office, 2002.
[7] ISO 20000 IT Service Management Standards, Int'l Organization for Standardization ISO/IEC, ISO, 2005.
[8] E. Noel and K.W. Tang, "Performance Modeling of Multihop Network Subject to Uniform and Nonuniform Geometric Traffic," IEEE/ACM Trans. Networking, vol. 8, no. 6, pp. 763-774, Dec. 2000.
[9] S.S. Thakkar and M. Schweiger, "Performance of an OLTP Application on Symmetry Multiprocessor System," Proc. 17th Ann. Int'l Symp. Computer Architecture, pp. 228-238, 1990.
[10] D. Menasce, V. Almeida, and L. Dowdy, Performance by Design: Computer Capacity Planning by Example. Prentice Hall, 2004.
[11] A.R. Hevner, S.T. March, J. Park, and S. Ram, "Design Science in Information Systems Research," MIS Quarterly, vol. 28, pp. 75-105, Mar. 2004.
[12] M. Missbach and J. Stelzel, Adaptive Hardware-Infrastrukturen für SAP. SAP Press, 2005.
[13] SAP, "SAP Standard Application Benchmarks: Measuring in SAPS," vol. 2009, 2008.
[14] Q. Zhang, L. Cherkasova, G. Mathews, W. Greene, and E. Smirni, "R-Capriccio: A Capacity Planning and Anomaly Detection Tool for Enterprise Services with Live Workloads," Proc. Int'l Middleware Conf., pp. 244-265, 2007.
[15] M. Garey and R. Graham, "Resource Constrained Scheduling as Generalized Bin Packing," J. Combinatorial Theory, Series A, vol. 21, pp. 257-298, Nov. 1976.
[16] M.Y. Kao, Encyclopedia of Algorithms. Springer, 2008.
[17] M. Yue, "A Simple Proof of the Inequality FFD (L) $\le\!\!$ 11/9 OPT (L) + 1, for All L, for the FFD Bin-Packing Algorithm," Acta Mathematicae Applicatae Sinica (English Series), vol. 7, pp. 321-331, 1991.
[18] G. Dósa, "The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD ( I )$\le\!\!$ 11/9 OPT ( I ) + 6/9," Proc. Int'l Symp. Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, B. Chen, M. Paterson, and G. Zhang, eds., pp. 1-11, 2007.
[19] C. Chekuri and S. Khanna, "On Multi-Dimensional Packing Problems," Proc. ACM-SIAM Symp. Discrete Algorithms, pp. 185-194, 1999.
[20] N. Bansal, A. Caprara, and M. Sviridenko, "Improved Approximation Algorithms for Multidimensional Bin Packing Problems," Proc. IEEE Symp. Foundations of Computer Science, pp. 697-708, 2006.
[21] M. Andreolini, S. Casolari, and M. Colajanni, "Models and Framework for Supporting Runtime Decisions in Web-Based Systems," ACM Trans. Web, vol. 2, pp. 1-43, 2008.
[22] S. Elnikety, E. Nahum, J. Tracey, and W. Zwaenepoel, "A Method for Transparent Admission Control and Request Scheduling in E-Commerce Web Sites," Proc. Int'l Conf. World Wide Web, 2004.
[23] C. Pu, A. Sahai, J. Parekh, J. Gueyoung, B. Ji, C. You-Kyung, T. Garcia, D. Irani, L. Jae, and L. Qifeng, "An Observation-Based Approach to Performance Characterization of Distributed n-Tier Applications," Proc. IEEE 10th Int'l Symp. Workload Characterization (IISWC '07), pp. 161-170, 2007.
[24] F. Margot, "Symmetric ILP: Coloring and Small Integers," Discrete Optimization, vol. 4, pp. 40-62, 2007.
[25] R. Kumar, "Important Questions from Gartner's EMEA Data Center Conference 2006: Data Center Trends," Gartner, Inc., Dec. 2006.
[26] R. Kumar, "Data Center Power and Cooling Scenario through 2015," Gartner, Inc., Mar. 2007.
[27] R. Kumar and L. Mieritz, "Conceptualizing 'Green' IT and Data Center Power and Cooling Issues," Gartner, Inc., Sept. 2007.
[28] R. Kumar and S. Mingay, "How IT Management Can 'Green' the Data Center," Gartner, Inc., Jan. 2008.
[29] J.R. Phelps, "Data Center Conference 2007 Server Consolidation Poll Finds Projects Increasing, Reasons Changing and Outside Assistance Growing," Gartner, Inc., Jan. 2008.
[30] K. Peffers, T. Tuunanen, M.A. Rothenberger, and S. Chatterjee, "A Design Science Research Methodology for Information Systems Research," J. Management Information Systems, vol. 24, pp. 45-77, 2008.
[31] J. Rolia, A. Andrzejak, and M. Arlitt, "Automating Enterprise Application Placement in Resource Utilities," Proc. 14th IFIP/IEEE Int'l Workshop Distributed Systems: Operations and Management (DSOM '03), pp. 118-129, 2003.
[32] A. Zhang, F. Safai, and D. Beyer, "Server Consolidation: High-Dimensional Probabilistic Bin-Packing," Proc. INFORMS Conf., 2005.
[33] S. Seltzsam, D. Gmach, K. Krompass, and A. Kemper, "AutoGlobe: An Automatic Administration Concept for Service-Oriented Database Applications," Proc. 22nd Int'l Conf. Data Eng. (ICDE '06), 2006.
[34] B. Hayes, "Cloud Computing," Comm. ACM, vol. 51, pp. 9-11, 2008.
[35] S. Seiden, "On the Online Bin Packing Problem," J. ACM, vol. 49, pp. 640-671, 2002.
[36] M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Company, 1979.
[37] R.H. Shumway and D.S. Stoffer, Time Series Analysis and Its Applications, second ed. Springer, 2006.
[38] H.P. Williams, Model Building in Mathematical Programming. John Wiley & Sons Ltd, 1999.
31 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool