메뉴 건너뛰기




Volumn , Issue , 2011, Pages 594-601

Effective VM sizing in virtualized data centers

Author keywords

[No Author keywords available]

Indexed keywords

BIN PACKING PROBLEM; DATA CENTERS; OPTIMAL SOLUTIONS; OVERFLOW PROBABILITY; PLACEMENT ALGORITHM; POLYNOMIAL-TIME; RESOURCE DEMANDS; SERVER CAPACITY; SERVER CONSOLIDATION; STATE-OF-THE-ART APPROACH; STOCHASTIC OPTIMIZATION PROBLEMS;

EID: 80052730018     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/INM.2011.5990564     Document Type: Conference Paper
Times cited : (118)

References (12)
  • 1
    • 34748920251 scopus 로고    scopus 로고
    • Dynamic placement of virtual machines for managing sla violations
    • IM '07. 10th IFIP/IEEE International Symposium on
    • N. Bobroff, A. Kochut, and K. Beaty. Dynamic placement of virtual machines for managing sla violations. In Integrated Network Management 2007. IM '07. 10th IFIP/IEEE International Symposium on, 2007.
    • (2007) Integrated Network Management 2007
    • Bobroff, N.1    Kochut, A.2    Beaty, K.3
  • 4
    • 0033336278 scopus 로고    scopus 로고
    • Stochastic load balancing and related problems
    • 40th Annual Symposium on
    • A. Goel and P. Indyk. Stochastic load balancing and related problems. In Foundations of Computer Science, 1999. 40th Annual Symposium on, pages 579-586, 1999.
    • (1999) Foundations of Computer Science, 1999 , pp. 579-586
    • Goel, A.1    Indyk, P.2
  • 5
    • 80052708864 scopus 로고
    • Resource allocation for broadband networks
    • Los Alamitos, CA, USA IEEE Computer Society Press
    • J. Y Hui. Resource allocation for broadband networks. In Broadband switching: architectures, protocols, design, and analysis, pages 358-368, Los Alamitos, CA, USA, 1991. IEEE Computer Society Press.
    • (1991) Broadband Switching: Architectures, Protocols, Design, and Analysis , pp. 358-368
    • Hui, J.Y.1
  • 12
    • 0041636797 scopus 로고
    • A simple proof of the inequality ffd(l) = (11/9)opt(l)+l, for all 1, for the ffd bin-packing algorithm
    • October
    • M. Yue. A simple proof of the inequality ffd(l) = (11/9)opt(l)+l, for all 1, for the ffd bin-packing algorithm. Acta Mathematicae Applicatae Sinica, 7(4), October 1991.
    • (1991) Acta Mathematicae Applicatae Sinica , vol.7 , Issue.4
    • Yue, M.1


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