Cloud task scheduling based on ant colony optimization

Tawfeek, Medhat A.; El-Sisi, Ashraf B.; Keshk, Arabi; Torkey, Fawzy A.

doi:10.1109/icces.2013.6707172

Cited by 233 publications

(124 citation statements)

References 16 publications

Supporting

Mentioning

124

Contrasting

Order By: Relevance

“…As ACO is based upon the random search and due its complex characteristics it is used by the many researchers to solve NP-hard problems such as travelling salesman problem, optimization problems, graph coloring, vehicle routing problem and scheduling problem. The positive feedback mechanism, inner parallelism is the strength of the ACO algorithm [5] …”

Section: Figure 1: Architecture Of Mqs For Cloud Computingmentioning

confidence: 99%

Energy Efficient Heuristic Base Job Scheduling Algorithms in Cloud Computing

Singh¹,

Gupta²

2017

IOSR JCE

View full text Add to dashboard Cite

Section: Figure 1: Architecture Of Mqs For Cloud Computingmentioning

confidence: 99%

Energy Efficient Heuristic Base Job Scheduling Algorithms in Cloud Computing

Singh¹,

Gupta²

2017

IOSR JCE

View full text Add to dashboard Cite

“…It has been successfully for solving multidimensional knapsack problem, traveling salesman problem, job shop scheduling, and quadratic assignment problem, task scheduling in grid and cloud computing, and much more [3]. In [10], they have considered minimization of makespan as the objective function. Their objective function based on execution time and transfer time of tasks on VMs.…”

Section: Related Workmentioning

confidence: 99%

Bi-Objective Task Scheduling in Cloud Computing using Chaotic Bat Algorithm

Farkar¹,

Kazem²

2017

ijacsa

View full text Add to dashboard Cite

Abstract-Cloud computing is a technology for providing services over the Internet. It gives approach to renting IT infrastructures on a short-term pay-per-usage basis. One of the service provider's goals is to use the resources efficiently and gain maximum profit. Cloud processes a huge amount of data, so tasks scheduling is a vital role in the cloud computing. The purpose of this paper is to propose a method based on chaos theory and bat algorithm for task scheduling in Cloud computing. Task scheduling is a core and challenging issue in cloud computing. The nature of the scheduling issue is as an NPHard problem and because of the success of heuristic algorithms in optimization and NP-Hard problems, the authors use a newly inspired bat algorithm and chaos theory to scheduling the tasks in the cloud. In this method, bat or candidate solutions are represented by a one-dimensional array. The fitness function is calculated based on makespan and energy consumption. The results show that the proposed method can schedule the received tasks in proper time than other compared heuristic algorithms, also the proposed method has better performance in term of makespan and energy consumption than compared methods.

show abstract

“…In this respect, the term resource provisioning means that providing resources. The approach proposed in [13] solves the problem of optimization in resource allocation. In this approach, incoming jobs are allocated to the virtual machines using Ant Colony Optimization (ACO) approach which minimizes the makespan by comparing with First Come First Served (FCFS) and Round-Robin (RR) scheduling algorithms.…”

Section: Related Workmentioning

confidence: 99%