scholarly journals Cost Effective Ant Colony Optimization in Cloud Computing

Cloud computing is a term for a wide range of developments possibilities. It is rapidly growing paradigm in software technology that offers different services. Cloud computing has come of age, since Amazon's rollouted the first of its kind of cloud services in 2006. It stores the tremendous amount of data that are being processed every day. Cloud computing is a reliable computing base for data-intensive jobs. Cloud computing provide computing resources as a service. It is on-demand availability of computing resources without direct interaction of user. A major focus area of cloud computing is task scheduling. Task scheduling is one among the many important issues to be dealt with. It means to optimize overall system capabilities and to allocate the right resources. Task scheduling referred to NP-hard problem. The proposed algorithm is Cost Effective ACO for task scheduling, which calculates execution cost of CPU, bandwidth, memory etc. The suggested algorithm is compared with CloudSim with the presented Basic Cost ACO algorithm-based task scheduling method and outcomes clearly shows that the CEACO based task scheduling method clearly outperforms the others techniques which are in use into considerations. The task is allotted to the number of VMs based on the priorities (highest to lowest) given by user. The simulation consequences demonstrate that the suggested scheduling algorithm performs faster than previous Ant Colony Optimization algorithm in reference to the cost. It reduces the overall cost as compare to existing algorithm.

2017 ◽  
Vol 7 (4) ◽  
pp. 20-40 ◽  
Author(s):  
Poopak Azad ◽  
Nima Jafari Navimipour

In a cloud environment, computing resources are available to users, and they pay only for the used resources. Task scheduling is considered as the most important issue in cloud computing which affects time and energy consumption. Task scheduling algorithms may use different procedures to distribute precedence to subtasks which produce different makespan in a heterogeneous computing system. Also, energy consumption can be different for each resource that is assigned to a task. Many heuristic algorithms have been proposed to solve task scheduling as an NP-hard problem. Most of these studies have been used to minimize the makespan. Both makespan and energy consumption are considered in this paper and a task scheduling method using a combination of cultural and ant colony optimization algorithm is presented in order to optimize these purposes. The basic idea of the proposed method is to use the advantages of both algorithms while avoiding the disadvantages. The experimental results using C# language in cloud azure environment show that the proposed algorithm outperforms previous algorithms in terms of energy consumption and makespan.


Sign in / Sign up

Export Citation Format

Share Document