Date of Publication :22nd February 2018

Abstract: In Modern days, the real-time system plays an important role in our modern and digital society. The success of any real-time application totally depends upon the selection of optimal scheduling algorithm. In real time application, every task should have the nature of deadlines and time when they arrived, on the basis of these parameters we observe the response time of different scheduling algorithm then we select the optimal algorithm for a particular application. So in this paper, our aim is to reduce the complexity of real-time system researcher for selection of scheduling algorithm for a particular application. This model-based approach is an extent the state of any real-time system in the area of scheduling. This approach works in any uniprocessor system

Reference :