메뉴 건너뛰기




Volumn 3, Issue 4, 2010, Pages 266-278

A mathematical programming approach for server consolidation problems in virtualized data centers

Author keywords

data center management services; Management of services delivery; modeling of resources; optimization of services systems

Indexed keywords

COST SAVING; DATA CENTER MANAGEMENT; DATA CENTERS; DECISION MODELS; ENTERPRISE DATA; EXACT SOLUTION; IT SERVICES; MODELING OF RESOURCES; NP-HARD PROBLEM; OPTIMIZATION OF SERVICES SYSTEMS; PRE-PROCESSING METHOD; REAL-WORLD; SERVER CONSOLIDATION; SERVER LOADS; SINGLE SERVER; VIRTUAL SERVERS; VIRTUALIZATIONS;

EID: 78650025707     PISSN: 19391374     EISSN: None     Source Type: Journal    
DOI: 10.1109/TSC.2010.25     Document Type: Article
Times cited : (304)

References (38)
  • 2
    • 70349509124 scopus 로고    scopus 로고
    • Technology with the environment in mind-dynamic data center power management: Trends, issues, and solutions
    • Feb
    • 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.
    • (2008) Intel Technology J. , vol.12 , pp. 59-68
    • Filani, D.1    He, J.2    Gao, S.3    Rajappa, M.4    Kumar, A.5    Shah, P.6    Nagappan, R.7
  • 5
    • 4043081253 scopus 로고    scopus 로고
    • IT outsourcing strategies: Universalistic, contingency, and configurational explanations of success
    • June
    • 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.
    • (2004) Information Systems Research , vol.15 , pp. 110-131
    • Lee, J.-N.1    Miranda, S.M.2    Kim, Y.-M.3
  • 8
    • 0034466678 scopus 로고    scopus 로고
    • Performance modeling of multihop network subject to uniform and nonuniform geometric traffic
    • Dec
    • 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.
    • (2000) IEEE/ACM Trans. Networking , vol.8 , Issue.6 , pp. 763-774
    • Noel, E.1    Tang, K.W.2
  • 11
    • 0242652022 scopus 로고    scopus 로고
    • Design science in information systems research
    • Mar
    • 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.
    • (2004) MIS Quarterly , vol.28 , pp. 75-105
    • Hevner, A.R.1    March, S.T.2    Park, J.3    Ram, S.4
  • 14
    • 38349079967 scopus 로고    scopus 로고
    • R-capriccio: A capacity planning and anomaly detection tool for enterprise services with live workloads
    • 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.
    • (2007) Proc. Int'l Middleware Conf , pp. 244-265
    • Zhang, Q.1    Cherkasova, L.2    Mathews, G.3    Greene, W.4    Smirni, E.5
  • 15
    • 0001491336 scopus 로고
    • Resource constrained scheduling as generalized bin packing
    • Nov
    • M. Garey and R Graham, "Resource Constrained Scheduling as Generalized Bin Packing", J. Combinatorial Theory, Series A, vol. 21, pp. 257-298, Nov. 1976.
    • (1976) J. Combinatorial Theory, Series A , vol.21 , pp. 257-298
    • Garey, M.1    Graham, R.2
  • 17
    • 0041636797 scopus 로고
    • A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, for All L, for the FFD Bin-packing algorithm
    • M. Yue, "A Simple Proof of the Inequality FFD (L) ≤ 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.
    • (1991) Acta Mathematicae Applicatae Sinica (English Series) , vol.7 , pp. 321-331
    • Yue, M.1
  • 18
    • 38049049887 scopus 로고    scopus 로고
    • The tight bound of first fit decreasing bin-packing algorithm Is FFD (I) ≤ 11/9 OPT (I) + 6/9
    • B. Chen, M. Paterson, and G Zhang, eds.
    • G Dosa, "The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD (I) ≤ 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.
    • (2007) Proc. Int'l Symp. Combinatorics, Algorithms, Probabilistic and Experimental Methodologies , pp. 1-11
    • Dosa, G.1
  • 21
    • 47249144372 scopus 로고    scopus 로고
    • Models and framework for supporting runtime decisions in web-based systems
    • 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.
    • (2008) ACM Trans. Web , vol.2 , pp. 1-43
    • Andreolini, M.1    Casolari, S.2    Colajanni, M.3
  • 24
    • 33846593931 scopus 로고    scopus 로고
    • Symmetric ILP: Coloring and small integers
    • F. Margot, "Symmetric ILP: Coloring and Small Integers", Discrete Optimization, vol. 4, pp. 40-62, 2007.
    • (2007) Discrete Optimization , vol.4 , pp. 40-62
    • Margot, F.1
  • 32
    • 78650020682 scopus 로고    scopus 로고
    • Server consolidation: High-dimensional probabilistic bin-packing
    • A. Zhang, F. Safai, and D. Beyer, "Server Consolidation: High-Dimensional Probabilistic Bin-Packing", Proc. INFORMS Conf., 2005.
    • (2005) Proc. INFORMS Conf.
    • Zhang, A.1    Safai, F.2    Beyer, D.3
  • 34
    • 85024260157 scopus 로고    scopus 로고
    • Cloud computing
    • B. Hayes, "Cloud Computing", Comm. ACM, vol. 51, pp. 9-11, 2008.
    • (2008) Comm. ACM , vol.51 , pp. 9-11
    • Hayes, B.1
  • 35
    • 1842550851 scopus 로고    scopus 로고
    • On the online bin packing problem
    • S. Seiden, "On the Online Bin Packing Problem", J. ACM, vol. 49, pp. 640-671, 2002.
    • (2002) J. ACM , vol.49 , pp. 640-671
    • Seiden, S.1


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.