Preemptive Scheduling of Real Time Services With Resource Allocation Strategy for Cloud Computing
- Syeda Sheema Samreen
- Shahapur Farhat Kauser
This paper presents preemptive scheduling approach to focus on providing a solution for online scheduling problem of real-time tasks, we present a system that uses virtualization technology to allocate resources for the tasks that are reaching its deadline. The primary objective of real time preemptive scheduling is to increase throughput and minimize average response time instead of meeting deadlines. Earlier real-time tasks are scheduled non-preemptively with the objective to maximize the total utility, but the task with higher priority needs to wait until the currently running task gets completed. Hence if the waiting task reaches its deadline gets aborted. That before a task is aborted, it consumes system resources including network bandwidth, storage space and processing power. This leads to affect the overall system performance and response time of a task. Preemptive algorithm is proposed where the task with higher priority are executed first, and the tasks which are reaching its deadline are spoon to virtual machine, this this increases the total system performance.
Syeda Sheema Samreen, Shahapur Farhat Kauser. "Preemptive Scheduling of Real Time Services With Resource Allocation Strategy for Cloud Computing".INTERNATIONAL JOURNAL OF ENGINEERING DEVELOPMENT AND RESEARCH ISSN:2321-9939, Vol.3, Issue 2, pp.293-295, URL :https://rjwave.org/ijedr/papers/IJEDR1502055.pdf
Volume 3 Issue 2
Pages. 293-295
