International Journal of Computer Applications |
Foundation of Computer Science (FCS), NY, USA |
Volume 80 - Number 9 |
Year of Publication: 2013 |
Authors: R. Santhosh, T. Ravichandran |
10.5120/13886-1796 |
R. Santhosh, T. Ravichandran . Non- Preemptive Real Time Scheduling using Checkpointing Algorithm for Cloud Computing. International Journal of Computer Applications. 80, 9 ( October 2013), 1-4. DOI=10.5120/13886-1796
This paper focuses on providing a solution for online real time services using non-preemptive scheduling algorithm in order to minimize the execution time of the migrated tasks. Earlier, a non-preemptive scheduling with task migration algorithm is used to minimize the penalty. Whenever a task misses its deadline, it will migrate the task to another virtual machine and starts its execution from the beginning. Therefore it increases the execution time of the migrated task. In order to overcome this problem, a non-preemptive real time scheduling using checkpointing algorithm is proposed to minimize the execution time of the migrated tasks and minimizes the penalty even better by earlier completion of migrated tasks. This improves the overall system performance. Our simulation results outperform the older approaches based on the similar model.