Round Robin ( RR ) cpu scheduling in java
On-campus and online computer science courses to Learn the basic concepts of Computer Science.This tutorial will cover c ,c++, java, data structure and algorithm,computer graphics,microprocessor,analysis of algorithms,Digital Logic Design and Analysis,computer architecture,computer networks,operating system.
code in Java:import java.io.BufferedReader; import java.io.IOException; import java.io.InputStreamReader; public class RR { public static void main(String args[]) throws IOException { BufferedReader br = new BufferedReader(new InputStreamReader(System.in)); System.out.println("Enter the Time Quantum: "); int q = Integer.parseInt(br.readLine()); System.out.println("Please enter the number of Processes: "); int n = Integer.parseInt(br.readLine()); int proc[][] = new int[n + 1][4];//proc[][0] is the AT array,[][1] - RT,[][2] - WT,[][3] - TT for(int i = 1; i <= n; i++) { System.out.println("Please enter the Burst Time for Process " + i + ": "); proc[i][1] = Integer.parseInt(br.readLine()); } System.out.println(); //Calculation of Total Time and Initialization of Time Chart array int total_time = 0; for(int i = 1; i <= n; i++) { total_time += proc[i][1]; } int time_chart[] = new int[total_time]; int sel_proc = 1; int current_q = 0; for(int i = 0; i < total_time; i++) { //Assign selected process to current time in the Chart time_chart[i] = sel_proc; //Decrement Remaining Time of selected process by 1 since it has been assigned the CPU for 1 unit of time proc[sel_proc][1]--; //WT and TT Calculation for(int j = 1; j <= n; j++) { if(proc[j][1] != 0) { proc[j][3]++;//If process has not completed execution its TT is incremented by 1 if(j != sel_proc)//If the process has not been currently assigned the CPU its WT is incremented by 1 proc[j][2]++; } else if(j == sel_proc)//This is a special case in which the process has been assigned CPU and has completed its execution proc[j][3]++; } //Printing the Time Chart if(i != 0) { if(sel_proc != time_chart[i - 1]) //If the CPU has been assigned to a different Process we need to print the current value of time and the name of //the new Process { System.out.print("--" + i + "--P" + sel_proc); } } else//If the current time is 0 i.e the printing has just started we need to print the name of the First selected Process System.out.print(i + "--P" + sel_proc); if(i == total_time - 1)//All the process names have been printed now we have to print the time at which execution ends System.out.print("--" + (i + 1)); //Updating value of sel_proc for next iteration current_q++; if(current_q == q || proc[sel_proc][1] == 0)//If Time slice has expired or the current process has completed execution { current_q = 0; //This will select the next valid value for sel_proc for(int j = 1; j <= n; j++) { sel_proc++; if(sel_proc == (n + 1)) sel_proc = 1; if(proc[sel_proc][1] != 0) break; } } } System.out.println(); System.out.println(); //Printing the WT and TT for each Process System.out.println("P\t WT \t TT "); for(int i = 1; i <= n; i++) { System.out.printf("%d\t%3dms\t%3dms",i,proc[i][2],proc[i][3]); System.out.println(); } System.out.println(); //Printing the average WT & TT float WT = 0,TT = 0; for(int i = 1; i <= n; i++) { WT += proc[i][2]; TT += proc[i][3]; } WT /= n; TT /= n; System.out.println("The Average WT is: " + WT + "ms"); System.out.println("The Average TT is: " + TT + "ms"); } }output:-
Enter the Time Quantum: 2 Please enter the number of Processes: 5 Please enter the Burst Time for Process 1: 6 Please enter the Burst Time for Process 2: 5 Please enter the Burst Time for Process 3: 2 Please enter the Burst Time for Process 4: 3 Please enter the Burst Time for Process 5: 7 0--P1--2--P2--4--P3--6--P4--8--P5--10--P1--12--P2--14--P4--15--P5--17--P1--19--P2--20--P5--23 P WT TT 1 13ms 19ms 2 15ms 20ms 3 4ms 6ms 4 12ms 15ms 5 16ms 23ms The Average WT is: 12.0ms The Average TT is: 16.6ms --------------------------------
0 comments: