Resource Reconstruction Algorithms for On-demand Allocation in Virtual Computing Resource Pool

被引:0
|
作者
Xiao-Jun Chen 1 Jing Zhang 1
机构
基金
国家高技术研究发展计划(863计划);
关键词
Virtual computing systems; virtual computing resource pool; resource allocation; resource reconstruction; status transition; resource combination; resource split; resource adjustment;
D O I
暂无
中图分类号
TP338 [各种电子数字计算机];
学科分类号
081201 ;
摘要
Resource reconstruction algorithms are studied in this paper to solve the problem of resource on-demand allocation and improve the efficiency of resource utilization in virtual computing resource pool. Based on the idea of resource virtualization and the analysis of the resource status transition, the resource allocation process and the necessity of resource reconstruction are presented. Resource reconstruction algorithms are designed to determine the resource reconstruction types, and it is shown that they can achieve the goal of resource on-demand allocation through three methodologies: resource combination, resource split, and resource random adjustment. The effects that the resource users have on the resource reconstruction results, the deviation between resources and requirements, and the uniformity of resource distribution are studied by three experiments. The experiments show that resource reconstruction has a close relationship with resource requirements, but it is not the same with current distribution of resources. The algorithms can complete the resource adjustment with a lower cost and form the logic resources to match the demands of resource users easily.
引用
收藏
页码:142 / 154
页数:13
相关论文
共 50 条
  • [1] Resource reconstruction algorithms for on-demand allocation in virtual computing resource pool
    Chen X.-J.
    Zhang J.
    Li J.-H.
    Li X.
    [J]. International Journal of Automation and Computing, 2012, 9 (2) : 142 - 154
  • [2] Resource virtualization methodology for on-demand allocation in cloud computing systems
    Chen, XiaoJun
    Zhang, Jing
    Li, Junhuai
    Li, Xiang
    [J]. SERVICE ORIENTED COMPUTING AND APPLICATIONS, 2013, 7 (02) : 77 - 100
  • [3] Efficient Resource Allocation for On-Demand Mobile-Edge Cloud Computing
    Chen, Xu
    Li, Wenzhong
    Lu, Sanglu
    Zhou, Zhi
    Fu, Xiaoming
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2018, 67 (09) : 8769 - 8780
  • [4] A resource leasing policy for on-demand computing
    England, D
    Weissman, J
    [J]. INTERNATIONAL JOURNAL OF HIGH PERFORMANCE COMPUTING APPLICATIONS, 2006, 20 (01): : 91 - 101
  • [5] Dynamic Wavelength Allocation Algorithms for On-Demand Deployment of GMPLS-controlled Virtual WSON Using a VON Resource Broker
    Vilalta, Ricard
    Munoz, Raul
    Casellas, Ramon
    Martinez, Ricardo
    [J]. 17TH EUROPEAN CONFERENCE ON NETWORK AND OPTICAL COMMUNICATIONS (NOC 2012) AND 7TH CONFERENCE ON OPTICAL CABLING AND INFRASTRUCTURE (OC&I 2012), 2012,
  • [6] Asynchronous Deep Reinforcement Learning for Collaborative Task Computing and On-Demand Resource Allocation in Vehicular Edge Computing
    Liu, Lei
    Feng, Jie
    Mu, Xuanyu
    Pei, Qingqi
    Lan, Dapeng
    Xiao, Ming
    [J]. IEEE Transactions on Intelligent Transportation Systems, 2023, 24 (12) : 15513 - 15526
  • [7] Selective cache ways: On-demand cache resource allocation
    Albonesi, DH
    [J]. 32ND ANNUAL INTERNATIONAL SYMPOSIUM ON MICROARCHITECTURE, (MICRO-32), PROCEEDINGS, 1999, : 248 - 259
  • [8] Dynamic Bin Packing for On-Demand Cloud Resource Allocation
    Li, Yusen
    Tang, Xueyan
    Cai, Wentong
    [J]. IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 2016, 27 (01) : 157 - 170
  • [9] On-demand resource allocation for service level guarantee in grid environment
    Yang, HL
    Wu, GY
    Zhang, JZ
    [J]. GRID AND COOPERATIVE COMPUTING - GCC 2005, PROCEEDINGS, 2005, 3795 : 678 - 689
  • [10] A study on a resource allocation algorithm for on-demand data center services
    Adachi, Motomitsu
    Hiraoka, Takuro
    Komatsu, Naohisa
    [J]. 10TH INTERNATIONAL CONFERENCE ON ADVANCED COMMUNICATION TECHNOLOGY, VOLS I-III: INNOVATIONS TOWARD FUTURE NETWORKS AND SERVICES, 2008, : 295 - 300