Scribd
Upload
15 views6 pages

Solution Lab6

The document describes the Shortest Remaining Time First (SRTF) CPU scheduling algorithm. It includes code to simulate SRTF scheduling for a set of processes with given arrival times and burst times. The code calculates the waiting time, turnaround time, and average waiting and turnaround times for each process. It uses a for loop to iterate through time steps, select the process with the shortest remaining burst time at each step, decrement its burst time, and calculate metrics for completed processes.

Uploaded by

aashirwadmishra24
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
15 views6 pages

Solution Lab6

The document describes the Shortest Remaining Time First (SRTF) CPU scheduling algorithm. It includes code to simulate SRTF scheduling for a set of processes with given arrival times and burst times. The code calculates the waiting time, turnaround time, and average waiting and turnaround times for each process. It uses a for loop to iterate through time steps, select the process with the shortest remaining burst time at each step, decrement its burst time, and calculate metrics for completed processes.

Uploaded by

aashirwadmishra24
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

SRTF

#include <stdio.h>
int main()
{
int a[10],b[10],x[10],i,j,smallest,count=0,time,n;
double avg=0,tt=0,end;
// printf("enter the number of Processes:\n");
scanf("%d",&n);
// printf("enter arrival time\n");
for(i=0;i<n;i++)
scanf("%d",&a[i]);
// printf("enter burst time\n");
for(i=0;i<n;i++)
scanf("%d",&b[i]);
for(i=0;i<n;i++)
x[i]=b[i];
b[9]=9999;

for(time=0;count!=n;time++)
{
smallest=9;
for(i=0;i<n;i++)
{
if(a[i]<=time && b[i]<b[smallest] && b[i]>0 )
smallest=i;
}
b[smallest]--;
if(b[smallest]==0)
{
count++;
end=time+1;
avg=avg+end-a[smallest]-x[smallest];
tt= tt+end-a[smallest];
}
}
printf("\n\nAverage waiting time = %lf\n",avg/n);
printf("Average Turnaround time = %lf",tt/n);
return 0;
}

HRRN

Solution
#include <stdio.h>
struct process {
char name;
int at, bt, ct, wt, tt;
int completed;
float ntt;
} p[10];
int n;
// Sorting Processes by Arrival Time
void sortByArrival()
{
struct process temp;
int i, j;
// Selection Sort applied
for (i = 0; i < n - 1; i++) {
for (j = i + 1; j < n; j++) {
// Check for lesser arrival time
if (p[i].at > p[j].at) {
// Swap earlier process to front
temp = p[i];
p[i] = p[j];
p[j] = temp;
}
}
}
}
void main()
{
int i, j, t, sum_bt = 0;
char c;
float avgwt = 0, avgtt = 0;
n = 5;
// predefined arrival times
int arriv[] = { 0, 2, 4, 6, 8 }; //Test Case 1
// int arriv[] = { 0, 1, 2, 3, 4 }; //Test Case 2
// predefined burst times
int burst[] = { 3, 6, 4, 5, 2 }; //Test Case 1
int burst[] = { 2, 4, 3, 4, 3 }; //Test Case 2
// Initializing the structure variables
for (i = 0, c = 'A'; i < n; i++, c++) {
p[i].name = c;
p[i].at = arriv[i];
p[i].bt = burst[i];
// Variable for Completion status
// Pending = 0
// Completed = 1
p[i].completed = 0;
// Variable for sum of all Burst Times
sum_bt += p[i].bt;
}
// Sorting the structure by arrival times
sortByArrival();
printf("\nProcess\tAT\tBT\tWT");
printf("\tTAT\t NTT");
for (t = p[0].at; t < sum_bt;) {
// Set lower limit to response ratio
float hrr = -9999;
// Response Ratio Variable
float temp;
// Variable to store next process selected
int loc;
for (i = 0; i < n; i++) {
// Checking if process has arrived and is Incomplete
if (p[i].at <= t && p[i].completed != 1) {
// Calculating Response Ratio
temp = (p[i].bt + (t - p[i].at)) / p[i].bt;
// Checking for Highest Response Ratio
if (hrr < temp) {
// Storing Response Ratio
hrr = temp;
// Storing Location
loc = i;
}
}
}
// Updating time value
t += p[loc].bt;
// Calculation of waiting time
p[loc].wt = t - p[loc].at - p[loc].bt;
// Calculation of Turn Around Time
p[loc].tt = t - p[loc].at;
// Sum Turn Around Time for average
avgtt += p[loc].tt;
// Calculation of Normalized Turn Around Time
p[loc].ntt = ((float)p[loc].tt / p[loc].bt);
// Updating Completion Status
p[loc].completed = 1;
// Sum Waiting Time for average
avgwt += p[loc].wt;
printf("\n%c\t%d\t", p[loc].name, p[loc].at);
printf("%d\t%d\t", p[loc].bt, p[loc].wt);
printf("%d\t%f", p[loc].tt, p[loc].ntt);
}
printf("\nAverage waiting time:%f\n", avgwt / n);
printf("Average Turn Around time:%f\n", avgtt / n);
}

You might also like