Artificial Bee Colony Algorithm for Cloud Task Scheduling | ||
| IJCI. International Journal of Computers and Information | ||
| Article 1, Volume 4, Issue 1, June 2015, Pages 1-10 PDF (812.25 K) | ||
| Document Type: Original Article | ||
| DOI: 10.21608/ijci.2015.33956 | ||
| Authors | ||
| Medhat A. Tawfik* 1; Ashraf Bahgat2; Arabi Keshk2; F. A. Torkey3 | ||
| 1Department of Computer Science, Menoufia University, Egypt | ||
| 2Faculty of Computer and Information Menoufia University | ||
| 3Prof. of Computer Science &Engineering and President of Kafer El- Sheekh University, Egypt | ||
| Abstract | ||
| Cloud computing services are becoming ubiquitous, and are becoming the primary source of computing power for both enterprises and personal computing applications. One of the fundamental issues in this environment is related to task scheduling. The scheduler should do the scheduling process efficiently in order to utilize the available resources. In this paper a cloud task scheduling policy based on artificial bee colony algorithm compared with different scheduling algorithms has been proposed. The main goal of the proposed algorithm is minimizing the makespan of a given tasks set. Artificial bee colony algorithm models the behavior of honey bees and can be used to find solutions for difficult or impossible combinatorial problems. Algorithms have been simulated using Cloudsim toolkit package. Experimental results showed that the artificial bee colony algorithm outperformed ACO, FPLTF and FCFS algorithms. | ||
| Keywords | ||
| Cloud Computing; task scheduling; make span; artificial bee colony | ||
|
Statistics Article View: 536 PDF Download: 1,103 |
||
