/
sjfnp.sh
172 lines (154 loc) · 3.75 KB
/
sjfnp.sh
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
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
# Bash Script to implement Shortest Job First Scheduling Algorithm (non pre-emptive)
border(){
z=121
for ((i=0; i<$z; i++))
do
echo -n "-"
done
echo ""
}
arrangeArrival(){
z=1
for ((i=0; i<$n; i++))
do
for ((j=i+1; j<$n; j++))
do
if [ ${arrival_time[$i]} -gt ${arrival_time[$j]} ]
then
temp=${arrival_time[$j]}
arrival_time[$j]=${arrival_time[$i]}
arrival_time[$i]=$temp
temp=${burst_time[$j]}
burst_time[$j]=${burst_time[$i]}
burst_time[$i]=$temp
temp=${pid[$j]}
pid[$j]=${pid[$i]}
pid[$i]=$temp
fi
done
done
}
arrangeBurst(){
z=1
for ((i=0; i<$n; i++))
do
for ((j=i+1; j<$n; j++))
do
if [ ${arrival_time[$i]} -eq ${arrival_time[$j]} ]
then
if [ ${burst_time[$i]} -gt ${burst_time[$j]} ]
then
temp=${arrival_time[$j]}
arrival_time[$j]=${arrival_time[$i]}
arrival_time[$i]=$temp
temp=${burst_time[$j]}
burst_time[$j]=${burst_time[$i]}
burst_time[$i]=$temp
temp=${pid[$j]}
pid[$j]=${pid[$i]}
pid[$i]=$temp
fi
fi
done
done
}
completionTime(){
completion_time[0]=`expr ${arrival_time[0]} + ${burst_time[0]}`
tat[0]=`expr ${completion_time[0]} - ${arrival_time[0]}`
waiting_time[0]=`expr ${tat[0]} - ${burst_time[0]}`
for ((i=1; i<$n; i++))
do
temp=${completion_time[`expr $i - 1`]}
low=${burst_time[$i]}
for ((j=i; j<$n; j++))
do
if [ $temp -ge ${arrival_time[$j]} ]
then
if [ $low -ge ${burst_time[$j]} ]
then
low=${burst_time[$j]}
val=$j
fi
fi
done
completion_time[$val]=`expr $temp + ${burst_time[$val]}`
tat[$val]=`expr ${completion_time[$val]} - ${arrival_time[$val]}`
waiting_time[$val]=`expr ${tat[$val]} - ${burst_time[$val]}`
if [ $val -ne $i ]
then
temp=${arrival_time[$val]}
arrival_time[$val]=${arrival_time[$i]}
arrival_time[$i]=$temp
temp=${burst_time[$val]}
burst_time[$val]=${burst_time[$i]}
burst_time[$i]=$temp
temp=${pid[$val]}
pid[$val]=${pid[$i]}
pid[$i]=$temp
temp=${completion_time[$val]}
completion_time[$val]=${completion_time[$i]}
completion_time[$i]=$temp
temp=${waiting_time[$val]}
waiting_time[$val]=${waiting_time[$i]}
waiting_time[$i]=$temp
temp=${tat[$val]}
tat[$val]=${pid[$i]}
tat[$i]=$temp
fi
done
}
echo -n "Enter the number of processes: "
read n
for ((i=0; i<$n; i++))
do
echo -n "Enter Process Id: "
read pid[$i]
echo -n "Enter arrival time: "
read arrival_time[$i]
echo -n "Enter burst time: "
read burst_time[$i]
done
arrangeArrival
arrangeBurst
completionTime
total_wt=0
total_tat=0
border
printf "|%-18s|%-20s|%-18s|%-20s|%-18s|%-20s|\n" "Process Id" "Burst time" "Arrival time" "Waiting time" "Turn around time" "Completion time"
border
for ((i=0; i<$n; i++))
do
total_wt=`expr $total_wt + ${waiting_time[$i]}`
total_tat=`expr ${tat[$i]} + $total_tat`
completion_time=`expr ${arrival_time[$i]} + ${tat[$i]}`
printf "|%-18s|%-20s|%-18s|%-20s|%-18s|%-20s|\n" ${pid[$i]} ${burst_time[$i]} ${arrival_time[$i]} ${waiting_time[$i]} ${tat[$i]} $completion_time
#echo "${burst_time[$i]} ${arrival_time[$i]} ${waiting_time[$i]} ${tat[$i]} $completion_time"
done
border
avgwt=`echo "scale=3; $total_wt / $n" | bc`
echo "Average waiting time = $avgwt"
avgtat=`echo "scale=3; $total_tat / $n" | bc`
echo "Average turn around time = $avgtat"
for ((i=0; i<8*n+n+1; i++))
do
echo -n "-"
done
echo ""
for ((i=0; i<$n; i++))
do
echo -n "| "
echo -n "P${pid[$i]}"
echo -n " "
done
echo "|"
for ((i=0; i<8*n+n+1; i++))
do
echo -n "-"
done
echo ""
echo -n "0 "
for ((i=0; i<$n; i++))
do
echo -n "`expr ${arrival_time[$i]} + ${tat[$i]}` "
done
echo ""