Cloud computing is a new technology provides computing resources as services, and allows users to access these resources via the Internet without the need to own knowledge and experience, or even control of infrastructure that support these services. Job scheduling is considered one of the main issues in cloud computing. The main task of job scheduling is how to find an optimal mapping of set of jobs to a set of available resources. Unsuitable mapping of jobs to resources usually leads to inefficient cloud performance. The current methods for cloud job scheduling process produce acceptable solution but not optimal solution. This paper proposes a new job scheduling mechanism using Glowworm Swarm Optimization (GSO). The proposed mechanism aims to find the best mapping in order to minimize the execution time of jobs. The proposed mechanism based on information of jobs (cloudlets) and resources (virtual machines) such as length of jobs, speed of resources and identifier for both. The scheduling function in the proposed job scheduling mechanism firstly creates a set of jobs and resources to generate the population by assigning the jobs to resources randomly and evaluates the population using fitness values which represent the execution times of jobs. Secondly the function used iterations to regenerate populations based on glowworms behavior to produce the best job schedule that gives the minimum execution time of jobs. The methodology of this research is based on simulation of the proposed mechanism using the CloudSim simulator. The evaluation process of the proposed mechanism started with a set of different experiments. These experiments revealed that, the proposed mechanism minimized the execution time of jobs. The proposed mechanism is compared with the First Come First Servers (FCFS) algorithm and experimental results revealed that the proposed mechanism has a better performance than FCFS for minimizing the execution time of jobs.
목차
Abstract 1. Introduction 2. Cloud Job Scheduling 3. Glowworm Swarm Optimization algorithm(GSO) 3.1. Luciferin-update-phase 3.2. Movement-phase 3.3. Local-decision Range Update Rule 4. Proposed Glowworm Swarm Optimization for Cloud Job Scheduling 4.1. Pseudo Code for the Proposed GSO Algorithm 5. Evaluation and Experimentation 5.1. The First Scenario 5.2. The Second Scenario 5.3. The Third Scenario 5.4. The Fourth Scenario 6. Conclusion and Future Work References
보안공학연구지원센터(IJAST) [Science & Engineering Research Support Center, Republic of Korea(IJAST)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Advanced Science and Technology
간기
월간
pISSN
2005-4238
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Advanced Science and Technology Vol.96