현재 위치
Home
Load Balancing In Decentralized Grid Scheduling Systems Using Bee Colony Algorithm
-
- 발행기관
- 보안공학연구지원센터(IJCA) 바로가기
-
- 간행물
- International Journal of Control and Automation SCOPUS 바로가기
-
- 통권
- Vol.9 No.6 (2016.06)바로가기
-
- 페이지
- pp.105-118
-
- 저자
-
- 언어
- 영어(ENG)
-
- URL
- https://www.earticle.net/Article/A280117
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
- 영어
- Load balancing is an important part of grid scheduling systems which aims to utilize dynamic and decentralized grid resources without any overcapacity happening at any resources. Load balancing is being considered as an important phase for distributed computing environments. In large scale distributed systems such as grid/cloud computing, it is necessary to use a distributed load balancing system in job scheduling system. Distributed load balancing was identified as a major concern to allow grid computing to scale up the job scheduling. Many algorithms had been proposed for finding the solution of load balancing problem in these fields. But very few algorithms are proposed for distributed load balancing in grid computing environments. In this paper, we have developed an adaptable artificial bee colony (ABC) algorithm for dynamic dividing and scheduling jobs via decentralized schedulers. The proposed method significantly enhances the load balance on the resources. Besides, this method does not need primary information about the capacity and power of the resources which is compatible with the variable and heterogeneous nature of decentralized scheduling. The proposed method is compared with the cuckoo based scheduling algorithm and OSL decentralized scheduling method. The results of the simulations revealed that the proposed method is significantly better than the OSL method. It also outperforms the cuckoo based scheduling algorithm in most of simulations.
목차
Abstract
1. Introduction
2. Research concepts and Previous Works
3. Honey Bee Behavior Inspired Load Balancing Method
3.1. Assumptions of the Study
3.2. The Statistical Data Used in the Proposed Method
3.3. Artificial Bee Colony in Task Scheduling
4. Results of the Experiments
4.1. Simulation and Applied Parameters
4.2. Comparing the Proposed Method with OSL
5. Conclusion and Directions for Future Research
References
키워드
Load balancing Job scheduling bee colony algorithm schedulers’ communication decentralized scheduling저자
간행물 정보
발행기관
-
- 발행기관명
- 보안공학연구지원센터(IJCA) [Science & Engineering Research Support Center, Republic of Korea(IJCA)]
- 설립연도
- 2006
- 분야
- 공학>컴퓨터학
- 소개
- 1. 보안공학에 대한 각종 조사 및 연구 2. 보안공학에 대한 응용기술 연구 및 발표 3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최 4. 보안공학 기술의 상호 협조 및 정보교환 5. 보안공학에 관한 표준화 사업 및 규격의 제정 6. 보안공학에 관한 산학연 협동의 증진 7. 국제적 학술 교류 및 기술 협력 8. 보안공학에 관한 논문지 발간 9. 기타 본 회 목적 달성에 필요한 사업
간행물
-
- 간행물명
- International Journal of Control and Automation
- 간기
- 월간
- pISSN
- 2005-4297
- 수록기간
- 2008~2016
- 십진분류
- KDC 505 DDC 605
이 권호 내 다른 논문 / International Journal of Control and Automation Vol.9 No.6
피인용수 : 0건 (자료제공 : 네이버학술정보)
함께 이용한 논문 이 논문을 다운로드한 분들이 이용한 다른 논문입니다.
출처 : 네이버학술정보
0개의 논문이 장바구니에 담겼습니다.