一种通用云计算资源调度问题的快速近似算法.pdfVIP

001: 10. 7544fissn1000-1239. 2016. 计算机研究与发展 Journal of Computer Research and Development 53(3): 697-703 , 2016 一种通用云计算资源调度问题的快速近似算法 魏蔚刘扬扬卫东 (ì 可南工业大学信息科学与工程学院 郑州 45000 1) (nsyncw@ 126. com) A Fast Approximation Algorithm for the General Resource Placement Problem in Cloud Computing Platform Wei Wei , Liu Yang , and Yang Weidong (College of Information Science and Eηgineering ， Henan University οf Technology , Zhengzhou 45000 1) Abstract 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 mea口 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) , a口 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. T