Earticle

초록

영어

Scheduling algorithm is always a hot topic in cloud computing environment. In order to eliminate system bottleneck and balance load dynamically. A load balancing task scheduling algorithm based on weighted random and feedback mechanisms was proposed in this paper. At first the chosen cloud scheduling host chose resources by needs and made static quantification, and then sorted them; secondly the algorithm chose resources from which sorted by weight randomly; then it acquired corresponding dynamic information to make load filter and sort the left. At last it achieved the self-adaptively to system load through feedback mechanisms. The experiment shows that the algorithm has avoided the system bottleneck effectively and has achieved balanced load as well as self-adaptability to it.

목차

Abstract
 Introduction
 Algorithm Description
 Resource Requirements Description
 Resource Attribute Description
 Algorithm Implementation
 The Task Mapping based on Weighted Random and Feedback Mechanism
 Filter Overloaded Resources
 Quantitative Ordering of Dynamic Attributes
 Load Information Feedback Regulation
 The Experimental Results and Performance Analysis
 Conclusions
 Acknowledgements
 References

키워드

저자

• Zhang Qian [ Computer and Communication Engineering, China University of Petroleum Qingdao, 266580, China ]
• Ge Yufei [ Computer and Communication Engineering, China University of Petroleum Qingdao, 266580, China ]
• Liang Hong [ Computer and Communication Engineering, China University of Petroleum Qingdao, 266580, China ]
• Shi Jin [ Computer and Communication Engineering, China University of Petroleum Qingdao, 266580, China ]

참고문헌

발행기관

간행물

표지보기 관심저널 등록

• 간행물명

  International Journal of Grid and Distributed Computing

• 간기

  격월간

• pISSN

  2005-4262

• 수록기간

  2008~2016

• 십진분류

  KDC 505 DDC 605