http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
- 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
- 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
RISS 인기검색어
- 검색키워드
- 저자 : Tanaya Roy (검색결과 1 건)
- 무료
- 기관 내 무료
- 유료
-
Cloud-Enabled Data Center Organization using K-D Tree
Sandip Roy,Rajesh Bose,Tanaya Roy,Debabrata Sarddar 보안공학연구지원센터 2015 International Journal of Database Theory and Appli Vol.8 No.3
An efficient load balancing algorithm in the field of cloud computing is absolutely essential in order to have a cloud network with graceful performance satisfying user expectation. Inspite of the existence of handful lightly loaded data centers, numerous heavily overloaded data centers may lead to a performance degradation of overall cloud network. Proper workload distribution may improve the overall performance of the cloud system. Now a day’s eminent cloud division rules are highly demanding algorithm for distributing workloads among various cloud server nodes deployed in cloud-enabled data centers scattered over the geographical regions. For the researcher, cloud division rule and optimal cloud server node searching are the most demanding jobs in load balancing leading towards more efficient cloud network and improve users’ satisfaction. This paper presents an expeditious cloud division rule based on geographical location of the cloud-enabled data centers distributed over earth surface and builds a two-dimensional space partition k-d tree to partition them in order to search intended cloud server node efficiently. Our proposed organization scheme can be utilized for active monitoring load balancing algorithm to improve the resource utilization for high performance in present cloud computing environment.
연관 검색어 추천
이 검색어로 많이 본 자료
활용도 높은 자료
