• 中国精品科技期刊
  • CCF推荐A类中文期刊
  • 计算领域高质量科技期刊T1类
Advanced Search
WeiWei, LiuYang, YangWeidong. A Fast Approximation Algorithm for the General Resource Placement Problem in Cloud Computing Platform[J]. Journal of Computer Research and Development, 2016, 53(3): 697-703. DOI: 10.7544/issn1000-1239.2016.20148323
Citation: WeiWei, LiuYang, YangWeidong. A Fast Approximation Algorithm for the General Resource Placement Problem in Cloud Computing Platform[J]. Journal of Computer Research and Development, 2016, 53(3): 697-703. DOI: 10.7544/issn1000-1239.2016.20148323

A Fast Approximation Algorithm for the General Resource Placement Problem in Cloud Computing Platform

More Information
  • Published Date: February 29, 2016
  • There are regionally distributed demands for various resources in cloud based large-scale online services. Given fixed resource budget, the service providers need to decide where to place resources to satisfy massive demands from all regions, where demands are usually represented by mean value in given time span. However, in scenarios with a large number of resources, demands are dynamic and stochastic, considering fine-grained demands and adopting stochastic model will further improve resource utilization. Compared with mean demand-based algorithm, considering demand stochasticity in algorithm will increase resource utilization ratio, but also leads to high time complexity. The time complexity of optimal algorithm is linear to total amount of resources, thus may be inefficient when dealing with a large number of resources. Based on nonlinear programming theory, we propose Fast Resource Placement (FRP), an effective resource placement method of high efficiency. In the algorithm, optimal solution is represented by continuous functions of input, and we construct approximation functions to reduce the computation complexity. The preliminary experiments show that in scenarios with general settings, compared with optimal algorithm, FRP can reduce the computation time by three orders of magnitude, and can achieve 99% effect of optimal solution. Therefore, FRP can be used to schedule large number of resources efficiently in time-tense scheduling scenarios.
  • Related Articles

    [1]Zhang Zilin, Liu Duo, Tan Yujuan, Wu Yu, Luo Longpan, Wang Weilüe, Qiao Lei. An Erasure-Coded Data Update Method for Distributed Storage Clusters[J]. Journal of Computer Research and Development, 2022, 59(11): 2451-2466. DOI: 10.7544/issn1000-1239.20210211
    [2]Chen Jinyin, Huang Guohan, Zhang Dunjie, Zhang Xuhong, Ji Shouling. GRD-GNN: Graph Reconstruction Defense for Graph Neural Network[J]. Journal of Computer Research and Development, 2021, 58(5): 1075-1091. DOI: 10.7544/issn1000-1239.2021.20200935
    [3]Li Guorui, Meng Jie, Peng Sancheng, Wang Cong. A Distributed Data Reconstruction Algorithm Based on Jacobi ADMM for Compressed Sensing in Sensor Networks[J]. Journal of Computer Research and Development, 2020, 57(6): 1284-1291. DOI: 10.7544/issn1000-1239.2020.20190587
    [4]Tang Yingjie, Wang Fang, Xie Yanwen. An Efficient Failure Reconstruction Based on In-Network Computing for Erasure-Coded Storage Systems[J]. Journal of Computer Research and Development, 2019, 56(4): 767-778. DOI: 10.7544/issn1000-1239.2019.20170834
    [5]Fu Yingxun, Wen Shilin, Ma Li, Shu Jiwu. Survey on Single Disk Failure Recovery Methods for Erasure Coded Storage Systems[J]. Journal of Computer Research and Development, 2018, 55(1): 1-13. DOI: 10.7544/issn1000-1239.2018.20160506
    [6]Liu Hai, Li Xinghua, Ma Jianfeng. Rational Secret Sharing Scheme Based on Reconstruction Order Adjustment Mechanism[J]. Journal of Computer Research and Development, 2015, 52(10): 2332-2340. DOI: 10.7544/issn1000-1239.2015.20150511
    [7]Li Yibin, Jia Zhiping, Xie Shuai, and Liu Fucai. Partial Dynamic Reconfigurable WSN Node with Power and Area Efficiency[J]. Journal of Computer Research and Development, 2014, 51(1): 173-179.
    [8]Fan Liya, Zhang Fa, Wang Gongming, Liu Zhiyong. Algorithm Analysis and Efficient Parallelization of the Single Particle Reconstruction Software Package: EMAN[J]. Journal of Computer Research and Development, 2010, 47(12).
    [9]Zhang Hongcan and Xue Wei. Reliability Analysis of Cluster RAID5 Storage System[J]. Journal of Computer Research and Development, 2010, 47(4): 727-735.
    [10]Ma Yili, Fu Xianglin, Han Xiaoming, and Xu Lu. The Separation between Storage and Computation[J]. Journal of Computer Research and Development, 2005, 42(3).
  • Cited by

    Periodical cited type(5)

    1. 张钦宇,张智凯,安丽荣,杨君一,张瑞. 面向天基数据中心的编码修复数据流调度. 移动通信. 2023(07): 21-26 .
    2. 杨浩,李竣业. 电力用户多渠道自动缴费习惯预判预警系统设计. 信息技术. 2021(03): 155-160 .
    3. 包涵,王意洁,许方亮. 基于生成矩阵变换的跨数据中心纠删码写入方法. 计算机研究与发展. 2020(02): 291-305 . 本站查看
    4. 李慧,李贵洋,胡金平,周悦,江小玉,韩鸿宇. 基于分布式存储的OHitchhiker码. 计算机工程与设计. 2020(07): 1941-1946 .
    5. 严新成,陈越,巴阳,贾洪勇,朱彧. 云环境下支持可更新加密的分布式数据编码存储方案. 计算机研究与发展. 2019(10): 2170-2182 . 本站查看

    Other cited types(11)

Catalog

    Article views (1305) PDF downloads (691) Cited by(16)

    /

    DownLoad:  Full-Size Img  PowerPoint
    Return
    Return