1.
INTRODUCTION
Cloud computing is a computing services given to the user over the internet. It is a paradigm for providing
computational resources like storage, hardware components, application service, software, virtual server(virtual
machine),database service and total service workflow through the browsing window using internet. Whenever a
user wants to access any of these services then he needs to get a subscription from the service provider for that
particular service. The uses of each service by the client is monitored by the service provider over a network and
later as per the use the charge is given by the user, that technology is called pay-per-use service. it refers to
services and applications that run on distributed network accessed by common Internet protocols and
networking standards using virtual resources.
The trends of using cloud computing leads to increase number of both cloud consumer and service provider.
This leads to complex resource management process including resource scheduling and provisioning.
provisioning of service is directly impacts to the resource utilization in cloud computing. Better resource
utilization can be achieved by adopting new task scheduling algorithms Task scheduling is the process of
allocating the resource to the particular job in specific time. The main objective is to maximize the resource
utilization, minimizing the waiting time.
1.1. NEED OF TASK SCHEDULING
Cloud computing provides many services like IaaS (Infrastructure as a Service), PaaS(Platform as a Service),
and SaaS (Software as a Service). In each type of service, the users are expected to submit the requests to the
service provider through the medium of the Internet. The service provider is responsible for managing the
resources to fulfill the requests generated by users. Service Providers employ scheduling algorithms to schedule
the incoming request (tasks) and to manage their computing resources efficiently. Task scheduling and resource
management permit providers to maximize revenue and the utilization of resources up to their limits. In practice,
in terms of the performance of cloud computing resources, the scheduling and allocation of resources are
important hurdles. For this reason, researchers have been attracted to studies of task scheduling in cloud
computing. Task scheduling is one of the core issues in cloud computing. Proper task scheduling may result in
the efficient utilization of resources. The major advantage of cloud computing is that it promotes proper
utilization of resources. Thus, task scheduling and resource allocation are two sides of a single coin. Each
affects the other.
1.2.CHALLENGES
To achieved the optimize utilization of resources, It is very important that resources to be managed properly . If
we compare between cloud computing and traditional computing , cloud computing faces many issues such as :
(i).Unpredictable workloads:
The existing strategies for scheduling in cloud environment follows deterministic modeling having prior
knowledge approximately task and resources. But, this isn't always possible for cloud computing in which the
tasks acquired for computation are notably unpredictable in nature as service as provider is ignorant of the
amount of information and computation is required to be managed. Additionally, virtualization era abstracts
stake holders from the info of the resources available, therefore adding extra demanding situations to service
provider functionality and service users. The uncertainty approximately knowledge of parameters like quantity
of computing sources to be had with their pace and functionality, the bandwidth variations, availability of
sources calls for provider carriers as well as service customers to be greater involved for making sure minimal
quality of service (QoS). So, researchers are working closer to this challenge of decreasing this uncertainty with
the aid of predicting the completion time and waiting time in queues to enhance useful resource utilization and
performance
(ii) Ensuring efficient resource utilization:
There is a term called Auto scaling in cloud computing. In this scenario the resource must allocated immediately
whenever its needed no matter it’s a planned demand or unplanned demand. The incoming workload must be
allocated to resources (Virtual Machines) such that the cloud service provider has to ensure efficient resource
utilization. This requires optimal scheduling techniques to allocate the tasks to available machines.
(iii) Heterogeneous physical nodes in cloud Datacenter :
Cloud computing is a distributed system .The tasks are allocated (or scheduled) across available nodes which are
widely distributed at different location and vary in computational power, memory , architecture and even the
network performance. Different tasks perform differently at different nodes.
(iv).Increased scheduling granularity than traditional scheduling:
The size of scheduling problem has increased from simple task(process) scheduling in traditional computing
systems with small data transfers to intensive VM resource scheduling and VM migrations in cloud computing
environment.
(v).Load balancing :
The optimal utilization of cloud resources demands uniform load must be distributed among different virtual
machines so that they should not suffer from under utilization and over utilization situations.
Task scheduling algorithms vary in their technique in scheduling tasks among cloud nodes statically,
dynamically, in batches or even online, eventually they are all trying to achieve the optimal distribution of tasks
overs cloud nodes. Through this section different task scheduling algorithms applied in cloud environment with
suitable verification and different aims will be presented and discussed in details.
LITERATURE REVIEW
This paper presents a survey of task scheduling strategies for workflow-based applications in Grid computing
environments. The authors describe the different types of scheduling strategies, including static and dynamic
scheduling, and provide an overview of the most commonly used approaches. The paper discusses the
challenges of task scheduling in Grid environments, such as the heterogeneity of resources and the dynamic
nature of Grids. The authors also describe the various factors that can influence the performance of scheduling
algorithms, such as the size of the workflow, the number of resources, and the communication costs. Finally, the
paper provides a comparative evaluation of several scheduling algorithms using a simulation framework, and
discusses the strengths and weaknesses of each approach. Overall, the paper provides a comprehensive overview
of the state-of-the-art in task scheduling for workflow-based applications in Grid computing environments .
The paper proposes a load-balanced min-min algorithm for static meta-task scheduling in grid computing. The
goal of the algorithm is to optimize the makespan of the meta-tasks by assigning them to the most suitable
computing resources. The load-balanced min-min algorithm works in two phases: first, it calculates the
execution time of each task on all available resources, and second, it assigns the tasks to the resources in a way
that minimizes the makespan and balances the load across the resources. The paper presents experimental results
that demonstrate the effectiveness of the load-balanced min-min algorithm in reducing the makespan and
improving load balance compared to other algorithms.
The paper "Static Task Scheduling Heuristic Approach in Cloud Computing Environment" proposes a
novel heuristic approach for scheduling static tasks in cloud computing environments. The authors
start by introducing the problem of task scheduling and its importance in cloud computing. They then
review existing research on task scheduling in cloud computing, focusing on heuristic-based
approaches.
The authors describe the proposed heuristic approach, which involves a set of rules to prioritize tasks
based on their resource requirements and the availability of resources in the cloud. The approach also
takes into account the inter-dependencies between tasks and their respective deadlines
The paper "Optimization of Cloud Datacenter Using Heuristic Strategic Approach" proposes a novel
heuristic approach for optimizing cloud datacenters. The authors start by introducing the problem of
cloud datacenter optimization and its importance in the context of increasing demand for cloud
services. They then review existing research on cloud datacenter optimization, focusing on heuristic-
based approaches.
The paper "A Priority Based on Min-Min Algorithm for Reducing Makespan Task Scheduling in
Cloud Computing" proposes a priority-based heuristic approach for task scheduling in cloud
computing environments. The authors start by introducing the problem of task scheduling and its
importance in cloud computing. They then review existing research on task scheduling in cloud
computing, focusing on heuristic-based approaches.
The paper "A New Grid Computation-Based Min-Min Algorithm" by X. Yu and X. Yu, published in
the proceedings of the 6th International Conference on Fuzzy Systems and Knowledge Discovery
(FSKD'09), proposes a modified version of the Min-Min algorithm for scheduling tasks in a grid
computing environment.
The authors start by introducing the problem of task scheduling in grid computing and its importance
in optimizing resource utilization and minimizing job completion time. They then review existing
research on task scheduling in grid computing, focusing on the Min-Min algorithm and its limitations.
The paper "A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto
Heterogeneous Distributed Computing Systems" by T. D. Braun et al. was published in the Journal of
Parallel and Distributed Computing in 2001.
The authors present a comparative study of eleven static heuristics for mapping independent tasks
onto heterogeneous distributed computing systems. The authors start by introducing the problem of
task mapping and its importance in optimizing the performance of distributed computing systems.
They then review existing research on task mapping in distributed computing systems, focusing on
static heuristics.
The paper "Cost-Efficient Workflow Scheduling Algorithm for Applications with Deadline Constraint
on Heterogeneous Clouds" proposes a novel workflow scheduling algorithm for applications with
deadline constraints on heterogeneous clouds. The paper was published in 2022.
The authors start by introducing the problem of workflow scheduling in cloud computing and its
importance in meeting application performance requirements. They then review existing research on
workflow scheduling in cloud computing, focusing on approaches for meeting deadline constraints
and minimizing cost.
The paper "MIN-Max-Min: A Heuristic Scheduling Algorithm for Jobs Across Geo-Distributed
Datacenters" proposes a heuristic algorithm for scheduling jobs across geo-distributed datacenters.
The paper was published in 2018.
The authors start by introducing the problem of job scheduling across multiple datacenters and its
importance in optimizing resource utilization and minimizing job completion time. They then review
existing research on job scheduling in geo-distributed datacenters, focusing on heuristic-based
approaches .
The paper "A Heuristic-Based Task Scheduling Algorithm for Scientific Workflows in Heterogeneous
Cloud Computing Platforms" proposes a novel heuristic-based algorithm for task scheduling in
heterogeneous cloud computing platforms. The paper was published in 2021.
The authors start by introducing the problem of task scheduling in scientific workflows and its
importance in optimizing the performance of cloud computing platforms. They then review existing
research on task scheduling in cloud computing, focusing on heuristic-based approaches.
Meta hurestic
The paper "MCAMC: Minimizing the Cost and Makespan of Cloud Service Using Non-Dominated
Sorting Genetic Algorithm-II" by A. Sathya Sofia proposes a novel approach to optimize cloud service
performance by minimizing both cost and makespan. The paper was published in 2019.
The author starts by introducing the problem of cloud service optimization and its importance in
minimizing cost and maximizing resource utilization. The author then reviews existing research on
cloud service optimization, focusing on genetic algorithm-based approaches.
The paper "Honey Bee Behavior Inspired Load Balancing of Tasks in Cloud Computing Environments"
proposes a load balancing approach inspired by the behavior of honey bees. The paper was
published in 2013.
The authors start by introducing the problem of load balancing in cloud computing environments
and its importance in optimizing resource utilization and minimizing job completion time. They then
review existing research on load balancing in cloud computing, focusing on swarm intelligence-based
approaches.
Numeric
The paper "A Priority-Based Scheduling Strategy for Virtual Machine Allocations in Cloud Computing
Environment" by Jing Xiao and Zhiyuan Wang proposes a priority-based scheduling strategy for
allocating virtual machines in cloud computing environments. The paper was published in the
proceedings of the 2012 International Conference on Cloud and Service Computing.
The authors start by introducing the problem of virtual machine allocation in cloud computing
environments and its importance in optimizing resource utilization and minimizing job completion
time. They then review existing research on virtual machine allocation in cloud computing, focusing
on priority-based approaches.
The paper "Improved Cost-Based Algorithm for Task Scheduling in Cloud Computing" by S. Selvarani
and G. Sudha Sadhasivam proposes an improved cost-based algorithm for task scheduling in cloud
computing environments. The paper was published in the proceedings of the 2010 IEEE International
Conference on Computational Intelligence and Computing Research.
The authors start by introducing the problem of task scheduling in cloud computing environments
and its importance in optimizing resource utilization and minimizing job completion time. They then
review existing research on task scheduling in cloud computing, focusing on cost-based approaches.
The paper "An Algorithm to Reduce the Time Complexity of Earliest Deadline First Scheduling
Algorithm in Real-Time System" by Jagbeer Singh, Bichitrananda Patra, and Satyendra Prasad Singh
proposes an algorithm to reduce the time complexity of the Earliest Deadline First (EDF) scheduling
algorithm in real-time systems. The paper was published in the International Journal of Advanced
Computer Science and Applications in February 2011.
The authors start by introducing the problem of scheduling in real-time systems and the challenges
of meeting deadlines while optimizing resource utilization. They then review existing research on
scheduling algorithms in real-time systems, focusing on the EDF algorithm and its time complexity.
The paper "A Greedy-Based Job Scheduling Algorithm in Cloud Computing" by Ji Li, Longhua Feng,
and Shenglong Fang proposes a greedy-based job scheduling algorithm in cloud computing. The
paper was published in the Journal of Software in 2014.
The authors start by introducing the problem of job scheduling in cloud computing environments
and its importance in optimizing resource utilization and minimizing job completion time. They then
review existing research on job scheduling in cloud computing, focusing on greedy-based
approaches.
The paper "A Simulation of Priority Based Earliest Deadline First Scheduling for Cloud Computing
System" by Gaurav Gupta et al. presents a simulation of priority-based earliest deadline first (EDF)
scheduling for cloud computing systems. The paper was published in the proceedings of the 2014
First International Conference on Networks & Soft Computing.
The authors start by introducing the problem of task scheduling in cloud computing systems and the
challenges of meeting deadlines while optimizing resource utilization. They then review existing
research on scheduling algorithms in cloud computing, focusing on EDF scheduling and its various
extensions.
The paper "Credit Based Scheduling Algorithm in Cloud Computing Environment" by Antony Thomas,
G. Krishnalal, and VP Jagathy Raj proposes a credit-based scheduling algorithm for cloud computing
environments. The paper was published in Procedia Computer Science in 2015.
The authors start by discussing the need for efficient task scheduling in cloud computing
environments and the challenges involved in balancing resource allocation and workload
distribution. They then review existing research on credit-based scheduling algorithms in cloud
computing, highlighting their advantages over other scheduling algorithms.
The paper "DCHEFT Approach for Task Scheduling to Efficient Resource Allocation in Cloud
Computing" proposes a task scheduling algorithm called DCHEFT (Dynamic Critical Path Based
Heterogeneous Earliest Finish Time) that aims to optimize resource allocation in cloud computing
environments. The paper was published in the International Journal of Computer Science and
Information Security in 2015.
The authors begin by discussing the importance of task scheduling in cloud computing and the
challenges involved in optimizing resource allocation. They then review existing research on task
scheduling algorithms and identify the limitations of current approaches.
The paper "Adaptation Of Johnson Sequencing Algorithm For Job Scheduling To Minimize The
Average Waiting Time In Cloud Computing Environment" proposes a job scheduling algorithm for
cloud computing environments that adapts the Johnson sequencing algorithm to minimize the
average waiting time of jobs. The paper was published in the Journal of Theoretical and Applied
Information Technology in 2016.
The authors begin by discussing the importance of job scheduling in cloud computing and the
challenges involved in minimizing the waiting time of jobs. They then review existing research on job
scheduling algorithms and identify the limitations of current approaches.
The paper "A novel hybrid of Shortest job first and round Robin with dynamic variable quantum time
task scheduling technique" proposes a task scheduling technique that combines the Shortest Job
First (SJF) and Round Robin (RR) scheduling algorithms with a dynamic variable quantum time
(DVQT) approach. The paper was published in the International Journal of Applied Engineering
Research in 2017.
The authors begin by discussing the importance of task scheduling in cloud computing and the
challenges involved in achieving efficient resource utilization. They then review existing research on
task scheduling algorithms and identify the limitations of current approaches.
The paper "Toward Task Scheduling Approaches to Reduce Energy Consumption in Cloud Computing
Environment" explores the problem of reducing energy consumption in cloud computing
environments through task scheduling approaches. The paper was published in the International
Journal of Distributed Sensor Networks in 2022.
The authors first discuss the importance of energy efficiency in cloud computing, as the high energy
consumption of data centers has significant environmental and economic impacts. They then review
existing research on energy-efficient task scheduling and identify the limitations of current
approaches.
REFERENCES
1. J. Blythe, S. Jain, E. Deelman, Y. Gil, K. Vahi, A. Mandal, et al.,"Task scheduling strategies for
workflow-based applications in grids," in Cluster Computing and the Grid, 2005. CCGrid
2005.IEEE International Symposium on, 2005, pp. 759-767.(2005)
2. T. Kokilavani and D. G. Amalarethinam, "Load balanced min-minalgorithm for static
meta-task scheduling in grid computing," Inter-national Journal of Computer
Applications, vol. 20, pp. 43-49, 2011.(2011)
3. X. Yu and X. Yu, "A new grid computation-based Min-Min algorithm," in Fuzzy Systems and
Knowledge Discovery, 2009. FSKD'09. Sixth International Conference on, 20. (2009)
4. T. D. Braun, H. J. Siegel, N. Beck, L. L. Bölöni, M. Maheswaran,A. I. Reuther, et al., "A
comparison of eleven static heuristics for mapping a class of independent tasks onto
heterogeneous distributed computing systems," Journal of Parallel and Distributed
computing, vol. 61, pp. 810-837, (2001).
5. S. Parsa and R. Entezari-Maleki, "RASA: A new task scheduling algorithm in grid
environment," World Applied sciences journal,vol. 7, pp. 152-160, 2009. (2009)
6. S. J. Patel and U. R. Bhoi, "Improved priority based job scheduling algorithm in cloud
computing using iterative method," in Advances in Computing and Communications (ICACC),
2014 Fourth International Conference on, 2014, pp. 199-202.(2014)
7. A heuristic-based task scheduling algorithm for scientific workflows in heterogeneous cloud
computing platforms(2021)
8. MIN-Max-Min: A heuristic scheduling algorithm for jobs across geo-distributed datacenters
(2018)
9. Cost-Efficient Workflow Scheduling Algorithm for Applications with Deadline Constraint on
Heterogeneous Clouds(2022)
10. MCAMC: minimizing the cost and makespan of cloud service using non-dominated sorting
genetic algorithm-II(2019) A Sathya Sofia
11. Honey bee behavior inspired load balancing of tasks in cloud computing environments(2013)
12. Xiao, Jing, and Zhiyuan Wang. "A PriorityBased Scheduling Strategy for Virtual Machine
Allocations in Cloud Computing Environment." Cloud and Service Computing (CSC),
2012 International Conference on. IEEE, 2012.
13. Selvarani, S., and G. Sudha Sadhasivam. "Improved Cost-Based Algorithm For
Task Scheduling In Cloud Computing." Computational Intelligence And
Computing Research (ICCIC), 2010 IEEE International Conference on. IEEE, 2010.
14. Jagbeer Singh, Bichitrananda Patra, Satyendra Prasad Singh, "An Algorithm to
Reduce the Time Complexity of Earliest Deadline First Scheduling Algorithm in Real-
Time System" (IJACSA) International Journal of Advanced Computer Science
and Applications, February 2011.
15. Li, Ji, Longhua Feng, and Shenglong Fang. "An greedy-based job scheduling
algorithm in cloud computing."Journal of Software 9.4 (2014): 921-925.
16. Gupta, Gaurav, et al. "A simulation of priority based earliest deadline first
scheduling for cloud computing system." Networks & Soft Computing
(ICNSC), 2014 First International Conference on. IEEE, 2014.
17. Thomas, Antony, G. Krishnalal, and VP Jagathy Raj. "Credit Based Scheduling
Algorithm in Cloud Computing Environment."Procedia Computer Science 46
(2015): 913-920.
18. DCHEFT Approach for Task Scheduling to Efficient Resource Allocation in Cloud
Computing Fattened backfilling: An improved strategy for job scheduling in parallel
systems (2016)
19. Adaptation Of Johnson Sequencing Algorithm For Job Scheduling To Minimize The
Average Waiting Time In Cloud Computing Environment (2016)
20. A novel hybrid of Shortest job first and round Robin with dynamic variable quantum
time task scheduling technique (2017)
21. Toward Task Scheduling Approaches to Reduce Energy Consumption in Cloud
Computing Environment (2022)
22.
