Cellular Particle Swarm Scheduling Algorithm for Virtual Resource Scheduling of Cloud Computing

Hao Yuan; Changbing Li; Maokang Du

Cellular Particle Swarm Scheduling Algorithm for Virtual Resource Scheduling of Cloud Computing

원문정보

Hao Yuan, Changbing Li, Maokang Du

보안공학연구지원센터(IJGDC) International Journal of Grid and Distributed Computing Vol.8 No.3 2015.06 pp.299-308

피인용수 : 0건 (자료제공 : 네이버학술정보)

초록

영어

The virtual resource scheduling is an important topic in the field of cloud computing. Based on particle swarm scheduling algorithm, this paper introduces cellular automata theory to construct a new cellular particle swarm scheduling algorithm. This approach through mathematical modeling for virtual resource scheduling of cloud computing and complete the final search configuration based on directional optimization objective function. Experimental results show that the proposed method has more excellent scheduling performance, in the case of changes in resources, can be also kept stable scheduling balance.

Abstract
1. Introduction
2. Backgrounds
  A. Particle Swarm Optimization (PSO)
  B. Cellular Automata Theory
3. Cellular Particle Swarm Optimization
  A. Multicomputing Backpack Modeling
  B. Objective Optimization Function
  C. Algorithmic Search Process
3. Experimental Results and Analysis
  A. Experimental Environment Settings
  B. Analysis of Experimental Results
4. Conclusion
5. Acknowledgements
References

키워드

저자정보

Hao Yuan China Key Lab of Electronic Commerce and Modern Logistics of Chongqing University of Posts and Telecommunications, Chongqing, China
Changbing Li China Key Lab of Electronic Commerce and Modern Logistics of Chongqing University of Posts and Telecommunications, Chongqing, China
Maokang Du China Key Lab of Electronic Commerce and Modern Logistics of Chongqing University of Posts and Telecommunications, Chongqing, China

참고문헌

자료제공 : 네이버학술정보

함께 이용한 논문

※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.

0개의 논문이 장바구니에 담겼습니다.

earticle