메뉴 건너뛰기




Volumn , Issue , 2012, Pages 406-413

An analysis of first fit heuristics for the virtual machine relocation problem

Author keywords

dynamic resource management; greedy heuristics; virtualization; vm migration; vm relocation

Indexed keywords

BUSINESS GOALS; DATA CENTRES; DIFFERENT ORDER; DYNAMIC RESOURCE MANAGEMENT; FIRST FIT; GREEDY HEURISTICS; MULTIPLE APPLICATIONS; RELOCATION POLICIES; RELOCATION PROBLEM; RESOURCE CAPACITY; SERVER CONSOLIDATION; VIRTUAL MACHINES; VIRTUALIZATIONS; VM MIGRATION;

EID: 84872063715     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (46)

References (20)
  • 2
    • 20344389520 scopus 로고    scopus 로고
    • The architecture of virtual machines
    • J. E. Smith and R. Nair, "The architecture of virtual machines," Computer, vol. 38, no. 5, pp. 32-38, 2005.
    • (2005) Computer , vol.38 , Issue.5 , pp. 32-38
    • Smith, J.E.1    Nair, R.2
  • 4
    • 78650025707 scopus 로고    scopus 로고
    • A mathematical programming approach for server consolidation problems in virtualized data centers
    • oct.-dec.
    • B. Speitkamp and M. Bichler, "A mathematical programming approach for server consolidation problems in virtualized data centers," Services Computing, IEEE Transactions on, vol. 3, no. 4, pp. 266-278, oct.-dec. 2010.
    • (2010) Services Computing, IEEE Transactions on , vol.3 , Issue.4 , pp. 266-278
    • Speitkamp, B.1    Bichler, M.2
  • 5
    • 77955515011 scopus 로고    scopus 로고
    • Resource allocation algorithms for virtualized service hosting platforms
    • Sep. [Online]. Available
    • M. Stillwell, D. Schanzenbach, F. Vivien, and H. Casanova, "Resource allocation algorithms for virtualized service hosting platforms," J. Parallel Distrib. Comput., vol. 70, no. 9, pp. 962-974, Sep. 2010. [Online]. Available: http://dx.doi.org/10.1016/j.jpdc.2010.05.006
    • (2010) J. Parallel Distrib. Comput. , vol.70 , Issue.9 , pp. 962-974
    • Stillwell, M.1    Schanzenbach, D.2    Vivien, F.3    Casanova, H.4
  • 10
    • 0041636797 scopus 로고
    • A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀ L for the FFD bin-packing algorithm
    • 10.1007/BF02009683. [Online]. Available
    • M. Yue, "A simple proof of the inequality FFD (L) ≤ 11/9 OPT (L) + 1, ∀ L for the FFD bin-packing algorithm," Acta Mathematicae Applicatae Sinica (English Series), vol. 7, pp. 321-331, 1991, 10.1007/BF02009683. [Online]. Available: http://dx.doi.org/10.1007/BF02009683
    • (1991) Acta Mathematicae Applicatae Sinica (English Series) , vol.7 , pp. 321-331
    • Yue, M.1
  • 11
    • 38049049887 scopus 로고    scopus 로고
    • The tight bound of first fit decreasing bin-packing algorithm is FFD (I)≤11/9 OPT (I)+6/9
    • Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ser. B. Chen, M. Paterson, and G. Zhang, Eds. Springer Berlin / Heidelberg, 10.1007/978-3-540-74450-4 1. [Online]. Available
    • G. Dsa, "The tight bound of first fit decreasing bin-packing algorithm is FFD (I)≤11/9 OPT (I)+6/9," in Combinatorics, Algorithms, Probabilistic and Experimental Methodologies, ser. Lecture Notes in Computer Science, B. Chen, M. Paterson, and G. Zhang, Eds. Springer Berlin / Heidelberg, 2007, vol. 4614, pp. 1-11, 10.1007/978-3-540-74450-4 1. [Online]. Available: http://dx.doi.org/10.1007/978-3-540-74450-4 1
    • (2007) Lecture Notes in Computer Science , vol.4614 , pp. 1-11
    • Dsa, G.1
  • 12
    • 37849022524 scopus 로고    scopus 로고
    • Secaucus, NJ, USA: Springer-Verlag New York, Inc.
    • M. Y. Kao, Encyclopedia of Algorithms. Secaucus, NJ, USA: Springer-Verlag New York, Inc., 2007.
    • (2007) Encyclopedia of Algorithms
    • Kao, M.Y.1
  • 14
    • 84864511735 scopus 로고    scopus 로고
    • Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in cloud data centers
    • [Online]. Available
    • A. Beloglazov and R. Buyya, "Optimal online deterministic algorithms and adaptive heuristics for energy and performance efficient dynamic consolidation of virtual machines in cloud data centers," Concurrency and Computation: Practice and Experience, pp. 1-24, 2011. [Online]. Available: http://dx.doi.org/10.1002/cpe.1867
    • (2011) Concurrency and Computation: Practice and Experience , pp. 1-24
    • Beloglazov, A.1    Buyya, R.2
  • 18
    • 84872089195 scopus 로고    scopus 로고
    • DCSim project site. The University of Western Ontario. [Online]. Available
    • DCSim project site. Distributed and Grid Systems (DiGS) Research Group, The University of Western Ontario. [Online]. Available: http://digs.csd.uwo.ca/ digs/
  • 20
    • 84872075941 scopus 로고    scopus 로고
    • Aug. Google Inc. [Online]. Available
    • (2012, Aug.) Google cluster data. Google Inc. [Online]. Available: http://code.google.com/p/googleclusterdata/
    • (2012) Google Cluster Data


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