Resource Allocation in Clouding Computing Based on Monkey Algorithm
DOI:
CSTR:
Author:
Affiliation:

Clc Number:

Fund Project:

  • Article
  • |
  • Figures
  • |
  • Metrics
  • |
  • Reference
  • |
  • Related
  • |
  • Cited by
  • |
  • Materials
  • |
  • Comments
    Abstract:

    It has always been the focus of research as how to solve the resource distribution problem in cloud computing, and aiming at the weakness emerging in the monkey algorithm, i.e. too quick convergence speed and being easy to fall into local optimal, etc. the monkey algorithm is introduced in this paper. First, chaos algorithm and inverse learning are introduced into monkey algorithm to initialize the initial position of monkey swarm. Second, the improvement of climbing, watching and jumping in monkey algorithm has improved the convergence precision of this algorithm. After the test of classic function, algorithm in this paper has improved noticeably in performance compared with other intelligent algorithms. Cloudsim platform has proved that by applying algorithm in this paper to cloud computing, resource consumption has been greatly improved during completing tasks.

    Reference
    Related
    Cited by
Get Citation

陈海涛.改进的猴群算法在云计算资源分配中的研究.计算机系统应用,2015,24(8):191-196

Copy
Share
Article Metrics
  • Abstract:
  • PDF:
  • HTML:
  • Cited by:
History
  • Received:December 16,2014
  • Revised:January 29,2015
  • Adopted:
  • Online: September 03,2015
  • Published:
Article QR Code
You are the firstVisitors
Copyright: Institute of Software, Chinese Academy of Sciences Beijing ICP No. 05046678-3
Address:4# South Fourth Street, Zhongguancun,Haidian, Beijing,Postal Code:100190
Phone:010-62661041 Fax: Email:csa (a) iscas.ac.cn
Technical Support:Beijing Qinyun Technology Development Co., Ltd.

Beijing Public Network Security No. 11040202500063