Scribd Logo
Upload

Welcome to Scribd!

  • 24 views

    RR Prog 7

    Uploaded by

    Prashanth gowda A S
    1) The document contains code for implementing scheduling algorithms like round robin and shortest remaining time first (SRTF). 2) It defines structures to store process details like ID, arrival time, burst time etc. and implements functions for scheduling logic. 3) The main function takes user input for number of processes and their burst times. It then calls the scheduling algorithms to calculate waiting times, turnaround times and provides output.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd

    RR Prog 7

    Uploaded by

    Prashanth gowda A S
    24 views4 pages
    1) The document contains code for implementing scheduling algorithms like round robin and shortest remaining time first (SRTF). 2) It defines structures to store process details like ID, arrival time, burst time etc. and implements functions for scheduling logic. 3) The main function takes user input for number of processes and their burst times. It then calls the scheduling algorithms to calculate waiting times, turnaround times and provides output.

    Original Description:

    Round Robin program

    Original Title

    RR prog 7

    Copyright

    © © All Rights Reserved

    Available Formats

    ODT, PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    1) The document contains code for implementing scheduling algorithms like round robin and shortest remaining time first (SRTF). 2) It defines structures to store process details like ID, arrival time, burst time etc. and implements functions for scheduling logic. 3) The main function takes user input for number of processes and their burst times. It then calls the scheduling algorithms to calculate waiting times, turnaround times and provides output.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Download as odt, pdf, or txt
    24 views4 pages

    RR Prog 7

    Uploaded by

    Prashanth gowda A S
    1) The document contains code for implementing scheduling algorithms like round robin and shortest remaining time first (SRTF). 2) It defines structures to store process details like ID, arrival time, burst time etc. and implements functions for scheduling logic. 3) The main function takes user input for number of processes and their burst times. It then calls the scheduling algorithms to calculate waiting times, turnaround times and provides output.

    Copyright:

    © All Rights Reserved
    Download as ODT, PDF, TXT or read online from Scribd
    Download as odt, pdf, or txt
    of 4

    #include<stdio.

    h>
    struct proc
    {
    int id;
    int arrival;
    int burst;
    int rem;
    int wait;
    int finish;
    int turnaround;
    }process[10];
    struct proc temp;
    int no;
    int chkprocess(int);
    int nextprocess();
    void roundrobin(int, int, int[], int[]);
    void srtf(int);
    void main()
    {
    int n,tq,choice;
    int bt[10],st[10],i,j,k;
    for(; ;)
    {
    printf("Enter the choice \n");
    printf(" 1. Round Robin\n 2. SRT\n 3. Exit \n");
    scanf("%d",&choice);
    switch(choice)
    {
    case 1:
    printf("Round Robin scheduling algorithm\n");
    printf("Enter number of processes:\n");
    scanf("%d",&n);
    printf("Enter burst time for sequences:");
    for(i=0;i<n;i++)
    {
    scanf("%d",&bt[i]);
    st[i]=bt[i];
    }
    printf("Enter time quantum:");
    scanf("%d",&tq);
    roundrobin(n,tq,st,bt);
    break;
    case 2:
    printf("\n \n ---SHORTEST REMAINING TIME NEXT---\n \n ");
    printf("\n \n Enter the number of processes: ");
    scanf("%d", &n);
    srtf(n);
    break;
    case 3: _exit(0);
    }// end of switch
    }// end of for
    }//end of main()
    void roundrobin(int n,int tq,int st[],int bt[])
    {
    int time=0;
    int tat[10],wt[10],i,count=0,swt=0,stat=0,temp1,sq=0,j,k;
    float awt=0.0,atat=0.0;
    while(1)
    {
    for(i=0,count=0;i<n;i++)
    {
    temp1=tq;
    if(st[i]==0)
    {
    count++;
    continue;
    }
    if(st[i]>tq)
    st[i]=st[i]-tq;
    else
    if(st[i]>=0)
    {
    temp1=st[i];
    st[i]=0;
    }
    sq=sq+temp1;
    tat[i]=sq;
    }
    if(n==count)
    break;
    for(i=0;i<n;i++)
    {
    wt[i]=tat[i]-bt[i]; // waiting time calculated from the turnaround time burst time
    swt=swt+wt[i]; // summation of wait time
    stat=stat+tat[i]; // summation of turnaround time
    }
    }
    awt=(float)swt/n; // average wait time
    atat=(float)stat/n; // average turnaround time
    printf("Process_no Burst time Wait time Turn around time\n");
    for(i=0;i<n;i++)
    printf("%d\t\t%d\t\t%d\t\t%d\n",i+1,bt[i],wt[i],tat[i]);
    printf("Avg wait time is %f\n Avg turn around time is %f\n",awt,atat);
    }// end of Round Robin

    int chkprocess(int s) // function to check process remaining time is zero or not


    {
    int i;
    for(i = 1; i <= s; i++)
    {
    if(process[i].rem != 0)
    return 1;
    }
    return 0;
    } // end of chkprocess
    int nextprocess()
    // function to identify the next process to be executed
    {
    int min, l, i;
    min = 32000; //any limit assumed
    for(i = 1; i <= no; i++)
    {
    if( process[i].rem!=0 && process[i].rem < min)
    {
    min = process[i].rem;
    l = i;
    }
    }
    return l;
    } // end of nextprocess
    void srtf(int n)
    {
    int i,j,k,time=0;
    float tavg,wavg;
    for(i = 1; i <= n; i++)
    {
    process[i].id = i;
    printf("\n\nEnter the arrival time for process %d: ", i);
    scanf("%d", &(process[i].arrival));
    printf("Enter the burst time for process %d: ", i);
    scanf("%d", &(process[i].burst));
    process[i].rem = process[i].burst;
    }
    for(i = 1; i <= n; i++)
    {
    for(j = i + 1; j <= n; j++)
    {
    if(process[i].arrival > process[j].arrival)
    {
    temp = process[i];
    process[i] = process[j];
    process[j] = temp;
    }
    }
    }
    no = 0;
    j = 1;
    while(chkprocess(n) == 1)
    {
    if(process[no + 1].arrival == time)
    {
    while(process[no+1].arrival==time)
    no++;
    if(process[j].rem==0)
    process[j].finish=time;
    j = nextprocess();
    }
    if(process[j].rem != 0) // to calculate the waiting time of a process
    {
    process[j].rem--;
    for(i = 1; i <= no; i++)
    {
    if(i != j && process[i].rem != 0)
    process[i].wait++;
    }
    }
    else
    {
    process[j].finish = time;
    j=nextprocess();
    time--;
    k=j;
    }
    time++;
    }
    process[k].finish = time;
    printf("\n\n\t\t\t---SHORTEST REMAINING TIME FIRST---");
    printf("\n\n Process Arrival Burst Waiting Finishing turnaround Tr/Tb\n");
    printf("%5s %9s %7s %10s %8s %9s\n\n", "id", "time", "time", "time", "time", "time");
    for(i = 1; i <= n; i++)
    {
    process[i].turnaround = process[i].wait + process[i].burst;
    printf("%5d %8d %7d %8d %10d %9d", process[i].id, process[i].arrival,
    process[i].burst, process[i].wait, process[i].finish, process[i].turnaround);
    tavg=tavg+ process[i].turnaround; //summation of turnaround time
    wavg=wavg+process[i].wait; // summation of waiting time
    printf("\n\n");
    }
    tavg=tavg/n; // average turnaround time
    wavg=wavg/n; // average wait time
    printf("tavg=%f\t wavg=%f\n",tavg,wavg);
    }

    You might also like