A Priority Constrained Pre-emptive Scheduling of Online Real Time Services with Fixed Checkpoint Intervals for Cloud Computing
Published: 2013
Author(s) Name: Santhosh R., Ravichandran T. |
Author(s) Affiliation: 1st Author is Research Scholar at Karpagam univ., 2nd Author is Principal at HIT, Coimbatore
Locked
Subscribed
Available for All
Abstract
In cloud computing, various services are accessed
by the different types of clients as pay per use over
the internet. This paper presents a new scheduling
technique for real time tasks in order to minimize the
execution time and focuses on the priority constrained
tasks. In older approaches, a non-preemptive
scheduling with task migration algorithm is used to
schedule the task with highest expected gain and
executes the tasks in the queue in a non-preemptive
manner. Therefore it increases the execution time of
the task and response time of the priority constrained
tasks. In order to overcome this problem, a priority
constrained pre-emptive scheduling of online real time
services with fixed checkpoint intervals is proposed to
minimize the execution time of the tasks and improves
the overall system performance by giving importance
for higher priority tasks. Our simulation results
outperform the traditional scheduling algorithms based
on the similar model.
Keywords: Execution Time, Priority, Deadline, Preemptive, Checkpoint Intervals.
View PDF