2015
DOI: 10.7763/ijmo.2015.v5.434
|View full text |Cite
|
Sign up to set email alerts
|

Task Scheduling in the Cloud Computing Based on the Cuckoo Search Algorithm

Abstract: Abstract-Cloud computing is the latest emerging trend in distributed computing, where shared resources are provided to end-users in an on demand fashion that brings many advantjuages, including data ubiquity, flexibility of access, high availability of resources, and flexibility. The task scheduling problem in Cloud computing is an NP-hard problem. Therefore, many heuristics have been proposed, from low level execution of tasks in multiple processors to high level execution of tasks. In this paper, a new evolu… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
39
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
7

Relationship

2
5

Authors

Journals

citations
Cited by 92 publications
(39 citation statements)
references
References 29 publications
0
39
0
Order By: Relevance
“…The authors claim that it uses two constraints in order to select the most suitable VM and guarantee the load balancing of the system. An evolutionary algorithm for scheduling tasks in Cloud computing is proposed in (Navimipour and Milani, 2015). It is based on the obligate brood parasitic behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies and focuses on minimizing the total waiting time of tasks.…”
Section: Related Workmentioning
confidence: 99%
“…The authors claim that it uses two constraints in order to select the most suitable VM and guarantee the load balancing of the system. An evolutionary algorithm for scheduling tasks in Cloud computing is proposed in (Navimipour and Milani, 2015). It is based on the obligate brood parasitic behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies and focuses on minimizing the total waiting time of tasks.…”
Section: Related Workmentioning
confidence: 99%
“…how well it adapts to its environment. For a maximization problem, the fitness of a solution can be proportional to the value of the objective function [21]. We uses three terms including total execution time (Ttime), average of waiting time (Wtime) and numbers of missed tasks because of their deadline (Missed) for designing fitness function as follow:…”
Section: A Solution Representationmentioning
confidence: 99%
“…The scheduling of a task workflow in a distributed computing platform is a well-known NP-hard problem [21]. The problem is even more complex and challenging when the virtualized clusters are used to execute a large number of tasks in a Cloud computing platform [21,22]. For this reason, many heuristics have been proposed, from low level execution of tasks in multiple processors to high level execution of tasks in Grid and Cloud environments [23].…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations