메뉴 건너뛰기




Volumn 2015-September, Issue , 2015, Pages 395-400

Multi-dimensional scheduling in cloud storage systems

Author keywords

Cloud Storage; Infrastructure as a Service; Resource Scheduling; Vector Bin Packing

Indexed keywords


EID: 84953731535     PISSN: 15503607     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICC.2015.7248353     Document Type: Conference Paper
Times cited : (13)

References (18)
  • 2
    • 84953810157 scopus 로고    scopus 로고
    • "Openstack." [Online]. Available: www.openstack.org
  • 4
    • 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 Generation Computer Systems, vol. 28, no. 5, pp. 755-768, 2012.
    • (2012) Future Generation Computer Systems , vol.28 , Issue.5 , pp. 755-768
    • Beloglazov, A.1    Abawajy, J.2    Buyya, R.3
  • 5
    • 84897711937 scopus 로고    scopus 로고
    • Qos-aware vm placement in multi-domain service level agreements scenarios
    • 2013 IEEE Sixth International Conference on, June
    • K. Lu, R. Yahyapour, P. Wieder, C. Kotsokalis, E. Yaqub, and A. Jehangiri, "Qos-aware vm placement in multi-domain service level agreements scenarios," in Cloud Computing (CLOUD), 2013 IEEE Sixth International Conference on, June 2013, pp. 661-668.
    • (2013) Cloud Computing (CLOUD) , pp. 661-668
    • Lu, K.1    Yahyapour, R.2    Wieder, P.3    Kotsokalis, C.4    Yaqub, E.5    Jehangiri, A.6
  • 8
    • 0000930151 scopus 로고    scopus 로고
    • There is no asymptotic PTAS for two-dimensional vector packing
    • G. J. Woeginger, "There is no asymptotic PTAS for two-dimensional vector packing," Information Processing Letters, vol. 64, no. 6, pp. 293-297, 1997.
    • (1997) Information Processing Letters , vol.64 , Issue.6 , pp. 293-297
    • Woeginger, G.J.1
  • 14
    • 0041636797 scopus 로고
    • A simple proof of the inequality FFD (L) 11/9 OPT (L)+ 1, L for the FFD bin-packing algorithm
    • 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, vol. 7, no. 4, pp. 321-331, 1991.
    • (1991) Acta Mathematicae Applicatae Sinica , vol.7 , Issue.4 , pp. 321-331
    • Yue, M.1
  • 15
    • 0000339680 scopus 로고
    • Worst-case performance bounds for simple one-dimensional packing algorithms
    • D. S. Johnson, A. Demers, J. D. Ullman, M. R. Garey, and R. L. Graham, "Worst-case performance bounds for simple one-dimensional packing algorithms," SIAM Journal on Computing, vol. 3, no. 4, pp. 299-325, 1974.
    • (1974) SIAM Journal on Computing , vol.3 , Issue.4 , pp. 299-325
    • Johnson, D.S.1    Demers, A.2    Ullman, J.D.3    Garey, M.R.4    Graham, R.L.5


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