International Journal of Management, IT and Engineering

CPU scheduling is one of the root structures for multiprogramming to increase the performance of operating system function that determines which of the process should be executed next when multiple run-able process is waiting in the ready queue. The Round Robin scheduling algorithm is found relatively better than another existing CPU scheduling algorithm. In the proposed paper a data model-based Markov chain analysis of improved round robin algorithm is done in order to determine the transition phenomenon of scheduler. Some specific schemes are performed as its particular cases and generated the results by the mathematical simulation process on the different data sets. The markovian approach of improved round robin scheduling algorithm is transparent and sufficient enough to provide the actual order of shifting various processes and also to determine the order of their execution. These efforts have found very efficient and useful. Further some simulation studies with graphical representation have been done to justify the proposed suggestions.