*Assistant Professor, Dept. of International Institute of Professional Studies, Devi Ahilya University, Indore, Madhya Pradesh, India
**Sr. Assistant Professor, Dept. of International Institute of Professional Studies, Devi Ahilya University,Indore, Madhya Pradesh, India
Multiprocessors have come out as a powerful computing medium for running real-time applications, especially where a uni-processor system would not be adequate to execute all the tasks. The accuracy and high performanceof multiprocessors have made a powerful computing resource. Such computing fremework requires a reliable algorithm to determine when and on which processor a given task should be compile in a successive manner. In multiprocessor systems, an efficient scheduling of a parallel jobs onto the processors that minimizes the entire execution time is vital for achieving a high performance. The Round Robin CPU scheduling algorithmis one of the widely used techniques for constrained optimization. Round Robin algorithm are basically preemptive algorithms based on the mechanics of quantum-based selection of jobs. As processors become available, the processesfrom the process
CPU Scheduling, Multiprocessor, Round Robin Scheduling Algorithm, Markov Chain Analysis, Transition Probability Matrix
