Title of article :
Improving the Palbimm Scheduling Algorithm for Fault Tolerance in Cloud Computing
Author/Authors :
Soltanshahi, Minoo Computer Engineering Department - Kerman Branch - Islamic Azad University, Kerman
Abstract :
Cloud computing is the latest
technology that involves distributed computation
over the Internet. It meets the needs of users
through sharing resources and using virtual
technology. The workflow user applications
refer to a set of tasks to be processed within the
cloud environment. Scheduling algorithms have
a lot to do with the efficiency of cloud computing
environments through selection of suitable
resources and assignment of workflows to them.
Given the factors affecting their efficiency, these
algorithms try to use resources optimally and
increase the efficiency of this environment. The
palbimm algorithm provides a scheduling method
that meets the majority of the requirements of
this environment and its users. In this article, we
improved the efficiency of the algorithm by adding
fault tolerance capability to it. Since this capability
is used in parallel with task scheduling, it has no
negative impact on the makespan. This is supported
by simulation results in CloudSim environment .
Keywords :
scheduling algorithm , fault tolerance , cloudsim , palbimm algorithm , makespan
Journal title :
Astroparticle Physics