Task Scheduling for cloud computing Based on Firefly Algorithm

Abstract In this paper a new method proposed, to solve the problem of scheduling resources in cloud computing, it is using a parallel scheduling model which can enhance parallel tasks scheduling while the relationship among serial tasks stay constant. The important feature of dynamic tasks is provided by users to sub-tasks in serial sequences and arranged as scheduling queue, these tasks have different and equal priorities according to running order. In this paper firefly algorithm (FA) have been introduced for scheduling the subtasks in cloud computer to prove a progress in short delay time. The most important features that can be considered are fairness and efficiency characteristics. Delay time Shortest and Fairness firefly algorithm (DSFFA) applied to solve task scheduling problem that realized the shortest delay time, which improving the user satisfaction. Experimental results show that DSFFA algorithm is better than the task scheduling –Firefly algorithm (TS-FA) algorithm in fairness, efficiency and task delay time, therefor it can be realized for the optimal scheduling in cloud computing.