Improved Deadline Monotonic Scheduling With Dynamic and Intelligent Time Slice for Real-time Systems

Abstract

In this paper the deadline-monotonic scheduling algorithm is improved to schedule processes in real-time systems. In real-time systems each task should have deadline that is greater than execution time and less than time period. Failure to meet the deadline in real-time systems degrades the system’s performance. The proposed algorithm ensures that the processes meet their deadlines using iterative calculations using the exact schedulability test to determine which processes are schedulable. After finding the schedulable processes, they are scheduled using a suitable scheduling algorithm. Simple Round Robin scheduling algorithm shows high context switching and higher waiting time and response time. An improved-RR algorithm is proposed which calculates intelligent time slice for individual processes and taking dynamic time quantum into account. A comparative study is made to observe the interference due to higher priority processes and it was found that the proposed algorithm performs better than [1].