메뉴 건너뛰기




Volumn 51, Issue , 2015, Pages 1-6

Rigorous results on the effectiveness of some heuristics for the consolidation of virtual machines in a cloud data center

Author keywords

Analysis of algorithms; Approximation algorithms; Cloud computing; Virtual machines; VM consolidation

Indexed keywords

ALGORITHMS; CLOUD COMPUTING; HEURISTIC ALGORITHMS; OPTIMIZATION;

EID: 84928985838     PISSN: 0167739X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.future.2015.04.004     Document Type: Article
Times cited : (33)

References (31)
  • 1
    • 63649117166 scopus 로고    scopus 로고
    • Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility
    • R. Buyya, C.S. Yeo, S. Venugopal, J. Broberg, and I. Brandic Cloud computing and emerging IT platforms: Vision, hype, and reality for delivering computing as the 5th utility Future Gener. Comput. Syst. 25 6 2009 599 616
    • (2009) Future Gener. Comput. Syst. , vol.25 , Issue.6 , pp. 599-616
    • Buyya, R.1    Yeo, C.S.2    Venugopal, S.3    Broberg, J.4    Brandic, I.5
  • 4
    • 77954948591 scopus 로고    scopus 로고
    • Energy aware consolidation for cloud computing
    • S. Srikantaiah, A. Kansal, and F. Zhao Energy aware consolidation for cloud computing Cluster Comput. 12 2009 1 15
    • (2009) Cluster Comput. , vol.12 , pp. 1-15
    • Srikantaiah, S.1    Kansal, A.2    Zhao, F.3
  • 6
    • 84857370722 scopus 로고    scopus 로고
    • Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing
    • A. Beloglazov, J. Abawajy, and R. Buyya Energy-aware resource allocation heuristics for efficient management of data centers for cloud computing Future Gener. Comput. Syst. 28 2012 755 768
    • (2012) Future Gener. Comput. Syst. , vol.28 , pp. 755-768
    • Beloglazov, A.1    Abawajy, J.2    Buyya, R.3
  • 7
    • 0000339680 scopus 로고
    • Worst-case performance bounds for simple one-dimensional packing algorithms
    • D.S. Johnson, A.J. Demers, J.D. Ullman, M.R. Garey, and R.L. Graham Worst-case performance bounds for simple one-dimensional packing algorithms SIAM J. Comput. 3 4 1974 299 325
    • (1974) SIAM J. Comput. , vol.3 , Issue.4 , pp. 299-325
    • Johnson, D.S.1    Demers, A.J.2    Ullman, J.D.3    Garey, M.R.4    Graham, R.L.5
  • 8
    • 38049049887 scopus 로고    scopus 로고
    • The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ 11/9OPT(I) + 6/9
    • Springer
    • G. Dósa The tight bound of first fit decreasing bin-packing algorithm is FFD(I) ≤ 11/9OPT(I) + 6/9 Combinatorics, Algorithms, Probabilistic and Experimental Methodologies 2007 Springer 1 11
    • (2007) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies , pp. 1-11
    • Dósa, G.1
  • 10
    • 84861965053 scopus 로고    scopus 로고
    • A new analysis of Best Fit bin packing
    • J. Sgall, A new analysis of Best Fit bin packing, in: Fun with Algorithms, 2012, pp. 315-321.
    • (2012) Fun with Algorithms , pp. 315-321
    • Sgall, J.1
  • 18
    • 84908395259 scopus 로고    scopus 로고
    • An autonomic approach to risk-aware data center overbooking
    • L. Tomás, and J. Tordsson An autonomic approach to risk-aware data center overbooking IEEE Trans. Cloud Comput. 2 3 2014 292 305
    • (2014) IEEE Trans. Cloud Comput. , vol.2 , Issue.3 , pp. 292-305
    • Tomás, L.1    Tordsson, J.2
  • 20
    • 79960879925 scopus 로고    scopus 로고
    • Managing cost, performance, and reliability tradeoffs for energy-aware server provisioning
    • IEEE
    • B. Guenter, N. Jain, and C. Williams Managing cost, performance, and reliability tradeoffs for energy-aware server provisioning Proceedings of IEEE INFOCOM 2011 IEEE 1332 1340
    • (2011) Proceedings of IEEE INFOCOM , pp. 1332-1340
    • Guenter, B.1    Jain, N.2    Williams, C.3
  • 24
    • 84861621601 scopus 로고    scopus 로고
    • Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds
    • D. Breitgand, A. Epstein, Improving consolidation of virtual machines with risk-aware bandwidth oversubscription in compute clouds, in: Proceedings of IEEE Infocom, 2012, pp. 2861-2865.
    • Proceedings of IEEE Infocom, 2012 , pp. 2861-2865
    • Breitgand, D.1    Epstein, A.2
  • 26
    • 84883074509 scopus 로고    scopus 로고
    • Optimizing data access latencies in cloud systems by intelligent virtual machine placement
    • M. Alicherry, T. Lakshman, Optimizing data access latencies in cloud systems by intelligent virtual machine placement, in: Proceedings of IEEE Infocom, 2013, pp. 647-655.
    • Proceedings of IEEE Infocom, 2013 , pp. 647-655
    • Alicherry, M.1    Lakshman, T.2
  • 27
    • 79952975243 scopus 로고    scopus 로고
    • Policy-driven service placement optimization in federated clouds
    • Tech. Rep., H-0299 (H1102-014)
    • D. Breitgand, A. Marashini, and J. Tordsson Policy-driven service placement optimization in federated clouds, Tech. Rep., IBM Research Report, H-0299 (H1102-014) 2011
    • (2011) IBM Research Report
    • Breitgand, D.1    Marashini, A.2    Tordsson, J.3
  • 29
    • 84866771162 scopus 로고    scopus 로고
    • Biting off safely more than you can chew: Predictive analytics for resource over-commit in IaaS cloud
    • IEEE
    • R. Ghosh, and V.K. Naik Biting off safely more than you can chew: Predictive analytics for resource over-commit in IaaS cloud 5th International Conference on Cloud Computing 2012 IEEE 25 32
    • (2012) 5th International Conference on Cloud Computing , pp. 25-32
    • Ghosh, R.1    Naik, V.K.2


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