Operating-System/FirstComeFirstServe.cpp at main · ria3999/Operating-System · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
#include <iostream>
# include<vector>
using namespace std;
void sortibg(vector<int> &arrtime,vector<int> &burst)
{
    int i, key, j,keybur;
    for (i = 1; i < arrtime.size(); i++)
    {
        key = arrtime[i];
        keybur = burst[i];
        j = i - 1;
        while (j >= 0 && arrtime[j] > key)
        {
            arrtime[j + 1] = arrtime[j];
            burst[j+1]=burst[j];
            j = j - 1;
        }
        arrtime[j + 1] = key;
        burst[j+1]=keybur;
    }
}
int main()
{
    int n;
    vector<int>arrtime,burst,response,gant;
    cout<<"Enter the number of processes:";
    cin>>n;
    int atime,btime;
    //INPUT
    for(int i=0;i<n;i++)
    {
        cout<<"Enter arrival time for process"<<i+1;
        cin>>atime;
        arrtime.push_back(atime);
        cout<<"Enter burst time for the process"<<i+1;
        cin>>btime;
        burst.push_back(btime);
    }
    //sort
    sortibg(arrtime,burst);
    cout<<"\narrtime";
    for(int i=0;i<n;i++)
    {
     cout<<arrtime[i]<<" ";
    }


    gant.push_back(0);
    vector<int>c;
        c.push_back(0);
    for(int i=1;i<n;i++)
    {
     if(arrtime[i]>burst[i-1])
     {
     gant[i]=arrtime[i];
     c.push_back(arrtime[i]-burst[i-1]);
     }
     else
     {
     gant[i]=gant[i-1]+burst[i-1];
     c.push_back(0);
     }
    }
    vector<int> gantend;
    gantend.push_back(burst[0]);

    for(int i=1;i<n;i++)
        gantend[i]=gantend[i-1]+burst[i]+c[i];

    float avg_responsetime=0;

    cout<<"\n c";
    for(int i=0;i<n;i++)
    {
     cout<<c[i]<<" ";
    }
    cout<<"\n arrtime";
    for(int i=0;i<n;i++)
    {
     cout<<arrtime[i]<<" ";
    }
    cout<<"\n burst";
    for(int i=0;i<n;i++)
    {
     cout<<burst[i]<<" ";
    }
    cout<<"\n gant";
    for(int i=0;i<n;i++)
    {
     cout<<gant[i]<<" ";
    }
    cout<<"\n gantend";
    for(int i=0;i<n;i++)
    {
        cout<<gantend[i]<<" ";
    }
    cout<<"\n";

    for(int i=0;i<n;i++)
    {
        avg_responsetime=avg_responsetime+gant[i]-arrtime[i];
        cout<<"responsetime"<<i<<" "<<avg_responsetime<<"\n";
    }
    avg_responsetime=avg_responsetime/n;
    cout<<"\n average waiting time "<<avg_responsetime;
    float average_tat=0;
    for(int i=0;i<n;i++)
        average_tat=average_tat+gantend[i]-arrtime[i];
    average_tat=average_tat/n;
    cout<<"\n average turn around time "<<average_tat;
    int sum=0;
    for(int i=0;i<n;i++)
        sum=sum+c[i];
    float used_time=gantend[n-1]-sum;
    float cpu_utilization=(used_time/gantend[n-1]);
    cout<<"\ncpu_utilization "<<cpu_utilization*100;
    double throughput;
    cout<<"\n throughput "<<(n*1.0/gantend[n-1]);
    return 0;
}