PROGRAM TO UNDERSTAND ROUND ROBIN SCHEDULING ALGORITHM

-

 /*

 * Round Robin Scheduling Program in C

 */

 

#include<stdio.h>

 

int main()

{

    //Input no of processed

    int  n;

    printf("Enter Total Number of Processes:");

    scanf("%d", &n);

    int wait_time = 0, ta_time = 0, arr_time[n], burst_time[n], temp_burst_time[n];

    int x = n;

 

    //Input details of processes

    for(int i = 0; i < n; i++)

    {

        printf("Enter Details of Process %d \n", i + 1);

        printf("Arrival Time:  ");

        scanf("%d", &arr_time[i]);

        printf("Burst Time:   ");

        scanf("%d", &burst_time[i]);

        temp_burst_time[i] = burst_time[i];

    }

 

    //Input time slot

    int time_slot;

    printf("Enter Time Slot:");

    scanf("%d", &time_slot);

 

    //Total indicates total time

    //counter indicates which process is executed

    int total = 0,  counter = 0,i;

    printf("Process ID       Burst Time       Turnaround Time      Waiting Time\n");

    for(total=0, i = 0; x!=0; )  

    {  

        // define the conditions

        if(temp_burst_time[i] <= time_slot && temp_burst_time[i] > 0)    

        {  

            total = total + temp_burst_time[i];  

            temp_burst_time[i] = 0;  

            counter=1;  

        }     

        else if(temp_burst_time[i] > 0)  

        {  

            temp_burst_time[i] = temp_burst_time[i] - time_slot;  

            total  += time_slot;    

        }  

        if(temp_burst_time[i]==0 && counter==1)  

        {  

            x--; //decrement the process no.  

            printf("\nProcess No %d  \t\t %d\t\t\t\t %d\t\t\t %d", i+1, burst_time[i],

                   total-arr_time[i], total-arr_time[i]-burst_time[i]);  

            wait_time = wait_time+total-arr_time[i]-burst_time[i];  

            ta_time += total -arr_time[i];  

            counter =0;     

        }  

        if(i==n-1)  

        {  

            i=0;  

        }  

        else if(arr_time[i+1]<=total)  

        {  

            i++;  

        }  

        else  

        {  

            i=0;  

        }  

    }  

    float average_wait_time = wait_time * 1.0 / n;

    float average_turnaround_time = ta_time * 1.0 / n;

    printf("\nAverage Waiting Time:%f", average_wait_time);

    printf("\nAvg Turnaround Time:%f", average_turnaround_time);

    return 0;

}


Output:

Enter Total Number of Processes:3

Enter Details of Process 1 

Arrival Time:  0

Burst Time:   10

Enter Details of Process 2 

Arrival Time:  1

Burst Time:   8

Enter Details of Process 3 

Arrival Time:  2

Burst Time:   7

Enter Time Slot:5

 

Process ID       Burst Time       Turnaround Time      Waiting Time

 

Process No 1       10         20          10

Process No 2       8         22     14

Process No 3       7         23     16

 

Average Waiting Time: 13.333333

Avg Turnaround Time: 21.666666

Comments

Post a Comment

Popular posts from this blog

PROGRAM FOR BANKERS ALGORITHM FOR DEADLOCK AVOIDENCE

-
#include<stdio.h> int main() {   /* array will store at most 5 process with 3 resoures if your process or    resources is greater than 5 and 3 then increase the size of array */   int p, c, count = 0, i, j, alc[5][3], max[5][3], need[5][3], safe[5], available[3], done[5], terminate = 0;   printf("Enter the number of process and resources");   scanf("%d %d", & p, & c);   // p is process and c is diffrent resources    printf("enter allocation of resource of all process %dx%d matrix", p, c);   for (i = 0; i < p; i++) {     for (j = 0; j < c; j++) {       scanf("%d", & alc[i][j]);     }   }   printf("enter the max resource process required %dx%d matrix", p, c);   for (i = 0; i < p; i++) {     for (j = 0; j < c; j++) {       scanf("%d", & max[i][j]);     }   }   printf("enter the  available resource");   f...
Read more

JAVA RECORD PROGRAM FOR AREA AND PERIMETER OF RECTANGLE

-
 // Java program to calculate  the area and perimeter of a rectangle using class concept import java.util.*; // Rectangle Class File class Rectangle {     // data members     int length, width;     // methods     //constructor to create Object     Rectangle(int length, int width) {         this. length = length;         this.width = width;     }     // prints the area of rectangle     public void area() {         int areaOfRectangle;         areaOfRectangle = this.length * this.width;         System.out.println("Area of rectangle with the given input is : " + areaOfRectangle);     }     // prints the perimeter of rectangle     public void perimeter() {         int  perimeterOfRectangle;         perimeterOfRectangle = 2 * (this...
Read more

JAVA PROGRAM TO PERFORM MULTI THREADING USING RUNNABLE INTERFACE

-
 class Multithreading implements Runnable {     public void run()     {         try {             // Displaying the thread that is running             System.out.println(                 "Thread " + Thread.currentThread().getId()                 + " is running");         }         catch (Exception e) {                          // Throwing an exception             System.out.println("Exception is caught");         }     } } // Main Class public class Geeks {     public static void main(String[] args)     {         int n = 8; // Number of threads         for (int i = 0; i < n; i++) {...
Read more