A New Proposed Two Processor Based CPU Scheduling Algorithm with Varying Time quantum for Real Time Systems
|H.S. Behera1*, Jajnaseni Panda, Dipanwita Thakur2 and Subasini Sahoo3
|Corresponding Author: H.S. Behera, E-mail: [email protected] ,[email protected] and [email protected]|
|Related article at Pubmed, Scholar Google|
The performance and efficiency of multitasking operating systems mainly depends upon the use of CPU scheduling algorithm. In time shared system, Round Robin (RR) scheduling gives optimal solution but it may not be suitable for real time systems because it gives more number of context switches and larger waiting time and larger turnaround time. In this paper two processor based CPU scheduling (TPBCS) algorithm is proposed, where one processor is exclusively for CPU-intensive processes and the other processor is exclusively for I/O-intensive processes. This approach dispatches the processes to appropriate processor according to their percentage of CPU or I/O requirement. After the processes are dispatched to respective processors, the time quantum is calculated and the processes are executed in increasing order of their burst time. Experimental analysis shows that our proposed algorithm performs better result by reducing the average waiting time, average turnaround time.